./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/popl20-send-receive.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/weaver/popl20-send-receive.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4eda2bf92bccdcc8638b67653fb7fdefc015ff9c815b317ad1009deb61d04585 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 10:55:46,853 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 10:55:46,927 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-09 10:55:46,932 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 10:55:46,933 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 10:55:46,956 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 10:55:46,957 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 10:55:46,957 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 10:55:46,958 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 10:55:46,959 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 10:55:46,959 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 10:55:46,959 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 10:55:46,960 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 10:55:46,963 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 10:55:46,963 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 10:55:46,963 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 10:55:46,964 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 10:55:46,964 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 10:55:46,964 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 10:55:46,965 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 10:55:46,965 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 10:55:46,970 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 10:55:46,970 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 10:55:46,970 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 10:55:46,971 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 10:55:46,971 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 10:55:46,971 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 10:55:46,971 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 10:55:46,971 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 10:55:46,972 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 10:55:46,972 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 10:55:46,972 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 10:55:46,973 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 10:55:46,973 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:55:46,975 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 10:55:46,975 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 10:55:46,975 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 10:55:46,976 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 10:55:46,976 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 10:55:46,977 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 10:55:46,977 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 10:55:46,978 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 10:55:46,978 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 4eda2bf92bccdcc8638b67653fb7fdefc015ff9c815b317ad1009deb61d04585 [2024-11-09 10:55:47,243 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 10:55:47,271 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 10:55:47,275 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 10:55:47,276 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 10:55:47,277 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 10:55:47,278 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-send-receive.wvr.c [2024-11-09 10:55:48,795 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 10:55:48,997 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 10:55:48,998 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-send-receive.wvr.c [2024-11-09 10:55:49,006 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a72ec84f2/bb7fdeb7424a42c89680204bd9be5a1b/FLAGd607b183f [2024-11-09 10:55:49,018 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a72ec84f2/bb7fdeb7424a42c89680204bd9be5a1b [2024-11-09 10:55:49,020 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 10:55:49,022 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 10:55:49,023 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 10:55:49,023 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 10:55:49,030 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 10:55:49,031 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:55:49" (1/1) ... [2024-11-09 10:55:49,032 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5068f61b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:55:49, skipping insertion in model container [2024-11-09 10:55:49,032 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:55:49" (1/1) ... [2024-11-09 10:55:49,058 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 10:55:49,272 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:55:49,275 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:55:49,283 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 10:55:49,307 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:55:49,327 INFO L204 MainTranslator]: Completed translation [2024-11-09 10:55:49,327 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:55:49 WrapperNode [2024-11-09 10:55:49,327 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 10:55:49,328 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 10:55:49,328 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 10:55:49,328 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 10:55:49,335 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:55:49" (1/1) ... [2024-11-09 10:55:49,343 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:55:49" (1/1) ... [2024-11-09 10:55:49,365 INFO L138 Inliner]: procedures = 24, calls = 38, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 150 [2024-11-09 10:55:49,366 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 10:55:49,366 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 10:55:49,366 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 10:55:49,366 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 10:55:49,377 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:55:49" (1/1) ... [2024-11-09 10:55:49,378 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:55:49" (1/1) ... [2024-11-09 10:55:49,381 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:55:49" (1/1) ... [2024-11-09 10:55:49,397 INFO L175 MemorySlicer]: Split 6 memory accesses to 2 slices as follows [2, 4]. 67 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2024-11-09 10:55:49,398 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:55:49" (1/1) ... [2024-11-09 10:55:49,398 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:55:49" (1/1) ... [2024-11-09 10:55:49,404 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:55:49" (1/1) ... [2024-11-09 10:55:49,408 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:55:49" (1/1) ... [2024-11-09 10:55:49,410 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:55:49" (1/1) ... [2024-11-09 10:55:49,412 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:55:49" (1/1) ... [2024-11-09 10:55:49,414 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 10:55:49,415 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 10:55:49,415 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 10:55:49,415 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 10:55:49,417 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:55:49" (1/1) ... [2024-11-09 10:55:49,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:55:49,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:55:49,454 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-09 10:55:49,461 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-09 10:55:49,512 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 10:55:49,512 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-09 10:55:49,512 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-09 10:55:49,513 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-09 10:55:49,513 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-09 10:55:49,513 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-09 10:55:49,513 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-09 10:55:49,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 10:55:49,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 10:55:49,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 10:55:49,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 10:55:49,513 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-09 10:55:49,514 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-09 10:55:49,514 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 10:55:49,514 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 10:55:49,514 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 10:55:49,514 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 10:55:49,514 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 10:55:49,518 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-09 10:55:49,623 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 10:55:49,625 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 10:55:49,962 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 10:55:49,963 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 10:55:50,198 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 10:55:50,199 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-09 10:55:50,199 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:55:50 BoogieIcfgContainer [2024-11-09 10:55:50,200 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 10:55:50,203 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 10:55:50,203 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 10:55:50,207 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 10:55:50,209 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:55:49" (1/3) ... [2024-11-09 10:55:50,210 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d09ac85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:55:50, skipping insertion in model container [2024-11-09 10:55:50,210 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:55:49" (2/3) ... [2024-11-09 10:55:50,211 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d09ac85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:55:50, skipping insertion in model container [2024-11-09 10:55:50,211 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:55:50" (3/3) ... [2024-11-09 10:55:50,212 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-send-receive.wvr.c [2024-11-09 10:55:50,229 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 10:55:50,229 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2024-11-09 10:55:50,229 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 10:55:50,301 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-09 10:55:50,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 48 transitions, 117 flow [2024-11-09 10:55:50,375 INFO L124 PetriNetUnfolderBase]: 4/45 cut-off events. [2024-11-09 10:55:50,375 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-09 10:55:50,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58 conditions, 45 events. 4/45 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 100 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 36. Up to 2 conditions per place. [2024-11-09 10:55:50,380 INFO L82 GeneralOperation]: Start removeDead. Operand has 54 places, 48 transitions, 117 flow [2024-11-09 10:55:50,384 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 44 transitions, 106 flow [2024-11-09 10:55:50,397 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 10:55:50,406 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=None, 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;@54dbd1a0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 10:55:50,407 INFO L334 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2024-11-09 10:55:50,412 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 10:55:50,412 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2024-11-09 10:55:50,412 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:55:50,412 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:55:50,413 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-09 10:55:50,414 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-09 10:55:50,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:55:50,419 INFO L85 PathProgramCache]: Analyzing trace with hash 453619, now seen corresponding path program 1 times [2024-11-09 10:55:50,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:55:50,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028573671] [2024-11-09 10:55:50,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:55:50,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:55:50,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:55:50,702 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-09 10:55:50,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:55:50,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028573671] [2024-11-09 10:55:50,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028573671] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:55:50,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:55:50,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 10:55:50,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818739431] [2024-11-09 10:55:50,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:55:50,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:55:50,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:55:50,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:55:50,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:55:50,817 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 48 [2024-11-09 10:55:50,820 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 44 transitions, 106 flow. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 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-09 10:55:50,820 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:55:50,821 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 48 [2024-11-09 10:55:50,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:55:51,075 INFO L124 PetriNetUnfolderBase]: 535/975 cut-off events. [2024-11-09 10:55:51,075 INFO L125 PetriNetUnfolderBase]: For 61/61 co-relation queries the response was YES. [2024-11-09 10:55:51,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1931 conditions, 975 events. 535/975 cut-off events. For 61/61 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 6794 event pairs, 491 based on Foata normal form. 1/630 useless extension candidates. Maximal degree in co-relation 1792. Up to 826 conditions per place. [2024-11-09 10:55:51,092 INFO L140 encePairwiseOnDemand]: 44/48 looper letters, 25 selfloop transitions, 2 changer transitions 0/41 dead transitions. [2024-11-09 10:55:51,092 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 41 transitions, 154 flow [2024-11-09 10:55:51,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:55:51,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:55:51,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 83 transitions. [2024-11-09 10:55:51,102 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5763888888888888 [2024-11-09 10:55:51,103 INFO L175 Difference]: Start difference. First operand has 50 places, 44 transitions, 106 flow. Second operand 3 states and 83 transitions. [2024-11-09 10:55:51,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 41 transitions, 154 flow [2024-11-09 10:55:51,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 41 transitions, 142 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-09 10:55:51,109 INFO L231 Difference]: Finished difference. Result has 43 places, 41 transitions, 92 flow [2024-11-09 10:55:51,111 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=43, PETRI_TRANSITIONS=41} [2024-11-09 10:55:51,114 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, -7 predicate places. [2024-11-09 10:55:51,114 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 41 transitions, 92 flow [2024-11-09 10:55:51,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 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-09 10:55:51,114 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:55:51,114 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-09 10:55:51,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 10:55:51,115 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-09 10:55:51,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:55:51,116 INFO L85 PathProgramCache]: Analyzing trace with hash 453620, now seen corresponding path program 1 times [2024-11-09 10:55:51,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:55:51,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107545969] [2024-11-09 10:55:51,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:55:51,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:55:51,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:55:51,450 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-09 10:55:51,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:55:51,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107545969] [2024-11-09 10:55:51,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107545969] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:55:51,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:55:51,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:55:51,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515497945] [2024-11-09 10:55:51,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:55:51,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:55:51,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:55:51,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:55:51,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:55:51,473 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 48 [2024-11-09 10:55:51,473 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 41 transitions, 92 flow. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 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-09 10:55:51,474 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:55:51,474 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 48 [2024-11-09 10:55:51,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:55:51,756 INFO L124 PetriNetUnfolderBase]: 536/978 cut-off events. [2024-11-09 10:55:51,757 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:55:51,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1867 conditions, 978 events. 536/978 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 6810 event pairs, 491 based on Foata normal form. 0/632 useless extension candidates. Maximal degree in co-relation 1845. Up to 831 conditions per place. [2024-11-09 10:55:51,770 INFO L140 encePairwiseOnDemand]: 43/48 looper letters, 27 selfloop transitions, 4 changer transitions 0/44 dead transitions. [2024-11-09 10:55:51,770 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 44 transitions, 162 flow [2024-11-09 10:55:51,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:55:51,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:55:51,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 104 transitions. [2024-11-09 10:55:51,774 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2024-11-09 10:55:51,774 INFO L175 Difference]: Start difference. First operand has 43 places, 41 transitions, 92 flow. Second operand 4 states and 104 transitions. [2024-11-09 10:55:51,774 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 44 transitions, 162 flow [2024-11-09 10:55:51,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 44 transitions, 156 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:55:51,777 INFO L231 Difference]: Finished difference. Result has 46 places, 44 transitions, 115 flow [2024-11-09 10:55:51,778 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=115, PETRI_PLACES=46, PETRI_TRANSITIONS=44} [2024-11-09 10:55:51,778 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, -4 predicate places. [2024-11-09 10:55:51,779 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 44 transitions, 115 flow [2024-11-09 10:55:51,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 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-09 10:55:51,779 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:55:51,780 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2024-11-09 10:55:51,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 10:55:51,781 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-09 10:55:51,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:55:51,783 INFO L85 PathProgramCache]: Analyzing trace with hash 435942302, now seen corresponding path program 1 times [2024-11-09 10:55:51,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:55:51,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179341047] [2024-11-09 10:55:51,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:55:51,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:55:51,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:55:52,051 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-09 10:55:52,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:55:52,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179341047] [2024-11-09 10:55:52,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179341047] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:55:52,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1130180075] [2024-11-09 10:55:52,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:55:52,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:55:52,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:55:52,055 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-09 10:55:52,057 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-09 10:55:52,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:55:52,133 INFO L255 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-09 10:55:52,137 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:55:52,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2024-11-09 10:55:52,441 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-09 10:55:52,441 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:55:52,602 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-09 10:55:52,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1130180075] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:55:52,604 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 10:55:52,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2024-11-09 10:55:52,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156487760] [2024-11-09 10:55:52,605 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 10:55:52,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 10:55:52,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:55:52,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 10:55:52,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-09 10:55:52,636 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 48 [2024-11-09 10:55:52,638 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 44 transitions, 115 flow. Second operand has 11 states, 11 states have (on average 19.363636363636363) internal successors, (213), 11 states have internal predecessors, (213), 0 states have call successors, (0), 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-09 10:55:52,639 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:55:52,639 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 48 [2024-11-09 10:55:52,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:55:52,981 INFO L124 PetriNetUnfolderBase]: 536/977 cut-off events. [2024-11-09 10:55:52,981 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:55:52,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1874 conditions, 977 events. 536/977 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 6788 event pairs, 491 based on Foata normal form. 0/631 useless extension candidates. Maximal degree in co-relation 1852. Up to 827 conditions per place. [2024-11-09 10:55:52,992 INFO L140 encePairwiseOnDemand]: 43/48 looper letters, 23 selfloop transitions, 7 changer transitions 0/43 dead transitions. [2024-11-09 10:55:52,992 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 43 transitions, 171 flow [2024-11-09 10:55:52,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:55:52,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 10:55:52,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 139 transitions. [2024-11-09 10:55:52,998 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4826388888888889 [2024-11-09 10:55:52,998 INFO L175 Difference]: Start difference. First operand has 46 places, 44 transitions, 115 flow. Second operand 6 states and 139 transitions. [2024-11-09 10:55:52,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 43 transitions, 171 flow [2024-11-09 10:55:52,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 43 transitions, 168 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 10:55:53,002 INFO L231 Difference]: Finished difference. Result has 49 places, 43 transitions, 122 flow [2024-11-09 10:55:53,002 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=122, PETRI_PLACES=49, PETRI_TRANSITIONS=43} [2024-11-09 10:55:53,003 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, -1 predicate places. [2024-11-09 10:55:53,004 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 43 transitions, 122 flow [2024-11-09 10:55:53,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 19.363636363636363) internal successors, (213), 11 states have internal predecessors, (213), 0 states have call successors, (0), 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-09 10:55:53,004 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:55:53,005 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:55:53,027 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-09 10:55:53,208 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-09 10:55:53,209 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-09 10:55:53,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:55:53,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1911380750, now seen corresponding path program 1 times [2024-11-09 10:55:53,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:55:53,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958215455] [2024-11-09 10:55:53,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:55:53,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:55:53,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:55:53,246 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-09 10:55:53,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:55:53,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958215455] [2024-11-09 10:55:53,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958215455] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:55:53,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:55:53,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 10:55:53,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217130023] [2024-11-09 10:55:53,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:55:53,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:55:53,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:55:53,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:55:53,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:55:53,251 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 48 [2024-11-09 10:55:53,251 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 43 transitions, 122 flow. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 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-09 10:55:53,251 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:55:53,252 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 48 [2024-11-09 10:55:53,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:55:53,444 INFO L124 PetriNetUnfolderBase]: 788/1330 cut-off events. [2024-11-09 10:55:53,444 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-11-09 10:55:53,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2543 conditions, 1330 events. 788/1330 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 7083 event pairs, 266 based on Foata normal form. 48/938 useless extension candidates. Maximal degree in co-relation 2517. Up to 856 conditions per place. [2024-11-09 10:55:53,454 INFO L140 encePairwiseOnDemand]: 42/48 looper letters, 43 selfloop transitions, 3 changer transitions 0/59 dead transitions. [2024-11-09 10:55:53,455 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 59 transitions, 250 flow [2024-11-09 10:55:53,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:55:53,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:55:53,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 103 transitions. [2024-11-09 10:55:53,457 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7152777777777778 [2024-11-09 10:55:53,457 INFO L175 Difference]: Start difference. First operand has 49 places, 43 transitions, 122 flow. Second operand 3 states and 103 transitions. [2024-11-09 10:55:53,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 59 transitions, 250 flow [2024-11-09 10:55:53,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 59 transitions, 220 flow, removed 3 selfloop flow, removed 7 redundant places. [2024-11-09 10:55:53,460 INFO L231 Difference]: Finished difference. Result has 45 places, 45 transitions, 115 flow [2024-11-09 10:55:53,460 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=115, PETRI_PLACES=45, PETRI_TRANSITIONS=45} [2024-11-09 10:55:53,461 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, -5 predicate places. [2024-11-09 10:55:53,461 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 45 transitions, 115 flow [2024-11-09 10:55:53,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 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-09 10:55:53,462 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:55:53,462 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:55:53,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 10:55:53,462 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-09 10:55:53,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:55:53,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1971454629, now seen corresponding path program 1 times [2024-11-09 10:55:53,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:55:53,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036915621] [2024-11-09 10:55:53,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:55:53,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:55:53,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:55:53,560 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-09 10:55:53,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:55:53,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036915621] [2024-11-09 10:55:53,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036915621] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:55:53,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:55:53,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:55:53,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501121691] [2024-11-09 10:55:53,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:55:53,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:55:53,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:55:53,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:55:53,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:55:53,571 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 48 [2024-11-09 10:55:53,571 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 45 transitions, 115 flow. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 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-09 10:55:53,572 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:55:53,572 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 48 [2024-11-09 10:55:53,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:55:53,683 INFO L124 PetriNetUnfolderBase]: 488/856 cut-off events. [2024-11-09 10:55:53,683 INFO L125 PetriNetUnfolderBase]: For 114/114 co-relation queries the response was YES. [2024-11-09 10:55:53,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1841 conditions, 856 events. 488/856 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 4376 event pairs, 330 based on Foata normal form. 0/701 useless extension candidates. Maximal degree in co-relation 842. Up to 712 conditions per place. [2024-11-09 10:55:53,690 INFO L140 encePairwiseOnDemand]: 43/48 looper letters, 26 selfloop transitions, 3 changer transitions 0/42 dead transitions. [2024-11-09 10:55:53,691 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 42 transitions, 165 flow [2024-11-09 10:55:53,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:55:53,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:55:53,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 99 transitions. [2024-11-09 10:55:53,692 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.515625 [2024-11-09 10:55:53,692 INFO L175 Difference]: Start difference. First operand has 45 places, 45 transitions, 115 flow. Second operand 4 states and 99 transitions. [2024-11-09 10:55:53,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 42 transitions, 165 flow [2024-11-09 10:55:53,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 42 transitions, 162 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 10:55:53,694 INFO L231 Difference]: Finished difference. Result has 44 places, 42 transitions, 110 flow [2024-11-09 10:55:53,695 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=110, PETRI_PLACES=44, PETRI_TRANSITIONS=42} [2024-11-09 10:55:53,695 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, -6 predicate places. [2024-11-09 10:55:53,695 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 42 transitions, 110 flow [2024-11-09 10:55:53,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 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-09 10:55:53,696 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:55:53,696 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:55:53,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 10:55:53,696 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-09 10:55:53,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:55:53,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1971454630, now seen corresponding path program 1 times [2024-11-09 10:55:53,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:55:53,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279101353] [2024-11-09 10:55:53,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:55:53,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:55:53,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:55:53,786 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-09 10:55:53,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:55:53,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279101353] [2024-11-09 10:55:53,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279101353] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:55:53,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:55:53,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:55:53,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629753336] [2024-11-09 10:55:53,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:55:53,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:55:53,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:55:53,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:55:53,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:55:53,793 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 48 [2024-11-09 10:55:53,794 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 42 transitions, 110 flow. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 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-09 10:55:53,794 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:55:53,794 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 48 [2024-11-09 10:55:53,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:55:53,958 INFO L124 PetriNetUnfolderBase]: 540/979 cut-off events. [2024-11-09 10:55:53,958 INFO L125 PetriNetUnfolderBase]: For 114/114 co-relation queries the response was YES. [2024-11-09 10:55:53,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2050 conditions, 979 events. 540/979 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 5249 event pairs, 383 based on Foata normal form. 0/819 useless extension candidates. Maximal degree in co-relation 1794. Up to 715 conditions per place. [2024-11-09 10:55:53,965 INFO L140 encePairwiseOnDemand]: 44/48 looper letters, 39 selfloop transitions, 3 changer transitions 0/55 dead transitions. [2024-11-09 10:55:53,966 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 55 transitions, 226 flow [2024-11-09 10:55:53,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:55:53,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:55:53,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 117 transitions. [2024-11-09 10:55:53,967 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.609375 [2024-11-09 10:55:53,967 INFO L175 Difference]: Start difference. First operand has 44 places, 42 transitions, 110 flow. Second operand 4 states and 117 transitions. [2024-11-09 10:55:53,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 55 transitions, 226 flow [2024-11-09 10:55:53,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 55 transitions, 222 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:55:53,970 INFO L231 Difference]: Finished difference. Result has 46 places, 42 transitions, 115 flow [2024-11-09 10:55:53,970 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=115, PETRI_PLACES=46, PETRI_TRANSITIONS=42} [2024-11-09 10:55:53,971 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, -4 predicate places. [2024-11-09 10:55:53,971 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 42 transitions, 115 flow [2024-11-09 10:55:53,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 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-09 10:55:53,972 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:55:53,972 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:55:53,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 10:55:53,972 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-09 10:55:53,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:55:53,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1370417084, now seen corresponding path program 1 times [2024-11-09 10:55:53,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:55:53,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982014394] [2024-11-09 10:55:53,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:55:53,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:55:53,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:55:54,047 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-09 10:55:54,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:55:54,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982014394] [2024-11-09 10:55:54,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982014394] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:55:54,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:55:54,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:55:54,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748920761] [2024-11-09 10:55:54,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:55:54,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:55:54,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:55:54,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:55:54,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:55:54,055 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 48 [2024-11-09 10:55:54,055 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 42 transitions, 115 flow. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 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-09 10:55:54,056 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:55:54,056 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 48 [2024-11-09 10:55:54,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:55:54,202 INFO L124 PetriNetUnfolderBase]: 694/1162 cut-off events. [2024-11-09 10:55:54,203 INFO L125 PetriNetUnfolderBase]: For 185/185 co-relation queries the response was YES. [2024-11-09 10:55:54,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2562 conditions, 1162 events. 694/1162 cut-off events. For 185/185 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 6219 event pairs, 219 based on Foata normal form. 14/1013 useless extension candidates. Maximal degree in co-relation 2313. Up to 743 conditions per place. [2024-11-09 10:55:54,212 INFO L140 encePairwiseOnDemand]: 45/48 looper letters, 42 selfloop transitions, 2 changer transitions 0/55 dead transitions. [2024-11-09 10:55:54,213 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 55 transitions, 237 flow [2024-11-09 10:55:54,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:55:54,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:55:54,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2024-11-09 10:55:54,214 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6458333333333334 [2024-11-09 10:55:54,214 INFO L175 Difference]: Start difference. First operand has 46 places, 42 transitions, 115 flow. Second operand 3 states and 93 transitions. [2024-11-09 10:55:54,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 55 transitions, 237 flow [2024-11-09 10:55:54,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 55 transitions, 232 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:55:54,219 INFO L231 Difference]: Finished difference. Result has 47 places, 42 transitions, 118 flow [2024-11-09 10:55:54,220 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=118, PETRI_PLACES=47, PETRI_TRANSITIONS=42} [2024-11-09 10:55:54,220 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, -3 predicate places. [2024-11-09 10:55:54,220 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 42 transitions, 118 flow [2024-11-09 10:55:54,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 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-09 10:55:54,221 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:55:54,221 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:55:54,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 10:55:54,221 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-09 10:55:54,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:55:54,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1370417050, now seen corresponding path program 1 times [2024-11-09 10:55:54,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:55:54,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915961044] [2024-11-09 10:55:54,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:55:54,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:55:54,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:55:54,498 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-09 10:55:54,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:55:54,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915961044] [2024-11-09 10:55:54,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915961044] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:55:54,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:55:54,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:55:54,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620708322] [2024-11-09 10:55:54,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:55:54,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 10:55:54,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:55:54,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 10:55:54,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 10:55:54,519 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 48 [2024-11-09 10:55:54,521 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 42 transitions, 118 flow. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 0 states have call successors, (0), 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-09 10:55:54,524 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:55:54,524 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 48 [2024-11-09 10:55:54,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:55:54,698 INFO L124 PetriNetUnfolderBase]: 327/682 cut-off events. [2024-11-09 10:55:54,699 INFO L125 PetriNetUnfolderBase]: For 212/212 co-relation queries the response was YES. [2024-11-09 10:55:54,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1444 conditions, 682 events. 327/682 cut-off events. For 212/212 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3677 event pairs, 200 based on Foata normal form. 54/701 useless extension candidates. Maximal degree in co-relation 1172. Up to 419 conditions per place. [2024-11-09 10:55:54,706 INFO L140 encePairwiseOnDemand]: 40/48 looper letters, 25 selfloop transitions, 7 changer transitions 0/46 dead transitions. [2024-11-09 10:55:54,706 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 46 transitions, 192 flow [2024-11-09 10:55:54,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:55:54,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 10:55:54,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 127 transitions. [2024-11-09 10:55:54,712 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5291666666666667 [2024-11-09 10:55:54,712 INFO L175 Difference]: Start difference. First operand has 47 places, 42 transitions, 118 flow. Second operand 5 states and 127 transitions. [2024-11-09 10:55:54,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 46 transitions, 192 flow [2024-11-09 10:55:54,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 46 transitions, 190 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 10:55:54,715 INFO L231 Difference]: Finished difference. Result has 47 places, 39 transitions, 122 flow [2024-11-09 10:55:54,716 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=122, PETRI_PLACES=47, PETRI_TRANSITIONS=39} [2024-11-09 10:55:54,716 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, -3 predicate places. [2024-11-09 10:55:54,717 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 39 transitions, 122 flow [2024-11-09 10:55:54,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 0 states have call successors, (0), 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-09 10:55:54,717 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:55:54,717 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] [2024-11-09 10:55:54,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 10:55:54,719 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-09 10:55:54,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:55:54,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1133173084, now seen corresponding path program 1 times [2024-11-09 10:55:54,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:55:54,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028490502] [2024-11-09 10:55:54,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:55:54,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:55:54,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:55:54,834 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-09 10:55:54,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:55:54,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028490502] [2024-11-09 10:55:54,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028490502] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:55:54,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:55:54,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:55:54,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251167745] [2024-11-09 10:55:54,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:55:54,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:55:54,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:55:54,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:55:54,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:55:54,846 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 48 [2024-11-09 10:55:54,847 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 39 transitions, 122 flow. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 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-09 10:55:54,847 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:55:54,847 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 48 [2024-11-09 10:55:54,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:55:54,969 INFO L124 PetriNetUnfolderBase]: 497/875 cut-off events. [2024-11-09 10:55:54,970 INFO L125 PetriNetUnfolderBase]: For 460/460 co-relation queries the response was YES. [2024-11-09 10:55:54,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2062 conditions, 875 events. 497/875 cut-off events. For 460/460 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 4266 event pairs, 63 based on Foata normal form. 48/913 useless extension candidates. Maximal degree in co-relation 1650. Up to 522 conditions per place. [2024-11-09 10:55:54,977 INFO L140 encePairwiseOnDemand]: 44/48 looper letters, 46 selfloop transitions, 4 changer transitions 0/61 dead transitions. [2024-11-09 10:55:54,977 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 61 transitions, 306 flow [2024-11-09 10:55:54,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:55:54,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:55:54,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 109 transitions. [2024-11-09 10:55:54,979 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5677083333333334 [2024-11-09 10:55:54,979 INFO L175 Difference]: Start difference. First operand has 47 places, 39 transitions, 122 flow. Second operand 4 states and 109 transitions. [2024-11-09 10:55:54,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 61 transitions, 306 flow [2024-11-09 10:55:54,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 61 transitions, 276 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-09 10:55:54,981 INFO L231 Difference]: Finished difference. Result has 48 places, 41 transitions, 129 flow [2024-11-09 10:55:54,982 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=129, PETRI_PLACES=48, PETRI_TRANSITIONS=41} [2024-11-09 10:55:54,982 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, -2 predicate places. [2024-11-09 10:55:54,983 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 41 transitions, 129 flow [2024-11-09 10:55:54,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 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-09 10:55:54,983 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:55:54,983 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] [2024-11-09 10:55:54,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 10:55:54,983 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-09 10:55:54,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:55:54,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1542694010, now seen corresponding path program 2 times [2024-11-09 10:55:54,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:55:54,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434815324] [2024-11-09 10:55:54,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:55:54,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:55:54,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:55:55,092 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-09 10:55:55,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:55:55,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434815324] [2024-11-09 10:55:55,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434815324] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:55:55,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:55:55,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:55:55,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500130310] [2024-11-09 10:55:55,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:55:55,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:55:55,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:55:55,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:55:55,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:55:55,113 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 48 [2024-11-09 10:55:55,113 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 41 transitions, 129 flow. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 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-09 10:55:55,113 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:55:55,114 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 48 [2024-11-09 10:55:55,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:55:55,230 INFO L124 PetriNetUnfolderBase]: 489/848 cut-off events. [2024-11-09 10:55:55,231 INFO L125 PetriNetUnfolderBase]: For 302/346 co-relation queries the response was YES. [2024-11-09 10:55:55,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2078 conditions, 848 events. 489/848 cut-off events. For 302/346 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 3615 event pairs, 95 based on Foata normal form. 60/907 useless extension candidates. Maximal degree in co-relation 1659. Up to 613 conditions per place. [2024-11-09 10:55:55,237 INFO L140 encePairwiseOnDemand]: 44/48 looper letters, 37 selfloop transitions, 6 changer transitions 0/55 dead transitions. [2024-11-09 10:55:55,238 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 55 transitions, 262 flow [2024-11-09 10:55:55,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:55:55,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:55:55,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 101 transitions. [2024-11-09 10:55:55,239 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5260416666666666 [2024-11-09 10:55:55,239 INFO L175 Difference]: Start difference. First operand has 48 places, 41 transitions, 129 flow. Second operand 4 states and 101 transitions. [2024-11-09 10:55:55,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 55 transitions, 262 flow [2024-11-09 10:55:55,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 55 transitions, 257 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 10:55:55,241 INFO L231 Difference]: Finished difference. Result has 52 places, 44 transitions, 159 flow [2024-11-09 10:55:55,241 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=159, PETRI_PLACES=52, PETRI_TRANSITIONS=44} [2024-11-09 10:55:55,242 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 2 predicate places. [2024-11-09 10:55:55,242 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 44 transitions, 159 flow [2024-11-09 10:55:55,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 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-09 10:55:55,242 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:55:55,243 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] [2024-11-09 10:55:55,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 10:55:55,243 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-09 10:55:55,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:55:55,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1347901906, now seen corresponding path program 3 times [2024-11-09 10:55:55,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:55:55,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247613331] [2024-11-09 10:55:55,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:55:55,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:55:55,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:55:55,344 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-09 10:55:55,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:55:55,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247613331] [2024-11-09 10:55:55,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247613331] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:55:55,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:55:55,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:55:55,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043944083] [2024-11-09 10:55:55,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:55:55,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:55:55,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:55:55,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:55:55,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:55:55,363 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 48 [2024-11-09 10:55:55,364 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 44 transitions, 159 flow. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 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-09 10:55:55,364 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:55:55,364 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 48 [2024-11-09 10:55:55,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:55:55,525 INFO L124 PetriNetUnfolderBase]: 564/1015 cut-off events. [2024-11-09 10:55:55,526 INFO L125 PetriNetUnfolderBase]: For 608/618 co-relation queries the response was YES. [2024-11-09 10:55:55,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2635 conditions, 1015 events. 564/1015 cut-off events. For 608/618 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 5064 event pairs, 142 based on Foata normal form. 62/1070 useless extension candidates. Maximal degree in co-relation 2041. Up to 552 conditions per place. [2024-11-09 10:55:55,534 INFO L140 encePairwiseOnDemand]: 43/48 looper letters, 53 selfloop transitions, 7 changer transitions 0/72 dead transitions. [2024-11-09 10:55:55,535 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 72 transitions, 373 flow [2024-11-09 10:55:55,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:55:55,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 10:55:55,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 132 transitions. [2024-11-09 10:55:55,536 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.55 [2024-11-09 10:55:55,536 INFO L175 Difference]: Start difference. First operand has 52 places, 44 transitions, 159 flow. Second operand 5 states and 132 transitions. [2024-11-09 10:55:55,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 72 transitions, 373 flow [2024-11-09 10:55:55,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 72 transitions, 368 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 10:55:55,539 INFO L231 Difference]: Finished difference. Result has 56 places, 45 transitions, 177 flow [2024-11-09 10:55:55,540 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=177, PETRI_PLACES=56, PETRI_TRANSITIONS=45} [2024-11-09 10:55:55,540 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 6 predicate places. [2024-11-09 10:55:55,540 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 45 transitions, 177 flow [2024-11-09 10:55:55,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 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-09 10:55:55,541 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:55:55,541 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] [2024-11-09 10:55:55,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 10:55:55,541 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-09 10:55:55,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:55:55,542 INFO L85 PathProgramCache]: Analyzing trace with hash -31243646, now seen corresponding path program 4 times [2024-11-09 10:55:55,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:55:55,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873156485] [2024-11-09 10:55:55,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:55:55,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:55:55,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:55:55,654 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-09 10:55:55,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:55:55,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873156485] [2024-11-09 10:55:55,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873156485] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:55:55,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:55:55,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:55:55,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472610162] [2024-11-09 10:55:55,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:55:55,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:55:55,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:55:55,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:55:55,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:55:55,672 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 48 [2024-11-09 10:55:55,672 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 45 transitions, 177 flow. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 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-09 10:55:55,672 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:55:55,672 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 48 [2024-11-09 10:55:55,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:55:55,858 INFO L124 PetriNetUnfolderBase]: 740/1385 cut-off events. [2024-11-09 10:55:55,858 INFO L125 PetriNetUnfolderBase]: For 1299/1359 co-relation queries the response was YES. [2024-11-09 10:55:55,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3583 conditions, 1385 events. 740/1385 cut-off events. For 1299/1359 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 7692 event pairs, 212 based on Foata normal form. 102/1440 useless extension candidates. Maximal degree in co-relation 3042. Up to 667 conditions per place. [2024-11-09 10:55:55,868 INFO L140 encePairwiseOnDemand]: 43/48 looper letters, 46 selfloop transitions, 7 changer transitions 0/66 dead transitions. [2024-11-09 10:55:55,868 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 66 transitions, 353 flow [2024-11-09 10:55:55,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:55:55,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 10:55:55,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 126 transitions. [2024-11-09 10:55:55,869 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.525 [2024-11-09 10:55:55,869 INFO L175 Difference]: Start difference. First operand has 56 places, 45 transitions, 177 flow. Second operand 5 states and 126 transitions. [2024-11-09 10:55:55,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 66 transitions, 353 flow [2024-11-09 10:55:55,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 66 transitions, 342 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-09 10:55:55,872 INFO L231 Difference]: Finished difference. Result has 58 places, 46 transitions, 189 flow [2024-11-09 10:55:55,873 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=189, PETRI_PLACES=58, PETRI_TRANSITIONS=46} [2024-11-09 10:55:55,873 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 8 predicate places. [2024-11-09 10:55:55,873 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 46 transitions, 189 flow [2024-11-09 10:55:55,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 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-09 10:55:55,874 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:55:55,874 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] [2024-11-09 10:55:55,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 10:55:55,874 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-09 10:55:55,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:55:55,875 INFO L85 PathProgramCache]: Analyzing trace with hash -565307366, now seen corresponding path program 5 times [2024-11-09 10:55:55,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:55:55,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260160089] [2024-11-09 10:55:55,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:55:55,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:55:55,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:55:56,019 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-09 10:55:56,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:55:56,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260160089] [2024-11-09 10:55:56,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260160089] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:55:56,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:55:56,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:55:56,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676856176] [2024-11-09 10:55:56,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:55:56,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:55:56,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:55:56,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:55:56,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:55:56,047 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 48 [2024-11-09 10:55:56,048 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 189 flow. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 0 states have call successors, (0), 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-09 10:55:56,048 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:55:56,048 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 48 [2024-11-09 10:55:56,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:55:56,319 INFO L124 PetriNetUnfolderBase]: 1003/1803 cut-off events. [2024-11-09 10:55:56,319 INFO L125 PetriNetUnfolderBase]: For 1661/1677 co-relation queries the response was YES. [2024-11-09 10:55:56,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4770 conditions, 1803 events. 1003/1803 cut-off events. For 1661/1677 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 10271 event pairs, 210 based on Foata normal form. 117/1870 useless extension candidates. Maximal degree in co-relation 4295. Up to 476 conditions per place. [2024-11-09 10:55:56,331 INFO L140 encePairwiseOnDemand]: 43/48 looper letters, 53 selfloop transitions, 5 changer transitions 7/77 dead transitions. [2024-11-09 10:55:56,331 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 77 transitions, 433 flow [2024-11-09 10:55:56,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:55:56,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 10:55:56,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 136 transitions. [2024-11-09 10:55:56,332 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5666666666666667 [2024-11-09 10:55:56,332 INFO L175 Difference]: Start difference. First operand has 58 places, 46 transitions, 189 flow. Second operand 5 states and 136 transitions. [2024-11-09 10:55:56,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 77 transitions, 433 flow [2024-11-09 10:55:56,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 77 transitions, 421 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-09 10:55:56,336 INFO L231 Difference]: Finished difference. Result has 61 places, 44 transitions, 192 flow [2024-11-09 10:55:56,336 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=192, PETRI_PLACES=61, PETRI_TRANSITIONS=44} [2024-11-09 10:55:56,336 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 11 predicate places. [2024-11-09 10:55:56,337 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 44 transitions, 192 flow [2024-11-09 10:55:56,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 0 states have call successors, (0), 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-09 10:55:56,337 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:55:56,337 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, 1, 1, 1, 1] [2024-11-09 10:55:56,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 10:55:56,338 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-09 10:55:56,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:55:56,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1702084630, now seen corresponding path program 1 times [2024-11-09 10:55:56,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:55:56,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501262149] [2024-11-09 10:55:56,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:55:56,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:55:56,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:55:56,970 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:55:56,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:55:56,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501262149] [2024-11-09 10:55:56,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501262149] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:55:56,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1621721543] [2024-11-09 10:55:56,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:55:56,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:55:56,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:55:56,973 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-09 10:55:56,974 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-09 10:55:57,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:55:57,062 INFO L255 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-09 10:55:57,065 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:55:57,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2024-11-09 10:55:57,436 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:55:57,436 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:55:58,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 55 [2024-11-09 10:55:58,201 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 10:55:58,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 68 [2024-11-09 10:55:58,377 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:55:58,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1621721543] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:55:58,380 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 10:55:58,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 28 [2024-11-09 10:55:58,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429767371] [2024-11-09 10:55:58,380 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 10:55:58,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-09 10:55:58,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:55:58,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-09 10:55:58,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=667, Unknown=0, NotChecked=0, Total=812 [2024-11-09 10:55:58,532 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 48 [2024-11-09 10:55:58,533 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 44 transitions, 192 flow. Second operand has 29 states, 29 states have (on average 12.689655172413794) internal successors, (368), 29 states have internal predecessors, (368), 0 states have call successors, (0), 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-09 10:55:58,533 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:55:58,533 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 48 [2024-11-09 10:55:58,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:56:03,964 INFO L124 PetriNetUnfolderBase]: 12007/17737 cut-off events. [2024-11-09 10:56:03,964 INFO L125 PetriNetUnfolderBase]: For 19316/19316 co-relation queries the response was YES. [2024-11-09 10:56:04,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50225 conditions, 17737 events. 12007/17737 cut-off events. For 19316/19316 co-relation queries the response was YES. Maximal size of possible extension queue 593. Compared 105758 event pairs, 981 based on Foata normal form. 696/18429 useless extension candidates. Maximal degree in co-relation 26003. Up to 3565 conditions per place. [2024-11-09 10:56:04,069 INFO L140 encePairwiseOnDemand]: 31/48 looper letters, 351 selfloop transitions, 117 changer transitions 92/564 dead transitions. [2024-11-09 10:56:04,069 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 564 transitions, 3337 flow [2024-11-09 10:56:04,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2024-11-09 10:56:04,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2024-11-09 10:56:04,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 1097 transitions. [2024-11-09 10:56:04,075 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.40095029239766083 [2024-11-09 10:56:04,075 INFO L175 Difference]: Start difference. First operand has 61 places, 44 transitions, 192 flow. Second operand 57 states and 1097 transitions. [2024-11-09 10:56:04,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 564 transitions, 3337 flow [2024-11-09 10:56:04,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 564 transitions, 3234 flow, removed 23 selfloop flow, removed 5 redundant places. [2024-11-09 10:56:04,097 INFO L231 Difference]: Finished difference. Result has 146 places, 166 transitions, 1289 flow [2024-11-09 10:56:04,097 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=57, PETRI_FLOW=1289, PETRI_PLACES=146, PETRI_TRANSITIONS=166} [2024-11-09 10:56:04,098 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 96 predicate places. [2024-11-09 10:56:04,098 INFO L471 AbstractCegarLoop]: Abstraction has has 146 places, 166 transitions, 1289 flow [2024-11-09 10:56:04,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 12.689655172413794) internal successors, (368), 29 states have internal predecessors, (368), 0 states have call successors, (0), 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-09 10:56:04,099 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:56:04,099 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 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-09 10:56:04,118 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 10:56:04,300 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,SelfDestructingSolverStorable13 [2024-11-09 10:56:04,301 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-09 10:56:04,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:56:04,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1271319742, now seen corresponding path program 2 times [2024-11-09 10:56:04,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:56:04,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704893267] [2024-11-09 10:56:04,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:56:04,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:56:04,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:56:04,395 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 10:56:04,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:56:04,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704893267] [2024-11-09 10:56:04,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704893267] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:56:04,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:56:04,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:56:04,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618452964] [2024-11-09 10:56:04,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:56:04,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:56:04,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:56:04,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:56:04,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:56:04,399 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 48 [2024-11-09 10:56:04,399 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 166 transitions, 1289 flow. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 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-09 10:56:04,399 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:56:04,399 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 48 [2024-11-09 10:56:04,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:56:04,973 INFO L124 PetriNetUnfolderBase]: 2079/3905 cut-off events. [2024-11-09 10:56:04,973 INFO L125 PetriNetUnfolderBase]: For 54902/55163 co-relation queries the response was YES. [2024-11-09 10:56:04,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20721 conditions, 3905 events. 2079/3905 cut-off events. For 54902/55163 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 24882 event pairs, 475 based on Foata normal form. 283/3909 useless extension candidates. Maximal degree in co-relation 18121. Up to 1551 conditions per place. [2024-11-09 10:56:05,016 INFO L140 encePairwiseOnDemand]: 44/48 looper letters, 113 selfloop transitions, 47 changer transitions 0/226 dead transitions. [2024-11-09 10:56:05,017 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 226 transitions, 2142 flow [2024-11-09 10:56:05,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:56:05,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:56:05,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 123 transitions. [2024-11-09 10:56:05,018 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.640625 [2024-11-09 10:56:05,018 INFO L175 Difference]: Start difference. First operand has 146 places, 166 transitions, 1289 flow. Second operand 4 states and 123 transitions. [2024-11-09 10:56:05,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 226 transitions, 2142 flow [2024-11-09 10:56:05,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 226 transitions, 1782 flow, removed 112 selfloop flow, removed 15 redundant places. [2024-11-09 10:56:05,100 INFO L231 Difference]: Finished difference. Result has 136 places, 204 transitions, 1551 flow [2024-11-09 10:56:05,101 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1034, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1551, PETRI_PLACES=136, PETRI_TRANSITIONS=204} [2024-11-09 10:56:05,102 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 86 predicate places. [2024-11-09 10:56:05,103 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 204 transitions, 1551 flow [2024-11-09 10:56:05,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 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-09 10:56:05,103 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:56:05,103 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 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-09 10:56:05,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 10:56:05,104 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-09 10:56:05,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:56:05,104 INFO L85 PathProgramCache]: Analyzing trace with hash -688874354, now seen corresponding path program 3 times [2024-11-09 10:56:05,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:56:05,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763663663] [2024-11-09 10:56:05,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:56:05,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:56:05,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:56:06,512 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:56:06,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:56:06,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763663663] [2024-11-09 10:56:06,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763663663] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:56:06,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2058540819] [2024-11-09 10:56:06,514 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 10:56:06,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:56:06,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:56:06,516 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-09 10:56:06,518 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-09 10:56:06,605 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-09 10:56:06,605 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 10:56:06,607 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-09 10:56:06,611 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:56:06,806 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-09 10:56:06,807 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:56:06,936 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 10:56:06,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 24 [2024-11-09 10:56:07,091 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-09 10:56:07,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2058540819] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:56:07,092 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 10:56:07,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 6, 6] total 22 [2024-11-09 10:56:07,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943564940] [2024-11-09 10:56:07,093 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 10:56:07,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-09 10:56:07,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:56:07,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-09 10:56:07,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=433, Unknown=0, NotChecked=0, Total=506 [2024-11-09 10:56:07,171 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 48 [2024-11-09 10:56:07,172 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 204 transitions, 1551 flow. Second operand has 23 states, 23 states have (on average 17.26086956521739) internal successors, (397), 23 states have internal predecessors, (397), 0 states have call successors, (0), 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-09 10:56:07,172 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:56:07,172 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 48 [2024-11-09 10:56:07,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:56:09,277 INFO L124 PetriNetUnfolderBase]: 5227/8998 cut-off events. [2024-11-09 10:56:09,277 INFO L125 PetriNetUnfolderBase]: For 89398/89446 co-relation queries the response was YES. [2024-11-09 10:56:09,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43915 conditions, 8998 events. 5227/8998 cut-off events. For 89398/89446 co-relation queries the response was YES. Maximal size of possible extension queue 359. Compared 58453 event pairs, 479 based on Foata normal form. 312/9072 useless extension candidates. Maximal degree in co-relation 34716. Up to 1966 conditions per place. [2024-11-09 10:56:09,356 INFO L140 encePairwiseOnDemand]: 35/48 looper letters, 283 selfloop transitions, 84 changer transitions 54/448 dead transitions. [2024-11-09 10:56:09,356 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 448 transitions, 4400 flow [2024-11-09 10:56:09,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-09 10:56:09,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2024-11-09 10:56:09,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 509 transitions. [2024-11-09 10:56:09,359 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4241666666666667 [2024-11-09 10:56:09,359 INFO L175 Difference]: Start difference. First operand has 136 places, 204 transitions, 1551 flow. Second operand 25 states and 509 transitions. [2024-11-09 10:56:09,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 448 transitions, 4400 flow [2024-11-09 10:56:09,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 448 transitions, 4298 flow, removed 51 selfloop flow, removed 0 redundant places. [2024-11-09 10:56:09,506 INFO L231 Difference]: Finished difference. Result has 164 places, 232 transitions, 2023 flow [2024-11-09 10:56:09,507 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1519, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=2023, PETRI_PLACES=164, PETRI_TRANSITIONS=232} [2024-11-09 10:56:09,508 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 114 predicate places. [2024-11-09 10:56:09,508 INFO L471 AbstractCegarLoop]: Abstraction has has 164 places, 232 transitions, 2023 flow [2024-11-09 10:56:09,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 17.26086956521739) internal successors, (397), 23 states have internal predecessors, (397), 0 states have call successors, (0), 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-09 10:56:09,509 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:56:09,509 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:56:09,526 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-09 10:56:09,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:56:09,714 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-09 10:56:09,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:56:09,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1958140950, now seen corresponding path program 4 times [2024-11-09 10:56:09,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:56:09,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654518587] [2024-11-09 10:56:09,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:56:09,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:56:09,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:56:09,871 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 10:56:09,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:56:09,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654518587] [2024-11-09 10:56:09,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654518587] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:56:09,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:56:09,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:56:09,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420678131] [2024-11-09 10:56:09,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:56:09,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:56:09,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:56:09,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:56:09,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:56:09,878 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 48 [2024-11-09 10:56:09,878 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 232 transitions, 2023 flow. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 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-09 10:56:09,879 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:56:09,879 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 48 [2024-11-09 10:56:09,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:56:10,716 INFO L124 PetriNetUnfolderBase]: 3499/6260 cut-off events. [2024-11-09 10:56:10,716 INFO L125 PetriNetUnfolderBase]: For 77369/77811 co-relation queries the response was YES. [2024-11-09 10:56:10,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33494 conditions, 6260 events. 3499/6260 cut-off events. For 77369/77811 co-relation queries the response was YES. Maximal size of possible extension queue 256. Compared 40195 event pairs, 585 based on Foata normal form. 635/6637 useless extension candidates. Maximal degree in co-relation 29590. Up to 2679 conditions per place. [2024-11-09 10:56:10,777 INFO L140 encePairwiseOnDemand]: 44/48 looper letters, 164 selfloop transitions, 6 changer transitions 3/220 dead transitions. [2024-11-09 10:56:10,777 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 220 transitions, 2430 flow [2024-11-09 10:56:10,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:56:10,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:56:10,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 105 transitions. [2024-11-09 10:56:10,779 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.546875 [2024-11-09 10:56:10,779 INFO L175 Difference]: Start difference. First operand has 164 places, 232 transitions, 2023 flow. Second operand 4 states and 105 transitions. [2024-11-09 10:56:10,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 220 transitions, 2430 flow [2024-11-09 10:56:10,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 220 transitions, 2248 flow, removed 52 selfloop flow, removed 15 redundant places. [2024-11-09 10:56:10,861 INFO L231 Difference]: Finished difference. Result has 144 places, 182 transitions, 1562 flow [2024-11-09 10:56:10,861 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1535, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1562, PETRI_PLACES=144, PETRI_TRANSITIONS=182} [2024-11-09 10:56:10,861 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 94 predicate places. [2024-11-09 10:56:10,862 INFO L471 AbstractCegarLoop]: Abstraction has has 144 places, 182 transitions, 1562 flow [2024-11-09 10:56:10,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 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-09 10:56:10,862 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:56:10,862 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 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-09 10:56:10,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 10:56:10,863 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-09 10:56:10,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:56:10,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1807127722, now seen corresponding path program 1 times [2024-11-09 10:56:10,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:56:10,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625861152] [2024-11-09 10:56:10,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:56:10,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:56:10,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:56:11,913 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:56:11,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:56:11,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625861152] [2024-11-09 10:56:11,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625861152] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:56:11,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1484533268] [2024-11-09 10:56:11,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:56:11,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:56:11,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:56:11,916 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-09 10:56:11,918 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-09 10:56:12,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:56:12,011 INFO L255 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-09 10:56:12,014 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:56:12,546 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:56:12,546 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:56:12,895 INFO L349 Elim1Store]: treesize reduction 10, result has 73.0 percent of original size [2024-11-09 10:56:12,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 75 treesize of output 50 [2024-11-09 10:56:13,393 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:56:13,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1484533268] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:56:13,394 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 10:56:13,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 35 [2024-11-09 10:56:13,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25045742] [2024-11-09 10:56:13,395 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 10:56:13,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-09 10:56:13,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:56:13,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-09 10:56:13,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=1060, Unknown=0, NotChecked=0, Total=1260 [2024-11-09 10:56:13,626 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48 [2024-11-09 10:56:13,626 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 182 transitions, 1562 flow. Second operand has 36 states, 36 states have (on average 14.63888888888889) internal successors, (527), 36 states have internal predecessors, (527), 0 states have call successors, (0), 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-09 10:56:13,627 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:56:13,627 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48 [2024-11-09 10:56:13,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:56:28,417 INFO L124 PetriNetUnfolderBase]: 37228/58267 cut-off events. [2024-11-09 10:56:28,417 INFO L125 PetriNetUnfolderBase]: For 409662/410600 co-relation queries the response was YES. [2024-11-09 10:56:28,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 272259 conditions, 58267 events. 37228/58267 cut-off events. For 409662/410600 co-relation queries the response was YES. Maximal size of possible extension queue 1394. Compared 419928 event pairs, 2497 based on Foata normal form. 2222/60320 useless extension candidates. Maximal degree in co-relation 176097. Up to 8024 conditions per place. [2024-11-09 10:56:28,996 INFO L140 encePairwiseOnDemand]: 33/48 looper letters, 1045 selfloop transitions, 687 changer transitions 343/2092 dead transitions. [2024-11-09 10:56:28,996 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 2092 transitions, 20883 flow [2024-11-09 10:56:28,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 171 states. [2024-11-09 10:56:28,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2024-11-09 10:56:29,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 3528 transitions. [2024-11-09 10:56:29,012 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4298245614035088 [2024-11-09 10:56:29,012 INFO L175 Difference]: Start difference. First operand has 144 places, 182 transitions, 1562 flow. Second operand 171 states and 3528 transitions. [2024-11-09 10:56:29,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 2092 transitions, 20883 flow [2024-11-09 10:56:29,352 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 311 places, 2092 transitions, 20877 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 10:56:29,370 INFO L231 Difference]: Finished difference. Result has 386 places, 821 transitions, 10427 flow [2024-11-09 10:56:29,370 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1530, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=117, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=171, PETRI_FLOW=10427, PETRI_PLACES=386, PETRI_TRANSITIONS=821} [2024-11-09 10:56:29,370 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 336 predicate places. [2024-11-09 10:56:29,371 INFO L471 AbstractCegarLoop]: Abstraction has has 386 places, 821 transitions, 10427 flow [2024-11-09 10:56:29,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 14.63888888888889) internal successors, (527), 36 states have internal predecessors, (527), 0 states have call successors, (0), 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-09 10:56:29,371 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:56:29,371 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 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-09 10:56:29,387 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 10:56:29,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-09 10:56:29,572 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-09 10:56:29,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:56:29,572 INFO L85 PathProgramCache]: Analyzing trace with hash -2117098686, now seen corresponding path program 2 times [2024-11-09 10:56:29,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:56:29,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57836065] [2024-11-09 10:56:29,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:56:29,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:56:29,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:56:31,006 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:56:31,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:56:31,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57836065] [2024-11-09 10:56:31,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57836065] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:56:31,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1529941922] [2024-11-09 10:56:31,007 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 10:56:31,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:56:31,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:56:31,009 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 10:56:31,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 10:56:31,100 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 10:56:31,101 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 10:56:31,103 INFO L255 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-09 10:56:31,106 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:56:31,682 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:56:31,682 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:56:31,993 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 10:56:31,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 75 treesize of output 60 [2024-11-09 10:56:32,567 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:56:32,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1529941922] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:56:32,568 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 10:56:32,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 38 [2024-11-09 10:56:32,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842835828] [2024-11-09 10:56:32,568 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 10:56:32,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-11-09 10:56:32,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:56:32,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-11-09 10:56:32,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=1262, Unknown=0, NotChecked=0, Total=1482 [2024-11-09 10:56:32,799 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 48 [2024-11-09 10:56:32,800 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 386 places, 821 transitions, 10427 flow. Second operand has 39 states, 39 states have (on average 17.974358974358974) internal successors, (701), 39 states have internal predecessors, (701), 0 states have call successors, (0), 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-09 10:56:32,800 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:56:32,800 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 48 [2024-11-09 10:56:32,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:56:56,414 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([436] L59-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.offset_1| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_1| 0) (= (mod |v_thread1Thread1of1ForFork0_~cond~0#1_5| 256) 0)) InVars {thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_5|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_1|, thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_5|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base][2276], [Black: 427#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 0 ~sum~0) (= ~v_assert~0 1) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)) (not (= (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0)) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (< ~n~0 (+ ~front~0 1)) (and (= ~back~0 ~front~0) (= ~sum~0 0)) (< ~front~0 0)) (<= ~sum~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 487#(and (<= 1 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (or (and (<= 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)) (not (= (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ ~front~0 1)) (= (mod |thread2Thread1of1ForFork1_~b~0#1| 256) 0) (< ~front~0 0))), Black: 303#(< 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)), 824#(not (= (mod |thread2Thread1of1ForFork1_~b~0#1| 256) 0)), Black: 431#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~v_assert~0 1) (= ~sum~0 0) (<= 0 ~front~0) (= ~queue~0.offset 0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (<= ~n~0 1) (<= (+ ~front~0 1) ~n~0) (= (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4)) 1)), Black: 384#(or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 1)) (= ~back~0 ~front~0) (<= ~sum~0 0))), Black: 441#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 0 ~sum~0) (= ~v_assert~0 1) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)) (not (= (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0)) (<= ~sum~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 453#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~sum~0 1) (= ~v_assert~0 1) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0)) (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (or (and (<= (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 0) (<= 0 (+ (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1))) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0))), Black: 528#(<= ~back~0 (+ ~front~0 1)), Black: 527#(<= ~back~0 ~front~0), 45#L112-4true, 14#thread1EXITtrue, 173#true, 116#(= (select |#valid| ~queue~0.base) 1), Black: 679#(< 0 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)), Black: 817#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~v_assert~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 805#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~sum~0 1) (= ~v_assert~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 531#true, Black: 825#(and (<= (mod |thread2Thread1of1ForFork1_~b~0#1| 256) 0) (<= 0 (div |thread2Thread1of1ForFork1_~b~0#1| 256))), Black: 111#(<= ~back~0 ~front~0), 13#L84true, 828#true, Black: 124#(= |thread2Thread1of1ForFork1_~b~0#1| 1), Black: 137#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~v_assert~0 1)), Black: 1259#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (or (< ~n~0 (+ ~back~0 1)) (and (<= ~front~0 0) (or (and (= (select (select |#memory_int#1| ~queue~0.base) 0) 1) (= (select (select |#memory_int#1| ~queue~0.base) 4) (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4)))) (not (= ~front~0 0))))) (= ~v_assert~0 1) (= ~sum~0 0) (= ~queue~0.offset 0) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (= (mod |thread2Thread1of1ForFork1_~b~0#1| 256) 0) (< ~front~0 0))), Black: 1257#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (or (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (= (mod |thread2Thread1of1ForFork1_~b~0#1| 256) 0) (< ~front~0 0)) (= ~v_assert~0 1) (<= 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)), Black: 1295#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~v_assert~0 1) (= (+ 1 (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4))) (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4)))) (= ~queue~0.offset 0) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (= (mod |thread2Thread1of1ForFork1_~b~0#1| 256) 0) (< ~front~0 0))), Black: 1373#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (or (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (= (mod |thread2Thread1of1ForFork1_~b~0#1| 256) 0) (< ~front~0 0)) (= ~v_assert~0 1) (= ~queue~0.offset 0) (= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4))) 0)), Black: 143#(and (= ~v_assert~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 1271#(and (<= 1 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (or (< ~n~0 (+ ~back~0 1)) (and (= ~sum~0 0) (<= ~front~0 0) (or (and (= (select (select |#memory_int#1| ~queue~0.base) 0) 1) (= (select (select |#memory_int#1| ~queue~0.base) 4) (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4)))) (not (= ~front~0 0))))) (= ~queue~0.offset 0)), Black: 1030#(or (not (= (+ (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1))), Black: 1139#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~v_assert~0 1) (= ~sum~0 0) (or (not (= (+ (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (and (<= 0 (+ (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)) (< ~n~0 (+ ~back~0 1)) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0))), Black: 1309#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (= ~v_assert~0 1) (= ~sum~0 0) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (= (mod |thread2Thread1of1ForFork1_~b~0#1| 256) 0) (< ~front~0 0)) (<= (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)), Black: 1147#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~v_assert~0 1) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)))), Black: 1115#(and (<= ~n~0 2) (= ~back~0 ~front~0) (= ~v_assert~0 1) (= ~sum~0 0) (= ~queue~0.offset 0)), Black: 1347#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (or (not (= (+ (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)))), Black: 1159#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~v_assert~0 1) (= ~sum~0 0)), Black: 149#(and (<= (div |thread1Thread1of1ForFork0_~cond~0#1| 256) 0) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 1333#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (or (not (= (+ (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)) (< ~n~0 (+ ~back~0 1)) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0)) (= ~v_assert~0 1)), Black: 1187#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 0 ~sum~0) (= ~v_assert~0 1) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (< ~front~0 0)) (or (< ~n~0 (+ ~back~0 1)) (and (= ~sum~0 0) (<= ~front~0 0) (or (and (= (select (select |#memory_int#1| ~queue~0.base) 0) 1) (= (select (select |#memory_int#1| ~queue~0.base) 4) (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4)))) (not (= ~front~0 0))))) (= ~queue~0.offset 0) (<= ~sum~0 1)), Black: 1207#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (= ~v_assert~0 1) (= ~sum~0 0) (or (not (= (+ (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (and (<= 0 (+ (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)) (< ~n~0 (+ ~back~0 1)) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0)) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (= (mod |thread2Thread1of1ForFork1_~b~0#1| 256) 0) (< ~front~0 0)) (<= (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)), Black: 1177#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~v_assert~0 1)), Black: 1137#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= ~n~0 2) (<= 1 ~back~0) (= ~back~0 ~front~0) (= ~sum~0 1) (= ~v_assert~0 1) (= (select (select |#memory_int#1| ~queue~0.base) (+ (- 4) (* ~back~0 4))) 1) (= ~queue~0.offset 0) (<= ~back~0 ~n~0)), Black: 1255#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (or (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (= (mod |thread2Thread1of1ForFork1_~b~0#1| 256) 0) (< ~front~0 0)) (= ~v_assert~0 1)), Black: 1323#(and (= ~sum~0 0) (or (not (= (+ (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (and (<= 0 (+ (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)) (< ~n~0 (+ ~back~0 1)) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0)) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (= (mod |thread2Thread1of1ForFork1_~b~0#1| 256) 0) (< ~front~0 0))), Black: 1185#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (or (< ~n~0 (+ ~back~0 1)) (and (<= ~front~0 0) (or (and (= (select (select |#memory_int#1| ~queue~0.base) 0) 1) (= (select (select |#memory_int#1| ~queue~0.base) 4) (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4)))) (not (= ~front~0 0))))) (or (< ~front~0 1) (not (= ~back~0 0))) (= ~v_assert~0 1) (= ~sum~0 0) (= ~queue~0.offset 0) (or (< ~n~0 3) (< ~back~0 1)) (= (+ 1 (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4))) (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4)))), Black: 1195#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 0 ~sum~0) (= ~v_assert~0 1) (<= ~sum~0 1)), Black: 1161#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 0 ~sum~0) (= ~v_assert~0 1) (or (not (= ~back~0 0)) (and (= ~sum~0 0) (<= ~front~0 0))) (= ~queue~0.offset 0) (or (< ~n~0 3) (< ~back~0 1)) (<= ~sum~0 1) (or (< ~n~0 (+ ~back~0 1)) (= (+ 1 (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4))) (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4))))) (= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4))) 0) (or (and (= ~sum~0 0) (not (= ~front~0 0)) (<= ~front~0 0)) (< ~n~0 (+ ~back~0 1)))), Black: 1169#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (or (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (= (mod |thread2Thread1of1ForFork1_~b~0#1| 256) 0) (< ~front~0 0)) (= ~v_assert~0 1) (or (not (= (+ (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)))), Black: 1305#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)))), Black: 1239#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~v_assert~0 1) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (< ~front~0 0)) (= (+ 1 (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4))) (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4)))) (= ~queue~0.offset 0)), Black: 1371#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (or (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (= (mod |thread2Thread1of1ForFork1_~b~0#1| 256) 0) (< ~front~0 0)) (or (not (= (+ (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)) (< ~n~0 (+ ~back~0 1)) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0)) (= ~v_assert~0 1)), Black: 1277#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~queue~0.offset 0) (or (< ~n~0 (+ ~back~0 1)) (= (+ 1 (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4))) (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4)))))), Black: 1245#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (or (< ~n~0 (+ ~back~0 1)) (= (+ 1 (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4))) (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4)))))), Black: 1251#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~v_assert~0 1) (or (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0))), Black: 1189#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 0 ~sum~0) (= ~v_assert~0 1) (= ~queue~0.offset 0) (<= ~sum~0 1) (or (< ~n~0 (+ ~back~0 1)) (= (+ 1 (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4))) (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4)))))), Black: 1223#(and (or (< 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4)) 1)) (< ~n~0 (+ ~back~0 1)) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0) (not (= (+ 1 (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4))) 0))) (<= 1 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (or (not (= ~back~0 0)) (and (= ~sum~0 0) (<= ~front~0 0))) (= ~queue~0.offset 0) (or (< ~n~0 3) (< ~back~0 1)) (or (< ~back~0 0) (and (<= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4))))) (< ~n~0 (+ ~back~0 1)) (not (= (+ 1 (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4))) 0)))), Black: 1327#(and (or (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (= (mod |thread2Thread1of1ForFork1_~b~0#1| 256) 0) (< ~front~0 0)) (<= 1 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256))), Black: 168#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (= ~sum~0 0)), Black: 1163#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 0 ~sum~0) (= ~v_assert~0 1) (or (not (= ~back~0 0)) (and (= ~sum~0 0) (<= ~front~0 0))) (= ~queue~0.offset 0) (or (< ~n~0 3) (< ~back~0 1)) (<= ~sum~0 1) (or (< ~n~0 (+ ~back~0 1)) (= (+ 1 (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4))) (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4))))) (or (< ~n~0 (+ ~back~0 1)) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0) (not (= (+ 1 (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4))) 0)))), Black: 1171#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (or (< ~n~0 (+ ~back~0 1)) (and (<= ~front~0 0) (or (and (= (select (select |#memory_int#1| ~queue~0.base) 0) 1) (= (select (select |#memory_int#1| ~queue~0.base) 4) (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4)))) (not (= ~front~0 0))))) (or (< ~front~0 1) (not (= ~back~0 0))) (= ~v_assert~0 1) (= ~sum~0 0) (= ~queue~0.offset 0) (or (< ~n~0 (+ ~back~0 1)) (= (+ 1 (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4))) (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4)))) (or (< ~n~0 3) (< ~back~0 1))), Black: 1201#(and (<= 0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (= ~v_assert~0 1) (= ~sum~0 0) (or (not (= (+ (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (and (<= 0 (+ (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)) (< ~n~0 (+ ~back~0 1)) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0)) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (= (mod |thread2Thread1of1ForFork1_~b~0#1| 256) 0) (< ~front~0 0)) (<= (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)), Black: 1297#(and (<= 0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (= ~v_assert~0 1) (= ~sum~0 0) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (= (mod |thread2Thread1of1ForFork1_~b~0#1| 256) 0) (< ~front~0 0)) (<= (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)), Black: 1281#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 0 ~sum~0) (= ~v_assert~0 1) (<= ~sum~0 1) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (= (mod |thread2Thread1of1ForFork1_~b~0#1| 256) 0) (< ~front~0 0))), Black: 1151#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~v_assert~0 1) (= ~sum~0 0) (or (not (= (+ (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (and (<= 0 (+ (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)) (< ~n~0 (+ ~back~0 1)) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0)) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (= (mod |thread2Thread1of1ForFork1_~b~0#1| 256) 0) (< ~front~0 0))), Black: 1267#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~v_assert~0 1) (= ~queue~0.offset 0) (= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4))) 0)), Black: 1273#(and (<= 1 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (or (< ~n~0 (+ ~back~0 1)) (= (+ 1 (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4))) (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4)))))), Black: 1237#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 0 ~sum~0) (= ~v_assert~0 1) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1))) (<= ~sum~0 1) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (= (mod |thread2Thread1of1ForFork1_~b~0#1| 256) 0) (< ~front~0 0))), Black: 1291#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (or (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (= (mod |thread2Thread1of1ForFork1_~b~0#1| 256) 0) (< ~front~0 0))), Black: 1269#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~v_assert~0 1) (= (+ 1 (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4))) (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4)))) (= ~queue~0.offset 0)), Black: 1037#(or (< ~back~0 0) (not (= (+ (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1))), Black: 1183#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (or (< 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4)) 1)) (< ~n~0 (+ ~back~0 1)) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0) (not (= (+ 1 (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4))) 0))) (= ~v_assert~0 1) (or (not (= ~back~0 0)) (and (= ~sum~0 0) (<= ~front~0 0))) (= ~queue~0.offset 0) (or (< ~n~0 3) (< ~back~0 1)) (or (< ~back~0 0) (and (<= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4))))) (< ~n~0 (+ ~back~0 1)) (not (= (+ 1 (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4))) 0)))), 31#thread3EXITtrue, Black: 1217#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~v_assert~0 1) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (or (< ~n~0 (+ ~back~0 1)) (= (+ 1 (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4))) (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4)))))), Black: 1167#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (or (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (= (mod |thread2Thread1of1ForFork1_~b~0#1| 256) 0) (< ~front~0 0)) (= ~v_assert~0 1) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)))), Black: 1221#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~v_assert~0 1) (= ~sum~0 0) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (= (mod |thread2Thread1of1ForFork1_~b~0#1| 256) 0) (< ~front~0 0))), Black: 1349#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (or (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (= (mod |thread2Thread1of1ForFork1_~b~0#1| 256) 0) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)))), Black: 1247#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (or (< ~n~0 (+ ~back~0 1)) (and (<= ~front~0 0) (or (and (= (select (select |#memory_int#1| ~queue~0.base) 0) 1) (= (select (select |#memory_int#1| ~queue~0.base) 4) (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4)))) (not (= ~front~0 0))))) (= ~v_assert~0 1) (= ~sum~0 0) (= ~queue~0.offset 0)), Black: 1315#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~sum~0 0) (or (not (= (+ (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (and (<= 0 (+ (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)) (< ~n~0 (+ ~back~0 1)) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0)) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (= (mod |thread2Thread1of1ForFork1_~b~0#1| 256) 0) (< ~front~0 0))), Black: 1203#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (or (< ~n~0 (+ ~back~0 1)) (and (<= ~front~0 0) (or (and (= (select (select |#memory_int#1| ~queue~0.base) 0) 1) (= (select (select |#memory_int#1| ~queue~0.base) 4) (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4)))) (not (= ~front~0 0))))) (= ~v_assert~0 1) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (< ~front~0 0)) (= ~sum~0 0) (= ~queue~0.offset 0)), Black: 1293#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~v_assert~0 1) (= ~queue~0.offset 0) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (= (mod |thread2Thread1of1ForFork1_~b~0#1| 256) 0) (< ~front~0 0)) (or (< ~n~0 (+ ~back~0 1)) (= (+ 1 (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4))) (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4)))))), Black: 1393#(and (<= 1 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (= ~sum~0 0) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (= (mod |thread2Thread1of1ForFork1_~b~0#1| 256) 0) (< ~front~0 0))), Black: 1215#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~v_assert~0 1) (or (< ~n~0 (+ ~back~0 1)) (and (= ~sum~0 0) (<= ~front~0 0) (or (and (= (select (select |#memory_int#1| ~queue~0.base) 0) 1) (= (select (select |#memory_int#1| ~queue~0.base) 4) (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4)))) (not (= ~front~0 0))))) (= ~queue~0.offset 0)), Black: 1157#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~v_assert~0 1) (or (not (= (+ (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)))), Black: 834#(and (or (< ~n~0 (+ ~back~0 1)) (and (= ~sum~0 0) (<= ~front~0 0) (or (and (= (select (select |#memory_int#1| ~queue~0.base) 0) 1) (= (select (select |#memory_int#1| ~queue~0.base) 4) (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4)))) (not (= ~front~0 0))))) (= ~queue~0.offset 0)), Black: 1365#(and (or (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (= (mod |thread2Thread1of1ForFork1_~b~0#1| 256) 0) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)))), Black: 1357#(and (or (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (= (mod |thread2Thread1of1ForFork1_~b~0#1| 256) 0) (< ~front~0 0)) (<= 1 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)))), Black: 1197#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (or (< 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4)) 1)) (< ~n~0 (+ ~back~0 1)) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0) (not (= (+ 1 (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4))) 0))) (or (not (= ~back~0 0)) (and (= ~sum~0 0) (<= ~front~0 0))) (= ~queue~0.offset 0) (or (< ~n~0 3) (< ~back~0 1)) (or (< ~back~0 0) (and (<= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4))))) (< ~n~0 (+ ~back~0 1)) (not (= (+ 1 (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4))) 0)))), Black: 1339#(and (<= 1 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (= ~sum~0 0) (or (not (= (+ (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (and (<= 0 (+ (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)) (< ~n~0 (+ ~back~0 1)) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0)) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (= (mod |thread2Thread1of1ForFork1_~b~0#1| 256) 0) (< ~front~0 0))), Black: 835#(and (= ~queue~0.offset 0) (or (< ~n~0 (+ ~back~0 1)) (= (+ 1 (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4))) (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4)))))), Black: 1155#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= ~n~0 2) (= ~sum~0 1) (= (select (select |#memory_int#1| ~queue~0.base) 0) 1) (= ~v_assert~0 1) (= (+ (select (select |#memory_int#1| ~queue~0.base) 4) 1) 0) (= ~queue~0.offset 0) (not (= ~back~0 0)) (<= ~n~0 ~back~0) (= ~front~0 1)), Black: 1181#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (or (< ~n~0 (+ ~back~0 1)) (and (not (= ~front~0 0)) (<= ~front~0 0))) (or (< ~front~0 1) (not (= ~back~0 0))) (= ~v_assert~0 1) (= ~sum~0 0) (= ~queue~0.offset 0) (or (< ~n~0 3) (< ~back~0 1)) (= (+ 1 (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4))) 0) (= (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4)) 0)), Black: 1243#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (or (< ~n~0 (+ ~back~0 1)) (and (= ~sum~0 0) (<= ~front~0 0) (or (and (= (select (select |#memory_int#1| ~queue~0.base) 0) 1) (= (select (select |#memory_int#1| ~queue~0.base) 4) (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4)))) (not (= ~front~0 0))))) (= ~queue~0.offset 0)), Black: 1121#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= ~n~0 2) (= ~back~0 ~front~0) (= ~v_assert~0 1) (= ~sum~0 0) (= ~queue~0.offset 0)), Black: 1213#(and (or (< 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4)) 1)) (< ~n~0 (+ ~back~0 1)) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0) (not (= (+ 1 (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4))) 0))) (or (not (= ~back~0 0)) (and (= ~sum~0 0) (<= ~front~0 0))) (= ~queue~0.offset 0) (or (< ~n~0 3) (< ~back~0 1)) (or (< ~back~0 0) (and (<= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4))))) (< ~n~0 (+ ~back~0 1)) (not (= (+ 1 (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4))) 0)))), Black: 1263#(and (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (or (< ~n~0 (+ ~back~0 1)) (= (+ 1 (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4))) (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4)))))), Black: 1369#(and (<= 1 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (or (not (= (+ (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)))), Black: 1343#(and (<= 1 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)))), Black: 1285#(and (<= 1 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (= ~queue~0.offset 0) (or (< ~n~0 (+ ~back~0 1)) (= (+ 1 (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4))) (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4)))))), Black: 1055#(or (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (= (mod |thread2Thread1of1ForFork1_~b~0#1| 256) 0) (< ~front~0 0)), 525#true, 156#(and (<= (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 0) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|)), Black: 1233#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 0 ~sum~0) (= ~v_assert~0 1) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1))) (<= ~sum~0 1)), Black: 1249#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~v_assert~0 1) (= ~queue~0.offset 0) (or (< ~n~0 (+ ~back~0 1)) (= (+ 1 (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4))) (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4)))))), Black: 1179#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~v_assert~0 1) (<= 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)), 1797#(and (= ~v_assert~0 1) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0) (< (+ ~back~0 1) 0)) (= ~sum~0 0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 350#(or (and (<= 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)) (not (= (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ ~front~0 1)) (= (mod |thread2Thread1of1ForFork1_~b~0#1| 256) 0) (< ~front~0 0)), Black: 425#(and (= ~v_assert~0 1) (= ~sum~0 0) (<= 0 ~front~0) (= ~queue~0.offset 0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (<= ~n~0 1) (<= (+ ~front~0 1) ~n~0) (= (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4)) 1)), Black: 479#(and (<= 1 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 1)) (= ~back~0 ~front~0) (<= ~sum~0 0)))), Black: 423#(and (<= 0 ~sum~0) (= ~v_assert~0 1) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)) (not (= (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0)) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (< ~n~0 (+ ~front~0 1)) (and (= ~back~0 ~front~0) (= ~sum~0 0)) (< ~front~0 0)) (<= ~sum~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 415#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~back~0 ~front~0) (= ~v_assert~0 1) (= ~sum~0 0) (= ~queue~0.offset 0) (= |thread2Thread1of1ForFork1_~b~0#1| 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (<= ~n~0 1)), Black: 393#(and (= ~back~0 ~front~0) (= ~v_assert~0 1) (= ~sum~0 0) (= ~queue~0.offset 0) (<= ~n~0 1)), Black: 409#(and (= ~back~0 ~front~0) (= ~v_assert~0 1) (= ~sum~0 0) (= ~queue~0.offset 0) (= |thread2Thread1of1ForFork1_~b~0#1| 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (<= ~n~0 1)), Black: 437#(and (<= 0 ~sum~0) (= ~v_assert~0 1) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)) (not (= (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0)) (<= ~sum~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 463#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~v_assert~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 399#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~back~0 ~front~0) (= ~v_assert~0 1) (= ~sum~0 0) (= ~queue~0.offset 0) (<= ~n~0 1)), Black: 457#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 0 ~sum~0) (= ~v_assert~0 1) (<= ~sum~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 1))]) [2024-11-09 10:56:56,416 INFO L294 olderBase$Statistics]: this new event has 50 ancestors and is not cut-off event [2024-11-09 10:56:56,416 INFO L297 olderBase$Statistics]: existing Event has 50 ancestors and is not cut-off event [2024-11-09 10:56:56,416 INFO L297 olderBase$Statistics]: existing Event has 50 ancestors and is not cut-off event [2024-11-09 10:56:56,416 INFO L297 olderBase$Statistics]: existing Event has 50 ancestors and is not cut-off event [2024-11-09 10:56:56,770 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([436] L59-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.offset_1| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_1| 0) (= (mod |v_thread1Thread1of1ForFork0_~cond~0#1_5| 256) 0)) InVars {thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_5|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_1|, thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_5|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base][571], [Black: 427#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 0 ~sum~0) (= ~v_assert~0 1) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)) (not (= (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0)) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (< ~n~0 (+ ~front~0 1)) (and (= ~back~0 ~front~0) (= ~sum~0 0)) (< ~front~0 0)) (<= ~sum~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 487#(and (<= 1 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (or (and (<= 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)) (not (= (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ ~front~0 1)) (= (mod |thread2Thread1of1ForFork1_~b~0#1| 256) 0) (< ~front~0 0))), Black: 303#(< 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)), 824#(not (= (mod |thread2Thread1of1ForFork1_~b~0#1| 256) 0)), Black: 431#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~v_assert~0 1) (= ~sum~0 0) (<= 0 ~front~0) (= ~queue~0.offset 0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (<= ~n~0 1) (<= (+ ~front~0 1) ~n~0) (= (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4)) 1)), Black: 384#(or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 1)) (= ~back~0 ~front~0) (<= ~sum~0 0))), Black: 441#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 0 ~sum~0) (= ~v_assert~0 1) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)) (not (= (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0)) (<= ~sum~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 453#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~sum~0 1) (= ~v_assert~0 1) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0)) (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (or (and (<= (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 0) (<= 0 (+ (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1))) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0))), Black: 528#(<= ~back~0 (+ ~front~0 1)), Black: 527#(<= ~back~0 ~front~0), 45#L112-4true, 14#thread1EXITtrue, 173#true, 116#(= (select |#valid| ~queue~0.base) 1), Black: 679#(< 0 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)), Black: 817#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~v_assert~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 805#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~sum~0 1) (= ~v_assert~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 531#true, Black: 825#(and (<= (mod |thread2Thread1of1ForFork1_~b~0#1| 256) 0) (<= 0 (div |thread2Thread1of1ForFork1_~b~0#1| 256))), 1833#(and (<= 0 ~sum~0) (= ~v_assert~0 1) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0) (< (+ ~back~0 1) 0)) (<= ~sum~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 111#(<= ~back~0 ~front~0), 13#L84true, 828#true, Black: 124#(= |thread2Thread1of1ForFork1_~b~0#1| 1), Black: 137#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~v_assert~0 1)), Black: 1259#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (or (< ~n~0 (+ ~back~0 1)) (and (<= ~front~0 0) (or (and (= (select (select |#memory_int#1| ~queue~0.base) 0) 1) (= (select (select |#memory_int#1| ~queue~0.base) 4) (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4)))) (not (= ~front~0 0))))) (= ~v_assert~0 1) (= ~sum~0 0) (= ~queue~0.offset 0) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (= (mod |thread2Thread1of1ForFork1_~b~0#1| 256) 0) (< ~front~0 0))), Black: 1257#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (or (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (= (mod |thread2Thread1of1ForFork1_~b~0#1| 256) 0) (< ~front~0 0)) (= ~v_assert~0 1) (<= 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)), Black: 1295#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~v_assert~0 1) (= (+ 1 (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4))) (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4)))) (= ~queue~0.offset 0) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (= (mod |thread2Thread1of1ForFork1_~b~0#1| 256) 0) (< ~front~0 0))), Black: 1373#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (or (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (= (mod |thread2Thread1of1ForFork1_~b~0#1| 256) 0) (< ~front~0 0)) (= ~v_assert~0 1) (= ~queue~0.offset 0) (= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4))) 0)), Black: 143#(and (= ~v_assert~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 1271#(and (<= 1 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (or (< ~n~0 (+ ~back~0 1)) (and (= ~sum~0 0) (<= ~front~0 0) (or (and (= (select (select |#memory_int#1| ~queue~0.base) 0) 1) (= (select (select |#memory_int#1| ~queue~0.base) 4) (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4)))) (not (= ~front~0 0))))) (= ~queue~0.offset 0)), Black: 1030#(or (not (= (+ (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1))), Black: 1139#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~v_assert~0 1) (= ~sum~0 0) (or (not (= (+ (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (and (<= 0 (+ (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)) (< ~n~0 (+ ~back~0 1)) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0))), Black: 1309#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (= ~v_assert~0 1) (= ~sum~0 0) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (= (mod |thread2Thread1of1ForFork1_~b~0#1| 256) 0) (< ~front~0 0)) (<= (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)), Black: 1147#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~v_assert~0 1) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)))), Black: 1115#(and (<= ~n~0 2) (= ~back~0 ~front~0) (= ~v_assert~0 1) (= ~sum~0 0) (= ~queue~0.offset 0)), Black: 1347#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (or (not (= (+ (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)))), Black: 1159#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~v_assert~0 1) (= ~sum~0 0)), Black: 149#(and (<= (div |thread1Thread1of1ForFork0_~cond~0#1| 256) 0) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 1333#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (or (not (= (+ (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)) (< ~n~0 (+ ~back~0 1)) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0)) (= ~v_assert~0 1)), Black: 1187#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 0 ~sum~0) (= ~v_assert~0 1) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (< ~front~0 0)) (or (< ~n~0 (+ ~back~0 1)) (and (= ~sum~0 0) (<= ~front~0 0) (or (and (= (select (select |#memory_int#1| ~queue~0.base) 0) 1) (= (select (select |#memory_int#1| ~queue~0.base) 4) (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4)))) (not (= ~front~0 0))))) (= ~queue~0.offset 0) (<= ~sum~0 1)), Black: 1207#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (= ~v_assert~0 1) (= ~sum~0 0) (or (not (= (+ (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (and (<= 0 (+ (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)) (< ~n~0 (+ ~back~0 1)) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0)) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (= (mod |thread2Thread1of1ForFork1_~b~0#1| 256) 0) (< ~front~0 0)) (<= (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)), Black: 1177#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~v_assert~0 1)), Black: 1137#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= ~n~0 2) (<= 1 ~back~0) (= ~back~0 ~front~0) (= ~sum~0 1) (= ~v_assert~0 1) (= (select (select |#memory_int#1| ~queue~0.base) (+ (- 4) (* ~back~0 4))) 1) (= ~queue~0.offset 0) (<= ~back~0 ~n~0)), Black: 1255#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (or (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (= (mod |thread2Thread1of1ForFork1_~b~0#1| 256) 0) (< ~front~0 0)) (= ~v_assert~0 1)), Black: 1323#(and (= ~sum~0 0) (or (not (= (+ (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (and (<= 0 (+ (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)) (< ~n~0 (+ ~back~0 1)) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0)) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (= (mod |thread2Thread1of1ForFork1_~b~0#1| 256) 0) (< ~front~0 0))), Black: 1185#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (or (< ~n~0 (+ ~back~0 1)) (and (<= ~front~0 0) (or (and (= (select (select |#memory_int#1| ~queue~0.base) 0) 1) (= (select (select |#memory_int#1| ~queue~0.base) 4) (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4)))) (not (= ~front~0 0))))) (or (< ~front~0 1) (not (= ~back~0 0))) (= ~v_assert~0 1) (= ~sum~0 0) (= ~queue~0.offset 0) (or (< ~n~0 3) (< ~back~0 1)) (= (+ 1 (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4))) (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4)))), Black: 1195#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 0 ~sum~0) (= ~v_assert~0 1) (<= ~sum~0 1)), Black: 1161#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 0 ~sum~0) (= ~v_assert~0 1) (or (not (= ~back~0 0)) (and (= ~sum~0 0) (<= ~front~0 0))) (= ~queue~0.offset 0) (or (< ~n~0 3) (< ~back~0 1)) (<= ~sum~0 1) (or (< ~n~0 (+ ~back~0 1)) (= (+ 1 (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4))) (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4))))) (= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4))) 0) (or (and (= ~sum~0 0) (not (= ~front~0 0)) (<= ~front~0 0)) (< ~n~0 (+ ~back~0 1)))), Black: 1169#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (or (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (= (mod |thread2Thread1of1ForFork1_~b~0#1| 256) 0) (< ~front~0 0)) (= ~v_assert~0 1) (or (not (= (+ (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)))), Black: 1305#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)))), Black: 1239#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~v_assert~0 1) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (< ~front~0 0)) (= (+ 1 (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4))) (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4)))) (= ~queue~0.offset 0)), Black: 1371#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (or (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (= (mod |thread2Thread1of1ForFork1_~b~0#1| 256) 0) (< ~front~0 0)) (or (not (= (+ (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)) (< ~n~0 (+ ~back~0 1)) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0)) (= ~v_assert~0 1)), Black: 1277#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~queue~0.offset 0) (or (< ~n~0 (+ ~back~0 1)) (= (+ 1 (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4))) (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4)))))), Black: 1245#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (or (< ~n~0 (+ ~back~0 1)) (= (+ 1 (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4))) (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4)))))), Black: 1251#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~v_assert~0 1) (or (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0))), Black: 1189#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 0 ~sum~0) (= ~v_assert~0 1) (= ~queue~0.offset 0) (<= ~sum~0 1) (or (< ~n~0 (+ ~back~0 1)) (= (+ 1 (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4))) (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4)))))), Black: 1223#(and (or (< 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4)) 1)) (< ~n~0 (+ ~back~0 1)) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0) (not (= (+ 1 (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4))) 0))) (<= 1 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (or (not (= ~back~0 0)) (and (= ~sum~0 0) (<= ~front~0 0))) (= ~queue~0.offset 0) (or (< ~n~0 3) (< ~back~0 1)) (or (< ~back~0 0) (and (<= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4))))) (< ~n~0 (+ ~back~0 1)) (not (= (+ 1 (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4))) 0)))), Black: 1327#(and (or (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (= (mod |thread2Thread1of1ForFork1_~b~0#1| 256) 0) (< ~front~0 0)) (<= 1 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256))), Black: 168#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (= ~sum~0 0)), Black: 1163#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 0 ~sum~0) (= ~v_assert~0 1) (or (not (= ~back~0 0)) (and (= ~sum~0 0) (<= ~front~0 0))) (= ~queue~0.offset 0) (or (< ~n~0 3) (< ~back~0 1)) (<= ~sum~0 1) (or (< ~n~0 (+ ~back~0 1)) (= (+ 1 (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4))) (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4))))) (or (< ~n~0 (+ ~back~0 1)) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0) (not (= (+ 1 (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4))) 0)))), Black: 1171#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (or (< ~n~0 (+ ~back~0 1)) (and (<= ~front~0 0) (or (and (= (select (select |#memory_int#1| ~queue~0.base) 0) 1) (= (select (select |#memory_int#1| ~queue~0.base) 4) (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4)))) (not (= ~front~0 0))))) (or (< ~front~0 1) (not (= ~back~0 0))) (= ~v_assert~0 1) (= ~sum~0 0) (= ~queue~0.offset 0) (or (< ~n~0 (+ ~back~0 1)) (= (+ 1 (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4))) (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4)))) (or (< ~n~0 3) (< ~back~0 1))), Black: 1201#(and (<= 0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (= ~v_assert~0 1) (= ~sum~0 0) (or (not (= (+ (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (and (<= 0 (+ (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)) (< ~n~0 (+ ~back~0 1)) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0)) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (= (mod |thread2Thread1of1ForFork1_~b~0#1| 256) 0) (< ~front~0 0)) (<= (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)), Black: 1297#(and (<= 0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (= ~v_assert~0 1) (= ~sum~0 0) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (= (mod |thread2Thread1of1ForFork1_~b~0#1| 256) 0) (< ~front~0 0)) (<= (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)), Black: 1281#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 0 ~sum~0) (= ~v_assert~0 1) (<= ~sum~0 1) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (= (mod |thread2Thread1of1ForFork1_~b~0#1| 256) 0) (< ~front~0 0))), Black: 1151#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~v_assert~0 1) (= ~sum~0 0) (or (not (= (+ (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (and (<= 0 (+ (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)) (< ~n~0 (+ ~back~0 1)) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0)) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (= (mod |thread2Thread1of1ForFork1_~b~0#1| 256) 0) (< ~front~0 0))), Black: 1267#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~v_assert~0 1) (= ~queue~0.offset 0) (= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4))) 0)), Black: 1273#(and (<= 1 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (or (< ~n~0 (+ ~back~0 1)) (= (+ 1 (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4))) (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4)))))), Black: 1237#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 0 ~sum~0) (= ~v_assert~0 1) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1))) (<= ~sum~0 1) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (= (mod |thread2Thread1of1ForFork1_~b~0#1| 256) 0) (< ~front~0 0))), Black: 1291#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (or (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (= (mod |thread2Thread1of1ForFork1_~b~0#1| 256) 0) (< ~front~0 0))), Black: 1269#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~v_assert~0 1) (= (+ 1 (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4))) (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4)))) (= ~queue~0.offset 0)), Black: 1037#(or (< ~back~0 0) (not (= (+ (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1))), Black: 1183#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (or (< 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4)) 1)) (< ~n~0 (+ ~back~0 1)) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0) (not (= (+ 1 (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4))) 0))) (= ~v_assert~0 1) (or (not (= ~back~0 0)) (and (= ~sum~0 0) (<= ~front~0 0))) (= ~queue~0.offset 0) (or (< ~n~0 3) (< ~back~0 1)) (or (< ~back~0 0) (and (<= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4))))) (< ~n~0 (+ ~back~0 1)) (not (= (+ 1 (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4))) 0)))), 31#thread3EXITtrue, Black: 1217#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~v_assert~0 1) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (or (< ~n~0 (+ ~back~0 1)) (= (+ 1 (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4))) (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4)))))), Black: 1167#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (or (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (= (mod |thread2Thread1of1ForFork1_~b~0#1| 256) 0) (< ~front~0 0)) (= ~v_assert~0 1) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)))), Black: 1221#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~v_assert~0 1) (= ~sum~0 0) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (= (mod |thread2Thread1of1ForFork1_~b~0#1| 256) 0) (< ~front~0 0))), Black: 1349#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (or (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (= (mod |thread2Thread1of1ForFork1_~b~0#1| 256) 0) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)))), Black: 1247#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (or (< ~n~0 (+ ~back~0 1)) (and (<= ~front~0 0) (or (and (= (select (select |#memory_int#1| ~queue~0.base) 0) 1) (= (select (select |#memory_int#1| ~queue~0.base) 4) (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4)))) (not (= ~front~0 0))))) (= ~v_assert~0 1) (= ~sum~0 0) (= ~queue~0.offset 0)), Black: 1315#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~sum~0 0) (or (not (= (+ (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (and (<= 0 (+ (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)) (< ~n~0 (+ ~back~0 1)) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0)) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (= (mod |thread2Thread1of1ForFork1_~b~0#1| 256) 0) (< ~front~0 0))), Black: 1203#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (or (< ~n~0 (+ ~back~0 1)) (and (<= ~front~0 0) (or (and (= (select (select |#memory_int#1| ~queue~0.base) 0) 1) (= (select (select |#memory_int#1| ~queue~0.base) 4) (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4)))) (not (= ~front~0 0))))) (= ~v_assert~0 1) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (< ~front~0 0)) (= ~sum~0 0) (= ~queue~0.offset 0)), Black: 1293#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~v_assert~0 1) (= ~queue~0.offset 0) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (= (mod |thread2Thread1of1ForFork1_~b~0#1| 256) 0) (< ~front~0 0)) (or (< ~n~0 (+ ~back~0 1)) (= (+ 1 (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4))) (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4)))))), Black: 1393#(and (<= 1 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (= ~sum~0 0) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (= (mod |thread2Thread1of1ForFork1_~b~0#1| 256) 0) (< ~front~0 0))), Black: 1215#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~v_assert~0 1) (or (< ~n~0 (+ ~back~0 1)) (and (= ~sum~0 0) (<= ~front~0 0) (or (and (= (select (select |#memory_int#1| ~queue~0.base) 0) 1) (= (select (select |#memory_int#1| ~queue~0.base) 4) (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4)))) (not (= ~front~0 0))))) (= ~queue~0.offset 0)), Black: 1157#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~v_assert~0 1) (or (not (= (+ (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)))), Black: 834#(and (or (< ~n~0 (+ ~back~0 1)) (and (= ~sum~0 0) (<= ~front~0 0) (or (and (= (select (select |#memory_int#1| ~queue~0.base) 0) 1) (= (select (select |#memory_int#1| ~queue~0.base) 4) (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4)))) (not (= ~front~0 0))))) (= ~queue~0.offset 0)), Black: 1365#(and (or (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (= (mod |thread2Thread1of1ForFork1_~b~0#1| 256) 0) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)))), Black: 1357#(and (or (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (= (mod |thread2Thread1of1ForFork1_~b~0#1| 256) 0) (< ~front~0 0)) (<= 1 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)))), Black: 1197#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (or (< 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4)) 1)) (< ~n~0 (+ ~back~0 1)) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0) (not (= (+ 1 (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4))) 0))) (or (not (= ~back~0 0)) (and (= ~sum~0 0) (<= ~front~0 0))) (= ~queue~0.offset 0) (or (< ~n~0 3) (< ~back~0 1)) (or (< ~back~0 0) (and (<= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4))))) (< ~n~0 (+ ~back~0 1)) (not (= (+ 1 (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4))) 0)))), Black: 1339#(and (<= 1 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (= ~sum~0 0) (or (not (= (+ (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (and (<= 0 (+ (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)) (< ~n~0 (+ ~back~0 1)) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0)) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (= (mod |thread2Thread1of1ForFork1_~b~0#1| 256) 0) (< ~front~0 0))), Black: 835#(and (= ~queue~0.offset 0) (or (< ~n~0 (+ ~back~0 1)) (= (+ 1 (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4))) (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4)))))), Black: 1155#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= ~n~0 2) (= ~sum~0 1) (= (select (select |#memory_int#1| ~queue~0.base) 0) 1) (= ~v_assert~0 1) (= (+ (select (select |#memory_int#1| ~queue~0.base) 4) 1) 0) (= ~queue~0.offset 0) (not (= ~back~0 0)) (<= ~n~0 ~back~0) (= ~front~0 1)), Black: 1181#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (or (< ~n~0 (+ ~back~0 1)) (and (not (= ~front~0 0)) (<= ~front~0 0))) (or (< ~front~0 1) (not (= ~back~0 0))) (= ~v_assert~0 1) (= ~sum~0 0) (= ~queue~0.offset 0) (or (< ~n~0 3) (< ~back~0 1)) (= (+ 1 (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4))) 0) (= (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4)) 0)), Black: 1243#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (or (< ~n~0 (+ ~back~0 1)) (and (= ~sum~0 0) (<= ~front~0 0) (or (and (= (select (select |#memory_int#1| ~queue~0.base) 0) 1) (= (select (select |#memory_int#1| ~queue~0.base) 4) (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4)))) (not (= ~front~0 0))))) (= ~queue~0.offset 0)), Black: 1121#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= ~n~0 2) (= ~back~0 ~front~0) (= ~v_assert~0 1) (= ~sum~0 0) (= ~queue~0.offset 0)), Black: 1213#(and (or (< 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4)) 1)) (< ~n~0 (+ ~back~0 1)) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0) (not (= (+ 1 (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4))) 0))) (or (not (= ~back~0 0)) (and (= ~sum~0 0) (<= ~front~0 0))) (= ~queue~0.offset 0) (or (< ~n~0 3) (< ~back~0 1)) (or (< ~back~0 0) (and (<= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4))))) (< ~n~0 (+ ~back~0 1)) (not (= (+ 1 (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4))) 0)))), Black: 1263#(and (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (or (< ~n~0 (+ ~back~0 1)) (= (+ 1 (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4))) (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4)))))), Black: 1369#(and (<= 1 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (or (not (= (+ (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)))), Black: 1343#(and (<= 1 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)))), Black: 1285#(and (<= 1 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (= ~queue~0.offset 0) (or (< ~n~0 (+ ~back~0 1)) (= (+ 1 (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4))) (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4)))))), Black: 1055#(or (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (= (mod |thread2Thread1of1ForFork1_~b~0#1| 256) 0) (< ~front~0 0)), 156#(and (<= (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 0) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|)), Black: 1233#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 0 ~sum~0) (= ~v_assert~0 1) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1))) (<= ~sum~0 1)), 525#true, Black: 1249#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~v_assert~0 1) (= ~queue~0.offset 0) (or (< ~n~0 (+ ~back~0 1)) (= (+ 1 (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4))) (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4)))))), Black: 1179#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~v_assert~0 1) (<= 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)), Black: 350#(or (and (<= 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)) (not (= (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ ~front~0 1)) (= (mod |thread2Thread1of1ForFork1_~b~0#1| 256) 0) (< ~front~0 0)), Black: 425#(and (= ~v_assert~0 1) (= ~sum~0 0) (<= 0 ~front~0) (= ~queue~0.offset 0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (<= ~n~0 1) (<= (+ ~front~0 1) ~n~0) (= (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4)) 1)), Black: 479#(and (<= 1 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 1)) (= ~back~0 ~front~0) (<= ~sum~0 0)))), Black: 423#(and (<= 0 ~sum~0) (= ~v_assert~0 1) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)) (not (= (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0)) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (< ~n~0 (+ ~front~0 1)) (and (= ~back~0 ~front~0) (= ~sum~0 0)) (< ~front~0 0)) (<= ~sum~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 415#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~back~0 ~front~0) (= ~v_assert~0 1) (= ~sum~0 0) (= ~queue~0.offset 0) (= |thread2Thread1of1ForFork1_~b~0#1| 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (<= ~n~0 1)), Black: 393#(and (= ~back~0 ~front~0) (= ~v_assert~0 1) (= ~sum~0 0) (= ~queue~0.offset 0) (<= ~n~0 1)), Black: 409#(and (= ~back~0 ~front~0) (= ~v_assert~0 1) (= ~sum~0 0) (= ~queue~0.offset 0) (= |thread2Thread1of1ForFork1_~b~0#1| 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (<= ~n~0 1)), Black: 437#(and (<= 0 ~sum~0) (= ~v_assert~0 1) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)) (not (= (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0)) (<= ~sum~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 463#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~v_assert~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 399#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~back~0 ~front~0) (= ~v_assert~0 1) (= ~sum~0 0) (= ~queue~0.offset 0) (<= ~n~0 1)), Black: 457#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 0 ~sum~0) (= ~v_assert~0 1) (<= ~sum~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 1))]) [2024-11-09 10:56:56,777 INFO L294 olderBase$Statistics]: this new event has 50 ancestors and is not cut-off event [2024-11-09 10:56:56,777 INFO L297 olderBase$Statistics]: existing Event has 50 ancestors and is not cut-off event [2024-11-09 10:56:56,778 INFO L297 olderBase$Statistics]: existing Event has 50 ancestors and is not cut-off event [2024-11-09 10:56:56,778 INFO L297 olderBase$Statistics]: existing Event has 50 ancestors and is not cut-off event [2024-11-09 10:56:58,455 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([436] L59-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.offset_1| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_1| 0) (= (mod |v_thread1Thread1of1ForFork0_~cond~0#1_5| 256) 0)) InVars {thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_5|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_1|, thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_5|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base][2276], [Black: 427#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 0 ~sum~0) (= ~v_assert~0 1) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)) (not (= (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0)) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (< ~n~0 (+ ~front~0 1)) (and (= ~back~0 ~front~0) (= ~sum~0 0)) (< ~front~0 0)) (<= ~sum~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 487#(and (<= 1 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (or (and (<= 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)) (not (= (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ ~front~0 1)) (= (mod |thread2Thread1of1ForFork1_~b~0#1| 256) 0) (< ~front~0 0))), Black: 303#(< 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)), 824#(not (= (mod |thread2Thread1of1ForFork1_~b~0#1| 256) 0)), Black: 431#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~v_assert~0 1) (= ~sum~0 0) (<= 0 ~front~0) (= ~queue~0.offset 0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (<= ~n~0 1) (<= (+ ~front~0 1) ~n~0) (= (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4)) 1)), Black: 384#(or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 1)) (= ~back~0 ~front~0) (<= ~sum~0 0))), Black: 441#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 0 ~sum~0) (= ~v_assert~0 1) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)) (not (= (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0)) (<= ~sum~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 453#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~sum~0 1) (= ~v_assert~0 1) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0)) (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (or (and (<= (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 0) (<= 0 (+ (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1))) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0))), Black: 528#(<= ~back~0 (+ ~front~0 1)), Black: 527#(<= ~back~0 ~front~0), 14#thread1EXITtrue, 173#true, 116#(= (select |#valid| ~queue~0.base) 1), Black: 679#(< 0 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)), Black: 817#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~v_assert~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 805#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~sum~0 1) (= ~v_assert~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 531#true, Black: 825#(and (<= (mod |thread2Thread1of1ForFork1_~b~0#1| 256) 0) (<= 0 (div |thread2Thread1of1ForFork1_~b~0#1| 256))), Black: 111#(<= ~back~0 ~front~0), 13#L84true, 828#true, Black: 124#(= |thread2Thread1of1ForFork1_~b~0#1| 1), Black: 137#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~v_assert~0 1)), Black: 1259#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (or (< ~n~0 (+ ~back~0 1)) (and (<= ~front~0 0) (or (and (= (select (select |#memory_int#1| ~queue~0.base) 0) 1) (= (select (select |#memory_int#1| ~queue~0.base) 4) (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4)))) (not (= ~front~0 0))))) (= ~v_assert~0 1) (= ~sum~0 0) (= ~queue~0.offset 0) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (= (mod |thread2Thread1of1ForFork1_~b~0#1| 256) 0) (< ~front~0 0))), Black: 1257#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (or (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (= (mod |thread2Thread1of1ForFork1_~b~0#1| 256) 0) (< ~front~0 0)) (= ~v_assert~0 1) (<= 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)), Black: 1295#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~v_assert~0 1) (= (+ 1 (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4))) (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4)))) (= ~queue~0.offset 0) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (= (mod |thread2Thread1of1ForFork1_~b~0#1| 256) 0) (< ~front~0 0))), Black: 1373#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (or (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (= (mod |thread2Thread1of1ForFork1_~b~0#1| 256) 0) (< ~front~0 0)) (= ~v_assert~0 1) (= ~queue~0.offset 0) (= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4))) 0)), Black: 143#(and (= ~v_assert~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 1271#(and (<= 1 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (or (< ~n~0 (+ ~back~0 1)) (and (= ~sum~0 0) (<= ~front~0 0) (or (and (= (select (select |#memory_int#1| ~queue~0.base) 0) 1) (= (select (select |#memory_int#1| ~queue~0.base) 4) (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4)))) (not (= ~front~0 0))))) (= ~queue~0.offset 0)), Black: 1030#(or (not (= (+ (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1))), Black: 1139#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~v_assert~0 1) (= ~sum~0 0) (or (not (= (+ (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (and (<= 0 (+ (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)) (< ~n~0 (+ ~back~0 1)) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0))), Black: 1309#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (= ~v_assert~0 1) (= ~sum~0 0) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (= (mod |thread2Thread1of1ForFork1_~b~0#1| 256) 0) (< ~front~0 0)) (<= (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)), Black: 1147#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~v_assert~0 1) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)))), Black: 1115#(and (<= ~n~0 2) (= ~back~0 ~front~0) (= ~v_assert~0 1) (= ~sum~0 0) (= ~queue~0.offset 0)), Black: 1347#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (or (not (= (+ (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)))), Black: 1159#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~v_assert~0 1) (= ~sum~0 0)), Black: 1333#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (or (not (= (+ (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)) (< ~n~0 (+ ~back~0 1)) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0)) (= ~v_assert~0 1)), Black: 149#(and (<= (div |thread1Thread1of1ForFork0_~cond~0#1| 256) 0) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 1187#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 0 ~sum~0) (= ~v_assert~0 1) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (< ~front~0 0)) (or (< ~n~0 (+ ~back~0 1)) (and (= ~sum~0 0) (<= ~front~0 0) (or (and (= (select (select |#memory_int#1| ~queue~0.base) 0) 1) (= (select (select |#memory_int#1| ~queue~0.base) 4) (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4)))) (not (= ~front~0 0))))) (= ~queue~0.offset 0) (<= ~sum~0 1)), Black: 1207#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (= ~v_assert~0 1) (= ~sum~0 0) (or (not (= (+ (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (and (<= 0 (+ (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)) (< ~n~0 (+ ~back~0 1)) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0)) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (= (mod |thread2Thread1of1ForFork1_~b~0#1| 256) 0) (< ~front~0 0)) (<= (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)), Black: 1177#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~v_assert~0 1)), Black: 1137#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= ~n~0 2) (<= 1 ~back~0) (= ~back~0 ~front~0) (= ~sum~0 1) (= ~v_assert~0 1) (= (select (select |#memory_int#1| ~queue~0.base) (+ (- 4) (* ~back~0 4))) 1) (= ~queue~0.offset 0) (<= ~back~0 ~n~0)), Black: 1255#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (or (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (= (mod |thread2Thread1of1ForFork1_~b~0#1| 256) 0) (< ~front~0 0)) (= ~v_assert~0 1)), Black: 1323#(and (= ~sum~0 0) (or (not (= (+ (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (and (<= 0 (+ (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)) (< ~n~0 (+ ~back~0 1)) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0)) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (= (mod |thread2Thread1of1ForFork1_~b~0#1| 256) 0) (< ~front~0 0))), Black: 1185#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (or (< ~n~0 (+ ~back~0 1)) (and (<= ~front~0 0) (or (and (= (select (select |#memory_int#1| ~queue~0.base) 0) 1) (= (select (select |#memory_int#1| ~queue~0.base) 4) (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4)))) (not (= ~front~0 0))))) (or (< ~front~0 1) (not (= ~back~0 0))) (= ~v_assert~0 1) (= ~sum~0 0) (= ~queue~0.offset 0) (or (< ~n~0 3) (< ~back~0 1)) (= (+ 1 (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4))) (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4)))), Black: 1195#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 0 ~sum~0) (= ~v_assert~0 1) (<= ~sum~0 1)), Black: 1161#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 0 ~sum~0) (= ~v_assert~0 1) (or (not (= ~back~0 0)) (and (= ~sum~0 0) (<= ~front~0 0))) (= ~queue~0.offset 0) (or (< ~n~0 3) (< ~back~0 1)) (<= ~sum~0 1) (or (< ~n~0 (+ ~back~0 1)) (= (+ 1 (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4))) (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4))))) (= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4))) 0) (or (and (= ~sum~0 0) (not (= ~front~0 0)) (<= ~front~0 0)) (< ~n~0 (+ ~back~0 1)))), Black: 1169#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (or (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (= (mod |thread2Thread1of1ForFork1_~b~0#1| 256) 0) (< ~front~0 0)) (= ~v_assert~0 1) (or (not (= (+ (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)))), Black: 1305#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)))), Black: 1239#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~v_assert~0 1) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (< ~front~0 0)) (= (+ 1 (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4))) (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4)))) (= ~queue~0.offset 0)), Black: 1371#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (or (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (= (mod |thread2Thread1of1ForFork1_~b~0#1| 256) 0) (< ~front~0 0)) (or (not (= (+ (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)) (< ~n~0 (+ ~back~0 1)) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0)) (= ~v_assert~0 1)), Black: 1277#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~queue~0.offset 0) (or (< ~n~0 (+ ~back~0 1)) (= (+ 1 (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4))) (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4)))))), Black: 1245#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (or (< ~n~0 (+ ~back~0 1)) (= (+ 1 (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4))) (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4)))))), 16#L113true, Black: 1251#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~v_assert~0 1) (or (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0))), Black: 1189#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 0 ~sum~0) (= ~v_assert~0 1) (= ~queue~0.offset 0) (<= ~sum~0 1) (or (< ~n~0 (+ ~back~0 1)) (= (+ 1 (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4))) (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4)))))), Black: 1223#(and (or (< 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4)) 1)) (< ~n~0 (+ ~back~0 1)) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0) (not (= (+ 1 (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4))) 0))) (<= 1 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (or (not (= ~back~0 0)) (and (= ~sum~0 0) (<= ~front~0 0))) (= ~queue~0.offset 0) (or (< ~n~0 3) (< ~back~0 1)) (or (< ~back~0 0) (and (<= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4))))) (< ~n~0 (+ ~back~0 1)) (not (= (+ 1 (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4))) 0)))), Black: 1327#(and (or (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (= (mod |thread2Thread1of1ForFork1_~b~0#1| 256) 0) (< ~front~0 0)) (<= 1 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256))), Black: 1163#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 0 ~sum~0) (= ~v_assert~0 1) (or (not (= ~back~0 0)) (and (= ~sum~0 0) (<= ~front~0 0))) (= ~queue~0.offset 0) (or (< ~n~0 3) (< ~back~0 1)) (<= ~sum~0 1) (or (< ~n~0 (+ ~back~0 1)) (= (+ 1 (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4))) (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4))))) (or (< ~n~0 (+ ~back~0 1)) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0) (not (= (+ 1 (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4))) 0)))), Black: 168#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (= ~sum~0 0)), Black: 1171#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (or (< ~n~0 (+ ~back~0 1)) (and (<= ~front~0 0) (or (and (= (select (select |#memory_int#1| ~queue~0.base) 0) 1) (= (select (select |#memory_int#1| ~queue~0.base) 4) (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4)))) (not (= ~front~0 0))))) (or (< ~front~0 1) (not (= ~back~0 0))) (= ~v_assert~0 1) (= ~sum~0 0) (= ~queue~0.offset 0) (or (< ~n~0 (+ ~back~0 1)) (= (+ 1 (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4))) (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4)))) (or (< ~n~0 3) (< ~back~0 1))), Black: 1201#(and (<= 0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (= ~v_assert~0 1) (= ~sum~0 0) (or (not (= (+ (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (and (<= 0 (+ (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)) (< ~n~0 (+ ~back~0 1)) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0)) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (= (mod |thread2Thread1of1ForFork1_~b~0#1| 256) 0) (< ~front~0 0)) (<= (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)), Black: 1297#(and (<= 0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (= ~v_assert~0 1) (= ~sum~0 0) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (= (mod |thread2Thread1of1ForFork1_~b~0#1| 256) 0) (< ~front~0 0)) (<= (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)), Black: 1281#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 0 ~sum~0) (= ~v_assert~0 1) (<= ~sum~0 1) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (= (mod |thread2Thread1of1ForFork1_~b~0#1| 256) 0) (< ~front~0 0))), Black: 1151#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~v_assert~0 1) (= ~sum~0 0) (or (not (= (+ (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (and (<= 0 (+ (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)) (< ~n~0 (+ ~back~0 1)) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0)) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (= (mod |thread2Thread1of1ForFork1_~b~0#1| 256) 0) (< ~front~0 0))), Black: 1267#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~v_assert~0 1) (= ~queue~0.offset 0) (= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4))) 0)), Black: 1273#(and (<= 1 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (or (< ~n~0 (+ ~back~0 1)) (= (+ 1 (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4))) (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4)))))), Black: 1237#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 0 ~sum~0) (= ~v_assert~0 1) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1))) (<= ~sum~0 1) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (= (mod |thread2Thread1of1ForFork1_~b~0#1| 256) 0) (< ~front~0 0))), Black: 1291#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (or (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (= (mod |thread2Thread1of1ForFork1_~b~0#1| 256) 0) (< ~front~0 0))), Black: 1269#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~v_assert~0 1) (= (+ 1 (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4))) (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4)))) (= ~queue~0.offset 0)), Black: 1037#(or (< ~back~0 0) (not (= (+ (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1))), Black: 1183#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (or (< 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4)) 1)) (< ~n~0 (+ ~back~0 1)) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0) (not (= (+ 1 (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4))) 0))) (= ~v_assert~0 1) (or (not (= ~back~0 0)) (and (= ~sum~0 0) (<= ~front~0 0))) (= ~queue~0.offset 0) (or (< ~n~0 3) (< ~back~0 1)) (or (< ~back~0 0) (and (<= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4))))) (< ~n~0 (+ ~back~0 1)) (not (= (+ 1 (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4))) 0)))), Black: 1217#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~v_assert~0 1) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (or (< ~n~0 (+ ~back~0 1)) (= (+ 1 (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4))) (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4)))))), 31#thread3EXITtrue, Black: 1167#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (or (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (= (mod |thread2Thread1of1ForFork1_~b~0#1| 256) 0) (< ~front~0 0)) (= ~v_assert~0 1) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)))), Black: 1221#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~v_assert~0 1) (= ~sum~0 0) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (= (mod |thread2Thread1of1ForFork1_~b~0#1| 256) 0) (< ~front~0 0))), Black: 1349#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (or (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (= (mod |thread2Thread1of1ForFork1_~b~0#1| 256) 0) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)))), Black: 1247#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (or (< ~n~0 (+ ~back~0 1)) (and (<= ~front~0 0) (or (and (= (select (select |#memory_int#1| ~queue~0.base) 0) 1) (= (select (select |#memory_int#1| ~queue~0.base) 4) (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4)))) (not (= ~front~0 0))))) (= ~v_assert~0 1) (= ~sum~0 0) (= ~queue~0.offset 0)), Black: 1315#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~sum~0 0) (or (not (= (+ (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (and (<= 0 (+ (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)) (< ~n~0 (+ ~back~0 1)) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0)) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (= (mod |thread2Thread1of1ForFork1_~b~0#1| 256) 0) (< ~front~0 0))), Black: 1203#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (or (< ~n~0 (+ ~back~0 1)) (and (<= ~front~0 0) (or (and (= (select (select |#memory_int#1| ~queue~0.base) 0) 1) (= (select (select |#memory_int#1| ~queue~0.base) 4) (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4)))) (not (= ~front~0 0))))) (= ~v_assert~0 1) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (< ~front~0 0)) (= ~sum~0 0) (= ~queue~0.offset 0)), Black: 1293#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~v_assert~0 1) (= ~queue~0.offset 0) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (= (mod |thread2Thread1of1ForFork1_~b~0#1| 256) 0) (< ~front~0 0)) (or (< ~n~0 (+ ~back~0 1)) (= (+ 1 (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4))) (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4)))))), Black: 1393#(and (<= 1 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (= ~sum~0 0) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (= (mod |thread2Thread1of1ForFork1_~b~0#1| 256) 0) (< ~front~0 0))), Black: 1215#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~v_assert~0 1) (or (< ~n~0 (+ ~back~0 1)) (and (= ~sum~0 0) (<= ~front~0 0) (or (and (= (select (select |#memory_int#1| ~queue~0.base) 0) 1) (= (select (select |#memory_int#1| ~queue~0.base) 4) (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4)))) (not (= ~front~0 0))))) (= ~queue~0.offset 0)), Black: 1157#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~v_assert~0 1) (or (not (= (+ (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)))), Black: 834#(and (or (< ~n~0 (+ ~back~0 1)) (and (= ~sum~0 0) (<= ~front~0 0) (or (and (= (select (select |#memory_int#1| ~queue~0.base) 0) 1) (= (select (select |#memory_int#1| ~queue~0.base) 4) (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4)))) (not (= ~front~0 0))))) (= ~queue~0.offset 0)), Black: 1365#(and (or (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (= (mod |thread2Thread1of1ForFork1_~b~0#1| 256) 0) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)))), Black: 1357#(and (or (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (= (mod |thread2Thread1of1ForFork1_~b~0#1| 256) 0) (< ~front~0 0)) (<= 1 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)))), Black: 1197#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (or (< 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4)) 1)) (< ~n~0 (+ ~back~0 1)) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0) (not (= (+ 1 (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4))) 0))) (or (not (= ~back~0 0)) (and (= ~sum~0 0) (<= ~front~0 0))) (= ~queue~0.offset 0) (or (< ~n~0 3) (< ~back~0 1)) (or (< ~back~0 0) (and (<= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4))))) (< ~n~0 (+ ~back~0 1)) (not (= (+ 1 (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4))) 0)))), Black: 1339#(and (<= 1 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (= ~sum~0 0) (or (not (= (+ (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (and (<= 0 (+ (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)) (< ~n~0 (+ ~back~0 1)) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0)) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (= (mod |thread2Thread1of1ForFork1_~b~0#1| 256) 0) (< ~front~0 0))), Black: 835#(and (= ~queue~0.offset 0) (or (< ~n~0 (+ ~back~0 1)) (= (+ 1 (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4))) (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4)))))), Black: 1155#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= ~n~0 2) (= ~sum~0 1) (= (select (select |#memory_int#1| ~queue~0.base) 0) 1) (= ~v_assert~0 1) (= (+ (select (select |#memory_int#1| ~queue~0.base) 4) 1) 0) (= ~queue~0.offset 0) (not (= ~back~0 0)) (<= ~n~0 ~back~0) (= ~front~0 1)), Black: 1181#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (or (< ~n~0 (+ ~back~0 1)) (and (not (= ~front~0 0)) (<= ~front~0 0))) (or (< ~front~0 1) (not (= ~back~0 0))) (= ~v_assert~0 1) (= ~sum~0 0) (= ~queue~0.offset 0) (or (< ~n~0 3) (< ~back~0 1)) (= (+ 1 (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4))) 0) (= (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4)) 0)), Black: 1243#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (or (< ~n~0 (+ ~back~0 1)) (and (= ~sum~0 0) (<= ~front~0 0) (or (and (= (select (select |#memory_int#1| ~queue~0.base) 0) 1) (= (select (select |#memory_int#1| ~queue~0.base) 4) (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4)))) (not (= ~front~0 0))))) (= ~queue~0.offset 0)), Black: 1121#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= ~n~0 2) (= ~back~0 ~front~0) (= ~v_assert~0 1) (= ~sum~0 0) (= ~queue~0.offset 0)), Black: 1213#(and (or (< 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4)) 1)) (< ~n~0 (+ ~back~0 1)) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0) (not (= (+ 1 (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4))) 0))) (or (not (= ~back~0 0)) (and (= ~sum~0 0) (<= ~front~0 0))) (= ~queue~0.offset 0) (or (< ~n~0 3) (< ~back~0 1)) (or (< ~back~0 0) (and (<= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4))))) (< ~n~0 (+ ~back~0 1)) (not (= (+ 1 (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4))) 0)))), Black: 1263#(and (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (or (< ~n~0 (+ ~back~0 1)) (= (+ 1 (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4))) (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4)))))), Black: 1369#(and (<= 1 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (or (not (= (+ (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)))), Black: 1343#(and (<= 1 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)))), Black: 1285#(and (<= 1 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (= ~queue~0.offset 0) (or (< ~n~0 (+ ~back~0 1)) (= (+ 1 (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4))) (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4)))))), Black: 1055#(or (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (= (mod |thread2Thread1of1ForFork1_~b~0#1| 256) 0) (< ~front~0 0)), 525#true, 156#(and (<= (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 0) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|)), Black: 1233#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 0 ~sum~0) (= ~v_assert~0 1) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1))) (<= ~sum~0 1)), Black: 1249#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~v_assert~0 1) (= ~queue~0.offset 0) (or (< ~n~0 (+ ~back~0 1)) (= (+ 1 (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4))) (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4)))))), Black: 1179#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~v_assert~0 1) (<= 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)), 1797#(and (= ~v_assert~0 1) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0) (< (+ ~back~0 1) 0)) (= ~sum~0 0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 350#(or (and (<= 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)) (not (= (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ ~front~0 1)) (= (mod |thread2Thread1of1ForFork1_~b~0#1| 256) 0) (< ~front~0 0)), Black: 425#(and (= ~v_assert~0 1) (= ~sum~0 0) (<= 0 ~front~0) (= ~queue~0.offset 0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (<= ~n~0 1) (<= (+ ~front~0 1) ~n~0) (= (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4)) 1)), Black: 479#(and (<= 1 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 1)) (= ~back~0 ~front~0) (<= ~sum~0 0)))), Black: 423#(and (<= 0 ~sum~0) (= ~v_assert~0 1) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)) (not (= (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0)) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (< ~n~0 (+ ~front~0 1)) (and (= ~back~0 ~front~0) (= ~sum~0 0)) (< ~front~0 0)) (<= ~sum~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 415#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~back~0 ~front~0) (= ~v_assert~0 1) (= ~sum~0 0) (= ~queue~0.offset 0) (= |thread2Thread1of1ForFork1_~b~0#1| 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (<= ~n~0 1)), Black: 393#(and (= ~back~0 ~front~0) (= ~v_assert~0 1) (= ~sum~0 0) (= ~queue~0.offset 0) (<= ~n~0 1)), Black: 409#(and (= ~back~0 ~front~0) (= ~v_assert~0 1) (= ~sum~0 0) (= ~queue~0.offset 0) (= |thread2Thread1of1ForFork1_~b~0#1| 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (<= ~n~0 1)), Black: 437#(and (<= 0 ~sum~0) (= ~v_assert~0 1) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)) (not (= (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0)) (<= ~sum~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 463#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~v_assert~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 399#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~back~0 ~front~0) (= ~v_assert~0 1) (= ~sum~0 0) (= ~queue~0.offset 0) (<= ~n~0 1)), Black: 457#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 0 ~sum~0) (= ~v_assert~0 1) (<= ~sum~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 1))]) [2024-11-09 10:56:58,455 INFO L294 olderBase$Statistics]: this new event has 51 ancestors and is not cut-off event [2024-11-09 10:56:58,455 INFO L297 olderBase$Statistics]: existing Event has 51 ancestors and is not cut-off event [2024-11-09 10:56:58,456 INFO L297 olderBase$Statistics]: existing Event has 51 ancestors and is not cut-off event [2024-11-09 10:56:58,456 INFO L297 olderBase$Statistics]: existing Event has 51 ancestors and is not cut-off event [2024-11-09 10:56:58,465 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([436] L59-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.offset_1| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_1| 0) (= (mod |v_thread1Thread1of1ForFork0_~cond~0#1_5| 256) 0)) InVars {thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_5|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_1|, thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_5|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base][571], [Black: 427#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 0 ~sum~0) (= ~v_assert~0 1) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)) (not (= (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0)) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (< ~n~0 (+ ~front~0 1)) (and (= ~back~0 ~front~0) (= ~sum~0 0)) (< ~front~0 0)) (<= ~sum~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 487#(and (<= 1 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (or (and (<= 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)) (not (= (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ ~front~0 1)) (= (mod |thread2Thread1of1ForFork1_~b~0#1| 256) 0) (< ~front~0 0))), Black: 303#(< 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)), 824#(not (= (mod |thread2Thread1of1ForFork1_~b~0#1| 256) 0)), Black: 431#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~v_assert~0 1) (= ~sum~0 0) (<= 0 ~front~0) (= ~queue~0.offset 0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (<= ~n~0 1) (<= (+ ~front~0 1) ~n~0) (= (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4)) 1)), Black: 384#(or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 1)) (= ~back~0 ~front~0) (<= ~sum~0 0))), Black: 441#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 0 ~sum~0) (= ~v_assert~0 1) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)) (not (= (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0)) (<= ~sum~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 453#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~sum~0 1) (= ~v_assert~0 1) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0)) (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (or (and (<= (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 0) (<= 0 (+ (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1))) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0))), Black: 528#(<= ~back~0 (+ ~front~0 1)), Black: 527#(<= ~back~0 ~front~0), 14#thread1EXITtrue, 173#true, 116#(= (select |#valid| ~queue~0.base) 1), Black: 679#(< 0 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)), Black: 817#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~v_assert~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 805#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~sum~0 1) (= ~v_assert~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 531#true, Black: 825#(and (<= (mod |thread2Thread1of1ForFork1_~b~0#1| 256) 0) (<= 0 (div |thread2Thread1of1ForFork1_~b~0#1| 256))), 1833#(and (<= 0 ~sum~0) (= ~v_assert~0 1) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0) (< (+ ~back~0 1) 0)) (<= ~sum~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 111#(<= ~back~0 ~front~0), 13#L84true, 828#true, Black: 124#(= |thread2Thread1of1ForFork1_~b~0#1| 1), Black: 137#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~v_assert~0 1)), Black: 1259#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (or (< ~n~0 (+ ~back~0 1)) (and (<= ~front~0 0) (or (and (= (select (select |#memory_int#1| ~queue~0.base) 0) 1) (= (select (select |#memory_int#1| ~queue~0.base) 4) (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4)))) (not (= ~front~0 0))))) (= ~v_assert~0 1) (= ~sum~0 0) (= ~queue~0.offset 0) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (= (mod |thread2Thread1of1ForFork1_~b~0#1| 256) 0) (< ~front~0 0))), Black: 1257#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (or (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (= (mod |thread2Thread1of1ForFork1_~b~0#1| 256) 0) (< ~front~0 0)) (= ~v_assert~0 1) (<= 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)), Black: 1295#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~v_assert~0 1) (= (+ 1 (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4))) (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4)))) (= ~queue~0.offset 0) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (= (mod |thread2Thread1of1ForFork1_~b~0#1| 256) 0) (< ~front~0 0))), Black: 1373#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (or (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (= (mod |thread2Thread1of1ForFork1_~b~0#1| 256) 0) (< ~front~0 0)) (= ~v_assert~0 1) (= ~queue~0.offset 0) (= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4))) 0)), Black: 143#(and (= ~v_assert~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 1271#(and (<= 1 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (or (< ~n~0 (+ ~back~0 1)) (and (= ~sum~0 0) (<= ~front~0 0) (or (and (= (select (select |#memory_int#1| ~queue~0.base) 0) 1) (= (select (select |#memory_int#1| ~queue~0.base) 4) (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4)))) (not (= ~front~0 0))))) (= ~queue~0.offset 0)), Black: 1030#(or (not (= (+ (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1))), Black: 1139#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~v_assert~0 1) (= ~sum~0 0) (or (not (= (+ (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (and (<= 0 (+ (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)) (< ~n~0 (+ ~back~0 1)) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0))), Black: 1309#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (= ~v_assert~0 1) (= ~sum~0 0) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (= (mod |thread2Thread1of1ForFork1_~b~0#1| 256) 0) (< ~front~0 0)) (<= (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)), Black: 1147#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~v_assert~0 1) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)))), Black: 1115#(and (<= ~n~0 2) (= ~back~0 ~front~0) (= ~v_assert~0 1) (= ~sum~0 0) (= ~queue~0.offset 0)), Black: 1347#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (or (not (= (+ (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)))), Black: 1159#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~v_assert~0 1) (= ~sum~0 0)), Black: 149#(and (<= (div |thread1Thread1of1ForFork0_~cond~0#1| 256) 0) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 1333#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (or (not (= (+ (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)) (< ~n~0 (+ ~back~0 1)) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0)) (= ~v_assert~0 1)), Black: 1187#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 0 ~sum~0) (= ~v_assert~0 1) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (< ~front~0 0)) (or (< ~n~0 (+ ~back~0 1)) (and (= ~sum~0 0) (<= ~front~0 0) (or (and (= (select (select |#memory_int#1| ~queue~0.base) 0) 1) (= (select (select |#memory_int#1| ~queue~0.base) 4) (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4)))) (not (= ~front~0 0))))) (= ~queue~0.offset 0) (<= ~sum~0 1)), Black: 1207#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (= ~v_assert~0 1) (= ~sum~0 0) (or (not (= (+ (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (and (<= 0 (+ (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)) (< ~n~0 (+ ~back~0 1)) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0)) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (= (mod |thread2Thread1of1ForFork1_~b~0#1| 256) 0) (< ~front~0 0)) (<= (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)), Black: 1177#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~v_assert~0 1)), Black: 1137#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= ~n~0 2) (<= 1 ~back~0) (= ~back~0 ~front~0) (= ~sum~0 1) (= ~v_assert~0 1) (= (select (select |#memory_int#1| ~queue~0.base) (+ (- 4) (* ~back~0 4))) 1) (= ~queue~0.offset 0) (<= ~back~0 ~n~0)), Black: 1255#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (or (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (= (mod |thread2Thread1of1ForFork1_~b~0#1| 256) 0) (< ~front~0 0)) (= ~v_assert~0 1)), Black: 1323#(and (= ~sum~0 0) (or (not (= (+ (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (and (<= 0 (+ (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)) (< ~n~0 (+ ~back~0 1)) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0)) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (= (mod |thread2Thread1of1ForFork1_~b~0#1| 256) 0) (< ~front~0 0))), Black: 1185#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (or (< ~n~0 (+ ~back~0 1)) (and (<= ~front~0 0) (or (and (= (select (select |#memory_int#1| ~queue~0.base) 0) 1) (= (select (select |#memory_int#1| ~queue~0.base) 4) (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4)))) (not (= ~front~0 0))))) (or (< ~front~0 1) (not (= ~back~0 0))) (= ~v_assert~0 1) (= ~sum~0 0) (= ~queue~0.offset 0) (or (< ~n~0 3) (< ~back~0 1)) (= (+ 1 (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4))) (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4)))), Black: 1195#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 0 ~sum~0) (= ~v_assert~0 1) (<= ~sum~0 1)), Black: 1161#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 0 ~sum~0) (= ~v_assert~0 1) (or (not (= ~back~0 0)) (and (= ~sum~0 0) (<= ~front~0 0))) (= ~queue~0.offset 0) (or (< ~n~0 3) (< ~back~0 1)) (<= ~sum~0 1) (or (< ~n~0 (+ ~back~0 1)) (= (+ 1 (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4))) (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4))))) (= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4))) 0) (or (and (= ~sum~0 0) (not (= ~front~0 0)) (<= ~front~0 0)) (< ~n~0 (+ ~back~0 1)))), Black: 1169#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (or (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (= (mod |thread2Thread1of1ForFork1_~b~0#1| 256) 0) (< ~front~0 0)) (= ~v_assert~0 1) (or (not (= (+ (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)))), Black: 1305#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)))), Black: 1239#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~v_assert~0 1) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (< ~front~0 0)) (= (+ 1 (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4))) (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4)))) (= ~queue~0.offset 0)), Black: 1371#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (or (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (= (mod |thread2Thread1of1ForFork1_~b~0#1| 256) 0) (< ~front~0 0)) (or (not (= (+ (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)) (< ~n~0 (+ ~back~0 1)) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0)) (= ~v_assert~0 1)), Black: 1277#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~queue~0.offset 0) (or (< ~n~0 (+ ~back~0 1)) (= (+ 1 (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4))) (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4)))))), Black: 1245#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (or (< ~n~0 (+ ~back~0 1)) (= (+ 1 (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4))) (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4)))))), 16#L113true, Black: 1251#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~v_assert~0 1) (or (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0))), Black: 1189#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 0 ~sum~0) (= ~v_assert~0 1) (= ~queue~0.offset 0) (<= ~sum~0 1) (or (< ~n~0 (+ ~back~0 1)) (= (+ 1 (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4))) (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4)))))), Black: 1223#(and (or (< 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4)) 1)) (< ~n~0 (+ ~back~0 1)) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0) (not (= (+ 1 (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4))) 0))) (<= 1 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (or (not (= ~back~0 0)) (and (= ~sum~0 0) (<= ~front~0 0))) (= ~queue~0.offset 0) (or (< ~n~0 3) (< ~back~0 1)) (or (< ~back~0 0) (and (<= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4))))) (< ~n~0 (+ ~back~0 1)) (not (= (+ 1 (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4))) 0)))), Black: 1327#(and (or (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (= (mod |thread2Thread1of1ForFork1_~b~0#1| 256) 0) (< ~front~0 0)) (<= 1 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256))), Black: 168#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (= ~sum~0 0)), Black: 1163#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 0 ~sum~0) (= ~v_assert~0 1) (or (not (= ~back~0 0)) (and (= ~sum~0 0) (<= ~front~0 0))) (= ~queue~0.offset 0) (or (< ~n~0 3) (< ~back~0 1)) (<= ~sum~0 1) (or (< ~n~0 (+ ~back~0 1)) (= (+ 1 (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4))) (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4))))) (or (< ~n~0 (+ ~back~0 1)) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0) (not (= (+ 1 (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4))) 0)))), Black: 1171#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (or (< ~n~0 (+ ~back~0 1)) (and (<= ~front~0 0) (or (and (= (select (select |#memory_int#1| ~queue~0.base) 0) 1) (= (select (select |#memory_int#1| ~queue~0.base) 4) (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4)))) (not (= ~front~0 0))))) (or (< ~front~0 1) (not (= ~back~0 0))) (= ~v_assert~0 1) (= ~sum~0 0) (= ~queue~0.offset 0) (or (< ~n~0 (+ ~back~0 1)) (= (+ 1 (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4))) (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4)))) (or (< ~n~0 3) (< ~back~0 1))), Black: 1201#(and (<= 0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (= ~v_assert~0 1) (= ~sum~0 0) (or (not (= (+ (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (and (<= 0 (+ (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)) (< ~n~0 (+ ~back~0 1)) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0)) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (= (mod |thread2Thread1of1ForFork1_~b~0#1| 256) 0) (< ~front~0 0)) (<= (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)), Black: 1297#(and (<= 0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (= ~v_assert~0 1) (= ~sum~0 0) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (= (mod |thread2Thread1of1ForFork1_~b~0#1| 256) 0) (< ~front~0 0)) (<= (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)), Black: 1281#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 0 ~sum~0) (= ~v_assert~0 1) (<= ~sum~0 1) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (= (mod |thread2Thread1of1ForFork1_~b~0#1| 256) 0) (< ~front~0 0))), Black: 1151#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~v_assert~0 1) (= ~sum~0 0) (or (not (= (+ (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (and (<= 0 (+ (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)) (< ~n~0 (+ ~back~0 1)) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0)) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (= (mod |thread2Thread1of1ForFork1_~b~0#1| 256) 0) (< ~front~0 0))), Black: 1267#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~v_assert~0 1) (= ~queue~0.offset 0) (= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4))) 0)), Black: 1273#(and (<= 1 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (or (< ~n~0 (+ ~back~0 1)) (= (+ 1 (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4))) (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4)))))), Black: 1237#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 0 ~sum~0) (= ~v_assert~0 1) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1))) (<= ~sum~0 1) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (= (mod |thread2Thread1of1ForFork1_~b~0#1| 256) 0) (< ~front~0 0))), Black: 1291#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (or (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (= (mod |thread2Thread1of1ForFork1_~b~0#1| 256) 0) (< ~front~0 0))), Black: 1269#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~v_assert~0 1) (= (+ 1 (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4))) (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4)))) (= ~queue~0.offset 0)), Black: 1037#(or (< ~back~0 0) (not (= (+ (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1))), Black: 1183#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (or (< 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4)) 1)) (< ~n~0 (+ ~back~0 1)) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0) (not (= (+ 1 (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4))) 0))) (= ~v_assert~0 1) (or (not (= ~back~0 0)) (and (= ~sum~0 0) (<= ~front~0 0))) (= ~queue~0.offset 0) (or (< ~n~0 3) (< ~back~0 1)) (or (< ~back~0 0) (and (<= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4))))) (< ~n~0 (+ ~back~0 1)) (not (= (+ 1 (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4))) 0)))), Black: 1217#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~v_assert~0 1) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (or (< ~n~0 (+ ~back~0 1)) (= (+ 1 (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4))) (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4)))))), 31#thread3EXITtrue, Black: 1167#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (or (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (= (mod |thread2Thread1of1ForFork1_~b~0#1| 256) 0) (< ~front~0 0)) (= ~v_assert~0 1) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)))), Black: 1221#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~v_assert~0 1) (= ~sum~0 0) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (= (mod |thread2Thread1of1ForFork1_~b~0#1| 256) 0) (< ~front~0 0))), Black: 1349#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (or (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (= (mod |thread2Thread1of1ForFork1_~b~0#1| 256) 0) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)))), Black: 1247#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (or (< ~n~0 (+ ~back~0 1)) (and (<= ~front~0 0) (or (and (= (select (select |#memory_int#1| ~queue~0.base) 0) 1) (= (select (select |#memory_int#1| ~queue~0.base) 4) (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4)))) (not (= ~front~0 0))))) (= ~v_assert~0 1) (= ~sum~0 0) (= ~queue~0.offset 0)), Black: 1315#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~sum~0 0) (or (not (= (+ (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (and (<= 0 (+ (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)) (< ~n~0 (+ ~back~0 1)) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0)) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (= (mod |thread2Thread1of1ForFork1_~b~0#1| 256) 0) (< ~front~0 0))), Black: 1203#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (or (< ~n~0 (+ ~back~0 1)) (and (<= ~front~0 0) (or (and (= (select (select |#memory_int#1| ~queue~0.base) 0) 1) (= (select (select |#memory_int#1| ~queue~0.base) 4) (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4)))) (not (= ~front~0 0))))) (= ~v_assert~0 1) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (< ~front~0 0)) (= ~sum~0 0) (= ~queue~0.offset 0)), Black: 1293#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~v_assert~0 1) (= ~queue~0.offset 0) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (= (mod |thread2Thread1of1ForFork1_~b~0#1| 256) 0) (< ~front~0 0)) (or (< ~n~0 (+ ~back~0 1)) (= (+ 1 (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4))) (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4)))))), Black: 1393#(and (<= 1 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (= ~sum~0 0) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (= (mod |thread2Thread1of1ForFork1_~b~0#1| 256) 0) (< ~front~0 0))), Black: 1215#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~v_assert~0 1) (or (< ~n~0 (+ ~back~0 1)) (and (= ~sum~0 0) (<= ~front~0 0) (or (and (= (select (select |#memory_int#1| ~queue~0.base) 0) 1) (= (select (select |#memory_int#1| ~queue~0.base) 4) (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4)))) (not (= ~front~0 0))))) (= ~queue~0.offset 0)), Black: 1157#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~v_assert~0 1) (or (not (= (+ (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)))), Black: 834#(and (or (< ~n~0 (+ ~back~0 1)) (and (= ~sum~0 0) (<= ~front~0 0) (or (and (= (select (select |#memory_int#1| ~queue~0.base) 0) 1) (= (select (select |#memory_int#1| ~queue~0.base) 4) (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4)))) (not (= ~front~0 0))))) (= ~queue~0.offset 0)), Black: 1365#(and (or (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (= (mod |thread2Thread1of1ForFork1_~b~0#1| 256) 0) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)))), Black: 1357#(and (or (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (= (mod |thread2Thread1of1ForFork1_~b~0#1| 256) 0) (< ~front~0 0)) (<= 1 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)))), Black: 1197#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (or (< 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4)) 1)) (< ~n~0 (+ ~back~0 1)) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0) (not (= (+ 1 (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4))) 0))) (or (not (= ~back~0 0)) (and (= ~sum~0 0) (<= ~front~0 0))) (= ~queue~0.offset 0) (or (< ~n~0 3) (< ~back~0 1)) (or (< ~back~0 0) (and (<= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4))))) (< ~n~0 (+ ~back~0 1)) (not (= (+ 1 (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4))) 0)))), Black: 1339#(and (<= 1 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (= ~sum~0 0) (or (not (= (+ (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (and (<= 0 (+ (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)) (< ~n~0 (+ ~back~0 1)) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0)) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (= (mod |thread2Thread1of1ForFork1_~b~0#1| 256) 0) (< ~front~0 0))), Black: 835#(and (= ~queue~0.offset 0) (or (< ~n~0 (+ ~back~0 1)) (= (+ 1 (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4))) (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4)))))), Black: 1155#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= ~n~0 2) (= ~sum~0 1) (= (select (select |#memory_int#1| ~queue~0.base) 0) 1) (= ~v_assert~0 1) (= (+ (select (select |#memory_int#1| ~queue~0.base) 4) 1) 0) (= ~queue~0.offset 0) (not (= ~back~0 0)) (<= ~n~0 ~back~0) (= ~front~0 1)), Black: 1181#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (or (< ~n~0 (+ ~back~0 1)) (and (not (= ~front~0 0)) (<= ~front~0 0))) (or (< ~front~0 1) (not (= ~back~0 0))) (= ~v_assert~0 1) (= ~sum~0 0) (= ~queue~0.offset 0) (or (< ~n~0 3) (< ~back~0 1)) (= (+ 1 (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4))) 0) (= (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4)) 0)), Black: 1243#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (or (< ~n~0 (+ ~back~0 1)) (and (= ~sum~0 0) (<= ~front~0 0) (or (and (= (select (select |#memory_int#1| ~queue~0.base) 0) 1) (= (select (select |#memory_int#1| ~queue~0.base) 4) (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4)))) (not (= ~front~0 0))))) (= ~queue~0.offset 0)), Black: 1121#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= ~n~0 2) (= ~back~0 ~front~0) (= ~v_assert~0 1) (= ~sum~0 0) (= ~queue~0.offset 0)), Black: 1213#(and (or (< 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4)) 1)) (< ~n~0 (+ ~back~0 1)) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0) (not (= (+ 1 (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4))) 0))) (or (not (= ~back~0 0)) (and (= ~sum~0 0) (<= ~front~0 0))) (= ~queue~0.offset 0) (or (< ~n~0 3) (< ~back~0 1)) (or (< ~back~0 0) (and (<= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4))))) (< ~n~0 (+ ~back~0 1)) (not (= (+ 1 (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4))) 0)))), Black: 1263#(and (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (or (< ~n~0 (+ ~back~0 1)) (= (+ 1 (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4))) (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4)))))), Black: 1369#(and (<= 1 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (or (not (= (+ (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)))), Black: 1343#(and (<= 1 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)))), Black: 1285#(and (<= 1 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (= ~queue~0.offset 0) (or (< ~n~0 (+ ~back~0 1)) (= (+ 1 (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4))) (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4)))))), Black: 1055#(or (< ~n~0 (+ ~back~0 2)) (< ~back~0 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (= (mod |thread2Thread1of1ForFork1_~b~0#1| 256) 0) (< ~front~0 0)), 525#true, 156#(and (<= (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 0) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|)), Black: 1233#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 0 ~sum~0) (= ~v_assert~0 1) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1))) (<= ~sum~0 1)), Black: 1249#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~v_assert~0 1) (= ~queue~0.offset 0) (or (< ~n~0 (+ ~back~0 1)) (= (+ 1 (select (select |#memory_int#1| ~queue~0.base) (* ~back~0 4))) (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4)))))), Black: 1179#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~v_assert~0 1) (<= 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)), Black: 350#(or (and (<= 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)) (not (= (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ ~front~0 1)) (= (mod |thread2Thread1of1ForFork1_~b~0#1| 256) 0) (< ~front~0 0)), Black: 425#(and (= ~v_assert~0 1) (= ~sum~0 0) (<= 0 ~front~0) (= ~queue~0.offset 0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (<= ~n~0 1) (<= (+ ~front~0 1) ~n~0) (= (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4)) 1)), Black: 479#(and (<= 1 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 1)) (= ~back~0 ~front~0) (<= ~sum~0 0)))), Black: 423#(and (<= 0 ~sum~0) (= ~v_assert~0 1) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)) (not (= (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0)) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (< ~n~0 (+ ~front~0 1)) (and (= ~back~0 ~front~0) (= ~sum~0 0)) (< ~front~0 0)) (<= ~sum~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 415#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~back~0 ~front~0) (= ~v_assert~0 1) (= ~sum~0 0) (= ~queue~0.offset 0) (= |thread2Thread1of1ForFork1_~b~0#1| 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (<= ~n~0 1)), Black: 393#(and (= ~back~0 ~front~0) (= ~v_assert~0 1) (= ~sum~0 0) (= ~queue~0.offset 0) (<= ~n~0 1)), Black: 409#(and (= ~back~0 ~front~0) (= ~v_assert~0 1) (= ~sum~0 0) (= ~queue~0.offset 0) (= |thread2Thread1of1ForFork1_~b~0#1| 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (<= ~n~0 1)), Black: 437#(and (<= 0 ~sum~0) (= ~v_assert~0 1) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)) (not (= (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0)) (<= ~sum~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 463#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~v_assert~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 399#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~back~0 ~front~0) (= ~v_assert~0 1) (= ~sum~0 0) (= ~queue~0.offset 0) (<= ~n~0 1)), Black: 457#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 0 ~sum~0) (= ~v_assert~0 1) (<= ~sum~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 1))]) [2024-11-09 10:56:58,465 INFO L294 olderBase$Statistics]: this new event has 51 ancestors and is not cut-off event [2024-11-09 10:56:58,465 INFO L297 olderBase$Statistics]: existing Event has 51 ancestors and is not cut-off event [2024-11-09 10:56:58,465 INFO L297 olderBase$Statistics]: existing Event has 51 ancestors and is not cut-off event [2024-11-09 10:56:58,465 INFO L297 olderBase$Statistics]: existing Event has 51 ancestors and is not cut-off event