./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 fca748b1 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-wip.dd.update-z3-fca748b-m [2024-11-20 09:45:11,173 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 09:45:11,274 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 09:45:11,278 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 09:45:11,279 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 09:45:11,305 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 09:45:11,306 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 09:45:11,306 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 09:45:11,307 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 09:45:11,308 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 09:45:11,309 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 09:45:11,309 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 09:45:11,309 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 09:45:11,312 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 09:45:11,312 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 09:45:11,313 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 09:45:11,313 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 09:45:11,313 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 09:45:11,313 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 09:45:11,313 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 09:45:11,314 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 09:45:11,314 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 09:45:11,314 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 09:45:11,314 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 09:45:11,315 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 09:45:11,315 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 09:45:11,315 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 09:45:11,315 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 09:45:11,315 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 09:45:11,316 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 09:45:11,316 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 09:45:11,316 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 09:45:11,316 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 09:45:11,316 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 09:45:11,317 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 09:45:11,317 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 09:45:11,317 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 09:45:11,317 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 09:45:11,317 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 09:45:11,317 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 09:45:11,318 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 09:45:11,319 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 09:45:11,319 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-11-20 09:45:11,642 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 09:45:11,684 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 09:45:11,691 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 09:45:11,692 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 09:45:11,696 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 09:45:11,698 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-11-20 09:45:13,631 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 09:45:13,784 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 09:45:13,785 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-threaded-sum-3.wvr.c [2024-11-20 09:45:13,795 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04b34197c/57864a0f9c414247bb785302acf4fade/FLAG4003833a8 [2024-11-20 09:45:13,812 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04b34197c/57864a0f9c414247bb785302acf4fade [2024-11-20 09:45:13,814 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 09:45:13,815 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 09:45:13,816 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 09:45:13,821 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 09:45:13,825 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 09:45:13,828 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:45:13" (1/1) ... [2024-11-20 09:45:13,830 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c051d3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:45:13, skipping insertion in model container [2024-11-20 09:45:13,830 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:45:13" (1/1) ... [2024-11-20 09:45:13,861 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 09:45:14,060 WARN L250 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-11-20 09:45:14,064 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 09:45:14,074 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 09:45:14,101 WARN L250 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-11-20 09:45:14,101 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 09:45:14,120 INFO L204 MainTranslator]: Completed translation [2024-11-20 09:45:14,121 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:45:14 WrapperNode [2024-11-20 09:45:14,121 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 09:45:14,122 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 09:45:14,122 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 09:45:14,123 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 09:45:14,128 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:45:14" (1/1) ... [2024-11-20 09:45:14,139 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:45:14" (1/1) ... [2024-11-20 09:45:14,158 INFO L138 Inliner]: procedures = 21, calls = 31, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 65 [2024-11-20 09:45:14,160 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 09:45:14,177 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 09:45:14,177 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 09:45:14,177 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 09:45:14,202 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:45:14" (1/1) ... [2024-11-20 09:45:14,203 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:45:14" (1/1) ... [2024-11-20 09:45:14,209 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:45:14" (1/1) ... [2024-11-20 09:45:14,238 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-11-20 09:45:14,240 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:45:14" (1/1) ... [2024-11-20 09:45:14,240 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:45:14" (1/1) ... [2024-11-20 09:45:14,244 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:45:14" (1/1) ... [2024-11-20 09:45:14,251 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:45:14" (1/1) ... [2024-11-20 09:45:14,255 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:45:14" (1/1) ... [2024-11-20 09:45:14,256 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:45:14" (1/1) ... [2024-11-20 09:45:14,259 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 09:45:14,262 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 09:45:14,262 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 09:45:14,262 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 09:45:14,263 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:45:14" (1/1) ... [2024-11-20 09:45:14,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 09:45:14,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 09:45:14,306 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-11-20 09:45:14,311 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-11-20 09:45:14,358 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 09:45:14,358 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-20 09:45:14,359 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-20 09:45:14,359 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-20 09:45:14,359 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-20 09:45:14,359 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-20 09:45:14,363 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-20 09:45:14,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 09:45:14,363 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-20 09:45:14,363 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-20 09:45:14,364 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 09:45:14,364 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 09:45:14,365 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-20 09:45:14,484 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 09:45:14,486 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 09:45:14,712 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-20 09:45:14,713 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 09:45:14,938 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 09:45:14,939 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-20 09:45:14,939 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:45:14 BoogieIcfgContainer [2024-11-20 09:45:14,939 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 09:45:14,941 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 09:45:14,946 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 09:45:14,949 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 09:45:14,953 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 09:45:13" (1/3) ... [2024-11-20 09:45:14,954 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@708296f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:45:14, skipping insertion in model container [2024-11-20 09:45:14,954 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:45:14" (2/3) ... [2024-11-20 09:45:14,954 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@708296f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:45:14, skipping insertion in model container [2024-11-20 09:45:14,954 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:45:14" (3/3) ... [2024-11-20 09:45:14,956 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-threaded-sum-3.wvr.c [2024-11-20 09:45:14,983 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 09:45:14,984 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 09:45:14,984 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-20 09:45:15,069 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-20 09:45:15,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 35 transitions, 91 flow [2024-11-20 09:45:15,143 INFO L124 PetriNetUnfolderBase]: 3/32 cut-off events. [2024-11-20 09:45:15,148 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-20 09:45:15,155 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-11-20 09:45:15,155 INFO L82 GeneralOperation]: Start removeDead. Operand has 42 places, 35 transitions, 91 flow [2024-11-20 09:45:15,161 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 38 places, 31 transitions, 80 flow [2024-11-20 09:45:15,177 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 09:45:15,186 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;@1e100198, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 09:45:15,187 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-20 09:45:15,210 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-20 09:45:15,218 INFO L124 PetriNetUnfolderBase]: 3/30 cut-off events. [2024-11-20 09:45:15,218 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-20 09:45:15,218 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 09:45:15,219 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-11-20 09:45:15,220 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-11-20 09:45:15,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:45:15,230 INFO L85 PathProgramCache]: Analyzing trace with hash -1029020577, now seen corresponding path program 1 times [2024-11-20 09:45:15,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:45:15,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11851396] [2024-11-20 09:45:15,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:45:15,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:45:15,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:45:16,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 09:45:16,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:45:16,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11851396] [2024-11-20 09:45:16,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11851396] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:45:16,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:45:16,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 09:45:16,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891980233] [2024-11-20 09:45:16,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:45:16,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 09:45:16,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:45:16,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 09:45:16,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 09:45:16,312 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 35 [2024-11-20 09:45:16,317 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-11-20 09:45:16,317 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 09:45:16,317 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 35 [2024-11-20 09:45:16,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 09:45:16,571 INFO L124 PetriNetUnfolderBase]: 367/655 cut-off events. [2024-11-20 09:45:16,572 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2024-11-20 09:45:16,577 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-11-20 09:45:16,584 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 33 selfloop transitions, 5 changer transitions 0/49 dead transitions. [2024-11-20 09:45:16,584 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 49 transitions, 204 flow [2024-11-20 09:45:16,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 09:45:16,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-20 09:45:16,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2024-11-20 09:45:16,595 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6785714285714286 [2024-11-20 09:45:16,599 INFO L175 Difference]: Start difference. First operand has 38 places, 31 transitions, 80 flow. Second operand 4 states and 95 transitions. [2024-11-20 09:45:16,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 49 transitions, 204 flow [2024-11-20 09:45:16,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 49 transitions, 184 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-20 09:45:16,621 INFO L231 Difference]: Finished difference. Result has 37 places, 35 transitions, 100 flow [2024-11-20 09:45:16,624 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-11-20 09:45:16,631 INFO L277 CegarLoopForPetriNet]: 38 programPoint places, -1 predicate places. [2024-11-20 09:45:16,635 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 35 transitions, 100 flow [2024-11-20 09:45:16,635 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-11-20 09:45:16,636 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 09:45:16,636 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-11-20 09:45:16,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 09:45:16,636 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-11-20 09:45:16,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:45:16,638 INFO L85 PathProgramCache]: Analyzing trace with hash 631285081, now seen corresponding path program 1 times [2024-11-20 09:45:16,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:45:16,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443579788] [2024-11-20 09:45:16,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:45:16,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:45:16,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:45:17,054 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 09:45:17,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:45:17,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443579788] [2024-11-20 09:45:17,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443579788] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:45:17,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:45:17,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 09:45:17,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029018315] [2024-11-20 09:45:17,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:45:17,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 09:45:17,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:45:17,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 09:45:17,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-20 09:45:17,090 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2024-11-20 09:45:17,090 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-11-20 09:45:17,090 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 09:45:17,090 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2024-11-20 09:45:17,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 09:45:17,427 INFO L124 PetriNetUnfolderBase]: 1042/1669 cut-off events. [2024-11-20 09:45:17,427 INFO L125 PetriNetUnfolderBase]: For 412/448 co-relation queries the response was YES. [2024-11-20 09:45:17,430 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-11-20 09:45:17,438 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 59 selfloop transitions, 20 changer transitions 0/87 dead transitions. [2024-11-20 09:45:17,438 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 87 transitions, 422 flow [2024-11-20 09:45:17,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 09:45:17,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-20 09:45:17,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 122 transitions. [2024-11-20 09:45:17,440 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6971428571428572 [2024-11-20 09:45:17,440 INFO L175 Difference]: Start difference. First operand has 37 places, 35 transitions, 100 flow. Second operand 5 states and 122 transitions. [2024-11-20 09:45:17,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 87 transitions, 422 flow [2024-11-20 09:45:17,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 87 transitions, 422 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-20 09:45:17,443 INFO L231 Difference]: Finished difference. Result has 44 places, 53 transitions, 256 flow [2024-11-20 09:45:17,443 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-11-20 09:45:17,444 INFO L277 CegarLoopForPetriNet]: 38 programPoint places, 6 predicate places. [2024-11-20 09:45:17,444 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 53 transitions, 256 flow [2024-11-20 09:45:17,444 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-11-20 09:45:17,444 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 09:45:17,444 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-11-20 09:45:17,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 09:45:17,445 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-11-20 09:45:17,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:45:17,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1270762887, now seen corresponding path program 2 times [2024-11-20 09:45:17,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:45:17,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150365579] [2024-11-20 09:45:17,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:45:17,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:45:17,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:45:17,946 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 09:45:17,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:45:17,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150365579] [2024-11-20 09:45:17,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150365579] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 09:45:17,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [9733309] [2024-11-20 09:45:17,947 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-20 09:45:17,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 09:45:17,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 09:45:17,954 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-11-20 09:45:17,956 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-11-20 09:45:18,088 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-20 09:45:18,089 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 09:45:18,091 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-20 09:45:18,098 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 09:45:18,313 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-20 09:45:18,317 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 09:45:18,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [9733309] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:45:18,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 09:45:18,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-11-20 09:45:18,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548046131] [2024-11-20 09:45:18,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:45:18,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 09:45:18,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:45:18,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 09:45:18,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-20 09:45:18,348 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 35 [2024-11-20 09:45:18,348 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-11-20 09:45:18,348 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 09:45:18,349 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 35 [2024-11-20 09:45:18,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 09:45:18,638 INFO L124 PetriNetUnfolderBase]: 785/1286 cut-off events. [2024-11-20 09:45:18,639 INFO L125 PetriNetUnfolderBase]: For 1097/1197 co-relation queries the response was YES. [2024-11-20 09:45:18,642 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-11-20 09:45:18,648 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 61 selfloop transitions, 6 changer transitions 2/83 dead transitions. [2024-11-20 09:45:18,648 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 83 transitions, 510 flow [2024-11-20 09:45:18,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 09:45:18,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-20 09:45:18,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 119 transitions. [2024-11-20 09:45:18,652 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.68 [2024-11-20 09:45:18,653 INFO L175 Difference]: Start difference. First operand has 44 places, 53 transitions, 256 flow. Second operand 5 states and 119 transitions. [2024-11-20 09:45:18,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 83 transitions, 510 flow [2024-11-20 09:45:18,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 83 transitions, 502 flow, removed 4 selfloop flow, removed 0 redundant places. [2024-11-20 09:45:18,659 INFO L231 Difference]: Finished difference. Result has 51 places, 54 transitions, 274 flow [2024-11-20 09:45:18,659 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-11-20 09:45:18,660 INFO L277 CegarLoopForPetriNet]: 38 programPoint places, 13 predicate places. [2024-11-20 09:45:18,660 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 54 transitions, 274 flow [2024-11-20 09:45:18,661 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-11-20 09:45:18,661 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 09:45:18,661 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-11-20 09:45:18,671 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-20 09:45:18,864 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-11-20 09:45:18,865 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-11-20 09:45:18,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:45:18,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1180905068, now seen corresponding path program 1 times [2024-11-20 09:45:18,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:45:18,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631404115] [2024-11-20 09:45:18,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:45:18,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:45:18,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:45:19,066 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 09:45:19,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:45:19,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631404115] [2024-11-20 09:45:19,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631404115] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:45:19,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:45:19,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 09:45:19,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621276879] [2024-11-20 09:45:19,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:45:19,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 09:45:19,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:45:19,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 09:45:19,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-20 09:45:19,094 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 35 [2024-11-20 09:45:19,094 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-11-20 09:45:19,094 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 09:45:19,094 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 35 [2024-11-20 09:45:19,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 09:45:19,308 INFO L124 PetriNetUnfolderBase]: 1074/1766 cut-off events. [2024-11-20 09:45:19,310 INFO L125 PetriNetUnfolderBase]: For 2464/2569 co-relation queries the response was YES. [2024-11-20 09:45:19,314 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-11-20 09:45:19,322 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 63 selfloop transitions, 10 changer transitions 0/86 dead transitions. [2024-11-20 09:45:19,322 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 86 transitions, 570 flow [2024-11-20 09:45:19,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 09:45:19,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-20 09:45:19,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 116 transitions. [2024-11-20 09:45:19,324 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6628571428571428 [2024-11-20 09:45:19,325 INFO L175 Difference]: Start difference. First operand has 51 places, 54 transitions, 274 flow. Second operand 5 states and 116 transitions. [2024-11-20 09:45:19,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 86 transitions, 570 flow [2024-11-20 09:45:19,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 86 transitions, 566 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-20 09:45:19,333 INFO L231 Difference]: Finished difference. Result has 55 places, 56 transitions, 313 flow [2024-11-20 09:45:19,333 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-11-20 09:45:19,334 INFO L277 CegarLoopForPetriNet]: 38 programPoint places, 17 predicate places. [2024-11-20 09:45:19,335 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 56 transitions, 313 flow [2024-11-20 09:45:19,335 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-11-20 09:45:19,335 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 09:45:19,335 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-11-20 09:45:19,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 09:45:19,335 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-11-20 09:45:19,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:45:19,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1706424632, now seen corresponding path program 2 times [2024-11-20 09:45:19,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:45:19,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841956424] [2024-11-20 09:45:19,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:45:19,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:45:19,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:45:19,509 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-20 09:45:19,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:45:19,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841956424] [2024-11-20 09:45:19,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841956424] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:45:19,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:45:19,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 09:45:19,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588119535] [2024-11-20 09:45:19,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:45:19,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 09:45:19,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:45:19,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 09:45:19,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 09:45:19,518 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 35 [2024-11-20 09:45:19,519 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-11-20 09:45:19,519 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 09:45:19,519 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 35 [2024-11-20 09:45:19,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 09:45:19,751 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-11-20 09:45:19,751 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2024-11-20 09:45:19,752 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-11-20 09:45:19,752 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-11-20 09:45:19,752 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-11-20 09:45:19,752 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-11-20 09:45:19,752 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2024-11-20 09:45:19,753 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-11-20 09:45:19,753 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-11-20 09:45:19,754 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-11-20 09:45:19,769 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-11-20 09:45:19,769 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2024-11-20 09:45:19,769 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-11-20 09:45:19,770 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-11-20 09:45:19,770 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-11-20 09:45:19,771 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-11-20 09:45:19,771 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2024-11-20 09:45:19,771 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-20 09:45:19,773 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-20 09:45:19,773 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-20 09:45:19,784 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-11-20 09:45:19,784 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2024-11-20 09:45:19,784 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-20 09:45:19,784 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-20 09:45:19,784 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-20 09:45:19,784 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-11-20 09:45:19,785 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2024-11-20 09:45:19,785 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-20 09:45:19,785 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-20 09:45:19,785 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-20 09:45:19,798 INFO L124 PetriNetUnfolderBase]: 1720/2759 cut-off events. [2024-11-20 09:45:19,799 INFO L125 PetriNetUnfolderBase]: For 4341/4543 co-relation queries the response was YES. [2024-11-20 09:45:19,806 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-11-20 09:45:19,822 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 81 selfloop transitions, 12 changer transitions 0/109 dead transitions. [2024-11-20 09:45:19,822 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 109 transitions, 804 flow [2024-11-20 09:45:19,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 09:45:19,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-20 09:45:19,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 126 transitions. [2024-11-20 09:45:19,823 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.72 [2024-11-20 09:45:19,823 INFO L175 Difference]: Start difference. First operand has 55 places, 56 transitions, 313 flow. Second operand 5 states and 126 transitions. [2024-11-20 09:45:19,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 109 transitions, 804 flow [2024-11-20 09:45:19,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 109 transitions, 778 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-20 09:45:19,840 INFO L231 Difference]: Finished difference. Result has 59 places, 67 transitions, 447 flow [2024-11-20 09:45:19,841 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-11-20 09:45:19,842 INFO L277 CegarLoopForPetriNet]: 38 programPoint places, 21 predicate places. [2024-11-20 09:45:19,843 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 67 transitions, 447 flow [2024-11-20 09:45:19,843 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-11-20 09:45:19,843 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 09:45:19,844 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-11-20 09:45:19,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 09:45:19,844 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-11-20 09:45:19,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:45:19,844 INFO L85 PathProgramCache]: Analyzing trace with hash 876781812, now seen corresponding path program 1 times [2024-11-20 09:45:19,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:45:19,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207720571] [2024-11-20 09:45:19,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:45:19,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:45:19,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:45:22,285 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 09:45:22,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:45:22,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207720571] [2024-11-20 09:45:22,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207720571] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 09:45:22,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [525081918] [2024-11-20 09:45:22,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:45:22,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 09:45:22,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 09:45:22,291 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-11-20 09:45:22,295 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-11-20 09:45:22,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:45:22,369 INFO L255 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-20 09:45:22,371 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 09:45:23,623 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 09:45:23,623 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 09:45:37,112 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 09:45:37,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [525081918] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 09:45:37,114 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 09:45:37,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 26 [2024-11-20 09:45:37,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255519615] [2024-11-20 09:45:37,115 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 09:45:37,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-20 09:45:37,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:45:37,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-20 09:45:37,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=555, Unknown=0, NotChecked=0, Total=702 [2024-11-20 09:45:37,182 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-11-20 09:45:37,183 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-11-20 09:45:37,183 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 09:45:37,183 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-11-20 09:45:37,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 09:46:13,223 INFO L124 PetriNetUnfolderBase]: 26910/39556 cut-off events. [2024-11-20 09:46:13,224 INFO L125 PetriNetUnfolderBase]: For 89814/89826 co-relation queries the response was YES. [2024-11-20 09:46:13,303 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-11-20 09:46:13,452 INFO L140 encePairwiseOnDemand]: 19/35 looper letters, 553 selfloop transitions, 457 changer transitions 324/1339 dead transitions. [2024-11-20 09:46:13,453 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 1339 transitions, 10386 flow [2024-11-20 09:46:13,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2024-11-20 09:46:13,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2024-11-20 09:46:13,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 1858 transitions. [2024-11-20 09:46:13,459 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5256011315417256 [2024-11-20 09:46:13,459 INFO L175 Difference]: Start difference. First operand has 59 places, 67 transitions, 447 flow. Second operand 101 states and 1858 transitions. [2024-11-20 09:46:13,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 1339 transitions, 10386 flow [2024-11-20 09:46:13,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 1339 transitions, 10332 flow, removed 7 selfloop flow, removed 1 redundant places. [2024-11-20 09:46:13,583 INFO L231 Difference]: Finished difference. Result has 215 places, 559 transitions, 6162 flow [2024-11-20 09:46:13,583 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-11-20 09:46:13,584 INFO L277 CegarLoopForPetriNet]: 38 programPoint places, 177 predicate places. [2024-11-20 09:46:13,586 INFO L471 AbstractCegarLoop]: Abstraction has has 215 places, 559 transitions, 6162 flow [2024-11-20 09:46:13,586 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-11-20 09:46:13,586 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 09:46:13,586 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-11-20 09:46:13,596 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-20 09:46:13,790 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-11-20 09:46:13,791 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-11-20 09:46:13,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:46:13,792 INFO L85 PathProgramCache]: Analyzing trace with hash -239063046, now seen corresponding path program 2 times [2024-11-20 09:46:13,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:46:13,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027428009] [2024-11-20 09:46:13,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:46:13,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:46:13,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:46:13,938 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 09:46:13,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:46:13,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027428009] [2024-11-20 09:46:13,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027428009] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 09:46:13,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1608002870] [2024-11-20 09:46:13,939 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-20 09:46:13,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 09:46:13,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 09:46:13,941 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-11-20 09:46:13,942 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-11-20 09:46:13,993 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-20 09:46:13,993 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 09:46:13,994 INFO L255 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-20 09:46:13,996 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 09:46:14,055 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 09:46:14,056 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 09:46:14,150 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 09:46:14,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1608002870] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 09:46:14,150 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 09:46:14,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 5] total 10 [2024-11-20 09:46:14,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361485929] [2024-11-20 09:46:14,151 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 09:46:14,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-20 09:46:14,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:46:14,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-20 09:46:14,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-20 09:46:14,181 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2024-11-20 09:46:14,182 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-11-20 09:46:14,182 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 09:46:14,182 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2024-11-20 09:46:14,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 09:46:20,112 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-11-20 09:46:20,115 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2024-11-20 09:46:20,115 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-11-20 09:46:20,115 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-11-20 09:46:20,115 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-11-20 09:46:21,127 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-11-20 09:46:21,128 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2024-11-20 09:46:21,128 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-11-20 09:46:21,128 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-11-20 09:46:21,129 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-11-20 09:46:23,011 INFO L124 PetriNetUnfolderBase]: 31187/45057 cut-off events. [2024-11-20 09:46:23,011 INFO L125 PetriNetUnfolderBase]: For 1360326/1373199 co-relation queries the response was YES. [2024-11-20 09:46:23,548 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-11-20 09:46:23,818 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 1099 selfloop transitions, 315 changer transitions 0/1526 dead transitions. [2024-11-20 09:46:23,818 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 1526 transitions, 19861 flow [2024-11-20 09:46:23,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-20 09:46:23,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-20 09:46:23,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 226 transitions. [2024-11-20 09:46:23,820 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5380952380952381 [2024-11-20 09:46:23,820 INFO L175 Difference]: Start difference. First operand has 215 places, 559 transitions, 6162 flow. Second operand 12 states and 226 transitions. [2024-11-20 09:46:23,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 1526 transitions, 19861 flow [2024-11-20 09:46:36,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 1526 transitions, 16915 flow, removed 1473 selfloop flow, removed 19 redundant places. [2024-11-20 09:46:36,633 INFO L231 Difference]: Finished difference. Result has 185 places, 748 transitions, 8315 flow [2024-11-20 09:46:36,633 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=5069, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=537, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=132, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=388, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=8315, PETRI_PLACES=185, PETRI_TRANSITIONS=748} [2024-11-20 09:46:36,634 INFO L277 CegarLoopForPetriNet]: 38 programPoint places, 147 predicate places. [2024-11-20 09:46:36,634 INFO L471 AbstractCegarLoop]: Abstraction has has 185 places, 748 transitions, 8315 flow [2024-11-20 09:46:36,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has 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-11-20 09:46:36,635 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 09:46:36,635 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-11-20 09:46:36,642 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-20 09:46:36,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 09:46:36,836 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-20 09:46:36,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:46:36,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1756102960, now seen corresponding path program 3 times [2024-11-20 09:46:36,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:46:36,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569846592] [2024-11-20 09:46:36,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:46:36,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:46:36,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:46:37,971 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 09:46:37,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:46:37,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569846592] [2024-11-20 09:46:37,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569846592] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 09:46:37,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1088276824] [2024-11-20 09:46:37,971 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-20 09:46:37,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 09:46:37,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 09:46:37,973 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 09:46:37,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-20 09:46:38,111 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-20 09:46:38,111 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 09:46:38,112 INFO L255 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-20 09:46:38,113 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 09:46:38,864 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 09:46:38,864 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 09:46:44,351 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 09:46:44,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1088276824] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 09:46:44,356 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 09:46:44,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 11] total 29 [2024-11-20 09:46:44,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122794367] [2024-11-20 09:46:44,356 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 09:46:44,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-20 09:46:44,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:46:44,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-20 09:46:44,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=649, Unknown=1, NotChecked=0, Total=870 [2024-11-20 09:46:44,455 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 35 [2024-11-20 09:46:44,455 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 748 transitions, 8315 flow. Second operand has 30 states, 30 states have (on average 9.2) internal successors, (276), 30 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-11-20 09:46:44,455 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 09:46:44,455 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 35 [2024-11-20 09:46:44,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand