./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-queue-add-3.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc 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/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-queue-add-3.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d2c89f010e0f73e8ba7e81bb150b82b70d39c0827c0d616dd2c3347839d51e01 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 01:53:58,211 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 01:53:58,282 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 01:53:58,289 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 01:53:58,289 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 01:53:58,317 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 01:53:58,318 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 01:53:58,319 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 01:53:58,320 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 01:53:58,321 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 01:53:58,322 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 01:53:58,322 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 01:53:58,323 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 01:53:58,325 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 01:53:58,325 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 01:53:58,325 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 01:53:58,326 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 01:53:58,326 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 01:53:58,326 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 01:53:58,329 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 01:53:58,329 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 01:53:58,330 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 01:53:58,330 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 01:53:58,330 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 01:53:58,331 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 01:53:58,331 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 01:53:58,331 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 01:53:58,331 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 01:53:58,332 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 01:53:58,332 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 01:53:58,332 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 01:53:58,332 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 01:53:58,333 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 01:53:58,333 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 01:53:58,333 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 01:53:58,333 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 01:53:58,334 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 01:53:58,334 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 01:53:58,334 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 01:53:58,334 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 01:53:58,335 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 01:53:58,335 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 01:53:58,336 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d2c89f010e0f73e8ba7e81bb150b82b70d39c0827c0d616dd2c3347839d51e01 [2024-11-19 01:53:58,609 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 01:53:58,636 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 01:53:58,639 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 01:53:58,640 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 01:53:58,640 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 01:53:58,641 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-queue-add-3.wvr.c [2024-11-19 01:54:00,124 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 01:54:00,318 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 01:54:00,319 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-queue-add-3.wvr.c [2024-11-19 01:54:00,328 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/522c4303a/1db8f8ac15e6473ea6a0588eae30516a/FLAGe6ea3f510 [2024-11-19 01:54:00,708 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/522c4303a/1db8f8ac15e6473ea6a0588eae30516a [2024-11-19 01:54:00,711 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 01:54:00,712 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 01:54:00,713 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 01:54:00,714 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 01:54:00,719 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 01:54:00,720 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:54:00" (1/1) ... [2024-11-19 01:54:00,721 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@434a61ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:54:00, skipping insertion in model container [2024-11-19 01:54:00,721 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:54:00" (1/1) ... [2024-11-19 01:54:00,748 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 01:54:01,017 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-queue-add-3.wvr.c[3451,3464] [2024-11-19 01:54:01,025 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 01:54:01,034 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 01:54:01,062 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-queue-add-3.wvr.c[3451,3464] [2024-11-19 01:54:01,065 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 01:54:01,083 INFO L204 MainTranslator]: Completed translation [2024-11-19 01:54:01,084 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:54:01 WrapperNode [2024-11-19 01:54:01,086 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 01:54:01,087 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 01:54:01,087 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 01:54:01,087 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 01:54:01,094 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:54:01" (1/1) ... [2024-11-19 01:54:01,101 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:54:01" (1/1) ... [2024-11-19 01:54:01,127 INFO L138 Inliner]: procedures = 24, calls = 40, calls flagged for inlining = 16, calls inlined = 18, statements flattened = 239 [2024-11-19 01:54:01,128 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 01:54:01,129 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 01:54:01,129 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 01:54:01,129 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 01:54:01,141 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:54:01" (1/1) ... [2024-11-19 01:54:01,142 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:54:01" (1/1) ... [2024-11-19 01:54:01,145 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:54:01" (1/1) ... [2024-11-19 01:54:01,161 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2024-11-19 01:54:01,162 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:54:01" (1/1) ... [2024-11-19 01:54:01,162 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:54:01" (1/1) ... [2024-11-19 01:54:01,169 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:54:01" (1/1) ... [2024-11-19 01:54:01,174 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:54:01" (1/1) ... [2024-11-19 01:54:01,176 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:54:01" (1/1) ... [2024-11-19 01:54:01,178 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:54:01" (1/1) ... [2024-11-19 01:54:01,181 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 01:54:01,182 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 01:54:01,182 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 01:54:01,182 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 01:54:01,183 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:54:01" (1/1) ... [2024-11-19 01:54:01,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 01:54:01,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:54:01,229 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-19 01:54:01,236 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-19 01:54:01,277 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 01:54:01,277 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-19 01:54:01,278 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-19 01:54:01,279 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-19 01:54:01,279 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-19 01:54:01,279 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-19 01:54:01,279 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-19 01:54:01,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 01:54:01,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 01:54:01,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 01:54:01,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 01:54:01,280 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-19 01:54:01,280 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-19 01:54:01,280 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 01:54:01,280 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 01:54:01,280 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 01:54:01,280 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 01:54:01,280 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 01:54:01,282 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-19 01:54:01,427 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 01:54:01,430 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 01:54:01,774 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-19 01:54:01,774 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 01:54:02,084 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 01:54:02,085 INFO L316 CfgBuilder]: Removed 5 assume(true) statements. [2024-11-19 01:54:02,086 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:54:02 BoogieIcfgContainer [2024-11-19 01:54:02,086 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 01:54:02,119 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 01:54:02,120 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 01:54:02,123 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 01:54:02,124 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 01:54:00" (1/3) ... [2024-11-19 01:54:02,124 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73bcaacb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:54:02, skipping insertion in model container [2024-11-19 01:54:02,125 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:54:01" (2/3) ... [2024-11-19 01:54:02,125 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73bcaacb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:54:02, skipping insertion in model container [2024-11-19 01:54:02,125 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:54:02" (3/3) ... [2024-11-19 01:54:02,127 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-queue-add-3.wvr.c [2024-11-19 01:54:02,145 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 01:54:02,146 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 01:54:02,146 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-19 01:54:02,211 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-19 01:54:02,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 44 transitions, 109 flow [2024-11-19 01:54:02,298 INFO L124 PetriNetUnfolderBase]: 7/41 cut-off events. [2024-11-19 01:54:02,299 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-19 01:54:02,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 41 events. 7/41 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 76 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 33. Up to 2 conditions per place. [2024-11-19 01:54:02,304 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 44 transitions, 109 flow [2024-11-19 01:54:02,308 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 43 places, 40 transitions, 98 flow [2024-11-19 01:54:02,321 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 01:54:02,330 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6039a2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 01:54:02,331 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-19 01:54:02,351 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 01:54:02,352 INFO L124 PetriNetUnfolderBase]: 7/39 cut-off events. [2024-11-19 01:54:02,352 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-19 01:54:02,352 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:54:02,355 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:54:02,355 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-19 01:54:02,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:54:02,361 INFO L85 PathProgramCache]: Analyzing trace with hash -618360053, now seen corresponding path program 1 times [2024-11-19 01:54:02,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:54:02,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818834534] [2024-11-19 01:54:02,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:54:02,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:54:02,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:54:02,676 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-19 01:54:02,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:54:02,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818834534] [2024-11-19 01:54:02,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818834534] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:54:02,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:54:02,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 01:54:02,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130343012] [2024-11-19 01:54:02,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:54:02,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 01:54:02,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:54:02,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 01:54:02,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 01:54:02,728 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 44 [2024-11-19 01:54:02,731 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 40 transitions, 98 flow. Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 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-19 01:54:02,731 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:54:02,731 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 44 [2024-11-19 01:54:02,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:54:03,012 INFO L124 PetriNetUnfolderBase]: 727/1253 cut-off events. [2024-11-19 01:54:03,013 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2024-11-19 01:54:03,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2347 conditions, 1253 events. 727/1253 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 6247 event pairs, 595 based on Foata normal form. 130/1241 useless extension candidates. Maximal degree in co-relation 2182. Up to 991 conditions per place. [2024-11-19 01:54:03,029 INFO L140 encePairwiseOnDemand]: 42/44 looper letters, 28 selfloop transitions, 0 changer transitions 0/38 dead transitions. [2024-11-19 01:54:03,030 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 38 transitions, 150 flow [2024-11-19 01:54:03,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 01:54:03,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-19 01:54:03,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 56 transitions. [2024-11-19 01:54:03,042 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6363636363636364 [2024-11-19 01:54:03,044 INFO L175 Difference]: Start difference. First operand has 43 places, 40 transitions, 98 flow. Second operand 2 states and 56 transitions. [2024-11-19 01:54:03,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 38 transitions, 150 flow [2024-11-19 01:54:03,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 38 transitions, 138 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-19 01:54:03,081 INFO L231 Difference]: Finished difference. Result has 38 places, 38 transitions, 82 flow [2024-11-19 01:54:03,087 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=82, PETRI_PLACES=38, PETRI_TRANSITIONS=38} [2024-11-19 01:54:03,091 INFO L277 CegarLoopForPetriNet]: 43 programPoint places, -5 predicate places. [2024-11-19 01:54:03,096 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 38 transitions, 82 flow [2024-11-19 01:54:03,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 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-19 01:54:03,097 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:54:03,097 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] [2024-11-19 01:54:03,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 01:54:03,101 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-19 01:54:03,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:54:03,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1956926361, now seen corresponding path program 1 times [2024-11-19 01:54:03,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:54:03,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651842088] [2024-11-19 01:54:03,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:54:03,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:54:03,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:54:03,354 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-19 01:54:03,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:54:03,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651842088] [2024-11-19 01:54:03,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651842088] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:54:03,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:54:03,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 01:54:03,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554641653] [2024-11-19 01:54:03,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:54:03,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 01:54:03,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:54:03,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 01:54:03,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 01:54:03,360 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 44 [2024-11-19 01:54:03,360 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 38 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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-19 01:54:03,361 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:54:03,361 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 44 [2024-11-19 01:54:03,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:54:03,530 INFO L124 PetriNetUnfolderBase]: 733/1237 cut-off events. [2024-11-19 01:54:03,532 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-11-19 01:54:03,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2312 conditions, 1237 events. 733/1237 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 5962 event pairs, 189 based on Foata normal form. 27/1185 useless extension candidates. Maximal degree in co-relation 2309. Up to 875 conditions per place. [2024-11-19 01:54:03,540 INFO L140 encePairwiseOnDemand]: 40/44 looper letters, 37 selfloop transitions, 3 changer transitions 0/50 dead transitions. [2024-11-19 01:54:03,541 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 50 transitions, 188 flow [2024-11-19 01:54:03,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 01:54:03,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 01:54:03,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 80 transitions. [2024-11-19 01:54:03,544 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6060606060606061 [2024-11-19 01:54:03,544 INFO L175 Difference]: Start difference. First operand has 38 places, 38 transitions, 82 flow. Second operand 3 states and 80 transitions. [2024-11-19 01:54:03,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 50 transitions, 188 flow [2024-11-19 01:54:03,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 50 transitions, 188 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 01:54:03,548 INFO L231 Difference]: Finished difference. Result has 41 places, 40 transitions, 101 flow [2024-11-19 01:54:03,548 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=101, PETRI_PLACES=41, PETRI_TRANSITIONS=40} [2024-11-19 01:54:03,549 INFO L277 CegarLoopForPetriNet]: 43 programPoint places, -2 predicate places. [2024-11-19 01:54:03,550 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 40 transitions, 101 flow [2024-11-19 01:54:03,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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-19 01:54:03,551 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:54:03,551 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] [2024-11-19 01:54:03,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 01:54:03,551 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-19 01:54:03,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:54:03,553 INFO L85 PathProgramCache]: Analyzing trace with hash -431758607, now seen corresponding path program 2 times [2024-11-19 01:54:03,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:54:03,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108326521] [2024-11-19 01:54:03,553 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 01:54:03,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:54:03,583 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 01:54:03,585 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 01:54:03,665 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-19 01:54:03,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:54:03,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108326521] [2024-11-19 01:54:03,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108326521] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:54:03,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:54:03,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 01:54:03,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55454] [2024-11-19 01:54:03,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:54:03,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 01:54:03,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:54:03,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 01:54:03,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 01:54:03,670 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 44 [2024-11-19 01:54:03,670 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 40 transitions, 101 flow. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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-19 01:54:03,670 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:54:03,670 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 44 [2024-11-19 01:54:03,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:54:03,842 INFO L124 PetriNetUnfolderBase]: 663/1217 cut-off events. [2024-11-19 01:54:03,843 INFO L125 PetriNetUnfolderBase]: For 204/207 co-relation queries the response was YES. [2024-11-19 01:54:03,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2459 conditions, 1217 events. 663/1217 cut-off events. For 204/207 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 6040 event pairs, 248 based on Foata normal form. 26/1151 useless extension candidates. Maximal degree in co-relation 2454. Up to 555 conditions per place. [2024-11-19 01:54:03,850 INFO L140 encePairwiseOnDemand]: 41/44 looper letters, 40 selfloop transitions, 2 changer transitions 0/52 dead transitions. [2024-11-19 01:54:03,850 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 52 transitions, 217 flow [2024-11-19 01:54:03,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 01:54:03,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 01:54:03,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 80 transitions. [2024-11-19 01:54:03,852 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6060606060606061 [2024-11-19 01:54:03,852 INFO L175 Difference]: Start difference. First operand has 41 places, 40 transitions, 101 flow. Second operand 3 states and 80 transitions. [2024-11-19 01:54:03,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 52 transitions, 217 flow [2024-11-19 01:54:03,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 52 transitions, 214 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 01:54:03,854 INFO L231 Difference]: Finished difference. Result has 43 places, 41 transitions, 110 flow [2024-11-19 01:54:03,854 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=110, PETRI_PLACES=43, PETRI_TRANSITIONS=41} [2024-11-19 01:54:03,855 INFO L277 CegarLoopForPetriNet]: 43 programPoint places, 0 predicate places. [2024-11-19 01:54:03,855 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 41 transitions, 110 flow [2024-11-19 01:54:03,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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-19 01:54:03,855 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:54:03,855 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] [2024-11-19 01:54:03,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 01:54:03,856 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-19 01:54:03,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:54:03,856 INFO L85 PathProgramCache]: Analyzing trace with hash 215404707, now seen corresponding path program 3 times [2024-11-19 01:54:03,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:54:03,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699126800] [2024-11-19 01:54:03,857 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 01:54:03,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:54:03,878 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-19 01:54:03,878 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 01:54:03,998 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-19 01:54:03,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:54:04,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699126800] [2024-11-19 01:54:04,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699126800] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:54:04,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:54:04,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 01:54:04,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340143707] [2024-11-19 01:54:04,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:54:04,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 01:54:04,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:54:04,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 01:54:04,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 01:54:04,002 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 44 [2024-11-19 01:54:04,003 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 41 transitions, 110 flow. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 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-19 01:54:04,003 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:54:04,003 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 44 [2024-11-19 01:54:04,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:54:04,192 INFO L124 PetriNetUnfolderBase]: 711/1316 cut-off events. [2024-11-19 01:54:04,192 INFO L125 PetriNetUnfolderBase]: For 284/286 co-relation queries the response was YES. [2024-11-19 01:54:04,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2787 conditions, 1316 events. 711/1316 cut-off events. For 284/286 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 6534 event pairs, 521 based on Foata normal form. 27/1251 useless extension candidates. Maximal degree in co-relation 2781. Up to 950 conditions per place. [2024-11-19 01:54:04,200 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 30 selfloop transitions, 2 changer transitions 13/55 dead transitions. [2024-11-19 01:54:04,200 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 55 transitions, 231 flow [2024-11-19 01:54:04,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 01:54:04,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 01:54:04,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 96 transitions. [2024-11-19 01:54:04,202 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5454545454545454 [2024-11-19 01:54:04,202 INFO L175 Difference]: Start difference. First operand has 43 places, 41 transitions, 110 flow. Second operand 4 states and 96 transitions. [2024-11-19 01:54:04,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 55 transitions, 231 flow [2024-11-19 01:54:04,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 55 transitions, 229 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 01:54:04,204 INFO L231 Difference]: Finished difference. Result has 47 places, 42 transitions, 124 flow [2024-11-19 01:54:04,204 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=42, 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=4, PETRI_FLOW=124, PETRI_PLACES=47, PETRI_TRANSITIONS=42} [2024-11-19 01:54:04,205 INFO L277 CegarLoopForPetriNet]: 43 programPoint places, 4 predicate places. [2024-11-19 01:54:04,205 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 42 transitions, 124 flow [2024-11-19 01:54:04,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 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-19 01:54:04,206 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:54:04,206 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-19 01:54:04,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 01:54:04,206 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-19 01:54:04,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:54:04,207 INFO L85 PathProgramCache]: Analyzing trace with hash -385150933, now seen corresponding path program 1 times [2024-11-19 01:54:04,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:54:04,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057279790] [2024-11-19 01:54:04,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:54:04,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:54:04,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:54:04,344 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-19 01:54:04,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:54:04,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057279790] [2024-11-19 01:54:04,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057279790] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:54:04,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:54:04,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 01:54:04,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788267741] [2024-11-19 01:54:04,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:54:04,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 01:54:04,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:54:04,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 01:54:04,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 01:54:04,347 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 44 [2024-11-19 01:54:04,347 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 42 transitions, 124 flow. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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-19 01:54:04,347 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:54:04,347 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 44 [2024-11-19 01:54:04,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:54:04,562 INFO L124 PetriNetUnfolderBase]: 905/1642 cut-off events. [2024-11-19 01:54:04,562 INFO L125 PetriNetUnfolderBase]: For 471/476 co-relation queries the response was YES. [2024-11-19 01:54:04,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3564 conditions, 1642 events. 905/1642 cut-off events. For 471/476 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 8514 event pairs, 676 based on Foata normal form. 32/1581 useless extension candidates. Maximal degree in co-relation 3556. Up to 951 conditions per place. [2024-11-19 01:54:04,572 INFO L140 encePairwiseOnDemand]: 40/44 looper letters, 31 selfloop transitions, 2 changer transitions 19/62 dead transitions. [2024-11-19 01:54:04,572 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 62 transitions, 286 flow [2024-11-19 01:54:04,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 01:54:04,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 01:54:04,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 99 transitions. [2024-11-19 01:54:04,574 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5625 [2024-11-19 01:54:04,574 INFO L175 Difference]: Start difference. First operand has 47 places, 42 transitions, 124 flow. Second operand 4 states and 99 transitions. [2024-11-19 01:54:04,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 62 transitions, 286 flow [2024-11-19 01:54:04,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 62 transitions, 274 flow, removed 5 selfloop flow, removed 2 redundant places. [2024-11-19 01:54:04,577 INFO L231 Difference]: Finished difference. Result has 49 places, 43 transitions, 130 flow [2024-11-19 01:54:04,577 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=130, PETRI_PLACES=49, PETRI_TRANSITIONS=43} [2024-11-19 01:54:04,578 INFO L277 CegarLoopForPetriNet]: 43 programPoint places, 6 predicate places. [2024-11-19 01:54:04,578 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 43 transitions, 130 flow [2024-11-19 01:54:04,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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-19 01:54:04,579 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:54:04,579 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, 1] [2024-11-19 01:54:04,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 01:54:04,580 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-19 01:54:04,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:54:04,581 INFO L85 PathProgramCache]: Analyzing trace with hash -2147043510, now seen corresponding path program 1 times [2024-11-19 01:54:04,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:54:04,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56349674] [2024-11-19 01:54:04,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:54:04,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:54:04,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:54:04,883 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 01:54:04,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:54:04,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56349674] [2024-11-19 01:54:04,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56349674] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:54:04,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:54:04,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 01:54:04,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641709245] [2024-11-19 01:54:04,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:54:04,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 01:54:04,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:54:04,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 01:54:04,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-19 01:54:04,909 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 44 [2024-11-19 01:54:04,910 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 43 transitions, 130 flow. Second operand has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 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-19 01:54:04,910 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:54:04,911 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 44 [2024-11-19 01:54:04,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:54:05,292 INFO L124 PetriNetUnfolderBase]: 1274/2112 cut-off events. [2024-11-19 01:54:05,293 INFO L125 PetriNetUnfolderBase]: For 619/631 co-relation queries the response was YES. [2024-11-19 01:54:05,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4777 conditions, 2112 events. 1274/2112 cut-off events. For 619/631 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 11525 event pairs, 342 based on Foata normal form. 1/2056 useless extension candidates. Maximal degree in co-relation 4768. Up to 775 conditions per place. [2024-11-19 01:54:05,305 INFO L140 encePairwiseOnDemand]: 35/44 looper letters, 78 selfloop transitions, 9 changer transitions 10/105 dead transitions. [2024-11-19 01:54:05,306 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 105 transitions, 501 flow [2024-11-19 01:54:05,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 01:54:05,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-19 01:54:05,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 181 transitions. [2024-11-19 01:54:05,308 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5142045454545454 [2024-11-19 01:54:05,309 INFO L175 Difference]: Start difference. First operand has 49 places, 43 transitions, 130 flow. Second operand 8 states and 181 transitions. [2024-11-19 01:54:05,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 105 transitions, 501 flow [2024-11-19 01:54:05,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 105 transitions, 491 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-11-19 01:54:05,314 INFO L231 Difference]: Finished difference. Result has 56 places, 49 transitions, 174 flow [2024-11-19 01:54:05,314 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=174, PETRI_PLACES=56, PETRI_TRANSITIONS=49} [2024-11-19 01:54:05,315 INFO L277 CegarLoopForPetriNet]: 43 programPoint places, 13 predicate places. [2024-11-19 01:54:05,316 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 49 transitions, 174 flow [2024-11-19 01:54:05,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 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-19 01:54:05,316 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:54:05,316 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, 1, 1, 1, 1] [2024-11-19 01:54:05,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 01:54:05,317 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-19 01:54:05,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:54:05,317 INFO L85 PathProgramCache]: Analyzing trace with hash 795121444, now seen corresponding path program 1 times [2024-11-19 01:54:05,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:54:05,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890744062] [2024-11-19 01:54:05,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:54:05,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:54:05,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:54:05,492 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 01:54:05,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:54:05,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890744062] [2024-11-19 01:54:05,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890744062] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 01:54:05,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1530187174] [2024-11-19 01:54:05,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:54:05,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:54:05,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:54:05,496 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-19 01:54:05,497 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-19 01:54:05,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:54:05,607 INFO L255 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 01:54:05,613 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:54:05,813 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 01:54:05,814 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 01:54:05,973 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 01:54:05,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1530187174] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 01:54:05,974 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 01:54:05,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2024-11-19 01:54:05,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004219882] [2024-11-19 01:54:05,974 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 01:54:05,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 01:54:05,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:54:05,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 01:54:05,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-11-19 01:54:05,978 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 44 [2024-11-19 01:54:05,978 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 49 transitions, 174 flow. Second operand has 12 states, 12 states have (on average 17.166666666666668) internal successors, (206), 12 states have internal predecessors, (206), 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-19 01:54:05,978 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:54:05,978 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 44 [2024-11-19 01:54:05,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:54:06,424 INFO L124 PetriNetUnfolderBase]: 1661/3258 cut-off events. [2024-11-19 01:54:06,424 INFO L125 PetriNetUnfolderBase]: For 1426/1429 co-relation queries the response was YES. [2024-11-19 01:54:06,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7606 conditions, 3258 events. 1661/3258 cut-off events. For 1426/1429 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 21574 event pairs, 1040 based on Foata normal form. 114/3222 useless extension candidates. Maximal degree in co-relation 7595. Up to 1488 conditions per place. [2024-11-19 01:54:06,446 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 66 selfloop transitions, 5 changer transitions 4/88 dead transitions. [2024-11-19 01:54:06,446 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 88 transitions, 456 flow [2024-11-19 01:54:06,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 01:54:06,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 01:54:06,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 144 transitions. [2024-11-19 01:54:06,447 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5454545454545454 [2024-11-19 01:54:06,447 INFO L175 Difference]: Start difference. First operand has 56 places, 49 transitions, 174 flow. Second operand 6 states and 144 transitions. [2024-11-19 01:54:06,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 88 transitions, 456 flow [2024-11-19 01:54:06,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 88 transitions, 449 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-11-19 01:54:06,453 INFO L231 Difference]: Finished difference. Result has 61 places, 52 transitions, 212 flow [2024-11-19 01:54:06,453 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=212, PETRI_PLACES=61, PETRI_TRANSITIONS=52} [2024-11-19 01:54:06,454 INFO L277 CegarLoopForPetriNet]: 43 programPoint places, 18 predicate places. [2024-11-19 01:54:06,454 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 52 transitions, 212 flow [2024-11-19 01:54:06,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 17.166666666666668) internal successors, (206), 12 states have internal predecessors, (206), 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-19 01:54:06,454 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:54:06,455 INFO L204 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:54:06,474 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-19 01:54:06,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:54:06,656 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-19 01:54:06,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:54:06,657 INFO L85 PathProgramCache]: Analyzing trace with hash 171620424, now seen corresponding path program 2 times [2024-11-19 01:54:06,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:54:06,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600567214] [2024-11-19 01:54:06,657 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 01:54:06,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:54:06,716 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 01:54:06,716 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 01:54:08,010 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 01:54:08,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:54:08,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600567214] [2024-11-19 01:54:08,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600567214] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 01:54:08,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [658098764] [2024-11-19 01:54:08,011 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 01:54:08,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:54:08,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:54:08,014 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-19 01:54:08,015 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-19 01:54:08,125 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 01:54:08,125 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 01:54:08,127 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-19 01:54:08,129 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:54:08,451 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:54:08,452 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 23 treesize of output 15 [2024-11-19 01:54:08,650 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 01:54:08,651 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 01:54:08,866 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-19 01:54:08,867 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 24 treesize of output 11 [2024-11-19 01:54:09,114 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 01:54:09,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [658098764] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 01:54:09,115 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 01:54:09,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 8] total 25 [2024-11-19 01:54:09,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069497006] [2024-11-19 01:54:09,115 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 01:54:09,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-19 01:54:09,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:54:09,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-19 01:54:09,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=566, Unknown=0, NotChecked=0, Total=650 [2024-11-19 01:54:09,364 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-11-19 01:54:09,365 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 52 transitions, 212 flow. Second operand has 26 states, 26 states have (on average 13.0) internal successors, (338), 26 states have internal predecessors, (338), 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-19 01:54:09,365 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:54:09,366 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-11-19 01:54:09,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:54:17,017 INFO L124 PetriNetUnfolderBase]: 12766/21908 cut-off events. [2024-11-19 01:54:17,017 INFO L125 PetriNetUnfolderBase]: For 12551/12892 co-relation queries the response was YES. [2024-11-19 01:54:17,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53872 conditions, 21908 events. 12766/21908 cut-off events. For 12551/12892 co-relation queries the response was YES. Maximal size of possible extension queue 876. Compared 166586 event pairs, 795 based on Foata normal form. 857/22617 useless extension candidates. Maximal degree in co-relation 53858. Up to 3204 conditions per place. [2024-11-19 01:54:17,296 INFO L140 encePairwiseOnDemand]: 29/44 looper letters, 653 selfloop transitions, 198 changer transitions 0/861 dead transitions. [2024-11-19 01:54:17,296 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 861 transitions, 4676 flow [2024-11-19 01:54:17,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-11-19 01:54:17,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2024-11-19 01:54:17,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 1563 transitions. [2024-11-19 01:54:17,302 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5003201024327785 [2024-11-19 01:54:17,302 INFO L175 Difference]: Start difference. First operand has 61 places, 52 transitions, 212 flow. Second operand 71 states and 1563 transitions. [2024-11-19 01:54:17,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 861 transitions, 4676 flow [2024-11-19 01:54:17,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 861 transitions, 4504 flow, removed 83 selfloop flow, removed 3 redundant places. [2024-11-19 01:54:17,338 INFO L231 Difference]: Finished difference. Result has 175 places, 286 transitions, 2113 flow [2024-11-19 01:54:17,338 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=197, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=71, PETRI_FLOW=2113, PETRI_PLACES=175, PETRI_TRANSITIONS=286} [2024-11-19 01:54:17,339 INFO L277 CegarLoopForPetriNet]: 43 programPoint places, 132 predicate places. [2024-11-19 01:54:17,339 INFO L471 AbstractCegarLoop]: Abstraction has has 175 places, 286 transitions, 2113 flow [2024-11-19 01:54:17,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 13.0) internal successors, (338), 26 states have internal predecessors, (338), 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-19 01:54:17,340 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:54:17,340 INFO L204 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1] [2024-11-19 01:54:17,357 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-19 01:54:17,544 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,SelfDestructingSolverStorable7 [2024-11-19 01:54:17,545 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-19 01:54:17,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:54:17,546 INFO L85 PathProgramCache]: Analyzing trace with hash -738677284, now seen corresponding path program 1 times [2024-11-19 01:54:17,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:54:17,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25240902] [2024-11-19 01:54:17,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:54:17,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:54:17,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:54:17,636 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 01:54:17,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:54:17,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25240902] [2024-11-19 01:54:17,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25240902] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:54:17,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:54:17,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 01:54:17,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306127368] [2024-11-19 01:54:17,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:54:17,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 01:54:17,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:54:17,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 01:54:17,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 01:54:17,640 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 44 [2024-11-19 01:54:17,640 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 286 transitions, 2113 flow. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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-19 01:54:17,640 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:54:17,640 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 44 [2024-11-19 01:54:17,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:54:22,001 INFO L124 PetriNetUnfolderBase]: 16123/30005 cut-off events. [2024-11-19 01:54:22,002 INFO L125 PetriNetUnfolderBase]: For 576888/579357 co-relation queries the response was YES. [2024-11-19 01:54:22,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133490 conditions, 30005 events. 16123/30005 cut-off events. For 576888/579357 co-relation queries the response was YES. Maximal size of possible extension queue 1295. Compared 266727 event pairs, 3475 based on Foata normal form. 530/29811 useless extension candidates. Maximal degree in co-relation 133430. Up to 10938 conditions per place. [2024-11-19 01:54:22,307 INFO L140 encePairwiseOnDemand]: 41/44 looper letters, 372 selfloop transitions, 61 changer transitions 0/466 dead transitions. [2024-11-19 01:54:22,307 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 466 transitions, 4278 flow [2024-11-19 01:54:22,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 01:54:22,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 01:54:22,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 116 transitions. [2024-11-19 01:54:22,308 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6590909090909091 [2024-11-19 01:54:22,308 INFO L175 Difference]: Start difference. First operand has 175 places, 286 transitions, 2113 flow. Second operand 4 states and 116 transitions. [2024-11-19 01:54:22,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 466 transitions, 4278 flow [2024-11-19 01:54:24,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 466 transitions, 3551 flow, removed 361 selfloop flow, removed 2 redundant places. [2024-11-19 01:54:24,925 INFO L231 Difference]: Finished difference. Result has 178 places, 332 transitions, 2414 flow [2024-11-19 01:54:24,925 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1648, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2414, PETRI_PLACES=178, PETRI_TRANSITIONS=332} [2024-11-19 01:54:24,926 INFO L277 CegarLoopForPetriNet]: 43 programPoint places, 135 predicate places. [2024-11-19 01:54:24,926 INFO L471 AbstractCegarLoop]: Abstraction has has 178 places, 332 transitions, 2414 flow [2024-11-19 01:54:24,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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-19 01:54:24,927 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:54:24,927 INFO L204 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:54:24,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 01:54:24,928 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-19 01:54:24,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:54:24,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1000789154, now seen corresponding path program 3 times [2024-11-19 01:54:24,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:54:24,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490028938] [2024-11-19 01:54:24,929 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 01:54:24,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:54:24,975 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-19 01:54:24,979 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 01:54:25,642 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 01:54:25,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:54:25,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490028938] [2024-11-19 01:54:25,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490028938] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 01:54:25,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [155160169] [2024-11-19 01:54:25,643 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 01:54:25,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:54:25,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:54:25,645 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-19 01:54:25,646 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-19 01:54:25,751 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-19 01:54:25,751 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 01:54:25,753 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-19 01:54:25,755 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:54:26,183 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-19 01:54:26,184 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 23 treesize of output 10 [2024-11-19 01:54:26,209 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 01:54:26,209 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 01:54:26,414 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-19 01:54:26,415 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 25 treesize of output 12 [2024-11-19 01:54:26,600 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 01:54:26,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [155160169] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 01:54:26,601 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 01:54:26,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 22 [2024-11-19 01:54:26,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127417593] [2024-11-19 01:54:26,602 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 01:54:26,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-19 01:54:26,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:54:26,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-19 01:54:26,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=426, Unknown=0, NotChecked=0, Total=506 [2024-11-19 01:54:26,633 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 44 [2024-11-19 01:54:26,633 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 332 transitions, 2414 flow. Second operand has 23 states, 23 states have (on average 14.347826086956522) internal successors, (330), 23 states have internal predecessors, (330), 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-19 01:54:26,633 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:54:26,634 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 44 [2024-11-19 01:54:26,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:54:35,238 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([713] L87-3-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork1_#res#1.base_1| 0) (= |v_thread3Thread1of1ForFork1_#res#1.offset_1| 0)) InVars {} OutVars{thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_1|, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res#1.offset, thread3Thread1of1ForFork1_#res#1.base][303], [39#L120-4true, 72#true, Black: 579#(and (or (and (<= ~q2_back~0 0) (= ~q1_front~0 0)) (not (= 0 ~q2_front~0)) (< ~n1~0 (+ ~q1_back~0 1))) (= ~q1~0.offset 0) (or (< (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0)) (< ~q2_front~0 1)) (exists ((v_~q1_back~0_135 Int)) (and (<= (+ v_~q1_back~0_135 1) ~q1_back~0) (= (select (select |#memory_int#1| ~q1~0.base) (* v_~q1_back~0_135 4)) 1) (<= ~q1_front~0 v_~q1_back~0_135))) (= ~q2~0.offset 0) (or (not (= 0 ~q2_front~0)) (and (<= ~q2_back~0 0) (or (not (= ~q2_back~0 0)) (= |thread2Thread1of1ForFork0_~j~0#1| 1))) (not (= |thread2Thread1of1ForFork0_~j~0#1| (select (select |#memory_int#1| ~q2~0.base) (* ~q2_back~0 4))))) (or (not (= 0 ~q2_front~0)) (not (= ~q1_back~0 0))) (<= ~n1~0 2)), 9#L52true, Black: 583#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 ~n1~0) (<= 1 ~q1_back~0) (<= 1 |thread2Thread1of1ForFork0_~j~0#1|) (= ~q1~0.offset 0) (or (< (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0)) (< ~q2_front~0 1)) (or (not (= 0 ~q2_front~0)) (and (<= ~q2_back~0 0) (or (not (= ~q2_back~0 0)) (= (select (select |#memory_int#1| ~q1~0.base) 0) 1)) (= ~q1_front~0 0)) (< ~n1~0 (+ ~q1_back~0 1))) (= ~q2~0.offset 0) (or (not (= 0 ~q2_front~0)) (and (<= ~q2_back~0 0) (or (not (= ~q2_back~0 0)) (= |thread2Thread1of1ForFork0_~j~0#1| 1))) (not (= |thread2Thread1of1ForFork0_~j~0#1| (select (select |#memory_int#1| ~q2~0.base) (* ~q2_back~0 4))))) (<= ~n1~0 2) (or (< 0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (< ~q1_front~0 0) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1)))), Black: 671#(and (<= ~q1_front~0 ~q1_back~0) (or (and (<= ~q2_back~0 0) (= ~q1_front~0 0)) (not (= 0 ~q2_front~0)) (not (= ~q1_back~0 0))) (= ~q1~0.offset 0) (or (not (= 0 ~q2_front~0)) (not (= (select (select |#memory_int#1| ~q2~0.base) 0) 0))) (= ~q2~0.offset 0) (<= ~q2_front~0 0) (<= ~n1~0 2) (or (< 0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (< ~q1_front~0 0) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1)))), Black: 619#(and (<= ~q1_front~0 ~q1_back~0) (= ~q1~0.offset 0) (or (not (= 0 ~q2_front~0)) (not (= (select (select |#memory_int#1| ~q2~0.base) 0) 0))) (or (and (<= 1 ~n1~0) (<= 1 ~q1_back~0) (<= 1 |thread2Thread1of1ForFork0_~j~0#1|)) (and (<= 1 ~n1~0) (<= 2 ~q1_back~0))) (= ~q2~0.offset 0) (<= ~q2_front~0 0) (<= ~n1~0 2) (or (< 0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (< ~q1_front~0 0) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1)))), Black: 595#(and (<= 1 ~n1~0) (<= 1 ~q1_back~0) (<= 1 |thread2Thread1of1ForFork0_~j~0#1|) (= ~q1~0.offset 0) (or (not (= 0 ~q2_front~0)) (not (= (select (select |#memory_int#1| ~q2~0.base) 0) 0))) (exists ((v_~q1_back~0_135 Int)) (and (<= (+ v_~q1_back~0_135 1) ~q1_back~0) (= (select (select |#memory_int#1| ~q1~0.base) (* v_~q1_back~0_135 4)) 1) (<= ~q1_front~0 v_~q1_back~0_135))) (= ~q2~0.offset 0) (<= ~q2_front~0 0) (<= ~n1~0 2)), Black: 643#(and (<= 1 |thread2Thread1of1ForFork0_~j~0#1|) (not (= |thread3Thread1of1ForFork1_~k~0#1| 0))), Black: 661#(and (<= 1 ~n1~0) (<= 1 ~q1_back~0) (<= 1 |thread2Thread1of1ForFork0_~j~0#1|) (or (not (= 0 ~q2_front~0)) (not (= (select (select |#memory_int#1| ~q2~0.base) 0) 0))) (= ~q2~0.offset 0) (<= ~q2_front~0 0) (<= ~n1~0 2) (exists ((v_~q1_back~0_135 Int)) (and (<= (+ v_~q1_back~0_135 1) ~q1_back~0) (= (select (select |#memory_int#1| ~q1~0.base) (+ (* v_~q1_back~0_135 4) ~q1~0.offset)) 1) (<= ~q1_front~0 v_~q1_back~0_135)))), Black: 665#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 ~n1~0) (<= 1 ~q1_back~0) (<= 1 |thread2Thread1of1ForFork0_~j~0#1|) (or (not (= 0 ~q2_front~0)) (not (= (select (select |#memory_int#1| ~q2~0.base) 0) 0))) (= ~q2~0.offset 0) (<= ~q2_front~0 0) (<= ~n1~0 2)), Black: 627#(and (<= ~q1_front~0 ~q1_back~0) (or (and (<= ~q2_back~0 0) (= ~q1_front~0 0)) (not (= 0 ~q2_front~0)) (not (= ~q1_back~0 0))) (= ~q1~0.offset 0) (or (not (= 0 ~q2_front~0)) (not (= (select (select |#memory_int#1| ~q2~0.base) 0) 0))) (or (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)) (< 0 |thread2Thread1of1ForFork0_~j~0#1|)) (= ~q2~0.offset 0) (<= ~q2_front~0 0) (<= ~n1~0 2) (or (< 0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (< ~q1_front~0 0) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1)))), Black: 633#(and (<= ~q1_front~0 ~q1_back~0) (= ~q1~0.offset 0) (or (not (= 0 ~q2_front~0)) (not (= (select (select |#memory_int#1| ~q2~0.base) 0) 0))) (or (and (<= 1 ~n1~0) (<= 1 ~q1_back~0) (<= 1 |thread2Thread1of1ForFork0_~j~0#1|)) (and (<= 1 ~n1~0) (<= 2 ~q1_back~0))) (= ~q2~0.offset 0) (<= ~q2_front~0 0) (<= ~n1~0 2) (or (not (= 0 ~q2_front~0)) (and (<= ~q2_back~0 0) (or (not (= ~q2_back~0 0)) (= |thread2Thread1of1ForFork0_~j~0#1| 1))) (not (= |thread2Thread1of1ForFork0_~j~0#1| (select (select |#memory_int#1| ~q2~0.base) (* ~q2_back~0 4)))) (< ~n1~0 (+ ~q1_back~0 1))) (or (< 0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (< ~q1_front~0 0) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1)))), Black: 603#(and (<= ~q1_front~0 ~q1_back~0) (or (and (<= ~q2_back~0 0) (= ~q1_front~0 0)) (not (= 0 ~q2_front~0)) (not (= ~q1_back~0 0))) (= ~q1~0.offset 0) (or (< (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0)) (< ~q2_front~0 1)) (or (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)) (< 0 |thread2Thread1of1ForFork0_~j~0#1|)) (= ~q2~0.offset 0) (<= ~n1~0 2) (or (< 0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (< ~q1_front~0 0) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1)))), Black: 611#(and (<= ~q1_front~0 ~q1_back~0) (or (and (<= ~q2_back~0 0) (= ~q1_front~0 0)) (not (= 0 ~q2_front~0)) (not (= ~q1_back~0 0))) (= ~q1~0.offset 0) (or (< (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0)) (< ~q2_front~0 1)) (or (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)) (< 0 |thread2Thread1of1ForFork0_~j~0#1|)) (= ~q2~0.offset 0) (<= ~n1~0 2) (or (not (= 0 ~q2_front~0)) (and (<= ~q2_back~0 0) (or (not (= ~q2_back~0 0)) (= |thread2Thread1of1ForFork0_~j~0#1| 1))) (not (= |thread2Thread1of1ForFork0_~j~0#1| (select (select |#memory_int#1| ~q2~0.base) (* ~q2_back~0 4)))) (< ~n1~0 (+ ~q1_back~0 1))) (or (< 0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (< ~q1_front~0 0) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1)))), Black: 629#(and (or (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)) (< 0 |thread2Thread1of1ForFork0_~j~0#1|)) (not (= |thread3Thread1of1ForFork1_~k~0#1| 0))), Black: 585#(and (<= 1 ~n1~0) (or (and (<= ~q2_back~0 0) (= ~q1_front~0 0)) (not (= 0 ~q2_front~0)) (< ~n1~0 (+ ~q1_back~0 1))) (<= 1 ~q1_back~0) (<= 1 |thread2Thread1of1ForFork0_~j~0#1|) (= ~q1~0.offset 0) (or (not (= |thread2Thread1of1ForFork0_~j~0#1| (select (select |#memory_int#1| ~q2~0.base) 0))) (not (= 0 ~q2_front~0)) (not (= ~q2_back~0 0)) (= |thread2Thread1of1ForFork0_~j~0#1| 1) (< ~n1~0 (+ ~q1_back~0 1))) (or (< (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0)) (< ~q2_front~0 1)) (exists ((v_~q1_back~0_135 Int)) (and (<= (+ v_~q1_back~0_135 1) ~q1_back~0) (= (select (select |#memory_int#1| ~q1~0.base) (* v_~q1_back~0_135 4)) 1) (<= ~q1_front~0 v_~q1_back~0_135))) (= ~q2~0.offset 0) (<= ~n1~0 2)), Black: 601#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 ~n1~0) (<= 1 ~q1_back~0) (<= 1 |thread2Thread1of1ForFork0_~j~0#1|) (or (< ~q1_front~0 0) (< 0 (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n1~0 2)), Black: 659#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 ~n1~0) (<= 1 ~q1_back~0) (<= 1 |thread2Thread1of1ForFork0_~j~0#1|) (= ~q1~0.offset 0) (or (not (= 0 ~q2_front~0)) (not (= (select (select |#memory_int#1| ~q2~0.base) 0) 0))) (= ~q2~0.offset 0) (<= ~q2_front~0 0) (<= ~n1~0 2)), Black: 86#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1)), Black: 615#(and (<= ~q1_front~0 ~q1_back~0) (or (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)) (< 0 |thread2Thread1of1ForFork0_~j~0#1|)) (or (< ~q1_front~0 0) (< 0 (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n1~0 2) (not (= |thread3Thread1of1ForFork1_~k~0#1| 0))), 27#thread3EXITtrue, Black: 647#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 ~n1~0) (<= 1 ~q1_back~0) (<= 1 |thread2Thread1of1ForFork0_~j~0#1|) (= ~q1~0.offset 0) (or (not (= |thread2Thread1of1ForFork0_~j~0#1| (select (select |#memory_int#1| ~q2~0.base) 0))) (not (= 0 ~q2_front~0)) (not (= ~q2_back~0 0)) (= |thread2Thread1of1ForFork0_~j~0#1| 1) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= 0 ~q2_front~0)) (not (= (select (select |#memory_int#1| ~q2~0.base) 0) 0))) (or (not (= 0 ~q2_front~0)) (and (<= ~q2_back~0 0) (or (not (= ~q2_back~0 0)) (= (select (select |#memory_int#1| ~q1~0.base) 0) 1)) (= ~q1_front~0 0)) (< ~n1~0 (+ ~q1_back~0 1))) (= ~q2~0.offset 0) (<= ~q2_front~0 0) (<= ~n1~0 2) (or (< 0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (< ~q1_front~0 0) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1)))), Black: 87#(<= ~n1~0 1), Black: 597#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 ~n1~0) (<= 1 ~q1_back~0) (<= 1 |thread2Thread1of1ForFork0_~j~0#1|) (= ~q1~0.offset 0) (or (not (= |thread2Thread1of1ForFork0_~j~0#1| (select (select |#memory_int#1| ~q2~0.base) 0))) (not (= 0 ~q2_front~0)) (not (= ~q2_back~0 0)) (= |thread2Thread1of1ForFork0_~j~0#1| 1) (< ~n1~0 (+ ~q1_back~0 1))) (or (< (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0)) (< ~q2_front~0 1)) (or (not (= 0 ~q2_front~0)) (and (<= ~q2_back~0 0) (or (not (= ~q2_back~0 0)) (= (select (select |#memory_int#1| ~q1~0.base) 0) 1)) (= ~q1_front~0 0)) (< ~n1~0 (+ ~q1_back~0 1))) (= ~q2~0.offset 0) (<= ~n1~0 2) (or (< 0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (< ~q1_front~0 0) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1)))), Black: 641#(and (<= 1 ~n1~0) (or (and (<= ~q2_back~0 0) (= ~q1_front~0 0)) (not (= 0 ~q2_front~0)) (< ~n1~0 (+ ~q1_back~0 1))) (<= 1 ~q1_back~0) (<= 1 |thread2Thread1of1ForFork0_~j~0#1|) (= ~q1~0.offset 0) (or (not (= 0 ~q2_front~0)) (not (= (select (select |#memory_int#1| ~q2~0.base) 0) 0))) (exists ((v_~q1_back~0_135 Int)) (and (<= (+ v_~q1_back~0_135 1) ~q1_back~0) (= (select (select |#memory_int#1| ~q1~0.base) (* v_~q1_back~0_135 4)) 1) (<= ~q1_front~0 v_~q1_back~0_135))) (= ~q2~0.offset 0) (or (not (= 0 ~q2_front~0)) (and (<= ~q2_back~0 0) (or (not (= ~q2_back~0 0)) (= |thread2Thread1of1ForFork0_~j~0#1| 1))) (not (= |thread2Thread1of1ForFork0_~j~0#1| (select (select |#memory_int#1| ~q2~0.base) (* ~q2_back~0 4))))) (<= ~q2_front~0 0) (<= ~n1~0 2)), Black: 393#(<= 1 |thread2Thread1of1ForFork0_~j~0#1|), Black: 589#(and (<= 1 ~n1~0) (<= 1 ~q1_back~0) (<= 1 |thread2Thread1of1ForFork0_~j~0#1|) (<= ~n1~0 2) (exists ((v_~q1_back~0_135 Int)) (and (<= (+ v_~q1_back~0_135 1) ~q1_back~0) (= (select (select |#memory_int#1| ~q1~0.base) (+ (* v_~q1_back~0_135 4) ~q1~0.offset)) 1) (<= ~q1_front~0 v_~q1_back~0_135)))), Black: 54#(= ~q1_back~0 ~q1_front~0), Black: 607#(and (<= 1 ~n1~0) (or (and (<= ~q2_back~0 0) (= ~q1_front~0 0)) (not (= 0 ~q2_front~0)) (< ~n1~0 (+ ~q1_back~0 1))) (<= 1 ~q1_back~0) (<= 1 |thread2Thread1of1ForFork0_~j~0#1|) (= ~q1~0.offset 0) (or (not (= |thread2Thread1of1ForFork0_~j~0#1| (select (select |#memory_int#1| ~q2~0.base) 0))) (not (= 0 ~q2_front~0)) (not (= ~q2_back~0 0)) (= |thread2Thread1of1ForFork0_~j~0#1| 1) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= 0 ~q2_front~0)) (not (= (select (select |#memory_int#1| ~q2~0.base) 0) 0))) (exists ((v_~q1_back~0_135 Int)) (and (<= (+ v_~q1_back~0_135 1) ~q1_back~0) (= (select (select |#memory_int#1| ~q1~0.base) (* v_~q1_back~0_135 4)) 1) (<= ~q1_front~0 v_~q1_back~0_135))) (= ~q2~0.offset 0) (<= ~q2_front~0 0) (<= ~n1~0 2)), Black: 673#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 ~n1~0) (<= 1 ~q1_back~0) (<= 1 |thread2Thread1of1ForFork0_~j~0#1|) (or (not (= 0 ~q2_front~0)) (not (= (select (select |#memory_int#1| ~q2~0.base) 0) 0))) (= ~q2~0.offset 0) (or (< ~q1_front~0 0) (< 0 (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~q2_front~0 0) (<= ~n1~0 2)), Black: 623#(and (<= ~q1_front~0 ~q1_back~0) (or (and (<= 1 ~n1~0) (<= 1 ~q1_back~0) (<= 1 |thread2Thread1of1ForFork0_~j~0#1|)) (and (<= 1 ~n1~0) (<= 2 ~q1_back~0))) (or (< ~q1_front~0 0) (< 0 (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n1~0 2) (not (= |thread3Thread1of1ForFork1_~k~0#1| 0))), Black: 58#(<= ~q2_back~0 ~q2_front~0), Black: 569#(and (<= ~q1_front~0 ~q1_back~0) (or (and (<= ~q2_back~0 0) (= ~q1_front~0 0)) (not (= 0 ~q2_front~0)) (not (= ~q1_back~0 0))) (= ~q1~0.offset 0) (or (< (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0)) (< ~q2_front~0 1)) (= ~q2~0.offset 0) (<= ~n1~0 2) (or (< 0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (< ~q1_front~0 0) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1)))), Black: 617#(and (<= 1 ~n1~0) (<= 1 ~q1_back~0) (<= 1 |thread2Thread1of1ForFork0_~j~0#1|) (<= ~n1~0 2) (exists ((v_~q1_back~0_135 Int)) (and (<= (+ v_~q1_back~0_135 1) ~q1_back~0) (= (select (select |#memory_int#1| ~q1~0.base) (+ (* v_~q1_back~0_135 4) ~q1~0.offset)) 1) (<= ~q1_front~0 v_~q1_back~0_135))) (not (= |thread3Thread1of1ForFork1_~k~0#1| 0))), Black: 577#(and (<= ~q1_front~0 ~q1_back~0) (= ~q1~0.offset 0) (or (< (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0)) (< ~q2_front~0 1)) (or (and (<= 1 ~n1~0) (<= 1 ~q1_back~0) (<= 1 |thread2Thread1of1ForFork0_~j~0#1|)) (and (<= 1 ~n1~0) (<= 2 ~q1_back~0))) (= ~q2~0.offset 0) (<= ~n1~0 2) (or (< 0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (< ~q1_front~0 0) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1)))), Black: 522#(or (< ~q1_front~0 0) (< ~n1~0 (+ ~q1_front~0 2)) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 2))), Black: 651#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 ~n1~0) (<= 1 ~q1_back~0) (<= 1 |thread2Thread1of1ForFork0_~j~0#1|) (= ~q1~0.offset 0) (or (not (= 0 ~q2_front~0)) (not (= (select (select |#memory_int#1| ~q2~0.base) 0) 0))) (or (not (= 0 ~q2_front~0)) (and (<= ~q2_back~0 0) (or (not (= ~q2_back~0 0)) (= (select (select |#memory_int#1| ~q1~0.base) 0) 1)) (= ~q1_front~0 0)) (< ~n1~0 (+ ~q1_back~0 1))) (= ~q2~0.offset 0) (or (not (= 0 ~q2_front~0)) (and (<= ~q2_back~0 0) (or (not (= ~q2_back~0 0)) (= |thread2Thread1of1ForFork0_~j~0#1| 1))) (not (= |thread2Thread1of1ForFork0_~j~0#1| (select (select |#memory_int#1| ~q2~0.base) (* ~q2_back~0 4))))) (<= ~q2_front~0 0) (<= ~n1~0 2) (or (< 0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (< ~q1_front~0 0) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1)))), Black: 655#(and (<= ~q1_front~0 ~q1_back~0) (or (and (<= ~q2_back~0 0) (= ~q1_front~0 0)) (not (= 0 ~q2_front~0)) (not (= ~q1_back~0 0))) (= ~q1~0.offset 0) (or (not (= 0 ~q2_front~0)) (not (= (select (select |#memory_int#1| ~q2~0.base) 0) 0))) (or (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)) (< 0 |thread2Thread1of1ForFork0_~j~0#1|)) (= ~q2~0.offset 0) (<= ~q2_front~0 0) (<= ~n1~0 2) (or (not (= 0 ~q2_front~0)) (and (<= ~q2_back~0 0) (or (not (= ~q2_back~0 0)) (= |thread2Thread1of1ForFork0_~j~0#1| 1))) (not (= |thread2Thread1of1ForFork0_~j~0#1| (select (select |#memory_int#1| ~q2~0.base) (* ~q2_back~0 4)))) (< ~n1~0 (+ ~q1_back~0 1))) (or (< 0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (< ~q1_front~0 0) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1)))), Black: 62#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 557#(and (<= ~q1_front~0 ~q1_back~0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~q2_front~0 ~q2_back~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (or (< ~q1_front~0 0) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 2))) (or (not (= ~q1_back~0 0)) (and (= ~q1_front~0 0) (= ~q2_back~0 ~q2_front~0))) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (or (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= ~q1_back~0 0))), Black: 484#(or (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)) (< 0 |thread2Thread1of1ForFork0_~j~0#1|)), Black: 631#(and (<= 1 ~n1~0) (<= 1 ~q1_back~0) (<= 1 |thread2Thread1of1ForFork0_~j~0#1|) (= ~q1~0.offset 0) (or (< (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0)) (< ~q2_front~0 1)) (exists ((v_~q1_back~0_135 Int)) (and (<= (+ v_~q1_back~0_135 1) ~q1_back~0) (= (select (select |#memory_int#1| ~q1~0.base) (* v_~q1_back~0_135 4)) 1) (<= ~q1_front~0 v_~q1_back~0_135))) (= ~q2~0.offset 0) (<= ~n1~0 2)), Black: 567#(and (or (and (<= ~q2_back~0 0) (= ~q1_front~0 0)) (not (= 0 ~q2_front~0)) (< ~n1~0 (+ ~q1_back~0 1))) (= ~q1~0.offset 0) (or (not (= |thread2Thread1of1ForFork0_~j~0#1| (select (select |#memory_int#1| ~q2~0.base) 0))) (not (= 0 ~q2_front~0)) (not (= ~q2_back~0 0)) (= |thread2Thread1of1ForFork0_~j~0#1| 1) (< ~n1~0 (+ ~q1_back~0 1))) (or (< (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0)) (< ~q2_front~0 1)) (exists ((v_~q1_back~0_135 Int)) (and (<= (+ v_~q1_back~0_135 1) ~q1_back~0) (= (select (select |#memory_int#1| ~q1~0.base) (* v_~q1_back~0_135 4)) 1) (<= ~q1_front~0 v_~q1_back~0_135))) (= ~q2~0.offset 0) (or (not (= 0 ~q2_front~0)) (not (= ~q1_back~0 0))) (<= ~n1~0 2)), Black: 559#(and (<= ~q1_front~0 ~q1_back~0) (= ~q1~0.offset 0) (or (not (= ~q1_back~0 0)) (and (= ~q1_front~0 0) (<= ~q2_back~0 ~q2_front~0))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) (<= ~n1~0 2) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~q2_front~0) (+ ~q2_back~0 1))), Black: 657#(and (<= 1 ~n1~0) (or (and (<= ~q2_back~0 0) (= ~q1_front~0 0)) (not (= 0 ~q2_front~0)) (< ~n1~0 (+ ~q1_back~0 1))) (<= 1 ~q1_back~0) (<= 1 |thread2Thread1of1ForFork0_~j~0#1|) (= ~q1~0.offset 0) (or (not (= 0 ~q2_front~0)) (not (= (select (select |#memory_int#1| ~q2~0.base) 0) 0))) (exists ((v_~q1_back~0_135 Int)) (and (<= (+ v_~q1_back~0_135 1) ~q1_back~0) (= (select (select |#memory_int#1| ~q1~0.base) (* v_~q1_back~0_135 4)) 1) (<= ~q1_front~0 v_~q1_back~0_135))) (= ~q2~0.offset 0) (<= ~q2_front~0 0) (<= ~n1~0 2)), Black: 599#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 ~n1~0) (<= 1 ~q1_back~0) (<= 1 |thread2Thread1of1ForFork0_~j~0#1|) (= ~q1~0.offset 0) (or (not (= 0 ~q2_front~0)) (not (= (select (select |#memory_int#1| ~q2~0.base) 0) 0))) (= ~q2~0.offset 0) (<= ~q2_front~0 0) (<= ~n1~0 2) (or (< 0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (< ~q1_front~0 0) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1)))), Black: 68#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), Black: 609#(and (<= ~q1_front~0 ~q1_back~0) (or (< ~q1_front~0 0) (< 0 (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n1~0 2) (not (= |thread3Thread1of1ForFork1_~k~0#1| 0))), Black: 571#(and (<= ~q1_front~0 ~q1_back~0) (= ~q1~0.offset 0) (or (< (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0)) (< ~q2_front~0 1)) (or (and (<= 1 ~n1~0) (<= 1 ~q1_back~0) (<= 1 |thread2Thread1of1ForFork0_~j~0#1|)) (and (<= 1 ~n1~0) (<= 2 ~q1_back~0))) (= ~q2~0.offset 0) (<= ~n1~0 2) (or (not (= 0 ~q2_front~0)) (and (<= ~q2_back~0 0) (or (not (= ~q2_back~0 0)) (= |thread2Thread1of1ForFork0_~j~0#1| 1))) (not (= |thread2Thread1of1ForFork0_~j~0#1| (select (select |#memory_int#1| ~q2~0.base) (* ~q2_back~0 4)))) (< ~n1~0 (+ ~q1_back~0 1))) (or (< 0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (< ~q1_front~0 0) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1)))), 50#true, Black: 625#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 ~n1~0) (<= 1 ~q1_back~0) (<= 1 |thread2Thread1of1ForFork0_~j~0#1|) (= ~q1~0.offset 0) (or (< (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0)) (< ~q2_front~0 1)) (= ~q2~0.offset 0) (<= ~n1~0 2)), Black: 613#(and (<= 1 ~n1~0) (or (and (<= ~q2_back~0 0) (= ~q1_front~0 0)) (not (= 0 ~q2_front~0)) (< ~n1~0 (+ ~q1_back~0 1))) (<= 1 ~q1_back~0) (<= 1 |thread2Thread1of1ForFork0_~j~0#1|) (= ~q1~0.offset 0) (or (< (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0)) (< ~q2_front~0 1)) (exists ((v_~q1_back~0_135 Int)) (and (<= (+ v_~q1_back~0_135 1) ~q1_back~0) (= (select (select |#memory_int#1| ~q1~0.base) (* v_~q1_back~0_135 4)) 1) (<= ~q1_front~0 v_~q1_back~0_135))) (= ~q2~0.offset 0) (<= ~n1~0 2)), Black: 581#(and (<= 1 ~n1~0) (or (and (<= ~q2_back~0 0) (= ~q1_front~0 0)) (not (= 0 ~q2_front~0)) (< ~n1~0 (+ ~q1_back~0 1))) (<= 1 ~q1_back~0) (<= 1 |thread2Thread1of1ForFork0_~j~0#1|) (= ~q1~0.offset 0) (or (< (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0)) (< ~q2_front~0 1)) (exists ((v_~q1_back~0_135 Int)) (and (<= (+ v_~q1_back~0_135 1) ~q1_back~0) (= (select (select |#memory_int#1| ~q1~0.base) (* v_~q1_back~0_135 4)) 1) (<= ~q1_front~0 v_~q1_back~0_135))) (= ~q2~0.offset 0) (or (not (= 0 ~q2_front~0)) (and (<= ~q2_back~0 0) (or (not (= ~q2_back~0 0)) (= |thread2Thread1of1ForFork0_~j~0#1| 1))) (not (= |thread2Thread1of1ForFork0_~j~0#1| (select (select |#memory_int#1| ~q2~0.base) (* ~q2_back~0 4))))) (<= ~n1~0 2)), 591#(and (<= ~q1_front~0 ~q1_back~0) (or (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)) (< 0 |thread2Thread1of1ForFork0_~j~0#1|)) (or (< ~q1_front~0 0) (< 0 (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n1~0 2)), Black: 621#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 ~n1~0) (<= 1 ~q1_back~0) (<= 1 |thread2Thread1of1ForFork0_~j~0#1|) (or (< ~q1_front~0 0) (< 0 (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n1~0 2) (not (= |thread3Thread1of1ForFork1_~k~0#1| 0))), Black: 653#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 ~n1~0) (<= 1 ~q1_back~0) (<= 1 |thread2Thread1of1ForFork0_~j~0#1|) (<= ~n1~0 2) (not (= |thread3Thread1of1ForFork1_~k~0#1| 0))), Black: 635#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 ~n1~0) (<= 1 ~q1_back~0) (<= 1 |thread2Thread1of1ForFork0_~j~0#1|) (<= ~n1~0 2)), Black: 663#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 ~n1~0) (<= 1 ~q1_back~0) (<= 1 |thread2Thread1of1ForFork0_~j~0#1|) (= ~q1~0.offset 0) (or (< (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0)) (< ~q2_front~0 1)) (= ~q2~0.offset 0) (<= ~n1~0 2) (or (< 0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (< ~q1_front~0 0) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1)))), Black: 78#(and (or (< ~N~0 (+ ~t~0 1)) (< (+ ~N~0 |thread3Thread1of1ForFork1_~k~0#1|) (+ ~t~0 1))) (or (< ~t~0 (+ ~N~0 |thread3Thread1of1ForFork1_~k~0#1| 1)) (< ~t~0 (+ ~N~0 1)))), Black: 76#(and (<= 0 ~N~0) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (= ~t~0 0)), Black: 723#(<= ~q2_back~0 ~q2_front~0), 971#(and (<= ~q1_front~0 ~q1_back~0) (= ~q1~0.offset 0) (<= ~n1~0 2) (or (not (= ~q1_back~0 0)) (and (<= (mod |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1073741823) (= ~q1_front~0 0)))), 41#L70true, 724#(<= ~q2_back~0 (+ 1 ~q2_front~0))]) [2024-11-19 01:54:35,239 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2024-11-19 01:54:35,239 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-19 01:54:35,239 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-19 01:54:35,239 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-19 01:54:35,240 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([716] L94-->L87-2: Formula: (not (= |v_thread3Thread1of1ForFork1_~k~0#1_9| 0)) InVars {thread3Thread1of1ForFork1_~k~0#1=|v_thread3Thread1of1ForFork1_~k~0#1_9|} OutVars{thread3Thread1of1ForFork1_~k~0#1=|v_thread3Thread1of1ForFork1_~k~0#1_9|} AuxVars[] AssignedVars[][320], [39#L120-4true, 615#(and (<= ~q1_front~0 ~q1_back~0) (or (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)) (< 0 |thread2Thread1of1ForFork0_~j~0#1|)) (or (< ~q1_front~0 0) (< 0 (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n1~0 2) (not (= |thread3Thread1of1ForFork1_~k~0#1| 0))), 72#true, Black: 579#(and (or (and (<= ~q2_back~0 0) (= ~q1_front~0 0)) (not (= 0 ~q2_front~0)) (< ~n1~0 (+ ~q1_back~0 1))) (= ~q1~0.offset 0) (or (< (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0)) (< ~q2_front~0 1)) (exists ((v_~q1_back~0_135 Int)) (and (<= (+ v_~q1_back~0_135 1) ~q1_back~0) (= (select (select |#memory_int#1| ~q1~0.base) (* v_~q1_back~0_135 4)) 1) (<= ~q1_front~0 v_~q1_back~0_135))) (= ~q2~0.offset 0) (or (not (= 0 ~q2_front~0)) (and (<= ~q2_back~0 0) (or (not (= ~q2_back~0 0)) (= |thread2Thread1of1ForFork0_~j~0#1| 1))) (not (= |thread2Thread1of1ForFork0_~j~0#1| (select (select |#memory_int#1| ~q2~0.base) (* ~q2_back~0 4))))) (or (not (= 0 ~q2_front~0)) (not (= ~q1_back~0 0))) (<= ~n1~0 2)), 9#L52true, Black: 583#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 ~n1~0) (<= 1 ~q1_back~0) (<= 1 |thread2Thread1of1ForFork0_~j~0#1|) (= ~q1~0.offset 0) (or (< (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0)) (< ~q2_front~0 1)) (or (not (= 0 ~q2_front~0)) (and (<= ~q2_back~0 0) (or (not (= ~q2_back~0 0)) (= (select (select |#memory_int#1| ~q1~0.base) 0) 1)) (= ~q1_front~0 0)) (< ~n1~0 (+ ~q1_back~0 1))) (= ~q2~0.offset 0) (or (not (= 0 ~q2_front~0)) (and (<= ~q2_back~0 0) (or (not (= ~q2_back~0 0)) (= |thread2Thread1of1ForFork0_~j~0#1| 1))) (not (= |thread2Thread1of1ForFork0_~j~0#1| (select (select |#memory_int#1| ~q2~0.base) (* ~q2_back~0 4))))) (<= ~n1~0 2) (or (< 0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (< ~q1_front~0 0) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1)))), Black: 671#(and (<= ~q1_front~0 ~q1_back~0) (or (and (<= ~q2_back~0 0) (= ~q1_front~0 0)) (not (= 0 ~q2_front~0)) (not (= ~q1_back~0 0))) (= ~q1~0.offset 0) (or (not (= 0 ~q2_front~0)) (not (= (select (select |#memory_int#1| ~q2~0.base) 0) 0))) (= ~q2~0.offset 0) (<= ~q2_front~0 0) (<= ~n1~0 2) (or (< 0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (< ~q1_front~0 0) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1)))), Black: 619#(and (<= ~q1_front~0 ~q1_back~0) (= ~q1~0.offset 0) (or (not (= 0 ~q2_front~0)) (not (= (select (select |#memory_int#1| ~q2~0.base) 0) 0))) (or (and (<= 1 ~n1~0) (<= 1 ~q1_back~0) (<= 1 |thread2Thread1of1ForFork0_~j~0#1|)) (and (<= 1 ~n1~0) (<= 2 ~q1_back~0))) (= ~q2~0.offset 0) (<= ~q2_front~0 0) (<= ~n1~0 2) (or (< 0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (< ~q1_front~0 0) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1)))), Black: 595#(and (<= 1 ~n1~0) (<= 1 ~q1_back~0) (<= 1 |thread2Thread1of1ForFork0_~j~0#1|) (= ~q1~0.offset 0) (or (not (= 0 ~q2_front~0)) (not (= (select (select |#memory_int#1| ~q2~0.base) 0) 0))) (exists ((v_~q1_back~0_135 Int)) (and (<= (+ v_~q1_back~0_135 1) ~q1_back~0) (= (select (select |#memory_int#1| ~q1~0.base) (* v_~q1_back~0_135 4)) 1) (<= ~q1_front~0 v_~q1_back~0_135))) (= ~q2~0.offset 0) (<= ~q2_front~0 0) (<= ~n1~0 2)), Black: 643#(and (<= 1 |thread2Thread1of1ForFork0_~j~0#1|) (not (= |thread3Thread1of1ForFork1_~k~0#1| 0))), Black: 661#(and (<= 1 ~n1~0) (<= 1 ~q1_back~0) (<= 1 |thread2Thread1of1ForFork0_~j~0#1|) (or (not (= 0 ~q2_front~0)) (not (= (select (select |#memory_int#1| ~q2~0.base) 0) 0))) (= ~q2~0.offset 0) (<= ~q2_front~0 0) (<= ~n1~0 2) (exists ((v_~q1_back~0_135 Int)) (and (<= (+ v_~q1_back~0_135 1) ~q1_back~0) (= (select (select |#memory_int#1| ~q1~0.base) (+ (* v_~q1_back~0_135 4) ~q1~0.offset)) 1) (<= ~q1_front~0 v_~q1_back~0_135)))), Black: 665#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 ~n1~0) (<= 1 ~q1_back~0) (<= 1 |thread2Thread1of1ForFork0_~j~0#1|) (or (not (= 0 ~q2_front~0)) (not (= (select (select |#memory_int#1| ~q2~0.base) 0) 0))) (= ~q2~0.offset 0) (<= ~q2_front~0 0) (<= ~n1~0 2)), Black: 627#(and (<= ~q1_front~0 ~q1_back~0) (or (and (<= ~q2_back~0 0) (= ~q1_front~0 0)) (not (= 0 ~q2_front~0)) (not (= ~q1_back~0 0))) (= ~q1~0.offset 0) (or (not (= 0 ~q2_front~0)) (not (= (select (select |#memory_int#1| ~q2~0.base) 0) 0))) (or (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)) (< 0 |thread2Thread1of1ForFork0_~j~0#1|)) (= ~q2~0.offset 0) (<= ~q2_front~0 0) (<= ~n1~0 2) (or (< 0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (< ~q1_front~0 0) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1)))), Black: 633#(and (<= ~q1_front~0 ~q1_back~0) (= ~q1~0.offset 0) (or (not (= 0 ~q2_front~0)) (not (= (select (select |#memory_int#1| ~q2~0.base) 0) 0))) (or (and (<= 1 ~n1~0) (<= 1 ~q1_back~0) (<= 1 |thread2Thread1of1ForFork0_~j~0#1|)) (and (<= 1 ~n1~0) (<= 2 ~q1_back~0))) (= ~q2~0.offset 0) (<= ~q2_front~0 0) (<= ~n1~0 2) (or (not (= 0 ~q2_front~0)) (and (<= ~q2_back~0 0) (or (not (= ~q2_back~0 0)) (= |thread2Thread1of1ForFork0_~j~0#1| 1))) (not (= |thread2Thread1of1ForFork0_~j~0#1| (select (select |#memory_int#1| ~q2~0.base) (* ~q2_back~0 4)))) (< ~n1~0 (+ ~q1_back~0 1))) (or (< 0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (< ~q1_front~0 0) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1)))), Black: 603#(and (<= ~q1_front~0 ~q1_back~0) (or (and (<= ~q2_back~0 0) (= ~q1_front~0 0)) (not (= 0 ~q2_front~0)) (not (= ~q1_back~0 0))) (= ~q1~0.offset 0) (or (< (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0)) (< ~q2_front~0 1)) (or (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)) (< 0 |thread2Thread1of1ForFork0_~j~0#1|)) (= ~q2~0.offset 0) (<= ~n1~0 2) (or (< 0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (< ~q1_front~0 0) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1)))), Black: 611#(and (<= ~q1_front~0 ~q1_back~0) (or (and (<= ~q2_back~0 0) (= ~q1_front~0 0)) (not (= 0 ~q2_front~0)) (not (= ~q1_back~0 0))) (= ~q1~0.offset 0) (or (< (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0)) (< ~q2_front~0 1)) (or (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)) (< 0 |thread2Thread1of1ForFork0_~j~0#1|)) (= ~q2~0.offset 0) (<= ~n1~0 2) (or (not (= 0 ~q2_front~0)) (and (<= ~q2_back~0 0) (or (not (= ~q2_back~0 0)) (= |thread2Thread1of1ForFork0_~j~0#1| 1))) (not (= |thread2Thread1of1ForFork0_~j~0#1| (select (select |#memory_int#1| ~q2~0.base) (* ~q2_back~0 4)))) (< ~n1~0 (+ ~q1_back~0 1))) (or (< 0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (< ~q1_front~0 0) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1)))), Black: 629#(and (or (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)) (< 0 |thread2Thread1of1ForFork0_~j~0#1|)) (not (= |thread3Thread1of1ForFork1_~k~0#1| 0))), Black: 585#(and (<= 1 ~n1~0) (or (and (<= ~q2_back~0 0) (= ~q1_front~0 0)) (not (= 0 ~q2_front~0)) (< ~n1~0 (+ ~q1_back~0 1))) (<= 1 ~q1_back~0) (<= 1 |thread2Thread1of1ForFork0_~j~0#1|) (= ~q1~0.offset 0) (or (not (= |thread2Thread1of1ForFork0_~j~0#1| (select (select |#memory_int#1| ~q2~0.base) 0))) (not (= 0 ~q2_front~0)) (not (= ~q2_back~0 0)) (= |thread2Thread1of1ForFork0_~j~0#1| 1) (< ~n1~0 (+ ~q1_back~0 1))) (or (< (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0)) (< ~q2_front~0 1)) (exists ((v_~q1_back~0_135 Int)) (and (<= (+ v_~q1_back~0_135 1) ~q1_back~0) (= (select (select |#memory_int#1| ~q1~0.base) (* v_~q1_back~0_135 4)) 1) (<= ~q1_front~0 v_~q1_back~0_135))) (= ~q2~0.offset 0) (<= ~n1~0 2)), Black: 601#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 ~n1~0) (<= 1 ~q1_back~0) (<= 1 |thread2Thread1of1ForFork0_~j~0#1|) (or (< ~q1_front~0 0) (< 0 (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n1~0 2)), Black: 659#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 ~n1~0) (<= 1 ~q1_back~0) (<= 1 |thread2Thread1of1ForFork0_~j~0#1|) (= ~q1~0.offset 0) (or (not (= 0 ~q2_front~0)) (not (= (select (select |#memory_int#1| ~q2~0.base) 0) 0))) (= ~q2~0.offset 0) (<= ~q2_front~0 0) (<= ~n1~0 2)), Black: 86#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1)), Black: 647#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 ~n1~0) (<= 1 ~q1_back~0) (<= 1 |thread2Thread1of1ForFork0_~j~0#1|) (= ~q1~0.offset 0) (or (not (= |thread2Thread1of1ForFork0_~j~0#1| (select (select |#memory_int#1| ~q2~0.base) 0))) (not (= 0 ~q2_front~0)) (not (= ~q2_back~0 0)) (= |thread2Thread1of1ForFork0_~j~0#1| 1) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= 0 ~q2_front~0)) (not (= (select (select |#memory_int#1| ~q2~0.base) 0) 0))) (or (not (= 0 ~q2_front~0)) (and (<= ~q2_back~0 0) (or (not (= ~q2_back~0 0)) (= (select (select |#memory_int#1| ~q1~0.base) 0) 1)) (= ~q1_front~0 0)) (< ~n1~0 (+ ~q1_back~0 1))) (= ~q2~0.offset 0) (<= ~q2_front~0 0) (<= ~n1~0 2) (or (< 0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (< ~q1_front~0 0) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1)))), Black: 87#(<= ~n1~0 1), Black: 597#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 ~n1~0) (<= 1 ~q1_back~0) (<= 1 |thread2Thread1of1ForFork0_~j~0#1|) (= ~q1~0.offset 0) (or (not (= |thread2Thread1of1ForFork0_~j~0#1| (select (select |#memory_int#1| ~q2~0.base) 0))) (not (= 0 ~q2_front~0)) (not (= ~q2_back~0 0)) (= |thread2Thread1of1ForFork0_~j~0#1| 1) (< ~n1~0 (+ ~q1_back~0 1))) (or (< (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0)) (< ~q2_front~0 1)) (or (not (= 0 ~q2_front~0)) (and (<= ~q2_back~0 0) (or (not (= ~q2_back~0 0)) (= (select (select |#memory_int#1| ~q1~0.base) 0) 1)) (= ~q1_front~0 0)) (< ~n1~0 (+ ~q1_back~0 1))) (= ~q2~0.offset 0) (<= ~n1~0 2) (or (< 0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (< ~q1_front~0 0) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1)))), Black: 641#(and (<= 1 ~n1~0) (or (and (<= ~q2_back~0 0) (= ~q1_front~0 0)) (not (= 0 ~q2_front~0)) (< ~n1~0 (+ ~q1_back~0 1))) (<= 1 ~q1_back~0) (<= 1 |thread2Thread1of1ForFork0_~j~0#1|) (= ~q1~0.offset 0) (or (not (= 0 ~q2_front~0)) (not (= (select (select |#memory_int#1| ~q2~0.base) 0) 0))) (exists ((v_~q1_back~0_135 Int)) (and (<= (+ v_~q1_back~0_135 1) ~q1_back~0) (= (select (select |#memory_int#1| ~q1~0.base) (* v_~q1_back~0_135 4)) 1) (<= ~q1_front~0 v_~q1_back~0_135))) (= ~q2~0.offset 0) (or (not (= 0 ~q2_front~0)) (and (<= ~q2_back~0 0) (or (not (= ~q2_back~0 0)) (= |thread2Thread1of1ForFork0_~j~0#1| 1))) (not (= |thread2Thread1of1ForFork0_~j~0#1| (select (select |#memory_int#1| ~q2~0.base) (* ~q2_back~0 4))))) (<= ~q2_front~0 0) (<= ~n1~0 2)), Black: 393#(<= 1 |thread2Thread1of1ForFork0_~j~0#1|), Black: 589#(and (<= 1 ~n1~0) (<= 1 ~q1_back~0) (<= 1 |thread2Thread1of1ForFork0_~j~0#1|) (<= ~n1~0 2) (exists ((v_~q1_back~0_135 Int)) (and (<= (+ v_~q1_back~0_135 1) ~q1_back~0) (= (select (select |#memory_int#1| ~q1~0.base) (+ (* v_~q1_back~0_135 4) ~q1~0.offset)) 1) (<= ~q1_front~0 v_~q1_back~0_135)))), Black: 54#(= ~q1_back~0 ~q1_front~0), Black: 607#(and (<= 1 ~n1~0) (or (and (<= ~q2_back~0 0) (= ~q1_front~0 0)) (not (= 0 ~q2_front~0)) (< ~n1~0 (+ ~q1_back~0 1))) (<= 1 ~q1_back~0) (<= 1 |thread2Thread1of1ForFork0_~j~0#1|) (= ~q1~0.offset 0) (or (not (= |thread2Thread1of1ForFork0_~j~0#1| (select (select |#memory_int#1| ~q2~0.base) 0))) (not (= 0 ~q2_front~0)) (not (= ~q2_back~0 0)) (= |thread2Thread1of1ForFork0_~j~0#1| 1) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= 0 ~q2_front~0)) (not (= (select (select |#memory_int#1| ~q2~0.base) 0) 0))) (exists ((v_~q1_back~0_135 Int)) (and (<= (+ v_~q1_back~0_135 1) ~q1_back~0) (= (select (select |#memory_int#1| ~q1~0.base) (* v_~q1_back~0_135 4)) 1) (<= ~q1_front~0 v_~q1_back~0_135))) (= ~q2~0.offset 0) (<= ~q2_front~0 0) (<= ~n1~0 2)), Black: 673#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 ~n1~0) (<= 1 ~q1_back~0) (<= 1 |thread2Thread1of1ForFork0_~j~0#1|) (or (not (= 0 ~q2_front~0)) (not (= (select (select |#memory_int#1| ~q2~0.base) 0) 0))) (= ~q2~0.offset 0) (or (< ~q1_front~0 0) (< 0 (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~q2_front~0 0) (<= ~n1~0 2)), Black: 623#(and (<= ~q1_front~0 ~q1_back~0) (or (and (<= 1 ~n1~0) (<= 1 ~q1_back~0) (<= 1 |thread2Thread1of1ForFork0_~j~0#1|)) (and (<= 1 ~n1~0) (<= 2 ~q1_back~0))) (or (< ~q1_front~0 0) (< 0 (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n1~0 2) (not (= |thread3Thread1of1ForFork1_~k~0#1| 0))), Black: 58#(<= ~q2_back~0 ~q2_front~0), Black: 569#(and (<= ~q1_front~0 ~q1_back~0) (or (and (<= ~q2_back~0 0) (= ~q1_front~0 0)) (not (= 0 ~q2_front~0)) (not (= ~q1_back~0 0))) (= ~q1~0.offset 0) (or (< (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0)) (< ~q2_front~0 1)) (= ~q2~0.offset 0) (<= ~n1~0 2) (or (< 0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (< ~q1_front~0 0) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1)))), Black: 617#(and (<= 1 ~n1~0) (<= 1 ~q1_back~0) (<= 1 |thread2Thread1of1ForFork0_~j~0#1|) (<= ~n1~0 2) (exists ((v_~q1_back~0_135 Int)) (and (<= (+ v_~q1_back~0_135 1) ~q1_back~0) (= (select (select |#memory_int#1| ~q1~0.base) (+ (* v_~q1_back~0_135 4) ~q1~0.offset)) 1) (<= ~q1_front~0 v_~q1_back~0_135))) (not (= |thread3Thread1of1ForFork1_~k~0#1| 0))), Black: 577#(and (<= ~q1_front~0 ~q1_back~0) (= ~q1~0.offset 0) (or (< (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0)) (< ~q2_front~0 1)) (or (and (<= 1 ~n1~0) (<= 1 ~q1_back~0) (<= 1 |thread2Thread1of1ForFork0_~j~0#1|)) (and (<= 1 ~n1~0) (<= 2 ~q1_back~0))) (= ~q2~0.offset 0) (<= ~n1~0 2) (or (< 0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (< ~q1_front~0 0) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1)))), Black: 522#(or (< ~q1_front~0 0) (< ~n1~0 (+ ~q1_front~0 2)) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 2))), Black: 651#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 ~n1~0) (<= 1 ~q1_back~0) (<= 1 |thread2Thread1of1ForFork0_~j~0#1|) (= ~q1~0.offset 0) (or (not (= 0 ~q2_front~0)) (not (= (select (select |#memory_int#1| ~q2~0.base) 0) 0))) (or (not (= 0 ~q2_front~0)) (and (<= ~q2_back~0 0) (or (not (= ~q2_back~0 0)) (= (select (select |#memory_int#1| ~q1~0.base) 0) 1)) (= ~q1_front~0 0)) (< ~n1~0 (+ ~q1_back~0 1))) (= ~q2~0.offset 0) (or (not (= 0 ~q2_front~0)) (and (<= ~q2_back~0 0) (or (not (= ~q2_back~0 0)) (= |thread2Thread1of1ForFork0_~j~0#1| 1))) (not (= |thread2Thread1of1ForFork0_~j~0#1| (select (select |#memory_int#1| ~q2~0.base) (* ~q2_back~0 4))))) (<= ~q2_front~0 0) (<= ~n1~0 2) (or (< 0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (< ~q1_front~0 0) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1)))), Black: 655#(and (<= ~q1_front~0 ~q1_back~0) (or (and (<= ~q2_back~0 0) (= ~q1_front~0 0)) (not (= 0 ~q2_front~0)) (not (= ~q1_back~0 0))) (= ~q1~0.offset 0) (or (not (= 0 ~q2_front~0)) (not (= (select (select |#memory_int#1| ~q2~0.base) 0) 0))) (or (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)) (< 0 |thread2Thread1of1ForFork0_~j~0#1|)) (= ~q2~0.offset 0) (<= ~q2_front~0 0) (<= ~n1~0 2) (or (not (= 0 ~q2_front~0)) (and (<= ~q2_back~0 0) (or (not (= ~q2_back~0 0)) (= |thread2Thread1of1ForFork0_~j~0#1| 1))) (not (= |thread2Thread1of1ForFork0_~j~0#1| (select (select |#memory_int#1| ~q2~0.base) (* ~q2_back~0 4)))) (< ~n1~0 (+ ~q1_back~0 1))) (or (< 0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (< ~q1_front~0 0) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1)))), Black: 62#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 557#(and (<= ~q1_front~0 ~q1_back~0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~q2_front~0 ~q2_back~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (or (< ~q1_front~0 0) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 2))) (or (not (= ~q1_back~0 0)) (and (= ~q1_front~0 0) (= ~q2_back~0 ~q2_front~0))) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (or (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= ~q1_back~0 0))), Black: 484#(or (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)) (< 0 |thread2Thread1of1ForFork0_~j~0#1|)), Black: 631#(and (<= 1 ~n1~0) (<= 1 ~q1_back~0) (<= 1 |thread2Thread1of1ForFork0_~j~0#1|) (= ~q1~0.offset 0) (or (< (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0)) (< ~q2_front~0 1)) (exists ((v_~q1_back~0_135 Int)) (and (<= (+ v_~q1_back~0_135 1) ~q1_back~0) (= (select (select |#memory_int#1| ~q1~0.base) (* v_~q1_back~0_135 4)) 1) (<= ~q1_front~0 v_~q1_back~0_135))) (= ~q2~0.offset 0) (<= ~n1~0 2)), Black: 567#(and (or (and (<= ~q2_back~0 0) (= ~q1_front~0 0)) (not (= 0 ~q2_front~0)) (< ~n1~0 (+ ~q1_back~0 1))) (= ~q1~0.offset 0) (or (not (= |thread2Thread1of1ForFork0_~j~0#1| (select (select |#memory_int#1| ~q2~0.base) 0))) (not (= 0 ~q2_front~0)) (not (= ~q2_back~0 0)) (= |thread2Thread1of1ForFork0_~j~0#1| 1) (< ~n1~0 (+ ~q1_back~0 1))) (or (< (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0)) (< ~q2_front~0 1)) (exists ((v_~q1_back~0_135 Int)) (and (<= (+ v_~q1_back~0_135 1) ~q1_back~0) (= (select (select |#memory_int#1| ~q1~0.base) (* v_~q1_back~0_135 4)) 1) (<= ~q1_front~0 v_~q1_back~0_135))) (= ~q2~0.offset 0) (or (not (= 0 ~q2_front~0)) (not (= ~q1_back~0 0))) (<= ~n1~0 2)), Black: 559#(and (<= ~q1_front~0 ~q1_back~0) (= ~q1~0.offset 0) (or (not (= ~q1_back~0 0)) (and (= ~q1_front~0 0) (<= ~q2_back~0 ~q2_front~0))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) (<= ~n1~0 2) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~q2_front~0) (+ ~q2_back~0 1))), Black: 657#(and (<= 1 ~n1~0) (or (and (<= ~q2_back~0 0) (= ~q1_front~0 0)) (not (= 0 ~q2_front~0)) (< ~n1~0 (+ ~q1_back~0 1))) (<= 1 ~q1_back~0) (<= 1 |thread2Thread1of1ForFork0_~j~0#1|) (= ~q1~0.offset 0) (or (not (= 0 ~q2_front~0)) (not (= (select (select |#memory_int#1| ~q2~0.base) 0) 0))) (exists ((v_~q1_back~0_135 Int)) (and (<= (+ v_~q1_back~0_135 1) ~q1_back~0) (= (select (select |#memory_int#1| ~q1~0.base) (* v_~q1_back~0_135 4)) 1) (<= ~q1_front~0 v_~q1_back~0_135))) (= ~q2~0.offset 0) (<= ~q2_front~0 0) (<= ~n1~0 2)), Black: 599#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 ~n1~0) (<= 1 ~q1_back~0) (<= 1 |thread2Thread1of1ForFork0_~j~0#1|) (= ~q1~0.offset 0) (or (not (= 0 ~q2_front~0)) (not (= (select (select |#memory_int#1| ~q2~0.base) 0) 0))) (= ~q2~0.offset 0) (<= ~q2_front~0 0) (<= ~n1~0 2) (or (< 0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (< ~q1_front~0 0) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1)))), Black: 68#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), Black: 609#(and (<= ~q1_front~0 ~q1_back~0) (or (< ~q1_front~0 0) (< 0 (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n1~0 2) (not (= |thread3Thread1of1ForFork1_~k~0#1| 0))), Black: 571#(and (<= ~q1_front~0 ~q1_back~0) (= ~q1~0.offset 0) (or (< (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0)) (< ~q2_front~0 1)) (or (and (<= 1 ~n1~0) (<= 1 ~q1_back~0) (<= 1 |thread2Thread1of1ForFork0_~j~0#1|)) (and (<= 1 ~n1~0) (<= 2 ~q1_back~0))) (= ~q2~0.offset 0) (<= ~n1~0 2) (or (not (= 0 ~q2_front~0)) (and (<= ~q2_back~0 0) (or (not (= ~q2_back~0 0)) (= |thread2Thread1of1ForFork0_~j~0#1| 1))) (not (= |thread2Thread1of1ForFork0_~j~0#1| (select (select |#memory_int#1| ~q2~0.base) (* ~q2_back~0 4)))) (< ~n1~0 (+ ~q1_back~0 1))) (or (< 0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (< ~q1_front~0 0) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1)))), 50#true, Black: 625#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 ~n1~0) (<= 1 ~q1_back~0) (<= 1 |thread2Thread1of1ForFork0_~j~0#1|) (= ~q1~0.offset 0) (or (< (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0)) (< ~q2_front~0 1)) (= ~q2~0.offset 0) (<= ~n1~0 2)), Black: 613#(and (<= 1 ~n1~0) (or (and (<= ~q2_back~0 0) (= ~q1_front~0 0)) (not (= 0 ~q2_front~0)) (< ~n1~0 (+ ~q1_back~0 1))) (<= 1 ~q1_back~0) (<= 1 |thread2Thread1of1ForFork0_~j~0#1|) (= ~q1~0.offset 0) (or (< (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0)) (< ~q2_front~0 1)) (exists ((v_~q1_back~0_135 Int)) (and (<= (+ v_~q1_back~0_135 1) ~q1_back~0) (= (select (select |#memory_int#1| ~q1~0.base) (* v_~q1_back~0_135 4)) 1) (<= ~q1_front~0 v_~q1_back~0_135))) (= ~q2~0.offset 0) (<= ~n1~0 2)), Black: 581#(and (<= 1 ~n1~0) (or (and (<= ~q2_back~0 0) (= ~q1_front~0 0)) (not (= 0 ~q2_front~0)) (< ~n1~0 (+ ~q1_back~0 1))) (<= 1 ~q1_back~0) (<= 1 |thread2Thread1of1ForFork0_~j~0#1|) (= ~q1~0.offset 0) (or (< (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0)) (< ~q2_front~0 1)) (exists ((v_~q1_back~0_135 Int)) (and (<= (+ v_~q1_back~0_135 1) ~q1_back~0) (= (select (select |#memory_int#1| ~q1~0.base) (* v_~q1_back~0_135 4)) 1) (<= ~q1_front~0 v_~q1_back~0_135))) (= ~q2~0.offset 0) (or (not (= 0 ~q2_front~0)) (and (<= ~q2_back~0 0) (or (not (= ~q2_back~0 0)) (= |thread2Thread1of1ForFork0_~j~0#1| 1))) (not (= |thread2Thread1of1ForFork0_~j~0#1| (select (select |#memory_int#1| ~q2~0.base) (* ~q2_back~0 4))))) (<= ~n1~0 2)), Black: 621#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 ~n1~0) (<= 1 ~q1_back~0) (<= 1 |thread2Thread1of1ForFork0_~j~0#1|) (or (< ~q1_front~0 0) (< 0 (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n1~0 2) (not (= |thread3Thread1of1ForFork1_~k~0#1| 0))), Black: 653#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 ~n1~0) (<= 1 ~q1_back~0) (<= 1 |thread2Thread1of1ForFork0_~j~0#1|) (<= ~n1~0 2) (not (= |thread3Thread1of1ForFork1_~k~0#1| 0))), Black: 635#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 ~n1~0) (<= 1 ~q1_back~0) (<= 1 |thread2Thread1of1ForFork0_~j~0#1|) (<= ~n1~0 2)), Black: 78#(and (or (< ~N~0 (+ ~t~0 1)) (< (+ ~N~0 |thread3Thread1of1ForFork1_~k~0#1|) (+ ~t~0 1))) (or (< ~t~0 (+ ~N~0 |thread3Thread1of1ForFork1_~k~0#1| 1)) (< ~t~0 (+ ~N~0 1)))), Black: 663#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 ~n1~0) (<= 1 ~q1_back~0) (<= 1 |thread2Thread1of1ForFork0_~j~0#1|) (= ~q1~0.offset 0) (or (< (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0)) (< ~q2_front~0 1)) (= ~q2~0.offset 0) (<= ~n1~0 2) (or (< 0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (< ~q1_front~0 0) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1)))), Black: 76#(and (<= 0 ~N~0) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (= ~t~0 0)), Black: 723#(<= ~q2_back~0 ~q2_front~0), 971#(and (<= ~q1_front~0 ~q1_back~0) (= ~q1~0.offset 0) (<= ~n1~0 2) (or (not (= ~q1_back~0 0)) (and (<= (mod |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1073741823) (= ~q1_front~0 0)))), 41#L70true, 36#L87-2true, 724#(<= ~q2_back~0 (+ 1 ~q2_front~0))]) [2024-11-19 01:54:35,241 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2024-11-19 01:54:35,241 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-11-19 01:54:35,241 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-11-19 01:54:35,242 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-19 01:54:35,812 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([713] L87-3-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork1_#res#1.base_1| 0) (= |v_thread3Thread1of1ForFork1_#res#1.offset_1| 0)) InVars {} OutVars{thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_1|, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res#1.offset, thread3Thread1of1ForFork1_#res#1.base][303], [72#true, Black: 579#(and (or (and (<= ~q2_back~0 0) (= ~q1_front~0 0)) (not (= 0 ~q2_front~0)) (< ~n1~0 (+ ~q1_back~0 1))) (= ~q1~0.offset 0) (or (< (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0)) (< ~q2_front~0 1)) (exists ((v_~q1_back~0_135 Int)) (and (<= (+ v_~q1_back~0_135 1) ~q1_back~0) (= (select (select |#memory_int#1| ~q1~0.base) (* v_~q1_back~0_135 4)) 1) (<= ~q1_front~0 v_~q1_back~0_135))) (= ~q2~0.offset 0) (or (not (= 0 ~q2_front~0)) (and (<= ~q2_back~0 0) (or (not (= ~q2_back~0 0)) (= |thread2Thread1of1ForFork0_~j~0#1| 1))) (not (= |thread2Thread1of1ForFork0_~j~0#1| (select (select |#memory_int#1| ~q2~0.base) (* ~q2_back~0 4))))) (or (not (= 0 ~q2_front~0)) (not (= ~q1_back~0 0))) (<= ~n1~0 2)), 9#L52true, Black: 583#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 ~n1~0) (<= 1 ~q1_back~0) (<= 1 |thread2Thread1of1ForFork0_~j~0#1|) (= ~q1~0.offset 0) (or (< (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0)) (< ~q2_front~0 1)) (or (not (= 0 ~q2_front~0)) (and (<= ~q2_back~0 0) (or (not (= ~q2_back~0 0)) (= (select (select |#memory_int#1| ~q1~0.base) 0) 1)) (= ~q1_front~0 0)) (< ~n1~0 (+ ~q1_back~0 1))) (= ~q2~0.offset 0) (or (not (= 0 ~q2_front~0)) (and (<= ~q2_back~0 0) (or (not (= ~q2_back~0 0)) (= |thread2Thread1of1ForFork0_~j~0#1| 1))) (not (= |thread2Thread1of1ForFork0_~j~0#1| (select (select |#memory_int#1| ~q2~0.base) (* ~q2_back~0 4))))) (<= ~n1~0 2) (or (< 0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (< ~q1_front~0 0) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1)))), Black: 671#(and (<= ~q1_front~0 ~q1_back~0) (or (and (<= ~q2_back~0 0) (= ~q1_front~0 0)) (not (= 0 ~q2_front~0)) (not (= ~q1_back~0 0))) (= ~q1~0.offset 0) (or (not (= 0 ~q2_front~0)) (not (= (select (select |#memory_int#1| ~q2~0.base) 0) 0))) (= ~q2~0.offset 0) (<= ~q2_front~0 0) (<= ~n1~0 2) (or (< 0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (< ~q1_front~0 0) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1)))), Black: 619#(and (<= ~q1_front~0 ~q1_back~0) (= ~q1~0.offset 0) (or (not (= 0 ~q2_front~0)) (not (= (select (select |#memory_int#1| ~q2~0.base) 0) 0))) (or (and (<= 1 ~n1~0) (<= 1 ~q1_back~0) (<= 1 |thread2Thread1of1ForFork0_~j~0#1|)) (and (<= 1 ~n1~0) (<= 2 ~q1_back~0))) (= ~q2~0.offset 0) (<= ~q2_front~0 0) (<= ~n1~0 2) (or (< 0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (< ~q1_front~0 0) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1)))), Black: 595#(and (<= 1 ~n1~0) (<= 1 ~q1_back~0) (<= 1 |thread2Thread1of1ForFork0_~j~0#1|) (= ~q1~0.offset 0) (or (not (= 0 ~q2_front~0)) (not (= (select (select |#memory_int#1| ~q2~0.base) 0) 0))) (exists ((v_~q1_back~0_135 Int)) (and (<= (+ v_~q1_back~0_135 1) ~q1_back~0) (= (select (select |#memory_int#1| ~q1~0.base) (* v_~q1_back~0_135 4)) 1) (<= ~q1_front~0 v_~q1_back~0_135))) (= ~q2~0.offset 0) (<= ~q2_front~0 0) (<= ~n1~0 2)), Black: 643#(and (<= 1 |thread2Thread1of1ForFork0_~j~0#1|) (not (= |thread3Thread1of1ForFork1_~k~0#1| 0))), Black: 661#(and (<= 1 ~n1~0) (<= 1 ~q1_back~0) (<= 1 |thread2Thread1of1ForFork0_~j~0#1|) (or (not (= 0 ~q2_front~0)) (not (= (select (select |#memory_int#1| ~q2~0.base) 0) 0))) (= ~q2~0.offset 0) (<= ~q2_front~0 0) (<= ~n1~0 2) (exists ((v_~q1_back~0_135 Int)) (and (<= (+ v_~q1_back~0_135 1) ~q1_back~0) (= (select (select |#memory_int#1| ~q1~0.base) (+ (* v_~q1_back~0_135 4) ~q1~0.offset)) 1) (<= ~q1_front~0 v_~q1_back~0_135)))), Black: 665#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 ~n1~0) (<= 1 ~q1_back~0) (<= 1 |thread2Thread1of1ForFork0_~j~0#1|) (or (not (= 0 ~q2_front~0)) (not (= (select (select |#memory_int#1| ~q2~0.base) 0) 0))) (= ~q2~0.offset 0) (<= ~q2_front~0 0) (<= ~n1~0 2)), Black: 627#(and (<= ~q1_front~0 ~q1_back~0) (or (and (<= ~q2_back~0 0) (= ~q1_front~0 0)) (not (= 0 ~q2_front~0)) (not (= ~q1_back~0 0))) (= ~q1~0.offset 0) (or (not (= 0 ~q2_front~0)) (not (= (select (select |#memory_int#1| ~q2~0.base) 0) 0))) (or (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)) (< 0 |thread2Thread1of1ForFork0_~j~0#1|)) (= ~q2~0.offset 0) (<= ~q2_front~0 0) (<= ~n1~0 2) (or (< 0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (< ~q1_front~0 0) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1)))), Black: 633#(and (<= ~q1_front~0 ~q1_back~0) (= ~q1~0.offset 0) (or (not (= 0 ~q2_front~0)) (not (= (select (select |#memory_int#1| ~q2~0.base) 0) 0))) (or (and (<= 1 ~n1~0) (<= 1 ~q1_back~0) (<= 1 |thread2Thread1of1ForFork0_~j~0#1|)) (and (<= 1 ~n1~0) (<= 2 ~q1_back~0))) (= ~q2~0.offset 0) (<= ~q2_front~0 0) (<= ~n1~0 2) (or (not (= 0 ~q2_front~0)) (and (<= ~q2_back~0 0) (or (not (= ~q2_back~0 0)) (= |thread2Thread1of1ForFork0_~j~0#1| 1))) (not (= |thread2Thread1of1ForFork0_~j~0#1| (select (select |#memory_int#1| ~q2~0.base) (* ~q2_back~0 4)))) (< ~n1~0 (+ ~q1_back~0 1))) (or (< 0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (< ~q1_front~0 0) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1)))), Black: 603#(and (<= ~q1_front~0 ~q1_back~0) (or (and (<= ~q2_back~0 0) (= ~q1_front~0 0)) (not (= 0 ~q2_front~0)) (not (= ~q1_back~0 0))) (= ~q1~0.offset 0) (or (< (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0)) (< ~q2_front~0 1)) (or (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)) (< 0 |thread2Thread1of1ForFork0_~j~0#1|)) (= ~q2~0.offset 0) (<= ~n1~0 2) (or (< 0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (< ~q1_front~0 0) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1)))), Black: 611#(and (<= ~q1_front~0 ~q1_back~0) (or (and (<= ~q2_back~0 0) (= ~q1_front~0 0)) (not (= 0 ~q2_front~0)) (not (= ~q1_back~0 0))) (= ~q1~0.offset 0) (or (< (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0)) (< ~q2_front~0 1)) (or (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)) (< 0 |thread2Thread1of1ForFork0_~j~0#1|)) (= ~q2~0.offset 0) (<= ~n1~0 2) (or (not (= 0 ~q2_front~0)) (and (<= ~q2_back~0 0) (or (not (= ~q2_back~0 0)) (= |thread2Thread1of1ForFork0_~j~0#1| 1))) (not (= |thread2Thread1of1ForFork0_~j~0#1| (select (select |#memory_int#1| ~q2~0.base) (* ~q2_back~0 4)))) (< ~n1~0 (+ ~q1_back~0 1))) (or (< 0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (< ~q1_front~0 0) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1)))), Black: 629#(and (or (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)) (< 0 |thread2Thread1of1ForFork0_~j~0#1|)) (not (= |thread3Thread1of1ForFork1_~k~0#1| 0))), Black: 585#(and (<= 1 ~n1~0) (or (and (<= ~q2_back~0 0) (= ~q1_front~0 0)) (not (= 0 ~q2_front~0)) (< ~n1~0 (+ ~q1_back~0 1))) (<= 1 ~q1_back~0) (<= 1 |thread2Thread1of1ForFork0_~j~0#1|) (= ~q1~0.offset 0) (or (not (= |thread2Thread1of1ForFork0_~j~0#1| (select (select |#memory_int#1| ~q2~0.base) 0))) (not (= 0 ~q2_front~0)) (not (= ~q2_back~0 0)) (= |thread2Thread1of1ForFork0_~j~0#1| 1) (< ~n1~0 (+ ~q1_back~0 1))) (or (< (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0)) (< ~q2_front~0 1)) (exists ((v_~q1_back~0_135 Int)) (and (<= (+ v_~q1_back~0_135 1) ~q1_back~0) (= (select (select |#memory_int#1| ~q1~0.base) (* v_~q1_back~0_135 4)) 1) (<= ~q1_front~0 v_~q1_back~0_135))) (= ~q2~0.offset 0) (<= ~n1~0 2)), Black: 601#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 ~n1~0) (<= 1 ~q1_back~0) (<= 1 |thread2Thread1of1ForFork0_~j~0#1|) (or (< ~q1_front~0 0) (< 0 (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n1~0 2)), Black: 659#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 ~n1~0) (<= 1 ~q1_back~0) (<= 1 |thread2Thread1of1ForFork0_~j~0#1|) (= ~q1~0.offset 0) (or (not (= 0 ~q2_front~0)) (not (= (select (select |#memory_int#1| ~q2~0.base) 0) 0))) (= ~q2~0.offset 0) (<= ~q2_front~0 0) (<= ~n1~0 2)), Black: 86#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1)), 27#thread3EXITtrue, Black: 615#(and (<= ~q1_front~0 ~q1_back~0) (or (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)) (< 0 |thread2Thread1of1ForFork0_~j~0#1|)) (or (< ~q1_front~0 0) (< 0 (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n1~0 2) (not (= |thread3Thread1of1ForFork1_~k~0#1| 0))), Black: 87#(<= ~n1~0 1), Black: 647#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 ~n1~0) (<= 1 ~q1_back~0) (<= 1 |thread2Thread1of1ForFork0_~j~0#1|) (= ~q1~0.offset 0) (or (not (= |thread2Thread1of1ForFork0_~j~0#1| (select (select |#memory_int#1| ~q2~0.base) 0))) (not (= 0 ~q2_front~0)) (not (= ~q2_back~0 0)) (= |thread2Thread1of1ForFork0_~j~0#1| 1) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= 0 ~q2_front~0)) (not (= (select (select |#memory_int#1| ~q2~0.base) 0) 0))) (or (not (= 0 ~q2_front~0)) (and (<= ~q2_back~0 0) (or (not (= ~q2_back~0 0)) (= (select (select |#memory_int#1| ~q1~0.base) 0) 1)) (= ~q1_front~0 0)) (< ~n1~0 (+ ~q1_back~0 1))) (= ~q2~0.offset 0) (<= ~q2_front~0 0) (<= ~n1~0 2) (or (< 0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (< ~q1_front~0 0) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1)))), Black: 597#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 ~n1~0) (<= 1 ~q1_back~0) (<= 1 |thread2Thread1of1ForFork0_~j~0#1|) (= ~q1~0.offset 0) (or (not (= |thread2Thread1of1ForFork0_~j~0#1| (select (select |#memory_int#1| ~q2~0.base) 0))) (not (= 0 ~q2_front~0)) (not (= ~q2_back~0 0)) (= |thread2Thread1of1ForFork0_~j~0#1| 1) (< ~n1~0 (+ ~q1_back~0 1))) (or (< (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0)) (< ~q2_front~0 1)) (or (not (= 0 ~q2_front~0)) (and (<= ~q2_back~0 0) (or (not (= ~q2_back~0 0)) (= (select (select |#memory_int#1| ~q1~0.base) 0) 1)) (= ~q1_front~0 0)) (< ~n1~0 (+ ~q1_back~0 1))) (= ~q2~0.offset 0) (<= ~n1~0 2) (or (< 0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (< ~q1_front~0 0) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1)))), Black: 641#(and (<= 1 ~n1~0) (or (and (<= ~q2_back~0 0) (= ~q1_front~0 0)) (not (= 0 ~q2_front~0)) (< ~n1~0 (+ ~q1_back~0 1))) (<= 1 ~q1_back~0) (<= 1 |thread2Thread1of1ForFork0_~j~0#1|) (= ~q1~0.offset 0) (or (not (= 0 ~q2_front~0)) (not (= (select (select |#memory_int#1| ~q2~0.base) 0) 0))) (exists ((v_~q1_back~0_135 Int)) (and (<= (+ v_~q1_back~0_135 1) ~q1_back~0) (= (select (select |#memory_int#1| ~q1~0.base) (* v_~q1_back~0_135 4)) 1) (<= ~q1_front~0 v_~q1_back~0_135))) (= ~q2~0.offset 0) (or (not (= 0 ~q2_front~0)) (and (<= ~q2_back~0 0) (or (not (= ~q2_back~0 0)) (= |thread2Thread1of1ForFork0_~j~0#1| 1))) (not (= |thread2Thread1of1ForFork0_~j~0#1| (select (select |#memory_int#1| ~q2~0.base) (* ~q2_back~0 4))))) (<= ~q2_front~0 0) (<= ~n1~0 2)), Black: 393#(<= 1 |thread2Thread1of1ForFork0_~j~0#1|), Black: 589#(and (<= 1 ~n1~0) (<= 1 ~q1_back~0) (<= 1 |thread2Thread1of1ForFork0_~j~0#1|) (<= ~n1~0 2) (exists ((v_~q1_back~0_135 Int)) (and (<= (+ v_~q1_back~0_135 1) ~q1_back~0) (= (select (select |#memory_int#1| ~q1~0.base) (+ (* v_~q1_back~0_135 4) ~q1~0.offset)) 1) (<= ~q1_front~0 v_~q1_back~0_135)))), Black: 54#(= ~q1_back~0 ~q1_front~0), Black: 607#(and (<= 1 ~n1~0) (or (and (<= ~q2_back~0 0) (= ~q1_front~0 0)) (not (= 0 ~q2_front~0)) (< ~n1~0 (+ ~q1_back~0 1))) (<= 1 ~q1_back~0) (<= 1 |thread2Thread1of1ForFork0_~j~0#1|) (= ~q1~0.offset 0) (or (not (= |thread2Thread1of1ForFork0_~j~0#1| (select (select |#memory_int#1| ~q2~0.base) 0))) (not (= 0 ~q2_front~0)) (not (= ~q2_back~0 0)) (= |thread2Thread1of1ForFork0_~j~0#1| 1) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= 0 ~q2_front~0)) (not (= (select (select |#memory_int#1| ~q2~0.base) 0) 0))) (exists ((v_~q1_back~0_135 Int)) (and (<= (+ v_~q1_back~0_135 1) ~q1_back~0) (= (select (select |#memory_int#1| ~q1~0.base) (* v_~q1_back~0_135 4)) 1) (<= ~q1_front~0 v_~q1_back~0_135))) (= ~q2~0.offset 0) (<= ~q2_front~0 0) (<= ~n1~0 2)), Black: 673#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 ~n1~0) (<= 1 ~q1_back~0) (<= 1 |thread2Thread1of1ForFork0_~j~0#1|) (or (not (= 0 ~q2_front~0)) (not (= (select (select |#memory_int#1| ~q2~0.base) 0) 0))) (= ~q2~0.offset 0) (or (< ~q1_front~0 0) (< 0 (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~q2_front~0 0) (<= ~n1~0 2)), Black: 623#(and (<= ~q1_front~0 ~q1_back~0) (or (and (<= 1 ~n1~0) (<= 1 ~q1_back~0) (<= 1 |thread2Thread1of1ForFork0_~j~0#1|)) (and (<= 1 ~n1~0) (<= 2 ~q1_back~0))) (or (< ~q1_front~0 0) (< 0 (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n1~0 2) (not (= |thread3Thread1of1ForFork1_~k~0#1| 0))), Black: 58#(<= ~q2_back~0 ~q2_front~0), Black: 569#(and (<= ~q1_front~0 ~q1_back~0) (or (and (<= ~q2_back~0 0) (= ~q1_front~0 0)) (not (= 0 ~q2_front~0)) (not (= ~q1_back~0 0))) (= ~q1~0.offset 0) (or (< (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0)) (< ~q2_front~0 1)) (= ~q2~0.offset 0) (<= ~n1~0 2) (or (< 0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (< ~q1_front~0 0) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1)))), Black: 617#(and (<= 1 ~n1~0) (<= 1 ~q1_back~0) (<= 1 |thread2Thread1of1ForFork0_~j~0#1|) (<= ~n1~0 2) (exists ((v_~q1_back~0_135 Int)) (and (<= (+ v_~q1_back~0_135 1) ~q1_back~0) (= (select (select |#memory_int#1| ~q1~0.base) (+ (* v_~q1_back~0_135 4) ~q1~0.offset)) 1) (<= ~q1_front~0 v_~q1_back~0_135))) (not (= |thread3Thread1of1ForFork1_~k~0#1| 0))), Black: 577#(and (<= ~q1_front~0 ~q1_back~0) (= ~q1~0.offset 0) (or (< (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0)) (< ~q2_front~0 1)) (or (and (<= 1 ~n1~0) (<= 1 ~q1_back~0) (<= 1 |thread2Thread1of1ForFork0_~j~0#1|)) (and (<= 1 ~n1~0) (<= 2 ~q1_back~0))) (= ~q2~0.offset 0) (<= ~n1~0 2) (or (< 0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (< ~q1_front~0 0) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1)))), Black: 522#(or (< ~q1_front~0 0) (< ~n1~0 (+ ~q1_front~0 2)) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 2))), Black: 651#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 ~n1~0) (<= 1 ~q1_back~0) (<= 1 |thread2Thread1of1ForFork0_~j~0#1|) (= ~q1~0.offset 0) (or (not (= 0 ~q2_front~0)) (not (= (select (select |#memory_int#1| ~q2~0.base) 0) 0))) (or (not (= 0 ~q2_front~0)) (and (<= ~q2_back~0 0) (or (not (= ~q2_back~0 0)) (= (select (select |#memory_int#1| ~q1~0.base) 0) 1)) (= ~q1_front~0 0)) (< ~n1~0 (+ ~q1_back~0 1))) (= ~q2~0.offset 0) (or (not (= 0 ~q2_front~0)) (and (<= ~q2_back~0 0) (or (not (= ~q2_back~0 0)) (= |thread2Thread1of1ForFork0_~j~0#1| 1))) (not (= |thread2Thread1of1ForFork0_~j~0#1| (select (select |#memory_int#1| ~q2~0.base) (* ~q2_back~0 4))))) (<= ~q2_front~0 0) (<= ~n1~0 2) (or (< 0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (< ~q1_front~0 0) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1)))), Black: 655#(and (<= ~q1_front~0 ~q1_back~0) (or (and (<= ~q2_back~0 0) (= ~q1_front~0 0)) (not (= 0 ~q2_front~0)) (not (= ~q1_back~0 0))) (= ~q1~0.offset 0) (or (not (= 0 ~q2_front~0)) (not (= (select (select |#memory_int#1| ~q2~0.base) 0) 0))) (or (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)) (< 0 |thread2Thread1of1ForFork0_~j~0#1|)) (= ~q2~0.offset 0) (<= ~q2_front~0 0) (<= ~n1~0 2) (or (not (= 0 ~q2_front~0)) (and (<= ~q2_back~0 0) (or (not (= ~q2_back~0 0)) (= |thread2Thread1of1ForFork0_~j~0#1| 1))) (not (= |thread2Thread1of1ForFork0_~j~0#1| (select (select |#memory_int#1| ~q2~0.base) (* ~q2_back~0 4)))) (< ~n1~0 (+ ~q1_back~0 1))) (or (< 0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (< ~q1_front~0 0) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1)))), Black: 62#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 557#(and (<= ~q1_front~0 ~q1_back~0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~q2_front~0 ~q2_back~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (or (< ~q1_front~0 0) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 2))) (or (not (= ~q1_back~0 0)) (and (= ~q1_front~0 0) (= ~q2_back~0 ~q2_front~0))) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (or (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= ~q1_back~0 0))), Black: 484#(or (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)) (< 0 |thread2Thread1of1ForFork0_~j~0#1|)), Black: 631#(and (<= 1 ~n1~0) (<= 1 ~q1_back~0) (<= 1 |thread2Thread1of1ForFork0_~j~0#1|) (= ~q1~0.offset 0) (or (< (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0)) (< ~q2_front~0 1)) (exists ((v_~q1_back~0_135 Int)) (and (<= (+ v_~q1_back~0_135 1) ~q1_back~0) (= (select (select |#memory_int#1| ~q1~0.base) (* v_~q1_back~0_135 4)) 1) (<= ~q1_front~0 v_~q1_back~0_135))) (= ~q2~0.offset 0) (<= ~n1~0 2)), Black: 567#(and (or (and (<= ~q2_back~0 0) (= ~q1_front~0 0)) (not (= 0 ~q2_front~0)) (< ~n1~0 (+ ~q1_back~0 1))) (= ~q1~0.offset 0) (or (not (= |thread2Thread1of1ForFork0_~j~0#1| (select (select |#memory_int#1| ~q2~0.base) 0))) (not (= 0 ~q2_front~0)) (not (= ~q2_back~0 0)) (= |thread2Thread1of1ForFork0_~j~0#1| 1) (< ~n1~0 (+ ~q1_back~0 1))) (or (< (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0)) (< ~q2_front~0 1)) (exists ((v_~q1_back~0_135 Int)) (and (<= (+ v_~q1_back~0_135 1) ~q1_back~0) (= (select (select |#memory_int#1| ~q1~0.base) (* v_~q1_back~0_135 4)) 1) (<= ~q1_front~0 v_~q1_back~0_135))) (= ~q2~0.offset 0) (or (not (= 0 ~q2_front~0)) (not (= ~q1_back~0 0))) (<= ~n1~0 2)), Black: 559#(and (<= ~q1_front~0 ~q1_back~0) (= ~q1~0.offset 0) (or (not (= ~q1_back~0 0)) (and (= ~q1_front~0 0) (<= ~q2_back~0 ~q2_front~0))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) (<= ~n1~0 2) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~q2_front~0) (+ ~q2_back~0 1))), Black: 657#(and (<= 1 ~n1~0) (or (and (<= ~q2_back~0 0) (= ~q1_front~0 0)) (not (= 0 ~q2_front~0)) (< ~n1~0 (+ ~q1_back~0 1))) (<= 1 ~q1_back~0) (<= 1 |thread2Thread1of1ForFork0_~j~0#1|) (= ~q1~0.offset 0) (or (not (= 0 ~q2_front~0)) (not (= (select (select |#memory_int#1| ~q2~0.base) 0) 0))) (exists ((v_~q1_back~0_135 Int)) (and (<= (+ v_~q1_back~0_135 1) ~q1_back~0) (= (select (select |#memory_int#1| ~q1~0.base) (* v_~q1_back~0_135 4)) 1) (<= ~q1_front~0 v_~q1_back~0_135))) (= ~q2~0.offset 0) (<= ~q2_front~0 0) (<= ~n1~0 2)), Black: 599#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 ~n1~0) (<= 1 ~q1_back~0) (<= 1 |thread2Thread1of1ForFork0_~j~0#1|) (= ~q1~0.offset 0) (or (not (= 0 ~q2_front~0)) (not (= (select (select |#memory_int#1| ~q2~0.base) 0) 0))) (= ~q2~0.offset 0) (<= ~q2_front~0 0) (<= ~n1~0 2) (or (< 0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (< ~q1_front~0 0) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1)))), Black: 68#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), Black: 609#(and (<= ~q1_front~0 ~q1_back~0) (or (< ~q1_front~0 0) (< 0 (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n1~0 2) (not (= |thread3Thread1of1ForFork1_~k~0#1| 0))), Black: 571#(and (<= ~q1_front~0 ~q1_back~0) (= ~q1~0.offset 0) (or (< (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0)) (< ~q2_front~0 1)) (or (and (<= 1 ~n1~0) (<= 1 ~q1_back~0) (<= 1 |thread2Thread1of1ForFork0_~j~0#1|)) (and (<= 1 ~n1~0) (<= 2 ~q1_back~0))) (= ~q2~0.offset 0) (<= ~n1~0 2) (or (not (= 0 ~q2_front~0)) (and (<= ~q2_back~0 0) (or (not (= ~q2_back~0 0)) (= |thread2Thread1of1ForFork0_~j~0#1| 1))) (not (= |thread2Thread1of1ForFork0_~j~0#1| (select (select |#memory_int#1| ~q2~0.base) (* ~q2_back~0 4)))) (< ~n1~0 (+ ~q1_back~0 1))) (or (< 0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (< ~q1_front~0 0) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1)))), 50#true, Black: 625#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 ~n1~0) (<= 1 ~q1_back~0) (<= 1 |thread2Thread1of1ForFork0_~j~0#1|) (= ~q1~0.offset 0) (or (< (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0)) (< ~q2_front~0 1)) (= ~q2~0.offset 0) (<= ~n1~0 2)), Black: 613#(and (<= 1 ~n1~0) (or (and (<= ~q2_back~0 0) (= ~q1_front~0 0)) (not (= 0 ~q2_front~0)) (< ~n1~0 (+ ~q1_back~0 1))) (<= 1 ~q1_back~0) (<= 1 |thread2Thread1of1ForFork0_~j~0#1|) (= ~q1~0.offset 0) (or (< (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0)) (< ~q2_front~0 1)) (exists ((v_~q1_back~0_135 Int)) (and (<= (+ v_~q1_back~0_135 1) ~q1_back~0) (= (select (select |#memory_int#1| ~q1~0.base) (* v_~q1_back~0_135 4)) 1) (<= ~q1_front~0 v_~q1_back~0_135))) (= ~q2~0.offset 0) (<= ~n1~0 2)), Black: 581#(and (<= 1 ~n1~0) (or (and (<= ~q2_back~0 0) (= ~q1_front~0 0)) (not (= 0 ~q2_front~0)) (< ~n1~0 (+ ~q1_back~0 1))) (<= 1 ~q1_back~0) (<= 1 |thread2Thread1of1ForFork0_~j~0#1|) (= ~q1~0.offset 0) (or (< (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0)) (< ~q2_front~0 1)) (exists ((v_~q1_back~0_135 Int)) (and (<= (+ v_~q1_back~0_135 1) ~q1_back~0) (= (select (select |#memory_int#1| ~q1~0.base) (* v_~q1_back~0_135 4)) 1) (<= ~q1_front~0 v_~q1_back~0_135))) (= ~q2~0.offset 0) (or (not (= 0 ~q2_front~0)) (and (<= ~q2_back~0 0) (or (not (= ~q2_back~0 0)) (= |thread2Thread1of1ForFork0_~j~0#1| 1))) (not (= |thread2Thread1of1ForFork0_~j~0#1| (select (select |#memory_int#1| ~q2~0.base) (* ~q2_back~0 4))))) (<= ~n1~0 2)), 591#(and (<= ~q1_front~0 ~q1_back~0) (or (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)) (< 0 |thread2Thread1of1ForFork0_~j~0#1|)) (or (< ~q1_front~0 0) (< 0 (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n1~0 2)), Black: 621#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 ~n1~0) (<= 1 ~q1_back~0) (<= 1 |thread2Thread1of1ForFork0_~j~0#1|) (or (< ~q1_front~0 0) (< 0 (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n1~0 2) (not (= |thread3Thread1of1ForFork1_~k~0#1| 0))), Black: 653#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 ~n1~0) (<= 1 ~q1_back~0) (<= 1 |thread2Thread1of1ForFork0_~j~0#1|) (<= ~n1~0 2) (not (= |thread3Thread1of1ForFork1_~k~0#1| 0))), Black: 635#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 ~n1~0) (<= 1 ~q1_back~0) (<= 1 |thread2Thread1of1ForFork0_~j~0#1|) (<= ~n1~0 2)), Black: 663#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 ~n1~0) (<= 1 ~q1_back~0) (<= 1 |thread2Thread1of1ForFork0_~j~0#1|) (= ~q1~0.offset 0) (or (< (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0)) (< ~q2_front~0 1)) (= ~q2~0.offset 0) (<= ~n1~0 2) (or (< 0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (< ~q1_front~0 0) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1)))), Black: 78#(and (or (< ~N~0 (+ ~t~0 1)) (< (+ ~N~0 |thread3Thread1of1ForFork1_~k~0#1|) (+ ~t~0 1))) (or (< ~t~0 (+ ~N~0 |thread3Thread1of1ForFork1_~k~0#1| 1)) (< ~t~0 (+ ~N~0 1)))), Black: 76#(and (<= 0 ~N~0) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (= ~t~0 0)), Black: 723#(<= ~q2_back~0 ~q2_front~0), 971#(and (<= ~q1_front~0 ~q1_back~0) (= ~q1~0.offset 0) (<= ~n1~0 2) (or (not (= ~q1_back~0 0)) (and (<= (mod |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1073741823) (= ~q1_front~0 0)))), 41#L70true, 34#L121true, 724#(<= ~q2_back~0 (+ 1 ~q2_front~0))]) [2024-11-19 01:54:35,813 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2024-11-19 01:54:35,813 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-19 01:54:35,813 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-19 01:54:35,813 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-19 01:54:35,813 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([716] L94-->L87-2: Formula: (not (= |v_thread3Thread1of1ForFork1_~k~0#1_9| 0)) InVars {thread3Thread1of1ForFork1_~k~0#1=|v_thread3Thread1of1ForFork1_~k~0#1_9|} OutVars{thread3Thread1of1ForFork1_~k~0#1=|v_thread3Thread1of1ForFork1_~k~0#1_9|} AuxVars[] AssignedVars[][320], [615#(and (<= ~q1_front~0 ~q1_back~0) (or (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)) (< 0 |thread2Thread1of1ForFork0_~j~0#1|)) (or (< ~q1_front~0 0) (< 0 (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n1~0 2) (not (= |thread3Thread1of1ForFork1_~k~0#1| 0))), 72#true, Black: 579#(and (or (and (<= ~q2_back~0 0) (= ~q1_front~0 0)) (not (= 0 ~q2_front~0)) (< ~n1~0 (+ ~q1_back~0 1))) (= ~q1~0.offset 0) (or (< (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0)) (< ~q2_front~0 1)) (exists ((v_~q1_back~0_135 Int)) (and (<= (+ v_~q1_back~0_135 1) ~q1_back~0) (= (select (select |#memory_int#1| ~q1~0.base) (* v_~q1_back~0_135 4)) 1) (<= ~q1_front~0 v_~q1_back~0_135))) (= ~q2~0.offset 0) (or (not (= 0 ~q2_front~0)) (and (<= ~q2_back~0 0) (or (not (= ~q2_back~0 0)) (= |thread2Thread1of1ForFork0_~j~0#1| 1))) (not (= |thread2Thread1of1ForFork0_~j~0#1| (select (select |#memory_int#1| ~q2~0.base) (* ~q2_back~0 4))))) (or (not (= 0 ~q2_front~0)) (not (= ~q1_back~0 0))) (<= ~n1~0 2)), 9#L52true, Black: 583#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 ~n1~0) (<= 1 ~q1_back~0) (<= 1 |thread2Thread1of1ForFork0_~j~0#1|) (= ~q1~0.offset 0) (or (< (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0)) (< ~q2_front~0 1)) (or (not (= 0 ~q2_front~0)) (and (<= ~q2_back~0 0) (or (not (= ~q2_back~0 0)) (= (select (select |#memory_int#1| ~q1~0.base) 0) 1)) (= ~q1_front~0 0)) (< ~n1~0 (+ ~q1_back~0 1))) (= ~q2~0.offset 0) (or (not (= 0 ~q2_front~0)) (and (<= ~q2_back~0 0) (or (not (= ~q2_back~0 0)) (= |thread2Thread1of1ForFork0_~j~0#1| 1))) (not (= |thread2Thread1of1ForFork0_~j~0#1| (select (select |#memory_int#1| ~q2~0.base) (* ~q2_back~0 4))))) (<= ~n1~0 2) (or (< 0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (< ~q1_front~0 0) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1)))), Black: 671#(and (<= ~q1_front~0 ~q1_back~0) (or (and (<= ~q2_back~0 0) (= ~q1_front~0 0)) (not (= 0 ~q2_front~0)) (not (= ~q1_back~0 0))) (= ~q1~0.offset 0) (or (not (= 0 ~q2_front~0)) (not (= (select (select |#memory_int#1| ~q2~0.base) 0) 0))) (= ~q2~0.offset 0) (<= ~q2_front~0 0) (<= ~n1~0 2) (or (< 0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (< ~q1_front~0 0) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1)))), Black: 619#(and (<= ~q1_front~0 ~q1_back~0) (= ~q1~0.offset 0) (or (not (= 0 ~q2_front~0)) (not (= (select (select |#memory_int#1| ~q2~0.base) 0) 0))) (or (and (<= 1 ~n1~0) (<= 1 ~q1_back~0) (<= 1 |thread2Thread1of1ForFork0_~j~0#1|)) (and (<= 1 ~n1~0) (<= 2 ~q1_back~0))) (= ~q2~0.offset 0) (<= ~q2_front~0 0) (<= ~n1~0 2) (or (< 0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (< ~q1_front~0 0) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1)))), Black: 595#(and (<= 1 ~n1~0) (<= 1 ~q1_back~0) (<= 1 |thread2Thread1of1ForFork0_~j~0#1|) (= ~q1~0.offset 0) (or (not (= 0 ~q2_front~0)) (not (= (select (select |#memory_int#1| ~q2~0.base) 0) 0))) (exists ((v_~q1_back~0_135 Int)) (and (<= (+ v_~q1_back~0_135 1) ~q1_back~0) (= (select (select |#memory_int#1| ~q1~0.base) (* v_~q1_back~0_135 4)) 1) (<= ~q1_front~0 v_~q1_back~0_135))) (= ~q2~0.offset 0) (<= ~q2_front~0 0) (<= ~n1~0 2)), Black: 643#(and (<= 1 |thread2Thread1of1ForFork0_~j~0#1|) (not (= |thread3Thread1of1ForFork1_~k~0#1| 0))), Black: 661#(and (<= 1 ~n1~0) (<= 1 ~q1_back~0) (<= 1 |thread2Thread1of1ForFork0_~j~0#1|) (or (not (= 0 ~q2_front~0)) (not (= (select (select |#memory_int#1| ~q2~0.base) 0) 0))) (= ~q2~0.offset 0) (<= ~q2_front~0 0) (<= ~n1~0 2) (exists ((v_~q1_back~0_135 Int)) (and (<= (+ v_~q1_back~0_135 1) ~q1_back~0) (= (select (select |#memory_int#1| ~q1~0.base) (+ (* v_~q1_back~0_135 4) ~q1~0.offset)) 1) (<= ~q1_front~0 v_~q1_back~0_135)))), Black: 665#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 ~n1~0) (<= 1 ~q1_back~0) (<= 1 |thread2Thread1of1ForFork0_~j~0#1|) (or (not (= 0 ~q2_front~0)) (not (= (select (select |#memory_int#1| ~q2~0.base) 0) 0))) (= ~q2~0.offset 0) (<= ~q2_front~0 0) (<= ~n1~0 2)), Black: 627#(and (<= ~q1_front~0 ~q1_back~0) (or (and (<= ~q2_back~0 0) (= ~q1_front~0 0)) (not (= 0 ~q2_front~0)) (not (= ~q1_back~0 0))) (= ~q1~0.offset 0) (or (not (= 0 ~q2_front~0)) (not (= (select (select |#memory_int#1| ~q2~0.base) 0) 0))) (or (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)) (< 0 |thread2Thread1of1ForFork0_~j~0#1|)) (= ~q2~0.offset 0) (<= ~q2_front~0 0) (<= ~n1~0 2) (or (< 0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (< ~q1_front~0 0) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1)))), Black: 633#(and (<= ~q1_front~0 ~q1_back~0) (= ~q1~0.offset 0) (or (not (= 0 ~q2_front~0)) (not (= (select (select |#memory_int#1| ~q2~0.base) 0) 0))) (or (and (<= 1 ~n1~0) (<= 1 ~q1_back~0) (<= 1 |thread2Thread1of1ForFork0_~j~0#1|)) (and (<= 1 ~n1~0) (<= 2 ~q1_back~0))) (= ~q2~0.offset 0) (<= ~q2_front~0 0) (<= ~n1~0 2) (or (not (= 0 ~q2_front~0)) (and (<= ~q2_back~0 0) (or (not (= ~q2_back~0 0)) (= |thread2Thread1of1ForFork0_~j~0#1| 1))) (not (= |thread2Thread1of1ForFork0_~j~0#1| (select (select |#memory_int#1| ~q2~0.base) (* ~q2_back~0 4)))) (< ~n1~0 (+ ~q1_back~0 1))) (or (< 0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (< ~q1_front~0 0) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1)))), Black: 603#(and (<= ~q1_front~0 ~q1_back~0) (or (and (<= ~q2_back~0 0) (= ~q1_front~0 0)) (not (= 0 ~q2_front~0)) (not (= ~q1_back~0 0))) (= ~q1~0.offset 0) (or (< (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0)) (< ~q2_front~0 1)) (or (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)) (< 0 |thread2Thread1of1ForFork0_~j~0#1|)) (= ~q2~0.offset 0) (<= ~n1~0 2) (or (< 0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (< ~q1_front~0 0) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1)))), Black: 611#(and (<= ~q1_front~0 ~q1_back~0) (or (and (<= ~q2_back~0 0) (= ~q1_front~0 0)) (not (= 0 ~q2_front~0)) (not (= ~q1_back~0 0))) (= ~q1~0.offset 0) (or (< (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0)) (< ~q2_front~0 1)) (or (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)) (< 0 |thread2Thread1of1ForFork0_~j~0#1|)) (= ~q2~0.offset 0) (<= ~n1~0 2) (or (not (= 0 ~q2_front~0)) (and (<= ~q2_back~0 0) (or (not (= ~q2_back~0 0)) (= |thread2Thread1of1ForFork0_~j~0#1| 1))) (not (= |thread2Thread1of1ForFork0_~j~0#1| (select (select |#memory_int#1| ~q2~0.base) (* ~q2_back~0 4)))) (< ~n1~0 (+ ~q1_back~0 1))) (or (< 0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (< ~q1_front~0 0) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1)))), Black: 629#(and (or (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)) (< 0 |thread2Thread1of1ForFork0_~j~0#1|)) (not (= |thread3Thread1of1ForFork1_~k~0#1| 0))), Black: 585#(and (<= 1 ~n1~0) (or (and (<= ~q2_back~0 0) (= ~q1_front~0 0)) (not (= 0 ~q2_front~0)) (< ~n1~0 (+ ~q1_back~0 1))) (<= 1 ~q1_back~0) (<= 1 |thread2Thread1of1ForFork0_~j~0#1|) (= ~q1~0.offset 0) (or (not (= |thread2Thread1of1ForFork0_~j~0#1| (select (select |#memory_int#1| ~q2~0.base) 0))) (not (= 0 ~q2_front~0)) (not (= ~q2_back~0 0)) (= |thread2Thread1of1ForFork0_~j~0#1| 1) (< ~n1~0 (+ ~q1_back~0 1))) (or (< (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0)) (< ~q2_front~0 1)) (exists ((v_~q1_back~0_135 Int)) (and (<= (+ v_~q1_back~0_135 1) ~q1_back~0) (= (select (select |#memory_int#1| ~q1~0.base) (* v_~q1_back~0_135 4)) 1) (<= ~q1_front~0 v_~q1_back~0_135))) (= ~q2~0.offset 0) (<= ~n1~0 2)), Black: 601#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 ~n1~0) (<= 1 ~q1_back~0) (<= 1 |thread2Thread1of1ForFork0_~j~0#1|) (or (< ~q1_front~0 0) (< 0 (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n1~0 2)), Black: 659#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 ~n1~0) (<= 1 ~q1_back~0) (<= 1 |thread2Thread1of1ForFork0_~j~0#1|) (= ~q1~0.offset 0) (or (not (= 0 ~q2_front~0)) (not (= (select (select |#memory_int#1| ~q2~0.base) 0) 0))) (= ~q2~0.offset 0) (<= ~q2_front~0 0) (<= ~n1~0 2)), Black: 86#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1)), Black: 87#(<= ~n1~0 1), Black: 647#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 ~n1~0) (<= 1 ~q1_back~0) (<= 1 |thread2Thread1of1ForFork0_~j~0#1|) (= ~q1~0.offset 0) (or (not (= |thread2Thread1of1ForFork0_~j~0#1| (select (select |#memory_int#1| ~q2~0.base) 0))) (not (= 0 ~q2_front~0)) (not (= ~q2_back~0 0)) (= |thread2Thread1of1ForFork0_~j~0#1| 1) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= 0 ~q2_front~0)) (not (= (select (select |#memory_int#1| ~q2~0.base) 0) 0))) (or (not (= 0 ~q2_front~0)) (and (<= ~q2_back~0 0) (or (not (= ~q2_back~0 0)) (= (select (select |#memory_int#1| ~q1~0.base) 0) 1)) (= ~q1_front~0 0)) (< ~n1~0 (+ ~q1_back~0 1))) (= ~q2~0.offset 0) (<= ~q2_front~0 0) (<= ~n1~0 2) (or (< 0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (< ~q1_front~0 0) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1)))), Black: 597#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 ~n1~0) (<= 1 ~q1_back~0) (<= 1 |thread2Thread1of1ForFork0_~j~0#1|) (= ~q1~0.offset 0) (or (not (= |thread2Thread1of1ForFork0_~j~0#1| (select (select |#memory_int#1| ~q2~0.base) 0))) (not (= 0 ~q2_front~0)) (not (= ~q2_back~0 0)) (= |thread2Thread1of1ForFork0_~j~0#1| 1) (< ~n1~0 (+ ~q1_back~0 1))) (or (< (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0)) (< ~q2_front~0 1)) (or (not (= 0 ~q2_front~0)) (and (<= ~q2_back~0 0) (or (not (= ~q2_back~0 0)) (= (select (select |#memory_int#1| ~q1~0.base) 0) 1)) (= ~q1_front~0 0)) (< ~n1~0 (+ ~q1_back~0 1))) (= ~q2~0.offset 0) (<= ~n1~0 2) (or (< 0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (< ~q1_front~0 0) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1)))), Black: 641#(and (<= 1 ~n1~0) (or (and (<= ~q2_back~0 0) (= ~q1_front~0 0)) (not (= 0 ~q2_front~0)) (< ~n1~0 (+ ~q1_back~0 1))) (<= 1 ~q1_back~0) (<= 1 |thread2Thread1of1ForFork0_~j~0#1|) (= ~q1~0.offset 0) (or (not (= 0 ~q2_front~0)) (not (= (select (select |#memory_int#1| ~q2~0.base) 0) 0))) (exists ((v_~q1_back~0_135 Int)) (and (<= (+ v_~q1_back~0_135 1) ~q1_back~0) (= (select (select |#memory_int#1| ~q1~0.base) (* v_~q1_back~0_135 4)) 1) (<= ~q1_front~0 v_~q1_back~0_135))) (= ~q2~0.offset 0) (or (not (= 0 ~q2_front~0)) (and (<= ~q2_back~0 0) (or (not (= ~q2_back~0 0)) (= |thread2Thread1of1ForFork0_~j~0#1| 1))) (not (= |thread2Thread1of1ForFork0_~j~0#1| (select (select |#memory_int#1| ~q2~0.base) (* ~q2_back~0 4))))) (<= ~q2_front~0 0) (<= ~n1~0 2)), Black: 393#(<= 1 |thread2Thread1of1ForFork0_~j~0#1|), Black: 589#(and (<= 1 ~n1~0) (<= 1 ~q1_back~0) (<= 1 |thread2Thread1of1ForFork0_~j~0#1|) (<= ~n1~0 2) (exists ((v_~q1_back~0_135 Int)) (and (<= (+ v_~q1_back~0_135 1) ~q1_back~0) (= (select (select |#memory_int#1| ~q1~0.base) (+ (* v_~q1_back~0_135 4) ~q1~0.offset)) 1) (<= ~q1_front~0 v_~q1_back~0_135)))), Black: 54#(= ~q1_back~0 ~q1_front~0), Black: 607#(and (<= 1 ~n1~0) (or (and (<= ~q2_back~0 0) (= ~q1_front~0 0)) (not (= 0 ~q2_front~0)) (< ~n1~0 (+ ~q1_back~0 1))) (<= 1 ~q1_back~0) (<= 1 |thread2Thread1of1ForFork0_~j~0#1|) (= ~q1~0.offset 0) (or (not (= |thread2Thread1of1ForFork0_~j~0#1| (select (select |#memory_int#1| ~q2~0.base) 0))) (not (= 0 ~q2_front~0)) (not (= ~q2_back~0 0)) (= |thread2Thread1of1ForFork0_~j~0#1| 1) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= 0 ~q2_front~0)) (not (= (select (select |#memory_int#1| ~q2~0.base) 0) 0))) (exists ((v_~q1_back~0_135 Int)) (and (<= (+ v_~q1_back~0_135 1) ~q1_back~0) (= (select (select |#memory_int#1| ~q1~0.base) (* v_~q1_back~0_135 4)) 1) (<= ~q1_front~0 v_~q1_back~0_135))) (= ~q2~0.offset 0) (<= ~q2_front~0 0) (<= ~n1~0 2)), Black: 673#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 ~n1~0) (<= 1 ~q1_back~0) (<= 1 |thread2Thread1of1ForFork0_~j~0#1|) (or (not (= 0 ~q2_front~0)) (not (= (select (select |#memory_int#1| ~q2~0.base) 0) 0))) (= ~q2~0.offset 0) (or (< ~q1_front~0 0) (< 0 (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~q2_front~0 0) (<= ~n1~0 2)), Black: 623#(and (<= ~q1_front~0 ~q1_back~0) (or (and (<= 1 ~n1~0) (<= 1 ~q1_back~0) (<= 1 |thread2Thread1of1ForFork0_~j~0#1|)) (and (<= 1 ~n1~0) (<= 2 ~q1_back~0))) (or (< ~q1_front~0 0) (< 0 (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n1~0 2) (not (= |thread3Thread1of1ForFork1_~k~0#1| 0))), Black: 58#(<= ~q2_back~0 ~q2_front~0), Black: 569#(and (<= ~q1_front~0 ~q1_back~0) (or (and (<= ~q2_back~0 0) (= ~q1_front~0 0)) (not (= 0 ~q2_front~0)) (not (= ~q1_back~0 0))) (= ~q1~0.offset 0) (or (< (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0)) (< ~q2_front~0 1)) (= ~q2~0.offset 0) (<= ~n1~0 2) (or (< 0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (< ~q1_front~0 0) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1)))), Black: 617#(and (<= 1 ~n1~0) (<= 1 ~q1_back~0) (<= 1 |thread2Thread1of1ForFork0_~j~0#1|) (<= ~n1~0 2) (exists ((v_~q1_back~0_135 Int)) (and (<= (+ v_~q1_back~0_135 1) ~q1_back~0) (= (select (select |#memory_int#1| ~q1~0.base) (+ (* v_~q1_back~0_135 4) ~q1~0.offset)) 1) (<= ~q1_front~0 v_~q1_back~0_135))) (not (= |thread3Thread1of1ForFork1_~k~0#1| 0))), Black: 577#(and (<= ~q1_front~0 ~q1_back~0) (= ~q1~0.offset 0) (or (< (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0)) (< ~q2_front~0 1)) (or (and (<= 1 ~n1~0) (<= 1 ~q1_back~0) (<= 1 |thread2Thread1of1ForFork0_~j~0#1|)) (and (<= 1 ~n1~0) (<= 2 ~q1_back~0))) (= ~q2~0.offset 0) (<= ~n1~0 2) (or (< 0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (< ~q1_front~0 0) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1)))), Black: 522#(or (< ~q1_front~0 0) (< ~n1~0 (+ ~q1_front~0 2)) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 2))), Black: 651#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 ~n1~0) (<= 1 ~q1_back~0) (<= 1 |thread2Thread1of1ForFork0_~j~0#1|) (= ~q1~0.offset 0) (or (not (= 0 ~q2_front~0)) (not (= (select (select |#memory_int#1| ~q2~0.base) 0) 0))) (or (not (= 0 ~q2_front~0)) (and (<= ~q2_back~0 0) (or (not (= ~q2_back~0 0)) (= (select (select |#memory_int#1| ~q1~0.base) 0) 1)) (= ~q1_front~0 0)) (< ~n1~0 (+ ~q1_back~0 1))) (= ~q2~0.offset 0) (or (not (= 0 ~q2_front~0)) (and (<= ~q2_back~0 0) (or (not (= ~q2_back~0 0)) (= |thread2Thread1of1ForFork0_~j~0#1| 1))) (not (= |thread2Thread1of1ForFork0_~j~0#1| (select (select |#memory_int#1| ~q2~0.base) (* ~q2_back~0 4))))) (<= ~q2_front~0 0) (<= ~n1~0 2) (or (< 0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (< ~q1_front~0 0) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1)))), Black: 655#(and (<= ~q1_front~0 ~q1_back~0) (or (and (<= ~q2_back~0 0) (= ~q1_front~0 0)) (not (= 0 ~q2_front~0)) (not (= ~q1_back~0 0))) (= ~q1~0.offset 0) (or (not (= 0 ~q2_front~0)) (not (= (select (select |#memory_int#1| ~q2~0.base) 0) 0))) (or (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)) (< 0 |thread2Thread1of1ForFork0_~j~0#1|)) (= ~q2~0.offset 0) (<= ~q2_front~0 0) (<= ~n1~0 2) (or (not (= 0 ~q2_front~0)) (and (<= ~q2_back~0 0) (or (not (= ~q2_back~0 0)) (= |thread2Thread1of1ForFork0_~j~0#1| 1))) (not (= |thread2Thread1of1ForFork0_~j~0#1| (select (select |#memory_int#1| ~q2~0.base) (* ~q2_back~0 4)))) (< ~n1~0 (+ ~q1_back~0 1))) (or (< 0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (< ~q1_front~0 0) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1)))), Black: 62#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 557#(and (<= ~q1_front~0 ~q1_back~0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~q2_front~0 ~q2_back~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (or (< ~q1_front~0 0) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 2))) (or (not (= ~q1_back~0 0)) (and (= ~q1_front~0 0) (= ~q2_back~0 ~q2_front~0))) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (or (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= ~q1_back~0 0))), Black: 484#(or (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)) (< 0 |thread2Thread1of1ForFork0_~j~0#1|)), Black: 631#(and (<= 1 ~n1~0) (<= 1 ~q1_back~0) (<= 1 |thread2Thread1of1ForFork0_~j~0#1|) (= ~q1~0.offset 0) (or (< (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0)) (< ~q2_front~0 1)) (exists ((v_~q1_back~0_135 Int)) (and (<= (+ v_~q1_back~0_135 1) ~q1_back~0) (= (select (select |#memory_int#1| ~q1~0.base) (* v_~q1_back~0_135 4)) 1) (<= ~q1_front~0 v_~q1_back~0_135))) (= ~q2~0.offset 0) (<= ~n1~0 2)), Black: 567#(and (or (and (<= ~q2_back~0 0) (= ~q1_front~0 0)) (not (= 0 ~q2_front~0)) (< ~n1~0 (+ ~q1_back~0 1))) (= ~q1~0.offset 0) (or (not (= |thread2Thread1of1ForFork0_~j~0#1| (select (select |#memory_int#1| ~q2~0.base) 0))) (not (= 0 ~q2_front~0)) (not (= ~q2_back~0 0)) (= |thread2Thread1of1ForFork0_~j~0#1| 1) (< ~n1~0 (+ ~q1_back~0 1))) (or (< (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0)) (< ~q2_front~0 1)) (exists ((v_~q1_back~0_135 Int)) (and (<= (+ v_~q1_back~0_135 1) ~q1_back~0) (= (select (select |#memory_int#1| ~q1~0.base) (* v_~q1_back~0_135 4)) 1) (<= ~q1_front~0 v_~q1_back~0_135))) (= ~q2~0.offset 0) (or (not (= 0 ~q2_front~0)) (not (= ~q1_back~0 0))) (<= ~n1~0 2)), Black: 559#(and (<= ~q1_front~0 ~q1_back~0) (= ~q1~0.offset 0) (or (not (= ~q1_back~0 0)) (and (= ~q1_front~0 0) (<= ~q2_back~0 ~q2_front~0))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) (<= ~n1~0 2) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~q2_front~0) (+ ~q2_back~0 1))), Black: 657#(and (<= 1 ~n1~0) (or (and (<= ~q2_back~0 0) (= ~q1_front~0 0)) (not (= 0 ~q2_front~0)) (< ~n1~0 (+ ~q1_back~0 1))) (<= 1 ~q1_back~0) (<= 1 |thread2Thread1of1ForFork0_~j~0#1|) (= ~q1~0.offset 0) (or (not (= 0 ~q2_front~0)) (not (= (select (select |#memory_int#1| ~q2~0.base) 0) 0))) (exists ((v_~q1_back~0_135 Int)) (and (<= (+ v_~q1_back~0_135 1) ~q1_back~0) (= (select (select |#memory_int#1| ~q1~0.base) (* v_~q1_back~0_135 4)) 1) (<= ~q1_front~0 v_~q1_back~0_135))) (= ~q2~0.offset 0) (<= ~q2_front~0 0) (<= ~n1~0 2)), Black: 599#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 ~n1~0) (<= 1 ~q1_back~0) (<= 1 |thread2Thread1of1ForFork0_~j~0#1|) (= ~q1~0.offset 0) (or (not (= 0 ~q2_front~0)) (not (= (select (select |#memory_int#1| ~q2~0.base) 0) 0))) (= ~q2~0.offset 0) (<= ~q2_front~0 0) (<= ~n1~0 2) (or (< 0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (< ~q1_front~0 0) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1)))), Black: 68#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), Black: 609#(and (<= ~q1_front~0 ~q1_back~0) (or (< ~q1_front~0 0) (< 0 (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n1~0 2) (not (= |thread3Thread1of1ForFork1_~k~0#1| 0))), Black: 571#(and (<= ~q1_front~0 ~q1_back~0) (= ~q1~0.offset 0) (or (< (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0)) (< ~q2_front~0 1)) (or (and (<= 1 ~n1~0) (<= 1 ~q1_back~0) (<= 1 |thread2Thread1of1ForFork0_~j~0#1|)) (and (<= 1 ~n1~0) (<= 2 ~q1_back~0))) (= ~q2~0.offset 0) (<= ~n1~0 2) (or (not (= 0 ~q2_front~0)) (and (<= ~q2_back~0 0) (or (not (= ~q2_back~0 0)) (= |thread2Thread1of1ForFork0_~j~0#1| 1))) (not (= |thread2Thread1of1ForFork0_~j~0#1| (select (select |#memory_int#1| ~q2~0.base) (* ~q2_back~0 4)))) (< ~n1~0 (+ ~q1_back~0 1))) (or (< 0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (< ~q1_front~0 0) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1)))), 50#true, Black: 625#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 ~n1~0) (<= 1 ~q1_back~0) (<= 1 |thread2Thread1of1ForFork0_~j~0#1|) (= ~q1~0.offset 0) (or (< (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0)) (< ~q2_front~0 1)) (= ~q2~0.offset 0) (<= ~n1~0 2)), Black: 613#(and (<= 1 ~n1~0) (or (and (<= ~q2_back~0 0) (= ~q1_front~0 0)) (not (= 0 ~q2_front~0)) (< ~n1~0 (+ ~q1_back~0 1))) (<= 1 ~q1_back~0) (<= 1 |thread2Thread1of1ForFork0_~j~0#1|) (= ~q1~0.offset 0) (or (< (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0)) (< ~q2_front~0 1)) (exists ((v_~q1_back~0_135 Int)) (and (<= (+ v_~q1_back~0_135 1) ~q1_back~0) (= (select (select |#memory_int#1| ~q1~0.base) (* v_~q1_back~0_135 4)) 1) (<= ~q1_front~0 v_~q1_back~0_135))) (= ~q2~0.offset 0) (<= ~n1~0 2)), Black: 581#(and (<= 1 ~n1~0) (or (and (<= ~q2_back~0 0) (= ~q1_front~0 0)) (not (= 0 ~q2_front~0)) (< ~n1~0 (+ ~q1_back~0 1))) (<= 1 ~q1_back~0) (<= 1 |thread2Thread1of1ForFork0_~j~0#1|) (= ~q1~0.offset 0) (or (< (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0)) (< ~q2_front~0 1)) (exists ((v_~q1_back~0_135 Int)) (and (<= (+ v_~q1_back~0_135 1) ~q1_back~0) (= (select (select |#memory_int#1| ~q1~0.base) (* v_~q1_back~0_135 4)) 1) (<= ~q1_front~0 v_~q1_back~0_135))) (= ~q2~0.offset 0) (or (not (= 0 ~q2_front~0)) (and (<= ~q2_back~0 0) (or (not (= ~q2_back~0 0)) (= |thread2Thread1of1ForFork0_~j~0#1| 1))) (not (= |thread2Thread1of1ForFork0_~j~0#1| (select (select |#memory_int#1| ~q2~0.base) (* ~q2_back~0 4))))) (<= ~n1~0 2)), Black: 621#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 ~n1~0) (<= 1 ~q1_back~0) (<= 1 |thread2Thread1of1ForFork0_~j~0#1|) (or (< ~q1_front~0 0) (< 0 (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n1~0 2) (not (= |thread3Thread1of1ForFork1_~k~0#1| 0))), Black: 653#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 ~n1~0) (<= 1 ~q1_back~0) (<= 1 |thread2Thread1of1ForFork0_~j~0#1|) (<= ~n1~0 2) (not (= |thread3Thread1of1ForFork1_~k~0#1| 0))), Black: 635#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 ~n1~0) (<= 1 ~q1_back~0) (<= 1 |thread2Thread1of1ForFork0_~j~0#1|) (<= ~n1~0 2)), Black: 78#(and (or (< ~N~0 (+ ~t~0 1)) (< (+ ~N~0 |thread3Thread1of1ForFork1_~k~0#1|) (+ ~t~0 1))) (or (< ~t~0 (+ ~N~0 |thread3Thread1of1ForFork1_~k~0#1| 1)) (< ~t~0 (+ ~N~0 1)))), Black: 663#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 ~n1~0) (<= 1 ~q1_back~0) (<= 1 |thread2Thread1of1ForFork0_~j~0#1|) (= ~q1~0.offset 0) (or (< (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0)) (< ~q2_front~0 1)) (= ~q2~0.offset 0) (<= ~n1~0 2) (or (< 0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (< ~q1_front~0 0) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1)))), Black: 76#(and (<= 0 ~N~0) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (= ~t~0 0)), Black: 723#(<= ~q2_back~0 ~q2_front~0), 971#(and (<= ~q1_front~0 ~q1_back~0) (= ~q1~0.offset 0) (<= ~n1~0 2) (or (not (= ~q1_back~0 0)) (and (<= (mod |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1073741823) (= ~q1_front~0 0)))), 41#L70true, 36#L87-2true, 34#L121true, 724#(<= ~q2_back~0 (+ 1 ~q2_front~0))]) [2024-11-19 01:54:35,814 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2024-11-19 01:54:35,814 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-19 01:54:35,814 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-19 01:54:35,814 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-19 01:54:36,853 INFO L124 PetriNetUnfolderBase]: 33448/56538 cut-off events. [2024-11-19 01:54:36,853 INFO L125 PetriNetUnfolderBase]: For 1001242/1003625 co-relation queries the response was YES. [2024-11-19 01:54:37,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 230948 conditions, 56538 events. 33448/56538 cut-off events. For 1001242/1003625 co-relation queries the response was YES. Maximal size of possible extension queue 2031. Compared 486799 event pairs, 3953 based on Foata normal form. 961/57050 useless extension candidates. Maximal degree in co-relation 230885. Up to 12896 conditions per place. [2024-11-19 01:54:37,586 INFO L140 encePairwiseOnDemand]: 35/44 looper letters, 638 selfloop transitions, 188 changer transitions 0/853 dead transitions. [2024-11-19 01:54:37,586 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 853 transitions, 8057 flow [2024-11-19 01:54:37,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-19 01:54:37,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2024-11-19 01:54:37,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 453 transitions. [2024-11-19 01:54:37,588 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5418660287081339 [2024-11-19 01:54:37,588 INFO L175 Difference]: Start difference. First operand has 178 places, 332 transitions, 2414 flow. Second operand 19 states and 453 transitions. [2024-11-19 01:54:37,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 853 transitions, 8057 flow [2024-11-19 01:54:43,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 853 transitions, 7723 flow, removed 167 selfloop flow, removed 0 redundant places. [2024-11-19 01:54:43,644 INFO L231 Difference]: Finished difference. Result has 205 places, 449 transitions, 3712 flow [2024-11-19 01:54:43,644 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=2332, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=332, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=232, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=3712, PETRI_PLACES=205, PETRI_TRANSITIONS=449} [2024-11-19 01:54:43,645 INFO L277 CegarLoopForPetriNet]: 43 programPoint places, 162 predicate places. [2024-11-19 01:54:43,645 INFO L471 AbstractCegarLoop]: Abstraction has has 205 places, 449 transitions, 3712 flow [2024-11-19 01:54:43,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 14.347826086956522) internal successors, (330), 23 states have internal predecessors, (330), 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-19 01:54:43,646 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:54:43,646 INFO L204 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:54:43,658 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-19 01:54:43,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:54:43,847 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-19 01:54:43,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:54:43,847 INFO L85 PathProgramCache]: Analyzing trace with hash -57799836, now seen corresponding path program 4 times [2024-11-19 01:54:43,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:54:43,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252868138] [2024-11-19 01:54:43,848 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 01:54:43,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:54:43,876 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 01:54:43,876 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 01:54:44,051 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 01:54:44,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:54:44,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252868138] [2024-11-19 01:54:44,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252868138] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 01:54:44,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [547414176] [2024-11-19 01:54:44,052 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 01:54:44,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:54:44,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:54:44,054 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-19 01:54:44,055 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-19 01:54:44,159 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 01:54:44,160 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 01:54:44,162 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 01:54:44,163 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:54:44,199 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 01:54:44,200 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 01:54:44,236 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-19 01:54:44,237 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 25 treesize of output 12 [2024-11-19 01:54:44,255 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 01:54:44,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [547414176] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 01:54:44,255 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 01:54:44,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4, 4] total 10 [2024-11-19 01:54:44,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655890612] [2024-11-19 01:54:44,256 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 01:54:44,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 01:54:44,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:54:44,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 01:54:44,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-19 01:54:44,289 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 44 [2024-11-19 01:54:44,290 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 449 transitions, 3712 flow. Second operand has 11 states, 11 states have (on average 12.727272727272727) internal successors, (140), 11 states have internal predecessors, (140), 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-19 01:54:44,290 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:54:44,290 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 44 [2024-11-19 01:54:44,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:54:55,845 INFO L124 PetriNetUnfolderBase]: 45191/73239 cut-off events. [2024-11-19 01:54:55,845 INFO L125 PetriNetUnfolderBase]: For 1261897/1261903 co-relation queries the response was YES. [2024-11-19 01:54:57,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 337269 conditions, 73239 events. 45191/73239 cut-off events. For 1261897/1261903 co-relation queries the response was YES. Maximal size of possible extension queue 2341. Compared 609155 event pairs, 7616 based on Foata normal form. 118/73346 useless extension candidates. Maximal degree in co-relation 337197. Up to 39530 conditions per place. [2024-11-19 01:54:57,281 INFO L140 encePairwiseOnDemand]: 36/44 looper letters, 576 selfloop transitions, 165 changer transitions 0/746 dead transitions. [2024-11-19 01:54:57,282 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 746 transitions, 7674 flow [2024-11-19 01:54:57,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 01:54:57,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-19 01:54:57,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 161 transitions. [2024-11-19 01:54:57,283 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5227272727272727 [2024-11-19 01:54:57,283 INFO L175 Difference]: Start difference. First operand has 205 places, 449 transitions, 3712 flow. Second operand 7 states and 161 transitions. [2024-11-19 01:54:57,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 746 transitions, 7674 flow [2024-11-19 01:55:11,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 746 transitions, 7647 flow, removed 3 selfloop flow, removed 6 redundant places. [2024-11-19 01:55:11,149 INFO L231 Difference]: Finished difference. Result has 204 places, 511 transitions, 4896 flow [2024-11-19 01:55:11,150 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=3599, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=434, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=93, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=310, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4896, PETRI_PLACES=204, PETRI_TRANSITIONS=511} [2024-11-19 01:55:11,150 INFO L277 CegarLoopForPetriNet]: 43 programPoint places, 161 predicate places. [2024-11-19 01:55:11,150 INFO L471 AbstractCegarLoop]: Abstraction has has 204 places, 511 transitions, 4896 flow [2024-11-19 01:55:11,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.727272727272727) internal successors, (140), 11 states have internal predecessors, (140), 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-19 01:55:11,151 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:55:11,151 INFO L204 CegarLoopForPetriNet]: trace histogram [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, 1, 1] [2024-11-19 01:55:11,163 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-19 01:55:11,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:55:11,351 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-19 01:55:11,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:55:11,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1833129347, now seen corresponding path program 1 times [2024-11-19 01:55:11,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:55:11,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074430553] [2024-11-19 01:55:11,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:55:11,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:55:11,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:55:11,516 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 01:55:11,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:55:11,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074430553] [2024-11-19 01:55:11,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074430553] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 01:55:11,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1076559858] [2024-11-19 01:55:11,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:55:11,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:55:11,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:55:11,519 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-19 01:55:11,520 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-19 01:55:11,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:55:11,616 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 01:55:11,618 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:55:11,715 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 01:55:11,715 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 01:55:11,831 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 01:55:11,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1076559858] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 01:55:11,832 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 01:55:11,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2024-11-19 01:55:11,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813290645] [2024-11-19 01:55:11,832 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 01:55:11,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-19 01:55:11,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:55:11,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-19 01:55:11,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-11-19 01:55:11,833 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 44 [2024-11-19 01:55:11,834 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 511 transitions, 4896 flow. Second operand has 13 states, 13 states have (on average 16.615384615384617) internal successors, (216), 13 states have internal predecessors, (216), 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-19 01:55:11,834 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:55:11,834 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 44 [2024-11-19 01:55:11,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand