./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-min-array.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-min-array.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 2261d9b3f7623cbd5155b35c39657066d179b87a48a9848bd1f196c713477a75 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 14:41:20,193 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 14:41:20,276 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 14:41:20,282 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 14:41:20,282 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 14:41:20,302 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 14:41:20,303 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 14:41:20,303 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 14:41:20,304 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 14:41:20,304 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 14:41:20,305 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 14:41:20,305 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 14:41:20,306 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 14:41:20,306 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 14:41:20,307 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 14:41:20,307 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 14:41:20,308 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 14:41:20,308 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 14:41:20,308 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 14:41:20,309 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 14:41:20,309 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 14:41:20,310 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 14:41:20,310 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 14:41:20,311 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 14:41:20,311 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 14:41:20,311 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 14:41:20,312 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 14:41:20,312 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 14:41:20,312 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 14:41:20,313 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 14:41:20,313 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 14:41:20,313 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 14:41:20,314 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 14:41:20,314 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 14:41:20,314 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 14:41:20,315 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 14:41:20,315 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 14:41:20,315 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 14:41:20,316 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 14:41:20,316 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 14:41:20,316 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 14:41:20,317 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 14:41:20,317 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 -> 2261d9b3f7623cbd5155b35c39657066d179b87a48a9848bd1f196c713477a75 [2024-10-14 14:41:20,564 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 14:41:20,588 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 14:41:20,591 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 14:41:20,593 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 14:41:20,593 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 14:41:20,594 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-min-array.wvr.c [2024-10-14 14:41:22,020 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 14:41:22,191 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 14:41:22,192 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-min-array.wvr.c [2024-10-14 14:41:22,199 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3b079d41/22242aa60a904346b933d1f6610aabe0/FLAG01592a971 [2024-10-14 14:41:22,212 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3b079d41/22242aa60a904346b933d1f6610aabe0 [2024-10-14 14:41:22,215 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 14:41:22,216 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 14:41:22,220 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 14:41:22,220 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 14:41:22,225 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 14:41:22,226 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 02:41:22" (1/1) ... [2024-10-14 14:41:22,227 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e5f55fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:41:22, skipping insertion in model container [2024-10-14 14:41:22,229 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 02:41:22" (1/1) ... [2024-10-14 14:41:22,249 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 14:41:22,412 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-min-array.wvr.c[2592,2605] [2024-10-14 14:41:22,421 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 14:41:22,428 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 14:41:22,448 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-min-array.wvr.c[2592,2605] [2024-10-14 14:41:22,451 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 14:41:22,467 INFO L204 MainTranslator]: Completed translation [2024-10-14 14:41:22,468 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:41:22 WrapperNode [2024-10-14 14:41:22,468 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 14:41:22,469 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 14:41:22,469 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 14:41:22,469 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 14:41:22,476 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:41:22" (1/1) ... [2024-10-14 14:41:22,484 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:41:22" (1/1) ... [2024-10-14 14:41:22,508 INFO L138 Inliner]: procedures = 23, calls = 28, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 86 [2024-10-14 14:41:22,508 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 14:41:22,509 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 14:41:22,509 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 14:41:22,509 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 14:41:22,520 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:41:22" (1/1) ... [2024-10-14 14:41:22,520 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:41:22" (1/1) ... [2024-10-14 14:41:22,525 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:41:22" (1/1) ... [2024-10-14 14:41:22,552 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 1 writes are split as follows [0, 1]. [2024-10-14 14:41:22,556 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:41:22" (1/1) ... [2024-10-14 14:41:22,556 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:41:22" (1/1) ... [2024-10-14 14:41:22,562 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:41:22" (1/1) ... [2024-10-14 14:41:22,569 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:41:22" (1/1) ... [2024-10-14 14:41:22,572 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:41:22" (1/1) ... [2024-10-14 14:41:22,577 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:41:22" (1/1) ... [2024-10-14 14:41:22,579 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 14:41:22,582 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 14:41:22,582 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 14:41:22,582 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 14:41:22,583 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:41:22" (1/1) ... [2024-10-14 14:41:22,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 14:41:22,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 14:41:22,621 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 14:41:22,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 14:41:22,665 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 14:41:22,665 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-14 14:41:22,665 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-14 14:41:22,666 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-14 14:41:22,666 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-14 14:41:22,666 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-10-14 14:41:22,666 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-10-14 14:41:22,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 14:41:22,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-14 14:41:22,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-14 14:41:22,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-14 14:41:22,667 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-14 14:41:22,667 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-14 14:41:22,667 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-14 14:41:22,668 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 14:41:22,668 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 14:41:22,668 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-14 14:41:22,668 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-14 14:41:22,670 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-14 14:41:22,769 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 14:41:22,771 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 14:41:23,008 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-14 14:41:23,008 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 14:41:23,212 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 14:41:23,213 INFO L314 CfgBuilder]: Removed 4 assume(true) statements. [2024-10-14 14:41:23,213 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 02:41:23 BoogieIcfgContainer [2024-10-14 14:41:23,213 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 14:41:23,215 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 14:41:23,215 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 14:41:23,218 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 14:41:23,218 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 02:41:22" (1/3) ... [2024-10-14 14:41:23,219 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5481cf6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 02:41:23, skipping insertion in model container [2024-10-14 14:41:23,219 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:41:22" (2/3) ... [2024-10-14 14:41:23,220 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5481cf6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 02:41:23, skipping insertion in model container [2024-10-14 14:41:23,220 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 02:41:23" (3/3) ... [2024-10-14 14:41:23,221 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-min-array.wvr.c [2024-10-14 14:41:23,236 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 14:41:23,236 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 14:41:23,236 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-14 14:41:23,283 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-10-14 14:41:23,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 33 transitions, 87 flow [2024-10-14 14:41:23,347 INFO L124 PetriNetUnfolderBase]: 4/30 cut-off events. [2024-10-14 14:41:23,349 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-14 14:41:23,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 30 events. 4/30 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 37 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 24. Up to 2 conditions per place. [2024-10-14 14:41:23,353 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 33 transitions, 87 flow [2024-10-14 14:41:23,356 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 29 transitions, 76 flow [2024-10-14 14:41:23,366 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 14:41:23,374 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;@7c277d9d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 14:41:23,374 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-10-14 14:41:23,388 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-14 14:41:23,388 INFO L124 PetriNetUnfolderBase]: 4/28 cut-off events. [2024-10-14 14:41:23,389 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-14 14:41:23,389 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 14:41:23,389 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:41:23,390 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-10-14 14:41:23,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:41:23,398 INFO L85 PathProgramCache]: Analyzing trace with hash 261283878, now seen corresponding path program 1 times [2024-10-14 14:41:23,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:41:23,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021135444] [2024-10-14 14:41:23,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:41:23,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:41:23,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:41:23,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 14:41:23,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:41:23,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021135444] [2024-10-14 14:41:23,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021135444] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:41:23,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:41:23,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 14:41:23,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131607733] [2024-10-14 14:41:23,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:41:23,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 14:41:23,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:41:23,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 14:41:23,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 14:41:23,826 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-10-14 14:41:23,829 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 29 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 14:41:23,829 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 14:41:23,829 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-10-14 14:41:23,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 14:41:24,094 INFO L124 PetriNetUnfolderBase]: 617/945 cut-off events. [2024-10-14 14:41:24,094 INFO L125 PetriNetUnfolderBase]: For 79/79 co-relation queries the response was YES. [2024-10-14 14:41:24,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1940 conditions, 945 events. 617/945 cut-off events. For 79/79 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 3706 event pairs, 126 based on Foata normal form. 1/932 useless extension candidates. Maximal degree in co-relation 1706. Up to 677 conditions per place. [2024-10-14 14:41:24,107 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 37 selfloop transitions, 4 changer transitions 1/46 dead transitions. [2024-10-14 14:41:24,107 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 46 transitions, 209 flow [2024-10-14 14:41:24,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 14:41:24,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 14:41:24,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 64 transitions. [2024-10-14 14:41:24,121 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6464646464646465 [2024-10-14 14:41:24,123 INFO L175 Difference]: Start difference. First operand has 35 places, 29 transitions, 76 flow. Second operand 3 states and 64 transitions. [2024-10-14 14:41:24,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 46 transitions, 209 flow [2024-10-14 14:41:24,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 46 transitions, 187 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-10-14 14:41:24,135 INFO L231 Difference]: Finished difference. Result has 32 places, 32 transitions, 90 flow [2024-10-14 14:41:24,137 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=32, PETRI_TRANSITIONS=32} [2024-10-14 14:41:24,141 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, -3 predicate places. [2024-10-14 14:41:24,141 INFO L471 AbstractCegarLoop]: Abstraction has has 32 places, 32 transitions, 90 flow [2024-10-14 14:41:24,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 14:41:24,144 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 14:41:24,144 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:41:24,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 14:41:24,145 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-10-14 14:41:24,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:41:24,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1254734667, now seen corresponding path program 1 times [2024-10-14 14:41:24,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:41:24,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228923545] [2024-10-14 14:41:24,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:41:24,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:41:24,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:41:24,410 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 14:41:24,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:41:24,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228923545] [2024-10-14 14:41:24,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228923545] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:41:24,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:41:24,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 14:41:24,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676348647] [2024-10-14 14:41:24,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:41:24,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 14:41:24,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:41:24,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 14:41:24,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 14:41:24,425 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-10-14 14:41:24,426 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 32 transitions, 90 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 14:41:24,426 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 14:41:24,426 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-10-14 14:41:24,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 14:41:24,605 INFO L124 PetriNetUnfolderBase]: 617/943 cut-off events. [2024-10-14 14:41:24,606 INFO L125 PetriNetUnfolderBase]: For 196/196 co-relation queries the response was YES. [2024-10-14 14:41:24,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2148 conditions, 943 events. 617/943 cut-off events. For 196/196 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 3839 event pairs, 407 based on Foata normal form. 0/914 useless extension candidates. Maximal degree in co-relation 792. Up to 895 conditions per place. [2024-10-14 14:41:24,616 INFO L140 encePairwiseOnDemand]: 30/33 looper letters, 27 selfloop transitions, 2 changer transitions 0/33 dead transitions. [2024-10-14 14:41:24,617 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 33 transitions, 150 flow [2024-10-14 14:41:24,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 14:41:24,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 14:41:24,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2024-10-14 14:41:24,619 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.48484848484848486 [2024-10-14 14:41:24,619 INFO L175 Difference]: Start difference. First operand has 32 places, 32 transitions, 90 flow. Second operand 3 states and 48 transitions. [2024-10-14 14:41:24,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 33 transitions, 150 flow [2024-10-14 14:41:24,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 33 transitions, 146 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-14 14:41:24,621 INFO L231 Difference]: Finished difference. Result has 34 places, 33 transitions, 98 flow [2024-10-14 14:41:24,621 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=34, PETRI_TRANSITIONS=33} [2024-10-14 14:41:24,622 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, -1 predicate places. [2024-10-14 14:41:24,623 INFO L471 AbstractCegarLoop]: Abstraction has has 34 places, 33 transitions, 98 flow [2024-10-14 14:41:24,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 14:41:24,623 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 14:41:24,623 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] [2024-10-14 14:41:24,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 14:41:24,624 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-10-14 14:41:24,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:41:24,626 INFO L85 PathProgramCache]: Analyzing trace with hash -788942457, now seen corresponding path program 1 times [2024-10-14 14:41:24,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:41:24,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824191104] [2024-10-14 14:41:24,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:41:24,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:41:24,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:41:24,727 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 14:41:24,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:41:24,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824191104] [2024-10-14 14:41:24,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824191104] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:41:24,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:41:24,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 14:41:24,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98169973] [2024-10-14 14:41:24,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:41:24,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 14:41:24,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:41:24,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 14:41:24,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 14:41:24,743 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-10-14 14:41:24,743 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 33 transitions, 98 flow. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 14:41:24,743 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 14:41:24,743 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-10-14 14:41:24,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 14:41:24,921 INFO L124 PetriNetUnfolderBase]: 790/1161 cut-off events. [2024-10-14 14:41:24,922 INFO L125 PetriNetUnfolderBase]: For 183/183 co-relation queries the response was YES. [2024-10-14 14:41:24,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2575 conditions, 1161 events. 790/1161 cut-off events. For 183/183 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 4676 event pairs, 246 based on Foata normal form. 0/1118 useless extension candidates. Maximal degree in co-relation 2562. Up to 576 conditions per place. [2024-10-14 14:41:24,929 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 40 selfloop transitions, 4 changer transitions 0/47 dead transitions. [2024-10-14 14:41:24,929 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 47 transitions, 224 flow [2024-10-14 14:41:24,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 14:41:24,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-14 14:41:24,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2024-10-14 14:41:24,931 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4772727272727273 [2024-10-14 14:41:24,931 INFO L175 Difference]: Start difference. First operand has 34 places, 33 transitions, 98 flow. Second operand 4 states and 63 transitions. [2024-10-14 14:41:24,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 47 transitions, 224 flow [2024-10-14 14:41:24,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 47 transitions, 218 flow, removed 2 selfloop flow, removed 1 redundant places. [2024-10-14 14:41:24,933 INFO L231 Difference]: Finished difference. Result has 38 places, 34 transitions, 113 flow [2024-10-14 14:41:24,933 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=113, PETRI_PLACES=38, PETRI_TRANSITIONS=34} [2024-10-14 14:41:24,934 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, 3 predicate places. [2024-10-14 14:41:24,934 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 34 transitions, 113 flow [2024-10-14 14:41:24,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 14:41:24,935 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 14:41:24,935 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] [2024-10-14 14:41:24,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 14:41:24,935 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-10-14 14:41:24,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:41:24,936 INFO L85 PathProgramCache]: Analyzing trace with hash 513300121, now seen corresponding path program 1 times [2024-10-14 14:41:24,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:41:24,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701976990] [2024-10-14 14:41:24,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:41:24,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:41:24,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:41:25,077 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 14:41:25,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:41:25,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701976990] [2024-10-14 14:41:25,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701976990] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 14:41:25,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1635446012] [2024-10-14 14:41:25,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:41:25,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 14:41:25,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 14:41:25,081 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 14:41:25,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 14:41:25,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:41:25,172 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 14:41:25,176 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 14:41:25,246 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 14:41:25,247 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 14:41:25,292 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 14:41:25,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1635446012] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-14 14:41:25,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-14 14:41:25,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2024-10-14 14:41:25,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52519449] [2024-10-14 14:41:25,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:41:25,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 14:41:25,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:41:25,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 14:41:25,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-10-14 14:41:25,303 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-10-14 14:41:25,304 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 34 transitions, 113 flow. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 14:41:25,305 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 14:41:25,305 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-10-14 14:41:25,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 14:41:25,472 INFO L124 PetriNetUnfolderBase]: 855/1295 cut-off events. [2024-10-14 14:41:25,473 INFO L125 PetriNetUnfolderBase]: For 505/505 co-relation queries the response was YES. [2024-10-14 14:41:25,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3247 conditions, 1295 events. 855/1295 cut-off events. For 505/505 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 5390 event pairs, 256 based on Foata normal form. 0/1230 useless extension candidates. Maximal degree in co-relation 3227. Up to 670 conditions per place. [2024-10-14 14:41:25,482 INFO L140 encePairwiseOnDemand]: 27/33 looper letters, 41 selfloop transitions, 5 changer transitions 0/50 dead transitions. [2024-10-14 14:41:25,482 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 50 transitions, 257 flow [2024-10-14 14:41:25,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 14:41:25,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-14 14:41:25,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2024-10-14 14:41:25,484 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.43636363636363634 [2024-10-14 14:41:25,484 INFO L175 Difference]: Start difference. First operand has 38 places, 34 transitions, 113 flow. Second operand 5 states and 72 transitions. [2024-10-14 14:41:25,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 50 transitions, 257 flow [2024-10-14 14:41:25,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 50 transitions, 251 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 14:41:25,488 INFO L231 Difference]: Finished difference. Result has 42 places, 35 transitions, 132 flow [2024-10-14 14:41:25,488 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=132, PETRI_PLACES=42, PETRI_TRANSITIONS=35} [2024-10-14 14:41:25,489 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, 7 predicate places. [2024-10-14 14:41:25,489 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 132 flow [2024-10-14 14:41:25,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 14:41:25,489 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 14:41:25,489 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] [2024-10-14 14:41:25,508 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 14:41:25,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 14:41:25,691 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-10-14 14:41:25,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:41:25,691 INFO L85 PathProgramCache]: Analyzing trace with hash -694361008, now seen corresponding path program 1 times [2024-10-14 14:41:25,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:41:25,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725586934] [2024-10-14 14:41:25,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:41:25,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:41:25,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:41:26,458 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 14:41:26,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:41:26,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725586934] [2024-10-14 14:41:26,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725586934] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 14:41:26,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1462955017] [2024-10-14 14:41:26,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:41:26,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 14:41:26,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 14:41:26,462 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 14:41:26,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-14 14:41:26,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:41:26,544 INFO L255 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-10-14 14:41:26,546 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 14:41:26,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-14 14:41:26,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 35 [2024-10-14 14:41:27,013 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 14:41:27,014 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 14:41:28,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 105 [2024-10-14 14:41:28,056 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 14:41:28,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 157 treesize of output 149 [2024-10-14 14:41:28,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 85 [2024-10-14 14:41:28,879 INFO L349 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2024-10-14 14:41:28,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 107 treesize of output 103 [2024-10-14 14:41:29,283 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 14:41:29,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1462955017] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 14:41:29,284 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 14:41:29,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 23 [2024-10-14 14:41:29,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793256714] [2024-10-14 14:41:29,284 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 14:41:29,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-14 14:41:29,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:41:29,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-14 14:41:29,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=462, Unknown=0, NotChecked=0, Total=552 [2024-10-14 14:41:29,443 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-10-14 14:41:29,443 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 132 flow. Second operand has 24 states, 24 states have (on average 8.666666666666666) internal successors, (208), 24 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 14:41:29,443 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 14:41:29,444 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-10-14 14:41:29,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 14:41:31,351 INFO L124 PetriNetUnfolderBase]: 1841/2761 cut-off events. [2024-10-14 14:41:31,352 INFO L125 PetriNetUnfolderBase]: For 1721/1721 co-relation queries the response was YES. [2024-10-14 14:41:31,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7669 conditions, 2761 events. 1841/2761 cut-off events. For 1721/1721 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 12609 event pairs, 106 based on Foata normal form. 1/2760 useless extension candidates. Maximal degree in co-relation 5614. Up to 1375 conditions per place. [2024-10-14 14:41:31,373 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 137 selfloop transitions, 57 changer transitions 1/199 dead transitions. [2024-10-14 14:41:31,374 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 199 transitions, 1067 flow [2024-10-14 14:41:31,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-14 14:41:31,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2024-10-14 14:41:31,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 321 transitions. [2024-10-14 14:41:31,378 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.46320346320346323 [2024-10-14 14:41:31,378 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 132 flow. Second operand 21 states and 321 transitions. [2024-10-14 14:41:31,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 199 transitions, 1067 flow [2024-10-14 14:41:31,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 199 transitions, 1050 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-14 14:41:31,389 INFO L231 Difference]: Finished difference. Result has 64 places, 91 transitions, 543 flow [2024-10-14 14:41:31,389 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=543, PETRI_PLACES=64, PETRI_TRANSITIONS=91} [2024-10-14 14:41:31,391 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, 29 predicate places. [2024-10-14 14:41:31,392 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 91 transitions, 543 flow [2024-10-14 14:41:31,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 8.666666666666666) internal successors, (208), 24 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 14:41:31,393 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 14:41:31,393 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] [2024-10-14 14:41:31,410 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-14 14:41:31,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 14:41:31,598 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-10-14 14:41:31,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:41:31,598 INFO L85 PathProgramCache]: Analyzing trace with hash -2045165880, now seen corresponding path program 2 times [2024-10-14 14:41:31,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:41:31,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450424452] [2024-10-14 14:41:31,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:41:31,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:41:31,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:41:32,139 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 14:41:32,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:41:32,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450424452] [2024-10-14 14:41:32,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450424452] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 14:41:32,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1924476158] [2024-10-14 14:41:32,141 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 14:41:32,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 14:41:32,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 14:41:32,143 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 14:41:32,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-14 14:41:32,217 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 14:41:32,217 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 14:41:32,219 INFO L255 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-10-14 14:41:32,221 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 14:41:32,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-14 14:41:32,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 34 [2024-10-14 14:41:32,519 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 14:41:32,519 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 14:41:33,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 85 [2024-10-14 14:41:33,406 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 14:41:33,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 107 treesize of output 111 [2024-10-14 14:41:33,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 105 [2024-10-14 14:41:33,730 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2024-10-14 14:41:33,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 157 treesize of output 1 [2024-10-14 14:41:33,756 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 14:41:33,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1924476158] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 14:41:33,756 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 14:41:33,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2024-10-14 14:41:33,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177843496] [2024-10-14 14:41:33,757 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 14:41:33,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-14 14:41:33,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:41:33,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-14 14:41:33,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2024-10-14 14:41:33,918 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-10-14 14:41:33,919 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 91 transitions, 543 flow. Second operand has 19 states, 19 states have (on average 9.736842105263158) internal successors, (185), 19 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 14:41:33,919 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 14:41:33,919 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-10-14 14:41:33,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 14:41:34,966 INFO L124 PetriNetUnfolderBase]: 1538/2445 cut-off events. [2024-10-14 14:41:34,967 INFO L125 PetriNetUnfolderBase]: For 3235/3238 co-relation queries the response was YES. [2024-10-14 14:41:34,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7984 conditions, 2445 events. 1538/2445 cut-off events. For 3235/3238 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 12186 event pairs, 126 based on Foata normal form. 3/2444 useless extension candidates. Maximal degree in co-relation 7422. Up to 1623 conditions per place. [2024-10-14 14:41:34,987 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 125 selfloop transitions, 49 changer transitions 1/181 dead transitions. [2024-10-14 14:41:34,987 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 181 transitions, 1211 flow [2024-10-14 14:41:34,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 14:41:34,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2024-10-14 14:41:34,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 242 transitions. [2024-10-14 14:41:34,989 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4888888888888889 [2024-10-14 14:41:34,989 INFO L175 Difference]: Start difference. First operand has 64 places, 91 transitions, 543 flow. Second operand 15 states and 242 transitions. [2024-10-14 14:41:34,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 181 transitions, 1211 flow [2024-10-14 14:41:35,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 181 transitions, 1093 flow, removed 44 selfloop flow, removed 3 redundant places. [2024-10-14 14:41:35,005 INFO L231 Difference]: Finished difference. Result has 76 places, 111 transitions, 679 flow [2024-10-14 14:41:35,005 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=453, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=679, PETRI_PLACES=76, PETRI_TRANSITIONS=111} [2024-10-14 14:41:35,006 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, 41 predicate places. [2024-10-14 14:41:35,006 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 111 transitions, 679 flow [2024-10-14 14:41:35,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 9.736842105263158) internal successors, (185), 19 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 14:41:35,006 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 14:41:35,007 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] [2024-10-14 14:41:35,025 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-14 14:41:35,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 14:41:35,208 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-10-14 14:41:35,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:41:35,209 INFO L85 PathProgramCache]: Analyzing trace with hash -605205446, now seen corresponding path program 3 times [2024-10-14 14:41:35,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:41:35,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55359784] [2024-10-14 14:41:35,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:41:35,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:41:35,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:41:35,731 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 14:41:35,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:41:35,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55359784] [2024-10-14 14:41:35,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55359784] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 14:41:35,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [659501756] [2024-10-14 14:41:35,732 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-14 14:41:35,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 14:41:35,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 14:41:35,734 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-10-14 14:41:35,735 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-10-14 14:41:35,810 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-10-14 14:41:35,811 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 14:41:35,813 INFO L255 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-10-14 14:41:35,815 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 14:41:35,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-14 14:41:36,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 35 [2024-10-14 14:41:36,094 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 14:41:36,094 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 14:41:36,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 61 [2024-10-14 14:41:36,879 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 14:41:36,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 79 [2024-10-14 14:41:37,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 47 [2024-10-14 14:41:37,033 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-14 14:41:37,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 1 [2024-10-14 14:41:37,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 58 [2024-10-14 14:41:37,045 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-14 14:41:37,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 1 [2024-10-14 14:41:37,072 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 14:41:37,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [659501756] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 14:41:37,073 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 14:41:37,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 22 [2024-10-14 14:41:37,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947527557] [2024-10-14 14:41:37,073 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 14:41:37,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-14 14:41:37,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:41:37,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-14 14:41:37,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=410, Unknown=0, NotChecked=0, Total=506 [2024-10-14 14:41:37,210 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-10-14 14:41:37,211 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 111 transitions, 679 flow. Second operand has 23 states, 23 states have (on average 8.826086956521738) internal successors, (203), 23 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 14:41:37,211 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 14:41:37,211 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-10-14 14:41:37,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 14:41:38,784 INFO L124 PetriNetUnfolderBase]: 2837/4302 cut-off events. [2024-10-14 14:41:38,784 INFO L125 PetriNetUnfolderBase]: For 4931/4936 co-relation queries the response was YES. [2024-10-14 14:41:38,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13781 conditions, 4302 events. 2837/4302 cut-off events. For 4931/4936 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 22223 event pairs, 146 based on Foata normal form. 6/4307 useless extension candidates. Maximal degree in co-relation 12444. Up to 2499 conditions per place. [2024-10-14 14:41:38,817 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 162 selfloop transitions, 89 changer transitions 2/257 dead transitions. [2024-10-14 14:41:38,818 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 257 transitions, 1757 flow [2024-10-14 14:41:38,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-14 14:41:38,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2024-10-14 14:41:38,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 292 transitions. [2024-10-14 14:41:38,819 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.46570972886762363 [2024-10-14 14:41:38,820 INFO L175 Difference]: Start difference. First operand has 76 places, 111 transitions, 679 flow. Second operand 19 states and 292 transitions. [2024-10-14 14:41:38,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 257 transitions, 1757 flow [2024-10-14 14:41:38,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 257 transitions, 1720 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-10-14 14:41:38,836 INFO L231 Difference]: Finished difference. Result has 96 places, 156 transitions, 1222 flow [2024-10-14 14:41:38,836 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=645, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=1222, PETRI_PLACES=96, PETRI_TRANSITIONS=156} [2024-10-14 14:41:38,837 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, 61 predicate places. [2024-10-14 14:41:38,837 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 156 transitions, 1222 flow [2024-10-14 14:41:38,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 8.826086956521738) internal successors, (203), 23 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 14:41:38,837 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 14:41:38,837 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] [2024-10-14 14:41:38,855 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-14 14:41:39,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 14:41:39,039 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-10-14 14:41:39,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:41:39,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1101888080, now seen corresponding path program 4 times [2024-10-14 14:41:39,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:41:39,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641457134] [2024-10-14 14:41:39,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:41:39,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:41:39,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:41:39,506 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 14:41:39,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:41:39,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641457134] [2024-10-14 14:41:39,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641457134] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 14:41:39,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [42806548] [2024-10-14 14:41:39,507 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-14 14:41:39,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 14:41:39,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 14:41:39,509 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-10-14 14:41:39,509 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-10-14 14:41:39,575 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-14 14:41:39,575 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 14:41:39,577 INFO L255 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-10-14 14:41:39,578 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 14:41:39,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-14 14:41:39,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 34 [2024-10-14 14:41:39,810 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 14:41:39,811 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 14:41:40,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 61 [2024-10-14 14:41:40,501 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 14:41:40,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 79 [2024-10-14 14:41:40,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 58 [2024-10-14 14:41:40,641 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-14 14:41:40,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 1 [2024-10-14 14:41:40,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 47 [2024-10-14 14:41:40,656 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-14 14:41:40,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 1 [2024-10-14 14:41:40,680 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 14:41:40,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [42806548] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 14:41:40,680 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 14:41:40,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 20 [2024-10-14 14:41:40,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899899871] [2024-10-14 14:41:40,681 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 14:41:40,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-14 14:41:40,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:41:40,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-14 14:41:40,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2024-10-14 14:41:40,836 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-10-14 14:41:40,837 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 156 transitions, 1222 flow. Second operand has 21 states, 21 states have (on average 9.047619047619047) internal successors, (190), 21 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 14:41:40,837 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 14:41:40,837 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-10-14 14:41:40,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 14:41:42,343 INFO L124 PetriNetUnfolderBase]: 3261/4900 cut-off events. [2024-10-14 14:41:42,343 INFO L125 PetriNetUnfolderBase]: For 8628/8633 co-relation queries the response was YES. [2024-10-14 14:41:42,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17782 conditions, 4900 events. 3261/4900 cut-off events. For 8628/8633 co-relation queries the response was YES. Maximal size of possible extension queue 263. Compared 25393 event pairs, 190 based on Foata normal form. 6/4905 useless extension candidates. Maximal degree in co-relation 16270. Up to 1876 conditions per place. [2024-10-14 14:41:42,371 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 140 selfloop transitions, 140 changer transitions 1/285 dead transitions. [2024-10-14 14:41:42,371 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 285 transitions, 2273 flow [2024-10-14 14:41:42,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-14 14:41:42,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2024-10-14 14:41:42,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 320 transitions. [2024-10-14 14:41:42,373 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.46176046176046176 [2024-10-14 14:41:42,374 INFO L175 Difference]: Start difference. First operand has 96 places, 156 transitions, 1222 flow. Second operand 21 states and 320 transitions. [2024-10-14 14:41:42,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 285 transitions, 2273 flow [2024-10-14 14:41:42,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 285 transitions, 2224 flow, removed 9 selfloop flow, removed 6 redundant places. [2024-10-14 14:41:42,407 INFO L231 Difference]: Finished difference. Result has 113 places, 180 transitions, 1697 flow [2024-10-14 14:41:42,408 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1173, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=118, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1697, PETRI_PLACES=113, PETRI_TRANSITIONS=180} [2024-10-14 14:41:42,408 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, 78 predicate places. [2024-10-14 14:41:42,408 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 180 transitions, 1697 flow [2024-10-14 14:41:42,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 9.047619047619047) internal successors, (190), 21 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 14:41:42,409 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 14:41:42,409 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] [2024-10-14 14:41:42,427 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-14 14:41:42,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 14:41:42,610 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-10-14 14:41:42,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:41:42,611 INFO L85 PathProgramCache]: Analyzing trace with hash -1443003576, now seen corresponding path program 5 times [2024-10-14 14:41:42,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:41:42,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222007294] [2024-10-14 14:41:42,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:41:42,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:41:42,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:41:43,003 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 14:41:43,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:41:43,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222007294] [2024-10-14 14:41:43,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222007294] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 14:41:43,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1645551585] [2024-10-14 14:41:43,003 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-14 14:41:43,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 14:41:43,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 14:41:43,007 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 14:41:43,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-14 14:41:43,086 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2024-10-14 14:41:43,086 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 14:41:43,090 INFO L255 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-14 14:41:43,092 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 14:41:43,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-14 14:41:43,371 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 14:41:43,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 87 treesize of output 75 [2024-10-14 14:41:43,642 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 14:41:43,642 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 14:41:44,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2024-10-14 14:41:44,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 50 [2024-10-14 14:41:44,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 57 [2024-10-14 14:41:44,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 71 [2024-10-14 14:41:44,540 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 14:41:44,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1645551585] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 14:41:44,540 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 14:41:44,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 28 [2024-10-14 14:41:44,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419400125] [2024-10-14 14:41:44,541 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 14:41:44,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-10-14 14:41:44,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:41:44,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-10-14 14:41:44,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=657, Unknown=0, NotChecked=0, Total=812 [2024-10-14 14:41:44,624 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-10-14 14:41:44,625 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 180 transitions, 1697 flow. Second operand has 29 states, 29 states have (on average 7.413793103448276) internal successors, (215), 29 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 14:41:44,625 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 14:41:44,625 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-10-14 14:41:44,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 14:41:50,091 INFO L124 PetriNetUnfolderBase]: 6480/9263 cut-off events. [2024-10-14 14:41:50,091 INFO L125 PetriNetUnfolderBase]: For 21066/21071 co-relation queries the response was YES. [2024-10-14 14:41:50,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35203 conditions, 9263 events. 6480/9263 cut-off events. For 21066/21071 co-relation queries the response was YES. Maximal size of possible extension queue 458. Compared 47909 event pairs, 270 based on Foata normal form. 7/9269 useless extension candidates. Maximal degree in co-relation 32733. Up to 2598 conditions per place. [2024-10-14 14:41:50,230 INFO L140 encePairwiseOnDemand]: 18/33 looper letters, 288 selfloop transitions, 344 changer transitions 2/636 dead transitions. [2024-10-14 14:41:50,230 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 636 transitions, 5459 flow [2024-10-14 14:41:50,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-10-14 14:41:50,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2024-10-14 14:41:50,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 696 transitions. [2024-10-14 14:41:50,242 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.41354723707664887 [2024-10-14 14:41:50,242 INFO L175 Difference]: Start difference. First operand has 113 places, 180 transitions, 1697 flow. Second operand 51 states and 696 transitions. [2024-10-14 14:41:50,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 636 transitions, 5459 flow [2024-10-14 14:41:50,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 636 transitions, 5241 flow, removed 82 selfloop flow, removed 10 redundant places. [2024-10-14 14:41:50,347 INFO L231 Difference]: Finished difference. Result has 175 places, 391 transitions, 4538 flow [2024-10-14 14:41:50,351 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1612, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=148, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=51, PETRI_FLOW=4538, PETRI_PLACES=175, PETRI_TRANSITIONS=391} [2024-10-14 14:41:50,352 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, 140 predicate places. [2024-10-14 14:41:50,354 INFO L471 AbstractCegarLoop]: Abstraction has has 175 places, 391 transitions, 4538 flow [2024-10-14 14:41:50,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 7.413793103448276) internal successors, (215), 29 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 14:41:50,354 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 14:41:50,354 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] [2024-10-14 14:41:50,373 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-14 14:41:50,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 14:41:50,556 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-10-14 14:41:50,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:41:50,556 INFO L85 PathProgramCache]: Analyzing trace with hash 386528106, now seen corresponding path program 6 times [2024-10-14 14:41:50,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:41:50,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105826237] [2024-10-14 14:41:50,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:41:50,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:41:50,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:41:50,646 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 14:41:50,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:41:50,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105826237] [2024-10-14 14:41:50,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105826237] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 14:41:50,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1515857879] [2024-10-14 14:41:50,647 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-10-14 14:41:50,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 14:41:50,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 14:41:50,649 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 14:41:50,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-14 14:41:50,729 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2024-10-14 14:41:50,729 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 14:41:50,730 INFO L255 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-14 14:41:50,732 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 14:41:50,844 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 14:41:50,845 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 14:41:50,924 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 14:41:50,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1515857879] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 14:41:50,925 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 14:41:50,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 18 [2024-10-14 14:41:50,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424940125] [2024-10-14 14:41:50,925 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 14:41:50,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-14 14:41:50,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:41:50,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-14 14:41:50,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2024-10-14 14:41:50,954 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2024-10-14 14:41:50,955 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 391 transitions, 4538 flow. Second operand has 19 states, 19 states have (on average 7.473684210526316) internal successors, (142), 19 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 14:41:50,955 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 14:41:50,955 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2024-10-14 14:41:50,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 14:41:53,969 INFO L124 PetriNetUnfolderBase]: 12293/17498 cut-off events. [2024-10-14 14:41:53,970 INFO L125 PetriNetUnfolderBase]: For 110303/110303 co-relation queries the response was YES. [2024-10-14 14:41:54,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87366 conditions, 17498 events. 12293/17498 cut-off events. For 110303/110303 co-relation queries the response was YES. Maximal size of possible extension queue 741. Compared 98257 event pairs, 1705 based on Foata normal form. 260/16597 useless extension candidates. Maximal degree in co-relation 86539. Up to 5082 conditions per place. [2024-10-14 14:41:54,095 INFO L140 encePairwiseOnDemand]: 19/33 looper letters, 828 selfloop transitions, 314 changer transitions 0/1143 dead transitions. [2024-10-14 14:41:54,096 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 1143 transitions, 13914 flow [2024-10-14 14:41:54,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-10-14 14:41:54,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2024-10-14 14:41:54,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 460 transitions. [2024-10-14 14:41:54,098 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4356060606060606 [2024-10-14 14:41:54,098 INFO L175 Difference]: Start difference. First operand has 175 places, 391 transitions, 4538 flow. Second operand 32 states and 460 transitions. [2024-10-14 14:41:54,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 1143 transitions, 13914 flow [2024-10-14 14:41:55,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 1143 transitions, 12372 flow, removed 642 selfloop flow, removed 14 redundant places. [2024-10-14 14:41:55,296 INFO L231 Difference]: Finished difference. Result has 210 places, 639 transitions, 7371 flow [2024-10-14 14:41:55,296 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=4073, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=391, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=88, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=287, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=7371, PETRI_PLACES=210, PETRI_TRANSITIONS=639} [2024-10-14 14:41:55,297 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, 175 predicate places. [2024-10-14 14:41:55,297 INFO L471 AbstractCegarLoop]: Abstraction has has 210 places, 639 transitions, 7371 flow [2024-10-14 14:41:55,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 7.473684210526316) internal successors, (142), 19 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 14:41:55,297 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 14:41:55,297 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] [2024-10-14 14:41:55,309 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-14 14:41:55,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 14:41:55,498 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-10-14 14:41:55,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:41:55,499 INFO L85 PathProgramCache]: Analyzing trace with hash -820156864, now seen corresponding path program 1 times [2024-10-14 14:41:55,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:41:55,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481766205] [2024-10-14 14:41:55,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:41:55,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:41:55,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:41:55,592 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 14:41:55,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:41:55,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481766205] [2024-10-14 14:41:55,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481766205] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 14:41:55,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [595178528] [2024-10-14 14:41:55,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:41:55,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 14:41:55,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 14:41:55,595 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 14:41:55,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-14 14:41:55,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:41:55,676 INFO L255 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-14 14:41:55,677 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 14:41:55,718 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 14:41:55,718 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 14:41:55,766 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 14:41:55,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [595178528] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 14:41:55,766 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 14:41:55,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2024-10-14 14:41:55,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847378220] [2024-10-14 14:41:55,766 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 14:41:55,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-14 14:41:55,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:41:55,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-14 14:41:55,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-10-14 14:41:55,791 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-10-14 14:41:55,791 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 639 transitions, 7371 flow. Second operand has 13 states, 13 states have (on average 9.384615384615385) internal successors, (122), 13 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 14:41:55,791 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 14:41:55,791 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-10-14 14:41:55,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 14:41:56,411 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([422] L71-->L75: Formula: (let ((.cse0 (select (select |v_#memory_int#1_53| v_~A~0.base_71) (+ v_~A~0.offset_71 (* v_thread3Thread1of1ForFork0_~i~2_7 4))))) (or (and (= v_~min2~0_58 v_~min2~0_57) (<= v_~min2~0_58 .cse0) (= |v_thread3Thread1of1ForFork0_#t~mem8_2| |v_thread3Thread1of1ForFork0_#t~mem8_1|)) (and (= v_~min2~0_57 .cse0) (< .cse0 v_~min2~0_58)))) InVars {~A~0.base=v_~A~0.base_71, ~A~0.offset=v_~A~0.offset_71, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_7, #memory_int#1=|v_#memory_int#1_53|, thread3Thread1of1ForFork0_#t~mem8=|v_thread3Thread1of1ForFork0_#t~mem8_1|, ~min2~0=v_~min2~0_58} OutVars{~A~0.base=v_~A~0.base_71, ~A~0.offset=v_~A~0.offset_71, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_7, #memory_int#1=|v_#memory_int#1_53|, thread3Thread1of1ForFork0_#t~mem8=|v_thread3Thread1of1ForFork0_#t~mem8_2|, thread3Thread1of1ForFork0_#t~mem7=|v_thread3Thread1of1ForFork0_#t~mem7_1|, ~min2~0=v_~min2~0_57} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem8, thread3Thread1of1ForFork0_#t~mem7, ~min2~0][206], [Black: 1272#(and (or (and (= ~min1~0 0) (= ~min2~0 0)) (and (<= (+ ~min1~0 1) 0) (= ~min2~0 ~min1~0))) (or (< 1 ~N~0) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (< 1 ~N~0))), Black: 1252#(and (or (< ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 1)) (< 1 ~N~0)) (or (and (<= ~min1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~min2~0 ~min1~0)) (< 1 ~N~0)) (or (and (or (= ~min1~0 0) (< ~min1~0 0)) (<= 2 ~N~0) (<= (+ ~min2~0 1) 0)) (and (= ~N~0 1) (<= (+ ~min1~0 1) 0)) (and (= ~min1~0 0) (= ~min2~0 0) (<= 1 ~N~0)) (and (= ~min2~0 0) (<= (+ ~min1~0 1) 0))) (<= thread1Thread1of1ForFork1_~i~0 1) (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (< 1 ~N~0))), Black: 1228#(and (or (and (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))))) (< 1 ~N~0)) (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 1)) (< 1 ~N~0)) (or (and (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 ~min1~0))) (< 1 ~N~0))), Black: 1260#(and (or (and (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))))) (< 1 ~N~0)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (and (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) ~min1~0) (= ~min2~0 ~min1~0)) (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 1))))) (or (and (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 ~min1~0))) (< 1 ~N~0))), Black: 1234#(and (or (and (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))))) (< 1 ~N~0)) (or (and (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 ~min1~0))) (< 1 ~N~0))), Black: 1127#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (= ~min2~0 ~min1~0)), 806#true, 32#L75true, Black: 1214#(and (= ~min1~0 0) (or (< ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 1)) (< 1 ~N~0)) (or (< 1 ~N~0) (and (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 0) (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0)))) (or (< 0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1)) (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0)))))) (or (exists ((v_subst_6 Int)) (and (<= (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_subst_6) ~A~0.offset)) 1) 0) (<= (+ v_subst_6 1) ~N~0) (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_subst_6) ~A~0.offset))) (<= 0 v_subst_6))) (and (= ~min2~0 0) (exists ((v_subst_5 Int)) (and (<= (+ v_subst_5 1) ~N~0) (<= 0 v_subst_5) (<= 0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* 4 v_subst_5))))))))), Black: 1222#(and (= ~min1~0 0) (or (and (= ~min2~0 0) (exists ((v_subst_10 Int)) (and (<= 0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* v_subst_10 4)))) (<= 0 v_subst_10) (<= (+ v_subst_10 1) ~N~0)))) (exists ((v_subst_9 Int)) (and (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* 4 v_subst_9)))) (<= 0 v_subst_9) (<= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* 4 v_subst_9))) 1) 0) (<= (+ v_subst_9 1) ~N~0)))) (or (< ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 1)) (< 1 ~N~0)) (or (< 1 ~N~0) (and (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 0) (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0)))) (or (< 0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1)) (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0)))))) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1244#(and (or (and (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))))) (< 1 ~N~0)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (and (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) ~min1~0) (= ~min2~0 ~min1~0)) (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 1))))) (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 1)) (< 1 ~N~0)) (or (and (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 ~min1~0))) (< 1 ~N~0))), Black: 1220#(and (or (and (or (and (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 ~min1~0))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) ~min2~0)) (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 1)) (and (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))))) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1)))))) (< 1 ~N~0)) (or (and (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0) (= (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) ~min2~0) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (and (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 ~min1~0)))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) ~min1~0) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))))) (< 1 ~N~0))), Black: 1157#(or (and (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0) (= (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) ~min2~0) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (and (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 ~min1~0)))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) ~min1~0) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))))) (< 1 ~N~0)), Black: 1256#(and (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 1)) (< 1 ~N~0)) (or (and (= ~min1~0 0) (= ~min2~0 0)) (and (<= (+ ~min1~0 1) 0) (= ~min2~0 ~min1~0))) (or (< 1 ~N~0) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (< 1 ~N~0))), Black: 1254#(and (or (and (= ~min1~0 0) (= ~min2~0 0)) (and (<= (+ ~min1~0 1) 0) (= ~min2~0 ~min1~0))) (or (= ~N~0 1) (< 1 ~N~0)) (<= thread1Thread1of1ForFork1_~i~0 1) (or (< 1 ~N~0) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (< 1 ~N~0))), Black: 1240#(and (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 1)) (< 1 ~N~0)) (or (and (= ~min1~0 0) (= ~min2~0 0)) (and (<= (+ ~min1~0 1) 0) (= ~min2~0 ~min1~0))) (or (= ~N~0 1) (< 1 ~N~0)) (<= thread1Thread1of1ForFork1_~i~0 1) (or (< 1 ~N~0) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (< 1 ~N~0))), 1495#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= 2 ~N~0) (<= thread2Thread1of1ForFork2_~i~1 0) (= thread1Thread1of1ForFork1_~i~0 0)), 15#L63true, Black: 408#(and (or (and (= ~min1~0 0) (= ~min2~0 0)) (and (<= (+ ~min1~0 1) 0) (= ~min2~0 ~min1~0))) (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0)) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1)))), 1010#true, Black: 378#(and (= ~min1~0 0) (= ~min2~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 347#(and (or (and (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min2~0) (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (and (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min1~0)) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min2~0) (= ~min2~0 ~min1~0))))), Black: 790#(and (<= ~min1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (<= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~min2~0 ~min1~0) (or (= ~min1~0 0) (< ~min1~0 0)) (= thread1Thread1of1ForFork1_~i~0 0) (<= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))))), Black: 794#(and (<= ~min1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (<= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~min2~0 ~min1~0) (or (= ~min1~0 0) (< ~min1~0 0)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 786#(and (= ~min1~0 0) (= (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork0_~i~2 4)) (select (select |#memory_int#1| ~A~0.base) 0)) (= ~A~0.offset 0) (<= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4))) (= thread1Thread1of1ForFork1_~i~0 0) (or (and (= ~min2~0 0) (<= 0 (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork0_~i~2 4)))) (and (<= (+ (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork0_~i~2 4)) 1) 0) (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork0_~i~2 4)))))), Black: 792#(and (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 ~min1~0)) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) ~min1~0) (= ~min2~0 ~min1~0)) (<= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (<= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)))) (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 1)))), Black: 740#(and (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1)) (and (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min1~0)) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))))) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min2~0) (and (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 ~min1~0))))), Black: 796#(and (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 ~min1~0)) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) ~min1~0) (= ~min2~0 ~min1~0)) (<= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 1)))), Black: 798#(and (or (and (= ~min1~0 0) (= ~min2~0 0)) (and (<= (+ ~min1~0 1) 0) (= ~min2~0 ~min1~0))) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min2~0) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))), 6#L94-4true, 600#true, Black: 48#(and (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 52#(<= (+ ~M~0 1) ~N~0), Black: 61#(<= 1 ~N~0), Black: 598#(and (<= ~min1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (<= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~min2~0 ~min1~0) (or (= ~min1~0 0) (< ~min1~0 0))), 1532#true, Black: 1491#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= 2 ~N~0) (<= ~M~0 0)), Black: 1295#true, Black: 1503#(and (<= thread3Thread1of1ForFork0_~i~2 1) (<= 2 ~N~0) (<= ~M~0 0)), Black: 1509#(and (<= thread3Thread1of1ForFork0_~i~2 1) (<= 2 ~N~0) (= thread1Thread1of1ForFork1_~i~0 0) (<= ~M~0 0)), Black: 1511#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= 2 ~N~0) (<= ~M~0 0)), 203#true, Black: 1006#(and (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min2~0) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (and (= ~min2~0 ~min1~0) (<= (+ ~min2~0 1) 0)) (and (= ~min1~0 0) (= ~min2~0 0))) (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))), Black: 1475#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= 2 ~N~0)), Black: 992#(and (= ~min1~0 0) (= ~A~0.offset 0) (or (= ~min2~0 0) (< (select (select |#memory_int#1| ~A~0.base) 0) 0)) (<= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4))) (or (< 0 (+ (select (select |#memory_int#1| ~A~0.base) 0) 1)) (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) 0))) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1487#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= 2 ~N~0) (<= thread2Thread1of1ForFork2_~i~1 0)), 5#L47true, Black: 1000#(and (<= ~min1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (<= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~min2~0 ~min1~0) (= thread1Thread1of1ForFork1_~i~0 0) (or (= ~min1~0 0) (< ~min2~0 0))), Black: 1473#(and (<= 2 ~N~0) (<= thread2Thread1of1ForFork2_~i~1 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1328#(and (<= 2 ~N~0) (<= thread2Thread1of1ForFork2_~i~1 0)), Black: 1507#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= 2 ~N~0) (<= thread2Thread1of1ForFork2_~i~1 0)), Black: 1481#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= 2 ~N~0) (<= thread2Thread1of1ForFork2_~i~1 0)), Black: 1335#(and (<= 2 ~N~0) (<= ~M~0 0)), Black: 1398#(< thread3Thread1of1ForFork0_~i~2 ~N~0), Black: 1501#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= 2 ~N~0)), Black: 1505#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= 2 ~N~0) (<= ~M~0 0) (<= thread3Thread1of1ForFork0_~i~2 0)), Black: 1236#(and (or (< ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 1)) (< 1 ~N~0)) (or (and (<= ~min1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~min2~0 ~min1~0)) (< 1 ~N~0)) (or (and (or (= ~min1~0 0) (< ~min1~0 0)) (<= 2 ~N~0) (<= (+ ~min2~0 1) 0)) (and (= ~N~0 1) (<= (+ ~min1~0 1) 0)) (and (= ~min1~0 0) (= ~min2~0 0) (<= 1 ~N~0)) (and (= ~min2~0 0) (<= (+ ~min1~0 1) 0))) (= thread1Thread1of1ForFork1_~i~0 0) (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (< 1 ~N~0))), Black: 1268#(and (or (and (<= ~min1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~min2~0 ~min1~0)) (< 1 ~N~0)) (or (and (or (= ~min1~0 0) (< ~min1~0 0)) (<= 2 ~N~0) (<= (+ ~min2~0 1) 0)) (and (= ~N~0 1) (<= (+ ~min1~0 1) 0)) (and (= ~min1~0 0) (= ~min2~0 0) (<= 1 ~N~0)) (and (= ~min2~0 0) (<= (+ ~min1~0 1) 0))) (<= thread1Thread1of1ForFork1_~i~0 1) (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (< 1 ~N~0))), Black: 1513#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= thread3Thread1of1ForFork0_~i~2 1) (<= 2 ~N~0) (<= ~M~0 0)), Black: 1477#(and (<= 2 ~N~0) (= thread1Thread1of1ForFork1_~i~0 0) (<= ~M~0 0)), Black: 1270#(and (or (< ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 1)) (< 1 ~N~0)) (or (and (= ~min1~0 0) (= ~min2~0 0)) (and (<= (+ ~min1~0 1) 0) (= ~min2~0 ~min1~0))) (or (< 1 ~N~0) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (< 1 ~N~0))), Black: 1020#(= ~min2~0 ~min1~0), Black: 1218#(and (or (< ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)) (and (or (and (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 ~min1~0))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) ~min2~0)) (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 1)) (and (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))))) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1)))))) (< 1 ~N~0)) (or (and (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0) (= (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) ~min2~0) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (and (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 ~min1~0)))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) ~min1~0) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))))) (< 1 ~N~0))), Black: 1208#(and (or (< ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)) (and (or (and (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 ~min1~0))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) ~min2~0)) (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 1)) (and (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))))) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1)))))) (< 1 ~N~0)) (or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (= ~min2~0 ~min1~0)) (or (and (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0) (= (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) ~min2~0) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (and (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 ~min1~0)))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) ~min1~0) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))))) (< 1 ~N~0))), Black: 1262#(and (or (and (<= ~min1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~min2~0 ~min1~0)) (< 1 ~N~0)) (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 1)) (< 1 ~N~0)) (or (and (or (= ~min1~0 0) (< ~min1~0 0)) (<= 2 ~N~0) (<= (+ ~min2~0 1) 0)) (and (= ~N~0 1) (<= (+ ~min1~0 1) 0)) (and (= ~min1~0 0) (= ~min2~0 0) (<= 1 ~N~0)) (and (= ~min2~0 0) (<= (+ ~min1~0 1) 0))) (<= thread1Thread1of1ForFork1_~i~0 1) (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (< 1 ~N~0)))]) [2024-10-14 14:41:56,412 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2024-10-14 14:41:56,412 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-10-14 14:41:56,412 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-10-14 14:41:56,412 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-10-14 14:41:56,771 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([422] L71-->L75: Formula: (let ((.cse0 (select (select |v_#memory_int#1_53| v_~A~0.base_71) (+ v_~A~0.offset_71 (* v_thread3Thread1of1ForFork0_~i~2_7 4))))) (or (and (= v_~min2~0_58 v_~min2~0_57) (<= v_~min2~0_58 .cse0) (= |v_thread3Thread1of1ForFork0_#t~mem8_2| |v_thread3Thread1of1ForFork0_#t~mem8_1|)) (and (= v_~min2~0_57 .cse0) (< .cse0 v_~min2~0_58)))) InVars {~A~0.base=v_~A~0.base_71, ~A~0.offset=v_~A~0.offset_71, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_7, #memory_int#1=|v_#memory_int#1_53|, thread3Thread1of1ForFork0_#t~mem8=|v_thread3Thread1of1ForFork0_#t~mem8_1|, ~min2~0=v_~min2~0_58} OutVars{~A~0.base=v_~A~0.base_71, ~A~0.offset=v_~A~0.offset_71, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_7, #memory_int#1=|v_#memory_int#1_53|, thread3Thread1of1ForFork0_#t~mem8=|v_thread3Thread1of1ForFork0_#t~mem8_2|, thread3Thread1of1ForFork0_#t~mem7=|v_thread3Thread1of1ForFork0_#t~mem7_1|, ~min2~0=v_~min2~0_57} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem8, thread3Thread1of1ForFork0_#t~mem7, ~min2~0][206], [Black: 1272#(and (or (and (= ~min1~0 0) (= ~min2~0 0)) (and (<= (+ ~min1~0 1) 0) (= ~min2~0 ~min1~0))) (or (< 1 ~N~0) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (< 1 ~N~0))), Black: 1252#(and (or (< ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 1)) (< 1 ~N~0)) (or (and (<= ~min1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~min2~0 ~min1~0)) (< 1 ~N~0)) (or (and (or (= ~min1~0 0) (< ~min1~0 0)) (<= 2 ~N~0) (<= (+ ~min2~0 1) 0)) (and (= ~N~0 1) (<= (+ ~min1~0 1) 0)) (and (= ~min1~0 0) (= ~min2~0 0) (<= 1 ~N~0)) (and (= ~min2~0 0) (<= (+ ~min1~0 1) 0))) (<= thread1Thread1of1ForFork1_~i~0 1) (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (< 1 ~N~0))), Black: 1228#(and (or (and (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))))) (< 1 ~N~0)) (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 1)) (< 1 ~N~0)) (or (and (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 ~min1~0))) (< 1 ~N~0))), Black: 1260#(and (or (and (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))))) (< 1 ~N~0)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (and (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) ~min1~0) (= ~min2~0 ~min1~0)) (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 1))))) (or (and (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 ~min1~0))) (< 1 ~N~0))), Black: 1234#(and (or (and (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))))) (< 1 ~N~0)) (or (and (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 ~min1~0))) (< 1 ~N~0))), 806#true, Black: 1127#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (= ~min2~0 ~min1~0)), Black: 1214#(and (= ~min1~0 0) (or (< ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 1)) (< 1 ~N~0)) (or (< 1 ~N~0) (and (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 0) (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0)))) (or (< 0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1)) (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0)))))) (or (exists ((v_subst_6 Int)) (and (<= (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_subst_6) ~A~0.offset)) 1) 0) (<= (+ v_subst_6 1) ~N~0) (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_subst_6) ~A~0.offset))) (<= 0 v_subst_6))) (and (= ~min2~0 0) (exists ((v_subst_5 Int)) (and (<= (+ v_subst_5 1) ~N~0) (<= 0 v_subst_5) (<= 0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* 4 v_subst_5))))))))), 32#L75true, Black: 1222#(and (= ~min1~0 0) (or (and (= ~min2~0 0) (exists ((v_subst_10 Int)) (and (<= 0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* v_subst_10 4)))) (<= 0 v_subst_10) (<= (+ v_subst_10 1) ~N~0)))) (exists ((v_subst_9 Int)) (and (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* 4 v_subst_9)))) (<= 0 v_subst_9) (<= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* 4 v_subst_9))) 1) 0) (<= (+ v_subst_9 1) ~N~0)))) (or (< ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 1)) (< 1 ~N~0)) (or (< 1 ~N~0) (and (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 0) (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0)))) (or (< 0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1)) (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0)))))) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1244#(and (or (and (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))))) (< 1 ~N~0)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (and (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) ~min1~0) (= ~min2~0 ~min1~0)) (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 1))))) (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 1)) (< 1 ~N~0)) (or (and (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 ~min1~0))) (< 1 ~N~0))), Black: 1220#(and (or (and (or (and (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 ~min1~0))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) ~min2~0)) (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 1)) (and (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))))) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1)))))) (< 1 ~N~0)) (or (and (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0) (= (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) ~min2~0) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (and (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 ~min1~0)))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) ~min1~0) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))))) (< 1 ~N~0))), Black: 1157#(or (and (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0) (= (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) ~min2~0) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (and (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 ~min1~0)))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) ~min1~0) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))))) (< 1 ~N~0)), Black: 1256#(and (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 1)) (< 1 ~N~0)) (or (and (= ~min1~0 0) (= ~min2~0 0)) (and (<= (+ ~min1~0 1) 0) (= ~min2~0 ~min1~0))) (or (< 1 ~N~0) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (< 1 ~N~0))), Black: 1254#(and (or (and (= ~min1~0 0) (= ~min2~0 0)) (and (<= (+ ~min1~0 1) 0) (= ~min2~0 ~min1~0))) (or (= ~N~0 1) (< 1 ~N~0)) (<= thread1Thread1of1ForFork1_~i~0 1) (or (< 1 ~N~0) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (< 1 ~N~0))), Black: 1240#(and (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 1)) (< 1 ~N~0)) (or (and (= ~min1~0 0) (= ~min2~0 0)) (and (<= (+ ~min1~0 1) 0) (= ~min2~0 ~min1~0))) (or (= ~N~0 1) (< 1 ~N~0)) (<= thread1Thread1of1ForFork1_~i~0 1) (or (< 1 ~N~0) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (< 1 ~N~0))), 15#L63true, 1495#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= 2 ~N~0) (<= thread2Thread1of1ForFork2_~i~1 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 408#(and (or (and (= ~min1~0 0) (= ~min2~0 0)) (and (<= (+ ~min1~0 1) 0) (= ~min2~0 ~min1~0))) (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0)) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1)))), 1010#true, Black: 378#(and (= ~min1~0 0) (= ~min2~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 347#(and (or (and (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min2~0) (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (and (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min1~0)) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min2~0) (= ~min2~0 ~min1~0))))), Black: 790#(and (<= ~min1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (<= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~min2~0 ~min1~0) (or (= ~min1~0 0) (< ~min1~0 0)) (= thread1Thread1of1ForFork1_~i~0 0) (<= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))))), Black: 794#(and (<= ~min1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (<= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~min2~0 ~min1~0) (or (= ~min1~0 0) (< ~min1~0 0)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 786#(and (= ~min1~0 0) (= (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork0_~i~2 4)) (select (select |#memory_int#1| ~A~0.base) 0)) (= ~A~0.offset 0) (<= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4))) (= thread1Thread1of1ForFork1_~i~0 0) (or (and (= ~min2~0 0) (<= 0 (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork0_~i~2 4)))) (and (<= (+ (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork0_~i~2 4)) 1) 0) (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork0_~i~2 4)))))), Black: 792#(and (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 ~min1~0)) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) ~min1~0) (= ~min2~0 ~min1~0)) (<= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (<= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)))) (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 1)))), Black: 740#(and (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1)) (and (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min1~0)) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))))) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min2~0) (and (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 ~min1~0))))), Black: 796#(and (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 ~min1~0)) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) ~min1~0) (= ~min2~0 ~min1~0)) (<= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 1)))), Black: 798#(and (or (and (= ~min1~0 0) (= ~min2~0 0)) (and (<= (+ ~min1~0 1) 0) (= ~min2~0 ~min1~0))) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min2~0) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))), 6#L94-4true, 600#true, Black: 48#(and (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 52#(<= (+ ~M~0 1) ~N~0), Black: 61#(<= 1 ~N~0), Black: 598#(and (<= ~min1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (<= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~min2~0 ~min1~0) (or (= ~min1~0 0) (< ~min1~0 0))), 1532#true, Black: 1491#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= 2 ~N~0) (<= ~M~0 0)), Black: 1295#true, Black: 1503#(and (<= thread3Thread1of1ForFork0_~i~2 1) (<= 2 ~N~0) (<= ~M~0 0)), Black: 1509#(and (<= thread3Thread1of1ForFork0_~i~2 1) (<= 2 ~N~0) (= thread1Thread1of1ForFork1_~i~0 0) (<= ~M~0 0)), 203#true, Black: 1511#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= 2 ~N~0) (<= ~M~0 0)), Black: 1006#(and (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min2~0) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (and (= ~min2~0 ~min1~0) (<= (+ ~min2~0 1) 0)) (and (= ~min1~0 0) (= ~min2~0 0))) (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))), Black: 1475#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= 2 ~N~0)), Black: 992#(and (= ~min1~0 0) (= ~A~0.offset 0) (or (= ~min2~0 0) (< (select (select |#memory_int#1| ~A~0.base) 0) 0)) (<= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4))) (or (< 0 (+ (select (select |#memory_int#1| ~A~0.base) 0) 1)) (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) 0))) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1487#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= 2 ~N~0) (<= thread2Thread1of1ForFork2_~i~1 0)), 5#L47true, Black: 1000#(and (<= ~min1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (<= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~min2~0 ~min1~0) (= thread1Thread1of1ForFork1_~i~0 0) (or (= ~min1~0 0) (< ~min2~0 0))), Black: 1473#(and (<= 2 ~N~0) (<= thread2Thread1of1ForFork2_~i~1 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1328#(and (<= 2 ~N~0) (<= thread2Thread1of1ForFork2_~i~1 0)), Black: 1507#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= 2 ~N~0) (<= thread2Thread1of1ForFork2_~i~1 0)), Black: 1481#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= 2 ~N~0) (<= thread2Thread1of1ForFork2_~i~1 0)), Black: 1335#(and (<= 2 ~N~0) (<= ~M~0 0)), Black: 1398#(< thread3Thread1of1ForFork0_~i~2 ~N~0), Black: 1501#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= 2 ~N~0)), Black: 1505#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= 2 ~N~0) (<= ~M~0 0) (<= thread3Thread1of1ForFork0_~i~2 0)), Black: 1236#(and (or (< ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 1)) (< 1 ~N~0)) (or (and (<= ~min1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~min2~0 ~min1~0)) (< 1 ~N~0)) (or (and (or (= ~min1~0 0) (< ~min1~0 0)) (<= 2 ~N~0) (<= (+ ~min2~0 1) 0)) (and (= ~N~0 1) (<= (+ ~min1~0 1) 0)) (and (= ~min1~0 0) (= ~min2~0 0) (<= 1 ~N~0)) (and (= ~min2~0 0) (<= (+ ~min1~0 1) 0))) (= thread1Thread1of1ForFork1_~i~0 0) (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (< 1 ~N~0))), Black: 1268#(and (or (and (<= ~min1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~min2~0 ~min1~0)) (< 1 ~N~0)) (or (and (or (= ~min1~0 0) (< ~min1~0 0)) (<= 2 ~N~0) (<= (+ ~min2~0 1) 0)) (and (= ~N~0 1) (<= (+ ~min1~0 1) 0)) (and (= ~min1~0 0) (= ~min2~0 0) (<= 1 ~N~0)) (and (= ~min2~0 0) (<= (+ ~min1~0 1) 0))) (<= thread1Thread1of1ForFork1_~i~0 1) (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (< 1 ~N~0))), Black: 1513#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= thread3Thread1of1ForFork0_~i~2 1) (<= 2 ~N~0) (<= ~M~0 0)), Black: 1477#(and (<= 2 ~N~0) (= thread1Thread1of1ForFork1_~i~0 0) (<= ~M~0 0)), Black: 1270#(and (or (< ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 1)) (< 1 ~N~0)) (or (and (= ~min1~0 0) (= ~min2~0 0)) (and (<= (+ ~min1~0 1) 0) (= ~min2~0 ~min1~0))) (or (< 1 ~N~0) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (< 1 ~N~0))), Black: 1020#(= ~min2~0 ~min1~0), Black: 1218#(and (or (< ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)) (and (or (and (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 ~min1~0))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) ~min2~0)) (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 1)) (and (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))))) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1)))))) (< 1 ~N~0)) (or (and (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0) (= (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) ~min2~0) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (and (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 ~min1~0)))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) ~min1~0) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))))) (< 1 ~N~0))), Black: 1208#(and (or (< ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)) (and (or (and (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 ~min1~0))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) ~min2~0)) (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 1)) (and (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))))) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1)))))) (< 1 ~N~0)) (or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (= ~min2~0 ~min1~0)) (or (and (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0) (= (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) ~min2~0) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (and (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 ~min1~0)))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) ~min1~0) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))))) (< 1 ~N~0))), Black: 1262#(and (or (and (<= ~min1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~min2~0 ~min1~0)) (< 1 ~N~0)) (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 1)) (< 1 ~N~0)) (or (and (or (= ~min1~0 0) (< ~min1~0 0)) (<= 2 ~N~0) (<= (+ ~min2~0 1) 0)) (and (= ~N~0 1) (<= (+ ~min1~0 1) 0)) (and (= ~min1~0 0) (= ~min2~0 0) (<= 1 ~N~0)) (and (= ~min2~0 0) (<= (+ ~min1~0 1) 0))) (<= thread1Thread1of1ForFork1_~i~0 1) (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (< 1 ~N~0)))]) [2024-10-14 14:41:56,774 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2024-10-14 14:41:56,775 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-10-14 14:41:56,775 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-10-14 14:41:56,775 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-10-14 14:41:56,775 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-10-14 14:41:56,792 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([422] L71-->L75: Formula: (let ((.cse0 (select (select |v_#memory_int#1_53| v_~A~0.base_71) (+ v_~A~0.offset_71 (* v_thread3Thread1of1ForFork0_~i~2_7 4))))) (or (and (= v_~min2~0_58 v_~min2~0_57) (<= v_~min2~0_58 .cse0) (= |v_thread3Thread1of1ForFork0_#t~mem8_2| |v_thread3Thread1of1ForFork0_#t~mem8_1|)) (and (= v_~min2~0_57 .cse0) (< .cse0 v_~min2~0_58)))) InVars {~A~0.base=v_~A~0.base_71, ~A~0.offset=v_~A~0.offset_71, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_7, #memory_int#1=|v_#memory_int#1_53|, thread3Thread1of1ForFork0_#t~mem8=|v_thread3Thread1of1ForFork0_#t~mem8_1|, ~min2~0=v_~min2~0_58} OutVars{~A~0.base=v_~A~0.base_71, ~A~0.offset=v_~A~0.offset_71, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_7, #memory_int#1=|v_#memory_int#1_53|, thread3Thread1of1ForFork0_#t~mem8=|v_thread3Thread1of1ForFork0_#t~mem8_2|, thread3Thread1of1ForFork0_#t~mem7=|v_thread3Thread1of1ForFork0_#t~mem7_1|, ~min2~0=v_~min2~0_57} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem8, thread3Thread1of1ForFork0_#t~mem7, ~min2~0][206], [Black: 1272#(and (or (and (= ~min1~0 0) (= ~min2~0 0)) (and (<= (+ ~min1~0 1) 0) (= ~min2~0 ~min1~0))) (or (< 1 ~N~0) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (< 1 ~N~0))), Black: 1252#(and (or (< ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 1)) (< 1 ~N~0)) (or (and (<= ~min1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~min2~0 ~min1~0)) (< 1 ~N~0)) (or (and (or (= ~min1~0 0) (< ~min1~0 0)) (<= 2 ~N~0) (<= (+ ~min2~0 1) 0)) (and (= ~N~0 1) (<= (+ ~min1~0 1) 0)) (and (= ~min1~0 0) (= ~min2~0 0) (<= 1 ~N~0)) (and (= ~min2~0 0) (<= (+ ~min1~0 1) 0))) (<= thread1Thread1of1ForFork1_~i~0 1) (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (< 1 ~N~0))), Black: 1228#(and (or (and (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))))) (< 1 ~N~0)) (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 1)) (< 1 ~N~0)) (or (and (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 ~min1~0))) (< 1 ~N~0))), Black: 1260#(and (or (and (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))))) (< 1 ~N~0)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (and (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) ~min1~0) (= ~min2~0 ~min1~0)) (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 1))))) (or (and (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 ~min1~0))) (< 1 ~N~0))), Black: 1234#(and (or (and (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))))) (< 1 ~N~0)) (or (and (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 ~min1~0))) (< 1 ~N~0))), 806#true, Black: 1127#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (= ~min2~0 ~min1~0)), Black: 1214#(and (= ~min1~0 0) (or (< ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 1)) (< 1 ~N~0)) (or (< 1 ~N~0) (and (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 0) (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0)))) (or (< 0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1)) (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0)))))) (or (exists ((v_subst_6 Int)) (and (<= (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_subst_6) ~A~0.offset)) 1) 0) (<= (+ v_subst_6 1) ~N~0) (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_subst_6) ~A~0.offset))) (<= 0 v_subst_6))) (and (= ~min2~0 0) (exists ((v_subst_5 Int)) (and (<= (+ v_subst_5 1) ~N~0) (<= 0 v_subst_5) (<= 0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* 4 v_subst_5))))))))), 32#L75true, Black: 1222#(and (= ~min1~0 0) (or (and (= ~min2~0 0) (exists ((v_subst_10 Int)) (and (<= 0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* v_subst_10 4)))) (<= 0 v_subst_10) (<= (+ v_subst_10 1) ~N~0)))) (exists ((v_subst_9 Int)) (and (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* 4 v_subst_9)))) (<= 0 v_subst_9) (<= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* 4 v_subst_9))) 1) 0) (<= (+ v_subst_9 1) ~N~0)))) (or (< ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 1)) (< 1 ~N~0)) (or (< 1 ~N~0) (and (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 0) (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0)))) (or (< 0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1)) (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0)))))) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1244#(and (or (and (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))))) (< 1 ~N~0)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (and (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) ~min1~0) (= ~min2~0 ~min1~0)) (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 1))))) (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 1)) (< 1 ~N~0)) (or (and (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 ~min1~0))) (< 1 ~N~0))), Black: 1220#(and (or (and (or (and (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 ~min1~0))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) ~min2~0)) (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 1)) (and (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))))) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1)))))) (< 1 ~N~0)) (or (and (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0) (= (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) ~min2~0) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (and (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 ~min1~0)))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) ~min1~0) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))))) (< 1 ~N~0))), Black: 1157#(or (and (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0) (= (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) ~min2~0) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (and (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 ~min1~0)))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) ~min1~0) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))))) (< 1 ~N~0)), Black: 1256#(and (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 1)) (< 1 ~N~0)) (or (and (= ~min1~0 0) (= ~min2~0 0)) (and (<= (+ ~min1~0 1) 0) (= ~min2~0 ~min1~0))) (or (< 1 ~N~0) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (< 1 ~N~0))), Black: 1254#(and (or (and (= ~min1~0 0) (= ~min2~0 0)) (and (<= (+ ~min1~0 1) 0) (= ~min2~0 ~min1~0))) (or (= ~N~0 1) (< 1 ~N~0)) (<= thread1Thread1of1ForFork1_~i~0 1) (or (< 1 ~N~0) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (< 1 ~N~0))), Black: 1240#(and (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 1)) (< 1 ~N~0)) (or (and (= ~min1~0 0) (= ~min2~0 0)) (and (<= (+ ~min1~0 1) 0) (= ~min2~0 ~min1~0))) (or (= ~N~0 1) (< 1 ~N~0)) (<= thread1Thread1of1ForFork1_~i~0 1) (or (< 1 ~N~0) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (< 1 ~N~0))), 15#L63true, 1495#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= 2 ~N~0) (<= thread2Thread1of1ForFork2_~i~1 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 408#(and (or (and (= ~min1~0 0) (= ~min2~0 0)) (and (<= (+ ~min1~0 1) 0) (= ~min2~0 ~min1~0))) (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0)) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1)))), 1010#true, Black: 378#(and (= ~min1~0 0) (= ~min2~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 347#(and (or (and (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min2~0) (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (and (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min1~0)) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min2~0) (= ~min2~0 ~min1~0))))), Black: 790#(and (<= ~min1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (<= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~min2~0 ~min1~0) (or (= ~min1~0 0) (< ~min1~0 0)) (= thread1Thread1of1ForFork1_~i~0 0) (<= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))))), Black: 794#(and (<= ~min1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (<= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~min2~0 ~min1~0) (or (= ~min1~0 0) (< ~min1~0 0)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 786#(and (= ~min1~0 0) (= (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork0_~i~2 4)) (select (select |#memory_int#1| ~A~0.base) 0)) (= ~A~0.offset 0) (<= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4))) (= thread1Thread1of1ForFork1_~i~0 0) (or (and (= ~min2~0 0) (<= 0 (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork0_~i~2 4)))) (and (<= (+ (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork0_~i~2 4)) 1) 0) (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork0_~i~2 4)))))), Black: 792#(and (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 ~min1~0)) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) ~min1~0) (= ~min2~0 ~min1~0)) (<= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (<= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)))) (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 1)))), Black: 740#(and (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1)) (and (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min1~0)) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))))) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min2~0) (and (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 ~min1~0))))), Black: 796#(and (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 ~min1~0)) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) ~min1~0) (= ~min2~0 ~min1~0)) (<= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 1)))), Black: 798#(and (or (and (= ~min1~0 0) (= ~min2~0 0)) (and (<= (+ ~min1~0 1) 0) (= ~min2~0 ~min1~0))) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min2~0) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))), 600#true, Black: 48#(and (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 52#(<= (+ ~M~0 1) ~N~0), 24#L95true, Black: 61#(<= 1 ~N~0), Black: 598#(and (<= ~min1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (<= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~min2~0 ~min1~0) (or (= ~min1~0 0) (< ~min1~0 0))), 1532#true, Black: 1491#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= 2 ~N~0) (<= ~M~0 0)), Black: 1295#true, Black: 1503#(and (<= thread3Thread1of1ForFork0_~i~2 1) (<= 2 ~N~0) (<= ~M~0 0)), Black: 1509#(and (<= thread3Thread1of1ForFork0_~i~2 1) (<= 2 ~N~0) (= thread1Thread1of1ForFork1_~i~0 0) (<= ~M~0 0)), 203#true, Black: 1511#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= 2 ~N~0) (<= ~M~0 0)), Black: 1006#(and (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min2~0) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (and (= ~min2~0 ~min1~0) (<= (+ ~min2~0 1) 0)) (and (= ~min1~0 0) (= ~min2~0 0))) (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))), Black: 1475#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= 2 ~N~0)), Black: 992#(and (= ~min1~0 0) (= ~A~0.offset 0) (or (= ~min2~0 0) (< (select (select |#memory_int#1| ~A~0.base) 0) 0)) (<= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4))) (or (< 0 (+ (select (select |#memory_int#1| ~A~0.base) 0) 1)) (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) 0))) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1487#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= 2 ~N~0) (<= thread2Thread1of1ForFork2_~i~1 0)), 5#L47true, Black: 1000#(and (<= ~min1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (<= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~min2~0 ~min1~0) (= thread1Thread1of1ForFork1_~i~0 0) (or (= ~min1~0 0) (< ~min2~0 0))), Black: 1473#(and (<= 2 ~N~0) (<= thread2Thread1of1ForFork2_~i~1 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1328#(and (<= 2 ~N~0) (<= thread2Thread1of1ForFork2_~i~1 0)), Black: 1507#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= 2 ~N~0) (<= thread2Thread1of1ForFork2_~i~1 0)), Black: 1481#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= 2 ~N~0) (<= thread2Thread1of1ForFork2_~i~1 0)), Black: 1335#(and (<= 2 ~N~0) (<= ~M~0 0)), Black: 1398#(< thread3Thread1of1ForFork0_~i~2 ~N~0), Black: 1501#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= 2 ~N~0)), Black: 1236#(and (or (< ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 1)) (< 1 ~N~0)) (or (and (<= ~min1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~min2~0 ~min1~0)) (< 1 ~N~0)) (or (and (or (= ~min1~0 0) (< ~min1~0 0)) (<= 2 ~N~0) (<= (+ ~min2~0 1) 0)) (and (= ~N~0 1) (<= (+ ~min1~0 1) 0)) (and (= ~min1~0 0) (= ~min2~0 0) (<= 1 ~N~0)) (and (= ~min2~0 0) (<= (+ ~min1~0 1) 0))) (= thread1Thread1of1ForFork1_~i~0 0) (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (< 1 ~N~0))), Black: 1505#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= 2 ~N~0) (<= ~M~0 0) (<= thread3Thread1of1ForFork0_~i~2 0)), Black: 1268#(and (or (and (<= ~min1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~min2~0 ~min1~0)) (< 1 ~N~0)) (or (and (or (= ~min1~0 0) (< ~min1~0 0)) (<= 2 ~N~0) (<= (+ ~min2~0 1) 0)) (and (= ~N~0 1) (<= (+ ~min1~0 1) 0)) (and (= ~min1~0 0) (= ~min2~0 0) (<= 1 ~N~0)) (and (= ~min2~0 0) (<= (+ ~min1~0 1) 0))) (<= thread1Thread1of1ForFork1_~i~0 1) (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (< 1 ~N~0))), Black: 1513#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= thread3Thread1of1ForFork0_~i~2 1) (<= 2 ~N~0) (<= ~M~0 0)), Black: 1270#(and (or (< ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 1)) (< 1 ~N~0)) (or (and (= ~min1~0 0) (= ~min2~0 0)) (and (<= (+ ~min1~0 1) 0) (= ~min2~0 ~min1~0))) (or (< 1 ~N~0) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (< 1 ~N~0))), Black: 1477#(and (<= 2 ~N~0) (= thread1Thread1of1ForFork1_~i~0 0) (<= ~M~0 0)), Black: 1020#(= ~min2~0 ~min1~0), Black: 1218#(and (or (< ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)) (and (or (and (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 ~min1~0))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) ~min2~0)) (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 1)) (and (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))))) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1)))))) (< 1 ~N~0)) (or (and (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0) (= (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) ~min2~0) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (and (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 ~min1~0)))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) ~min1~0) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))))) (< 1 ~N~0))), Black: 1208#(and (or (< ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)) (and (or (and (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 ~min1~0))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) ~min2~0)) (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 1)) (and (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))))) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1)))))) (< 1 ~N~0)) (or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (= ~min2~0 ~min1~0)) (or (and (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0) (= (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) ~min2~0) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (and (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 ~min1~0)))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) ~min1~0) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))))) (< 1 ~N~0))), Black: 1262#(and (or (and (<= ~min1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~min2~0 ~min1~0)) (< 1 ~N~0)) (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 1)) (< 1 ~N~0)) (or (and (or (= ~min1~0 0) (< ~min1~0 0)) (<= 2 ~N~0) (<= (+ ~min2~0 1) 0)) (and (= ~N~0 1) (<= (+ ~min1~0 1) 0)) (and (= ~min1~0 0) (= ~min2~0 0) (<= 1 ~N~0)) (and (= ~min2~0 0) (<= (+ ~min1~0 1) 0))) (<= thread1Thread1of1ForFork1_~i~0 1) (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (< 1 ~N~0)))]) [2024-10-14 14:41:56,793 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2024-10-14 14:41:56,794 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-10-14 14:41:56,794 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-10-14 14:41:56,794 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-10-14 14:41:57,092 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([422] L71-->L75: Formula: (let ((.cse0 (select (select |v_#memory_int#1_53| v_~A~0.base_71) (+ v_~A~0.offset_71 (* v_thread3Thread1of1ForFork0_~i~2_7 4))))) (or (and (= v_~min2~0_58 v_~min2~0_57) (<= v_~min2~0_58 .cse0) (= |v_thread3Thread1of1ForFork0_#t~mem8_2| |v_thread3Thread1of1ForFork0_#t~mem8_1|)) (and (= v_~min2~0_57 .cse0) (< .cse0 v_~min2~0_58)))) InVars {~A~0.base=v_~A~0.base_71, ~A~0.offset=v_~A~0.offset_71, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_7, #memory_int#1=|v_#memory_int#1_53|, thread3Thread1of1ForFork0_#t~mem8=|v_thread3Thread1of1ForFork0_#t~mem8_1|, ~min2~0=v_~min2~0_58} OutVars{~A~0.base=v_~A~0.base_71, ~A~0.offset=v_~A~0.offset_71, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_7, #memory_int#1=|v_#memory_int#1_53|, thread3Thread1of1ForFork0_#t~mem8=|v_thread3Thread1of1ForFork0_#t~mem8_2|, thread3Thread1of1ForFork0_#t~mem7=|v_thread3Thread1of1ForFork0_#t~mem7_1|, ~min2~0=v_~min2~0_57} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem8, thread3Thread1of1ForFork0_#t~mem7, ~min2~0][206], [Black: 1272#(and (or (and (= ~min1~0 0) (= ~min2~0 0)) (and (<= (+ ~min1~0 1) 0) (= ~min2~0 ~min1~0))) (or (< 1 ~N~0) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (< 1 ~N~0))), Black: 1252#(and (or (< ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 1)) (< 1 ~N~0)) (or (and (<= ~min1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~min2~0 ~min1~0)) (< 1 ~N~0)) (or (and (or (= ~min1~0 0) (< ~min1~0 0)) (<= 2 ~N~0) (<= (+ ~min2~0 1) 0)) (and (= ~N~0 1) (<= (+ ~min1~0 1) 0)) (and (= ~min1~0 0) (= ~min2~0 0) (<= 1 ~N~0)) (and (= ~min2~0 0) (<= (+ ~min1~0 1) 0))) (<= thread1Thread1of1ForFork1_~i~0 1) (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (< 1 ~N~0))), Black: 1228#(and (or (and (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))))) (< 1 ~N~0)) (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 1)) (< 1 ~N~0)) (or (and (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 ~min1~0))) (< 1 ~N~0))), Black: 1260#(and (or (and (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))))) (< 1 ~N~0)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (and (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) ~min1~0) (= ~min2~0 ~min1~0)) (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 1))))) (or (and (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 ~min1~0))) (< 1 ~N~0))), Black: 1234#(and (or (and (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))))) (< 1 ~N~0)) (or (and (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 ~min1~0))) (< 1 ~N~0))), 806#true, Black: 1127#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (= ~min2~0 ~min1~0)), 32#L75true, Black: 1214#(and (= ~min1~0 0) (or (< ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 1)) (< 1 ~N~0)) (or (< 1 ~N~0) (and (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 0) (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0)))) (or (< 0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1)) (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0)))))) (or (exists ((v_subst_6 Int)) (and (<= (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_subst_6) ~A~0.offset)) 1) 0) (<= (+ v_subst_6 1) ~N~0) (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_subst_6) ~A~0.offset))) (<= 0 v_subst_6))) (and (= ~min2~0 0) (exists ((v_subst_5 Int)) (and (<= (+ v_subst_5 1) ~N~0) (<= 0 v_subst_5) (<= 0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* 4 v_subst_5))))))))), Black: 1222#(and (= ~min1~0 0) (or (and (= ~min2~0 0) (exists ((v_subst_10 Int)) (and (<= 0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* v_subst_10 4)))) (<= 0 v_subst_10) (<= (+ v_subst_10 1) ~N~0)))) (exists ((v_subst_9 Int)) (and (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* 4 v_subst_9)))) (<= 0 v_subst_9) (<= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* 4 v_subst_9))) 1) 0) (<= (+ v_subst_9 1) ~N~0)))) (or (< ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 1)) (< 1 ~N~0)) (or (< 1 ~N~0) (and (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 0) (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0)))) (or (< 0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1)) (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0)))))) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1244#(and (or (and (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))))) (< 1 ~N~0)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (and (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) ~min1~0) (= ~min2~0 ~min1~0)) (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 1))))) (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 1)) (< 1 ~N~0)) (or (and (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 ~min1~0))) (< 1 ~N~0))), Black: 1220#(and (or (and (or (and (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 ~min1~0))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) ~min2~0)) (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 1)) (and (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))))) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1)))))) (< 1 ~N~0)) (or (and (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0) (= (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) ~min2~0) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (and (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 ~min1~0)))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) ~min1~0) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))))) (< 1 ~N~0))), Black: 1157#(or (and (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0) (= (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) ~min2~0) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (and (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 ~min1~0)))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) ~min1~0) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))))) (< 1 ~N~0)), Black: 1256#(and (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 1)) (< 1 ~N~0)) (or (and (= ~min1~0 0) (= ~min2~0 0)) (and (<= (+ ~min1~0 1) 0) (= ~min2~0 ~min1~0))) (or (< 1 ~N~0) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (< 1 ~N~0))), Black: 1254#(and (or (and (= ~min1~0 0) (= ~min2~0 0)) (and (<= (+ ~min1~0 1) 0) (= ~min2~0 ~min1~0))) (or (= ~N~0 1) (< 1 ~N~0)) (<= thread1Thread1of1ForFork1_~i~0 1) (or (< 1 ~N~0) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (< 1 ~N~0))), Black: 1240#(and (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 1)) (< 1 ~N~0)) (or (and (= ~min1~0 0) (= ~min2~0 0)) (and (<= (+ ~min1~0 1) 0) (= ~min2~0 ~min1~0))) (or (= ~N~0 1) (< 1 ~N~0)) (<= thread1Thread1of1ForFork1_~i~0 1) (or (< 1 ~N~0) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (< 1 ~N~0))), 15#L63true, 1495#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= 2 ~N~0) (<= thread2Thread1of1ForFork2_~i~1 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 408#(and (or (and (= ~min1~0 0) (= ~min2~0 0)) (and (<= (+ ~min1~0 1) 0) (= ~min2~0 ~min1~0))) (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0)) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1)))), 1010#true, Black: 378#(and (= ~min1~0 0) (= ~min2~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 347#(and (or (and (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min2~0) (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (and (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min1~0)) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min2~0) (= ~min2~0 ~min1~0))))), Black: 790#(and (<= ~min1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (<= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~min2~0 ~min1~0) (or (= ~min1~0 0) (< ~min1~0 0)) (= thread1Thread1of1ForFork1_~i~0 0) (<= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))))), Black: 794#(and (<= ~min1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (<= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~min2~0 ~min1~0) (or (= ~min1~0 0) (< ~min1~0 0)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 786#(and (= ~min1~0 0) (= (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork0_~i~2 4)) (select (select |#memory_int#1| ~A~0.base) 0)) (= ~A~0.offset 0) (<= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4))) (= thread1Thread1of1ForFork1_~i~0 0) (or (and (= ~min2~0 0) (<= 0 (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork0_~i~2 4)))) (and (<= (+ (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork0_~i~2 4)) 1) 0) (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork0_~i~2 4)))))), Black: 792#(and (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 ~min1~0)) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) ~min1~0) (= ~min2~0 ~min1~0)) (<= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (<= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)))) (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 1)))), Black: 740#(and (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1)) (and (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min1~0)) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))))) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min2~0) (and (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 ~min1~0))))), Black: 796#(and (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 ~min1~0)) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) ~min1~0) (= ~min2~0 ~min1~0)) (<= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 1)))), Black: 798#(and (or (and (= ~min1~0 0) (= ~min2~0 0)) (and (<= (+ ~min1~0 1) 0) (= ~min2~0 ~min1~0))) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min2~0) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))), 600#true, Black: 48#(and (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 52#(<= (+ ~M~0 1) ~N~0), 24#L95true, Black: 61#(<= 1 ~N~0), Black: 598#(and (<= ~min1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (<= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~min2~0 ~min1~0) (or (= ~min1~0 0) (< ~min1~0 0))), 1532#true, Black: 1491#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= 2 ~N~0) (<= ~M~0 0)), Black: 1295#true, Black: 1503#(and (<= thread3Thread1of1ForFork0_~i~2 1) (<= 2 ~N~0) (<= ~M~0 0)), Black: 1509#(and (<= thread3Thread1of1ForFork0_~i~2 1) (<= 2 ~N~0) (= thread1Thread1of1ForFork1_~i~0 0) (<= ~M~0 0)), 203#true, Black: 1511#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= 2 ~N~0) (<= ~M~0 0)), Black: 1006#(and (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min2~0) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (and (= ~min2~0 ~min1~0) (<= (+ ~min2~0 1) 0)) (and (= ~min1~0 0) (= ~min2~0 0))) (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))), Black: 1475#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= 2 ~N~0)), Black: 992#(and (= ~min1~0 0) (= ~A~0.offset 0) (or (= ~min2~0 0) (< (select (select |#memory_int#1| ~A~0.base) 0) 0)) (<= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4))) (or (< 0 (+ (select (select |#memory_int#1| ~A~0.base) 0) 1)) (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) 0))) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1487#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= 2 ~N~0) (<= thread2Thread1of1ForFork2_~i~1 0)), 5#L47true, Black: 1000#(and (<= ~min1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (<= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~min2~0 ~min1~0) (= thread1Thread1of1ForFork1_~i~0 0) (or (= ~min1~0 0) (< ~min2~0 0))), Black: 1473#(and (<= 2 ~N~0) (<= thread2Thread1of1ForFork2_~i~1 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1328#(and (<= 2 ~N~0) (<= thread2Thread1of1ForFork2_~i~1 0)), Black: 1507#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= 2 ~N~0) (<= thread2Thread1of1ForFork2_~i~1 0)), Black: 1481#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= 2 ~N~0) (<= thread2Thread1of1ForFork2_~i~1 0)), Black: 1335#(and (<= 2 ~N~0) (<= ~M~0 0)), Black: 1398#(< thread3Thread1of1ForFork0_~i~2 ~N~0), Black: 1501#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= 2 ~N~0)), Black: 1236#(and (or (< ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 1)) (< 1 ~N~0)) (or (and (<= ~min1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~min2~0 ~min1~0)) (< 1 ~N~0)) (or (and (or (= ~min1~0 0) (< ~min1~0 0)) (<= 2 ~N~0) (<= (+ ~min2~0 1) 0)) (and (= ~N~0 1) (<= (+ ~min1~0 1) 0)) (and (= ~min1~0 0) (= ~min2~0 0) (<= 1 ~N~0)) (and (= ~min2~0 0) (<= (+ ~min1~0 1) 0))) (= thread1Thread1of1ForFork1_~i~0 0) (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (< 1 ~N~0))), Black: 1505#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= 2 ~N~0) (<= ~M~0 0) (<= thread3Thread1of1ForFork0_~i~2 0)), Black: 1268#(and (or (and (<= ~min1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~min2~0 ~min1~0)) (< 1 ~N~0)) (or (and (or (= ~min1~0 0) (< ~min1~0 0)) (<= 2 ~N~0) (<= (+ ~min2~0 1) 0)) (and (= ~N~0 1) (<= (+ ~min1~0 1) 0)) (and (= ~min1~0 0) (= ~min2~0 0) (<= 1 ~N~0)) (and (= ~min2~0 0) (<= (+ ~min1~0 1) 0))) (<= thread1Thread1of1ForFork1_~i~0 1) (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (< 1 ~N~0))), Black: 1513#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= thread3Thread1of1ForFork0_~i~2 1) (<= 2 ~N~0) (<= ~M~0 0)), Black: 1270#(and (or (< ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 1)) (< 1 ~N~0)) (or (and (= ~min1~0 0) (= ~min2~0 0)) (and (<= (+ ~min1~0 1) 0) (= ~min2~0 ~min1~0))) (or (< 1 ~N~0) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (< 1 ~N~0))), Black: 1477#(and (<= 2 ~N~0) (= thread1Thread1of1ForFork1_~i~0 0) (<= ~M~0 0)), Black: 1020#(= ~min2~0 ~min1~0), Black: 1218#(and (or (< ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)) (and (or (and (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 ~min1~0))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) ~min2~0)) (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 1)) (and (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))))) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1)))))) (< 1 ~N~0)) (or (and (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0) (= (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) ~min2~0) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (and (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 ~min1~0)))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) ~min1~0) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))))) (< 1 ~N~0))), Black: 1208#(and (or (< ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)) (and (or (and (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 ~min1~0))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) ~min2~0)) (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 1)) (and (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))))) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1)))))) (< 1 ~N~0)) (or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (= ~min2~0 ~min1~0)) (or (and (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0) (= (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) ~min2~0) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (and (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 ~min1~0)))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) ~min1~0) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))))) (< 1 ~N~0))), Black: 1262#(and (or (and (<= ~min1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~min2~0 ~min1~0)) (< 1 ~N~0)) (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 1)) (< 1 ~N~0)) (or (and (or (= ~min1~0 0) (< ~min1~0 0)) (<= 2 ~N~0) (<= (+ ~min2~0 1) 0)) (and (= ~N~0 1) (<= (+ ~min1~0 1) 0)) (and (= ~min1~0 0) (= ~min2~0 0) (<= 1 ~N~0)) (and (= ~min2~0 0) (<= (+ ~min1~0 1) 0))) (<= thread1Thread1of1ForFork1_~i~0 1) (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (< 1 ~N~0)))]) [2024-10-14 14:41:57,093 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2024-10-14 14:41:57,093 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-10-14 14:41:57,093 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-10-14 14:41:57,093 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-10-14 14:41:57,093 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-10-14 14:41:57,732 INFO L124 PetriNetUnfolderBase]: 7586/11686 cut-off events. [2024-10-14 14:41:57,732 INFO L125 PetriNetUnfolderBase]: For 126983/127524 co-relation queries the response was YES. [2024-10-14 14:41:57,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68153 conditions, 11686 events. 7586/11686 cut-off events. For 126983/127524 co-relation queries the response was YES. Maximal size of possible extension queue 625. Compared 74024 event pairs, 2329 based on Foata normal form. 477/11973 useless extension candidates. Maximal degree in co-relation 67504. Up to 5392 conditions per place. [2024-10-14 14:41:57,952 INFO L140 encePairwiseOnDemand]: 27/33 looper letters, 675 selfloop transitions, 9 changer transitions 2/777 dead transitions. [2024-10-14 14:41:57,952 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 777 transitions, 10464 flow [2024-10-14 14:41:57,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 14:41:57,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-14 14:41:57,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 98 transitions. [2024-10-14 14:41:57,953 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.494949494949495 [2024-10-14 14:41:57,953 INFO L175 Difference]: Start difference. First operand has 210 places, 639 transitions, 7371 flow. Second operand 6 states and 98 transitions. [2024-10-14 14:41:57,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 777 transitions, 10464 flow [2024-10-14 14:41:58,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 777 transitions, 10359 flow, removed 49 selfloop flow, removed 3 redundant places. [2024-10-14 14:41:58,834 INFO L231 Difference]: Finished difference. Result has 213 places, 536 transitions, 6111 flow [2024-10-14 14:41:58,834 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=6076, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=536, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=527, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=6111, PETRI_PLACES=213, PETRI_TRANSITIONS=536} [2024-10-14 14:41:58,835 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, 178 predicate places. [2024-10-14 14:41:58,835 INFO L471 AbstractCegarLoop]: Abstraction has has 213 places, 536 transitions, 6111 flow [2024-10-14 14:41:58,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.384615384615385) internal successors, (122), 13 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 14:41:58,835 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 14:41:58,835 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] [2024-10-14 14:41:58,847 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-10-14 14:41:59,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-14 14:41:59,036 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-10-14 14:41:59,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:41:59,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1527978253, now seen corresponding path program 7 times [2024-10-14 14:41:59,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:41:59,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336397525] [2024-10-14 14:41:59,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:41:59,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:41:59,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:41:59,125 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 14:41:59,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:41:59,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336397525] [2024-10-14 14:41:59,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336397525] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 14:41:59,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1469763629] [2024-10-14 14:41:59,126 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-10-14 14:41:59,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 14:41:59,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 14:41:59,128 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 14:41:59,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-14 14:41:59,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:41:59,209 INFO L255 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-14 14:41:59,210 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 14:41:59,329 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 14:41:59,329 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 14:41:59,370 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 14:41:59,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1469763629] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 14:41:59,371 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 14:41:59,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2024-10-14 14:41:59,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261202635] [2024-10-14 14:41:59,371 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 14:41:59,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-14 14:41:59,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:41:59,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-14 14:41:59,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2024-10-14 14:41:59,388 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-10-14 14:41:59,389 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 536 transitions, 6111 flow. Second operand has 14 states, 14 states have (on average 9.714285714285714) internal successors, (136), 14 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 14:41:59,389 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 14:41:59,389 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-10-14 14:41:59,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 14:42:00,886 INFO L124 PetriNetUnfolderBase]: 6408/9928 cut-off events. [2024-10-14 14:42:00,886 INFO L125 PetriNetUnfolderBase]: For 115763/116074 co-relation queries the response was YES. [2024-10-14 14:42:00,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59311 conditions, 9928 events. 6408/9928 cut-off events. For 115763/116074 co-relation queries the response was YES. Maximal size of possible extension queue 474. Compared 60882 event pairs, 1934 based on Foata normal form. 356/10255 useless extension candidates. Maximal degree in co-relation 58643. Up to 4939 conditions per place. [2024-10-14 14:42:00,968 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 413 selfloop transitions, 59 changer transitions 10/532 dead transitions. [2024-10-14 14:42:00,968 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 532 transitions, 6800 flow [2024-10-14 14:42:00,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 14:42:00,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-10-14 14:42:00,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 115 transitions. [2024-10-14 14:42:00,969 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.49783549783549785 [2024-10-14 14:42:00,970 INFO L175 Difference]: Start difference. First operand has 213 places, 536 transitions, 6111 flow. Second operand 7 states and 115 transitions. [2024-10-14 14:42:00,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 532 transitions, 6800 flow [2024-10-14 14:42:01,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 532 transitions, 6717 flow, removed 38 selfloop flow, removed 3 redundant places. [2024-10-14 14:42:01,713 INFO L231 Difference]: Finished difference. Result has 217 places, 472 transitions, 5434 flow [2024-10-14 14:42:01,714 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=5338, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=481, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=422, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=5434, PETRI_PLACES=217, PETRI_TRANSITIONS=472} [2024-10-14 14:42:01,714 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, 182 predicate places. [2024-10-14 14:42:01,714 INFO L471 AbstractCegarLoop]: Abstraction has has 217 places, 472 transitions, 5434 flow [2024-10-14 14:42:01,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 9.714285714285714) internal successors, (136), 14 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 14:42:01,715 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 14:42:01,715 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] [2024-10-14 14:42:01,727 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-10-14 14:42:01,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 14:42:01,915 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-10-14 14:42:01,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:42:01,916 INFO L85 PathProgramCache]: Analyzing trace with hash 2146383493, now seen corresponding path program 8 times [2024-10-14 14:42:01,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:42:01,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755856100] [2024-10-14 14:42:01,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:42:01,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:42:01,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:42:02,006 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 14:42:02,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:42:02,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755856100] [2024-10-14 14:42:02,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755856100] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 14:42:02,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1422457240] [2024-10-14 14:42:02,007 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 14:42:02,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 14:42:02,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 14:42:02,010 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 14:42:02,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-14 14:42:02,098 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 14:42:02,099 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 14:42:02,100 INFO L255 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-14 14:42:02,103 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 14:42:02,222 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 14:42:02,222 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 14:42:02,286 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 14:42:02,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1422457240] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 14:42:02,287 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 14:42:02,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2024-10-14 14:42:02,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020428497] [2024-10-14 14:42:02,288 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 14:42:02,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-14 14:42:02,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:42:02,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-14 14:42:02,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2024-10-14 14:42:02,324 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-10-14 14:42:02,325 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 472 transitions, 5434 flow. Second operand has 14 states, 14 states have (on average 9.642857142857142) internal successors, (135), 14 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 14:42:02,325 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 14:42:02,325 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-10-14 14:42:02,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 14:42:03,650 INFO L124 PetriNetUnfolderBase]: 4751/7325 cut-off events. [2024-10-14 14:42:03,650 INFO L125 PetriNetUnfolderBase]: For 84328/84665 co-relation queries the response was YES. [2024-10-14 14:42:03,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41601 conditions, 7325 events. 4751/7325 cut-off events. For 84328/84665 co-relation queries the response was YES. Maximal size of possible extension queue 362. Compared 42488 event pairs, 1548 based on Foata normal form. 270/7530 useless extension candidates. Maximal degree in co-relation 41516. Up to 4845 conditions per place. [2024-10-14 14:42:03,695 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 272 selfloop transitions, 3 changer transitions 113/413 dead transitions. [2024-10-14 14:42:03,695 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 413 transitions, 5363 flow [2024-10-14 14:42:03,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 14:42:03,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-10-14 14:42:03,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 110 transitions. [2024-10-14 14:42:03,696 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2024-10-14 14:42:03,696 INFO L175 Difference]: Start difference. First operand has 217 places, 472 transitions, 5434 flow. Second operand 7 states and 110 transitions. [2024-10-14 14:42:03,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 413 transitions, 5363 flow [2024-10-14 14:42:04,108 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 413 transitions, 5088 flow, removed 92 selfloop flow, removed 12 redundant places. [2024-10-14 14:42:04,112 INFO L231 Difference]: Finished difference. Result has 206 places, 300 transitions, 2980 flow [2024-10-14 14:42:04,112 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=4068, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=382, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=379, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2980, PETRI_PLACES=206, PETRI_TRANSITIONS=300} [2024-10-14 14:42:04,113 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, 171 predicate places. [2024-10-14 14:42:04,113 INFO L471 AbstractCegarLoop]: Abstraction has has 206 places, 300 transitions, 2980 flow [2024-10-14 14:42:04,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 9.642857142857142) internal successors, (135), 14 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 14:42:04,113 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 14:42:04,113 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:42:04,125 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-10-14 14:42:04,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-14 14:42:04,314 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-10-14 14:42:04,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:42:04,314 INFO L85 PathProgramCache]: Analyzing trace with hash -161010821, now seen corresponding path program 9 times [2024-10-14 14:42:04,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:42:04,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853564109] [2024-10-14 14:42:04,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:42:04,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:42:04,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:42:04,431 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 14:42:04,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:42:04,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853564109] [2024-10-14 14:42:04,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853564109] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 14:42:04,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1125922138] [2024-10-14 14:42:04,432 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-14 14:42:04,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 14:42:04,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 14:42:04,435 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 14:42:04,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-14 14:42:04,513 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-14 14:42:04,513 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 14:42:04,514 INFO L255 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-14 14:42:04,516 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 14:42:04,629 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 14:42:04,629 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 14:42:04,740 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 14:42:04,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1125922138] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 14:42:04,741 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 14:42:04,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2024-10-14 14:42:04,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135032085] [2024-10-14 14:42:04,741 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 14:42:04,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-14 14:42:04,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:42:04,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-14 14:42:04,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2024-10-14 14:42:04,786 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-10-14 14:42:04,787 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 300 transitions, 2980 flow. Second operand has 20 states, 20 states have (on average 7.3) internal successors, (146), 20 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 14:42:04,787 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 14:42:04,787 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-10-14 14:42:04,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 14:42:08,166 INFO L124 PetriNetUnfolderBase]: 13592/19281 cut-off events. [2024-10-14 14:42:08,167 INFO L125 PetriNetUnfolderBase]: For 189741/190399 co-relation queries the response was YES. [2024-10-14 14:42:08,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105125 conditions, 19281 events. 13592/19281 cut-off events. For 189741/190399 co-relation queries the response was YES. Maximal size of possible extension queue 632. Compared 107356 event pairs, 557 based on Foata normal form. 240/19385 useless extension candidates. Maximal degree in co-relation 105062. Up to 7424 conditions per place. [2024-10-14 14:42:08,323 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 905 selfloop transitions, 368 changer transitions 0/1297 dead transitions. [2024-10-14 14:42:08,323 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 1297 transitions, 14588 flow [2024-10-14 14:42:08,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-10-14 14:42:08,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2024-10-14 14:42:08,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 573 transitions. [2024-10-14 14:42:08,325 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4692874692874693 [2024-10-14 14:42:08,325 INFO L175 Difference]: Start difference. First operand has 206 places, 300 transitions, 2980 flow. Second operand 37 states and 573 transitions. [2024-10-14 14:42:08,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 1297 transitions, 14588 flow [2024-10-14 14:42:09,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 1297 transitions, 13152 flow, removed 588 selfloop flow, removed 23 redundant places. [2024-10-14 14:42:09,742 INFO L231 Difference]: Finished difference. Result has 177 places, 591 transitions, 6541 flow [2024-10-14 14:42:09,742 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2667, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=300, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=112, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=6541, PETRI_PLACES=177, PETRI_TRANSITIONS=591} [2024-10-14 14:42:09,743 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, 142 predicate places. [2024-10-14 14:42:09,743 INFO L471 AbstractCegarLoop]: Abstraction has has 177 places, 591 transitions, 6541 flow [2024-10-14 14:42:09,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 7.3) internal successors, (146), 20 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 14:42:09,743 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 14:42:09,743 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:42:09,756 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-10-14 14:42:09,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-10-14 14:42:09,944 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-10-14 14:42:09,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:42:09,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1715871281, now seen corresponding path program 10 times [2024-10-14 14:42:09,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:42:09,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740183979] [2024-10-14 14:42:09,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:42:09,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:42:09,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:42:10,065 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 14:42:10,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:42:10,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740183979] [2024-10-14 14:42:10,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740183979] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 14:42:10,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [410034616] [2024-10-14 14:42:10,066 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-14 14:42:10,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 14:42:10,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 14:42:10,067 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 14:42:10,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-10-14 14:42:10,136 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-14 14:42:10,137 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 14:42:10,138 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-14 14:42:10,139 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 14:42:10,239 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 14:42:10,239 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 14:42:10,323 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 14:42:10,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [410034616] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 14:42:10,323 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 14:42:10,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 17 [2024-10-14 14:42:10,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168793957] [2024-10-14 14:42:10,324 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 14:42:10,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-14 14:42:10,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:42:10,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-14 14:42:10,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2024-10-14 14:42:10,332 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2024-10-14 14:42:10,333 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 591 transitions, 6541 flow. Second operand has 17 states, 17 states have (on average 7.235294117647059) internal successors, (123), 17 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 14:42:10,333 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 14:42:10,333 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2024-10-14 14:42:10,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 14:42:14,961 INFO L124 PetriNetUnfolderBase]: 17345/24341 cut-off events. [2024-10-14 14:42:14,961 INFO L125 PetriNetUnfolderBase]: For 240279/240279 co-relation queries the response was YES. [2024-10-14 14:42:15,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136855 conditions, 24341 events. 17345/24341 cut-off events. For 240279/240279 co-relation queries the response was YES. Maximal size of possible extension queue 699. Compared 133916 event pairs, 484 based on Foata normal form. 32/24373 useless extension candidates. Maximal degree in co-relation 136793. Up to 8859 conditions per place. [2024-10-14 14:42:15,133 INFO L140 encePairwiseOnDemand]: 18/33 looper letters, 697 selfloop transitions, 845 changer transitions 0/1543 dead transitions. [2024-10-14 14:42:15,133 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 1543 transitions, 18131 flow [2024-10-14 14:42:15,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-10-14 14:42:15,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2024-10-14 14:42:15,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 578 transitions. [2024-10-14 14:42:15,135 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.39807162534435264 [2024-10-14 14:42:15,136 INFO L175 Difference]: Start difference. First operand has 177 places, 591 transitions, 6541 flow. Second operand 44 states and 578 transitions. [2024-10-14 14:42:15,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 1543 transitions, 18131 flow [2024-10-14 14:42:17,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 1543 transitions, 17608 flow, removed 258 selfloop flow, removed 4 redundant places. [2024-10-14 14:42:17,989 INFO L231 Difference]: Finished difference. Result has 228 places, 982 transitions, 13586 flow [2024-10-14 14:42:17,989 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=6366, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=591, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=457, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=44, PETRI_FLOW=13586, PETRI_PLACES=228, PETRI_TRANSITIONS=982} [2024-10-14 14:42:17,990 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, 193 predicate places. [2024-10-14 14:42:17,990 INFO L471 AbstractCegarLoop]: Abstraction has has 228 places, 982 transitions, 13586 flow [2024-10-14 14:42:17,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 7.235294117647059) internal successors, (123), 17 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 14:42:17,990 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 14:42:17,990 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:42:18,007 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-10-14 14:42:18,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-14 14:42:18,195 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-10-14 14:42:18,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:42:18,195 INFO L85 PathProgramCache]: Analyzing trace with hash -489664485, now seen corresponding path program 11 times [2024-10-14 14:42:18,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:42:18,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842349261] [2024-10-14 14:42:18,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:42:18,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:42:18,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:42:18,324 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-14 14:42:18,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:42:18,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842349261] [2024-10-14 14:42:18,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842349261] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 14:42:18,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1956461208] [2024-10-14 14:42:18,325 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-14 14:42:18,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 14:42:18,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 14:42:18,326 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 14:42:18,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-10-14 14:42:18,404 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2024-10-14 14:42:18,404 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 14:42:18,405 INFO L255 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-14 14:42:18,406 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 14:42:18,512 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 14:42:18,512 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 14:42:18,605 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 14:42:18,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1956461208] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 14:42:18,606 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 14:42:18,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 18 [2024-10-14 14:42:18,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751777492] [2024-10-14 14:42:18,606 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 14:42:18,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-14 14:42:18,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:42:18,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-14 14:42:18,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2024-10-14 14:42:18,648 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2024-10-14 14:42:18,648 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 982 transitions, 13586 flow. Second operand has 18 states, 18 states have (on average 6.777777777777778) internal successors, (122), 18 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 14:42:18,649 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 14:42:18,649 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2024-10-14 14:42:18,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 14:42:25,532 INFO L124 PetriNetUnfolderBase]: 19188/26950 cut-off events. [2024-10-14 14:42:25,533 INFO L125 PetriNetUnfolderBase]: For 326498/326498 co-relation queries the response was YES. [2024-10-14 14:42:25,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 163683 conditions, 26950 events. 19188/26950 cut-off events. For 326498/326498 co-relation queries the response was YES. Maximal size of possible extension queue 791. Compared 151253 event pairs, 475 based on Foata normal form. 32/26982 useless extension candidates. Maximal degree in co-relation 163609. Up to 9795 conditions per place. [2024-10-14 14:42:25,818 INFO L140 encePairwiseOnDemand]: 18/33 looper letters, 1017 selfloop transitions, 1077 changer transitions 0/2095 dead transitions. [2024-10-14 14:42:25,818 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 2095 transitions, 26713 flow [2024-10-14 14:42:25,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-10-14 14:42:25,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2024-10-14 14:42:25,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 933 transitions. [2024-10-14 14:42:25,822 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.39820742637644047 [2024-10-14 14:42:25,822 INFO L175 Difference]: Start difference. First operand has 228 places, 982 transitions, 13586 flow. Second operand 71 states and 933 transitions. [2024-10-14 14:42:25,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 2095 transitions, 26713 flow [2024-10-14 14:42:33,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 2095 transitions, 25012 flow, removed 477 selfloop flow, removed 7 redundant places. [2024-10-14 14:42:33,195 INFO L231 Difference]: Finished difference. Result has 306 places, 1230 transitions, 18638 flow [2024-10-14 14:42:33,196 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=12256, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=982, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=845, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=71, PETRI_FLOW=18638, PETRI_PLACES=306, PETRI_TRANSITIONS=1230} [2024-10-14 14:42:33,196 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, 271 predicate places. [2024-10-14 14:42:33,196 INFO L471 AbstractCegarLoop]: Abstraction has has 306 places, 1230 transitions, 18638 flow [2024-10-14 14:42:33,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 6.777777777777778) internal successors, (122), 18 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 14:42:33,197 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 14:42:33,197 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:42:33,209 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-10-14 14:42:33,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-14 14:42:33,397 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-10-14 14:42:33,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:42:33,398 INFO L85 PathProgramCache]: Analyzing trace with hash 2110799999, now seen corresponding path program 12 times [2024-10-14 14:42:33,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:42:33,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821497086] [2024-10-14 14:42:33,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:42:33,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:42:33,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:42:33,538 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-14 14:42:33,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:42:33,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821497086] [2024-10-14 14:42:33,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821497086] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 14:42:33,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [916127895] [2024-10-14 14:42:33,539 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-10-14 14:42:33,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 14:42:33,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 14:42:33,541 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 14:42:33,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-10-14 14:42:33,628 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2024-10-14 14:42:33,628 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 14:42:33,630 INFO L255 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-14 14:42:33,633 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 14:42:33,719 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 14:42:33,719 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 14:42:33,796 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 14:42:33,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [916127895] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 14:42:33,796 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 14:42:33,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 19 [2024-10-14 14:42:33,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733184144] [2024-10-14 14:42:33,796 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 14:42:33,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-14 14:42:33,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:42:33,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-14 14:42:33,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2024-10-14 14:42:33,834 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2024-10-14 14:42:33,834 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 1230 transitions, 18638 flow. Second operand has 19 states, 19 states have (on average 6.631578947368421) internal successors, (126), 19 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 14:42:33,834 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 14:42:33,834 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2024-10-14 14:42:33,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand