./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-simple-array-sum.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-simple-array-sum.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 0c7c5c48eda3eba87519854c38b7495ee97c35417d2a6e287791b53fe49d6c07 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 16:48:18,455 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 16:48:18,509 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 16:48:18,513 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 16:48:18,517 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 16:48:18,539 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 16:48:18,539 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 16:48:18,539 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 16:48:18,544 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 16:48:18,544 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 16:48:18,544 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 16:48:18,544 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 16:48:18,545 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 16:48:18,545 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 16:48:18,545 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 16:48:18,545 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 16:48:18,545 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 16:48:18,545 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 16:48:18,545 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 16:48:18,545 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 16:48:18,545 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 16:48:18,545 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 16:48:18,545 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 16:48:18,545 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 16:48:18,545 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 16:48:18,545 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 16:48:18,545 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 16:48:18,545 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 16:48:18,545 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 16:48:18,545 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:48:18,545 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:48:18,545 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:48:18,545 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:48:18,546 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 16:48:18,546 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:48:18,546 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:48:18,546 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:48:18,546 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:48:18,546 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 16:48:18,546 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 16:48:18,546 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 16:48:18,546 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 16:48:18,546 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 16:48:18,546 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 16:48:18,546 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 16:48:18,546 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 16:48:18,546 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 16:48:18,546 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 16:48:18,546 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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 -> 0c7c5c48eda3eba87519854c38b7495ee97c35417d2a6e287791b53fe49d6c07 [2025-01-09 16:48:18,784 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 16:48:18,791 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 16:48:18,794 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 16:48:18,795 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 16:48:18,795 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 16:48:18,796 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-simple-array-sum.wvr.c [2025-01-09 16:48:19,908 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/245173362/d35469b4b65c4e99984244a3565b967f/FLAG94e856083 [2025-01-09 16:48:20,143 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 16:48:20,144 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-simple-array-sum.wvr.c [2025-01-09 16:48:20,149 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/245173362/d35469b4b65c4e99984244a3565b967f/FLAG94e856083 [2025-01-09 16:48:20,471 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/245173362/d35469b4b65c4e99984244a3565b967f [2025-01-09 16:48:20,473 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 16:48:20,474 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 16:48:20,475 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 16:48:20,475 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 16:48:20,478 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 16:48:20,478 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:48:20" (1/1) ... [2025-01-09 16:48:20,479 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14924845 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:48:20, skipping insertion in model container [2025-01-09 16:48:20,479 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:48:20" (1/1) ... [2025-01-09 16:48:20,489 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 16:48:20,604 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-simple-array-sum.wvr.c[2429,2442] [2025-01-09 16:48:20,609 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:48:20,616 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 16:48:20,628 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-simple-array-sum.wvr.c[2429,2442] [2025-01-09 16:48:20,632 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:48:20,641 INFO L204 MainTranslator]: Completed translation [2025-01-09 16:48:20,642 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:48:20 WrapperNode [2025-01-09 16:48:20,642 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 16:48:20,643 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 16:48:20,643 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 16:48:20,643 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 16:48:20,647 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:48:20" (1/1) ... [2025-01-09 16:48:20,651 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:48:20" (1/1) ... [2025-01-09 16:48:20,662 INFO L138 Inliner]: procedures = 23, calls = 20, calls flagged for inlining = 7, calls inlined = 9, statements flattened = 103 [2025-01-09 16:48:20,662 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 16:48:20,662 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 16:48:20,662 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 16:48:20,662 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 16:48:20,668 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:48:20" (1/1) ... [2025-01-09 16:48:20,668 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:48:20" (1/1) ... [2025-01-09 16:48:20,669 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:48:20" (1/1) ... [2025-01-09 16:48:20,682 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2025-01-09 16:48:20,682 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:48:20" (1/1) ... [2025-01-09 16:48:20,682 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:48:20" (1/1) ... [2025-01-09 16:48:20,686 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:48:20" (1/1) ... [2025-01-09 16:48:20,687 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:48:20" (1/1) ... [2025-01-09 16:48:20,689 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:48:20" (1/1) ... [2025-01-09 16:48:20,690 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:48:20" (1/1) ... [2025-01-09 16:48:20,691 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:48:20" (1/1) ... [2025-01-09 16:48:20,692 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 16:48:20,694 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 16:48:20,694 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 16:48:20,694 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 16:48:20,695 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:48:20" (1/1) ... [2025-01-09 16:48:20,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:48:20,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:48:20,720 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 16:48:20,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 16:48:20,738 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 16:48:20,738 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-09 16:48:20,738 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-09 16:48:20,738 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-09 16:48:20,738 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-09 16:48:20,738 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-09 16:48:20,738 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-09 16:48:20,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 16:48:20,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 16:48:20,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 16:48:20,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 16:48:20,739 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 16:48:20,739 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 16:48:20,739 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 16:48:20,739 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 16:48:20,739 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 16:48:20,740 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 16:48:20,807 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 16:48:20,808 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 16:48:21,007 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 16:48:21,007 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 16:48:21,144 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 16:48:21,146 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 16:48:21,146 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:48:21 BoogieIcfgContainer [2025-01-09 16:48:21,146 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 16:48:21,147 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 16:48:21,147 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 16:48:21,151 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 16:48:21,151 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:48:20" (1/3) ... [2025-01-09 16:48:21,151 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@637766dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:48:21, skipping insertion in model container [2025-01-09 16:48:21,151 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:48:20" (2/3) ... [2025-01-09 16:48:21,151 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@637766dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:48:21, skipping insertion in model container [2025-01-09 16:48:21,151 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:48:21" (3/3) ... [2025-01-09 16:48:21,152 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-simple-array-sum.wvr.c [2025-01-09 16:48:21,162 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 16:48:21,163 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-simple-array-sum.wvr.c that has 4 procedures, 36 locations, 1 initial locations, 5 loop locations, and 1 error locations. [2025-01-09 16:48:21,163 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 16:48:21,211 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-09 16:48:21,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 41 transitions, 103 flow [2025-01-09 16:48:21,267 INFO L124 PetriNetUnfolderBase]: 6/38 cut-off events. [2025-01-09 16:48:21,270 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-09 16:48:21,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 38 events. 6/38 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 55 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 30. Up to 3 conditions per place. [2025-01-09 16:48:21,274 INFO L82 GeneralOperation]: Start removeDead. Operand has 45 places, 41 transitions, 103 flow [2025-01-09 16:48:21,279 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 41 places, 37 transitions, 92 flow [2025-01-09 16:48:21,286 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:48:21,300 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;@78158b6d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:48:21,301 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-01-09 16:48:21,309 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:48:21,309 INFO L124 PetriNetUnfolderBase]: 6/36 cut-off events. [2025-01-09 16:48:21,310 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-09 16:48:21,310 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:48:21,310 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:48:21,311 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)] === [2025-01-09 16:48:21,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:48:21,314 INFO L85 PathProgramCache]: Analyzing trace with hash 191043834, now seen corresponding path program 1 times [2025-01-09 16:48:21,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:48:21,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065682250] [2025-01-09 16:48:21,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:48:21,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:48:21,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 16:48:21,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 16:48:21,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:48:21,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:48:21,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:48:21,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:48:21,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065682250] [2025-01-09 16:48:21,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065682250] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:48:21,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:48:21,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:48:21,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950834260] [2025-01-09 16:48:21,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:48:21,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:48:21,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:48:21,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:48:21,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:48:21,987 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41 [2025-01-09 16:48:21,989 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 37 transitions, 92 flow. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:48:21,989 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:48:21,989 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41 [2025-01-09 16:48:21,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:48:22,262 INFO L124 PetriNetUnfolderBase]: 1244/2030 cut-off events. [2025-01-09 16:48:22,263 INFO L125 PetriNetUnfolderBase]: For 150/150 co-relation queries the response was YES. [2025-01-09 16:48:22,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3890 conditions, 2030 events. 1244/2030 cut-off events. For 150/150 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 10693 event pairs, 782 based on Foata normal form. 1/1904 useless extension candidates. Maximal degree in co-relation 1885. Up to 1028 conditions per place. [2025-01-09 16:48:22,282 INFO L140 encePairwiseOnDemand]: 35/41 looper letters, 49 selfloop transitions, 5 changer transitions 1/63 dead transitions. [2025-01-09 16:48:22,282 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 63 transitions, 272 flow [2025-01-09 16:48:22,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:48:22,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 16:48:22,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 100 transitions. [2025-01-09 16:48:22,292 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6097560975609756 [2025-01-09 16:48:22,294 INFO L175 Difference]: Start difference. First operand has 41 places, 37 transitions, 92 flow. Second operand 4 states and 100 transitions. [2025-01-09 16:48:22,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 63 transitions, 272 flow [2025-01-09 16:48:22,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 63 transitions, 248 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-01-09 16:48:22,310 INFO L231 Difference]: Finished difference. Result has 40 places, 41 transitions, 114 flow [2025-01-09 16:48:22,311 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=114, PETRI_PLACES=40, PETRI_TRANSITIONS=41} [2025-01-09 16:48:22,315 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, -1 predicate places. [2025-01-09 16:48:22,316 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 41 transitions, 114 flow [2025-01-09 16:48:22,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:48:22,316 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:48:22,316 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:48:22,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 16:48:22,316 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)] === [2025-01-09 16:48:22,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:48:22,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1692989459, now seen corresponding path program 1 times [2025-01-09 16:48:22,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:48:22,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659929798] [2025-01-09 16:48:22,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:48:22,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:48:22,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-09 16:48:22,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-09 16:48:22,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:48:22,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:48:22,418 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:48:22,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:48:22,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659929798] [2025-01-09 16:48:22,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659929798] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:48:22,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [459604113] [2025-01-09 16:48:22,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:48:22,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:48:22,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:48:22,420 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:48:22,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 16:48:22,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-09 16:48:22,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-09 16:48:22,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:48:22,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:48:22,505 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 16:48:22,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:48:22,557 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:48:22,558 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:48:22,593 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:48:22,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [459604113] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 16:48:22,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 16:48:22,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2025-01-09 16:48:22,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978387939] [2025-01-09 16:48:22,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:48:22,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:48:22,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:48:22,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:48:22,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-01-09 16:48:22,604 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 41 [2025-01-09 16:48:22,605 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 41 transitions, 114 flow. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:48:22,605 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:48:22,606 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 41 [2025-01-09 16:48:22,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:48:22,922 INFO L124 PetriNetUnfolderBase]: 2249/3791 cut-off events. [2025-01-09 16:48:22,922 INFO L125 PetriNetUnfolderBase]: For 281/281 co-relation queries the response was YES. [2025-01-09 16:48:22,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7426 conditions, 3791 events. 2249/3791 cut-off events. For 281/281 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 23323 event pairs, 1558 based on Foata normal form. 0/3513 useless extension candidates. Maximal degree in co-relation 5648. Up to 1537 conditions per place. [2025-01-09 16:48:22,942 INFO L140 encePairwiseOnDemand]: 36/41 looper letters, 52 selfloop transitions, 6 changer transitions 0/68 dead transitions. [2025-01-09 16:48:22,943 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 68 transitions, 297 flow [2025-01-09 16:48:22,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:48:22,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:48:22,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 117 transitions. [2025-01-09 16:48:22,945 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5707317073170731 [2025-01-09 16:48:22,945 INFO L175 Difference]: Start difference. First operand has 40 places, 41 transitions, 114 flow. Second operand 5 states and 117 transitions. [2025-01-09 16:48:22,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 68 transitions, 297 flow [2025-01-09 16:48:22,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 68 transitions, 290 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-01-09 16:48:22,948 INFO L231 Difference]: Finished difference. Result has 45 places, 44 transitions, 138 flow [2025-01-09 16:48:22,948 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=138, PETRI_PLACES=45, PETRI_TRANSITIONS=44} [2025-01-09 16:48:22,949 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 4 predicate places. [2025-01-09 16:48:22,949 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 44 transitions, 138 flow [2025-01-09 16:48:22,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:48:22,950 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:48:22,950 INFO L206 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] [2025-01-09 16:48:22,958 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 16:48:23,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:48:23,154 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)] === [2025-01-09 16:48:23,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:48:23,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1045891774, now seen corresponding path program 1 times [2025-01-09 16:48:23,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:48:23,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562349497] [2025-01-09 16:48:23,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:48:23,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:48:23,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-09 16:48:23,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-09 16:48:23,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:48:23,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:48:23,241 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:48:23,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:48:23,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562349497] [2025-01-09 16:48:23,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562349497] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:48:23,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019006171] [2025-01-09 16:48:23,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:48:23,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:48:23,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:48:23,244 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:48:23,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 16:48:23,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-09 16:48:23,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-09 16:48:23,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:48:23,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:48:23,316 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 16:48:23,317 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:48:23,355 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:48:23,356 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:48:23,391 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:48:23,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2019006171] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 16:48:23,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 16:48:23,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2025-01-09 16:48:23,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829493032] [2025-01-09 16:48:23,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:48:23,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:48:23,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:48:23,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:48:23,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-01-09 16:48:23,404 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41 [2025-01-09 16:48:23,405 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 44 transitions, 138 flow. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:48:23,405 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:48:23,405 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41 [2025-01-09 16:48:23,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:48:23,737 INFO L124 PetriNetUnfolderBase]: 2697/4356 cut-off events. [2025-01-09 16:48:23,737 INFO L125 PetriNetUnfolderBase]: For 104/104 co-relation queries the response was YES. [2025-01-09 16:48:23,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8570 conditions, 4356 events. 2697/4356 cut-off events. For 104/104 co-relation queries the response was YES. Maximal size of possible extension queue 255. Compared 25823 event pairs, 996 based on Foata normal form. 0/3961 useless extension candidates. Maximal degree in co-relation 7013. Up to 1122 conditions per place. [2025-01-09 16:48:23,755 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 78 selfloop transitions, 11 changer transitions 0/98 dead transitions. [2025-01-09 16:48:23,755 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 98 transitions, 440 flow [2025-01-09 16:48:23,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:48:23,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 16:48:23,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 153 transitions. [2025-01-09 16:48:23,756 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6219512195121951 [2025-01-09 16:48:23,756 INFO L175 Difference]: Start difference. First operand has 45 places, 44 transitions, 138 flow. Second operand 6 states and 153 transitions. [2025-01-09 16:48:23,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 98 transitions, 440 flow [2025-01-09 16:48:23,757 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 98 transitions, 436 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-01-09 16:48:23,758 INFO L231 Difference]: Finished difference. Result has 51 places, 49 transitions, 186 flow [2025-01-09 16:48:23,758 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=186, PETRI_PLACES=51, PETRI_TRANSITIONS=49} [2025-01-09 16:48:23,759 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 10 predicate places. [2025-01-09 16:48:23,759 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 49 transitions, 186 flow [2025-01-09 16:48:23,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:48:23,759 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:48:23,759 INFO L206 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] [2025-01-09 16:48:23,765 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 16:48:23,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:48:23,960 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)] === [2025-01-09 16:48:23,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:48:23,961 INFO L85 PathProgramCache]: Analyzing trace with hash -405225028, now seen corresponding path program 1 times [2025-01-09 16:48:23,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:48:23,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770657177] [2025-01-09 16:48:23,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:48:23,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:48:23,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-09 16:48:23,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 16:48:23,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:48:23,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:48:24,043 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:48:24,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:48:24,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770657177] [2025-01-09 16:48:24,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770657177] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:48:24,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:48:24,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:48:24,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760562759] [2025-01-09 16:48:24,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:48:24,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:48:24,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:48:24,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:48:24,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:48:24,058 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41 [2025-01-09 16:48:24,058 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 49 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:48:24,058 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:48:24,058 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41 [2025-01-09 16:48:24,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:48:24,310 INFO L124 PetriNetUnfolderBase]: 1780/3037 cut-off events. [2025-01-09 16:48:24,310 INFO L125 PetriNetUnfolderBase]: For 1128/1128 co-relation queries the response was YES. [2025-01-09 16:48:24,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6549 conditions, 3037 events. 1780/3037 cut-off events. For 1128/1128 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 17725 event pairs, 1022 based on Foata normal form. 164/2988 useless extension candidates. Maximal degree in co-relation 3291. Up to 1170 conditions per place. [2025-01-09 16:48:24,326 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 61 selfloop transitions, 8 changer transitions 4/82 dead transitions. [2025-01-09 16:48:24,326 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 82 transitions, 404 flow [2025-01-09 16:48:24,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:48:24,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 16:48:24,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 138 transitions. [2025-01-09 16:48:24,328 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5609756097560976 [2025-01-09 16:48:24,328 INFO L175 Difference]: Start difference. First operand has 51 places, 49 transitions, 186 flow. Second operand 6 states and 138 transitions. [2025-01-09 16:48:24,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 82 transitions, 404 flow [2025-01-09 16:48:24,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 82 transitions, 398 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 16:48:24,331 INFO L231 Difference]: Finished difference. Result has 55 places, 45 transitions, 180 flow [2025-01-09 16:48:24,331 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=180, PETRI_PLACES=55, PETRI_TRANSITIONS=45} [2025-01-09 16:48:24,331 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 14 predicate places. [2025-01-09 16:48:24,331 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 45 transitions, 180 flow [2025-01-09 16:48:24,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:48:24,332 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:48:24,332 INFO L206 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] [2025-01-09 16:48:24,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 16:48:24,332 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)] === [2025-01-09 16:48:24,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:48:24,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1558277941, now seen corresponding path program 1 times [2025-01-09 16:48:24,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:48:24,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604433907] [2025-01-09 16:48:24,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:48:24,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:48:24,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-09 16:48:24,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 16:48:24,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:48:24,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:48:24,384 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:48:24,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:48:24,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604433907] [2025-01-09 16:48:24,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604433907] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:48:24,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:48:24,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:48:24,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985769058] [2025-01-09 16:48:24,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:48:24,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:48:24,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:48:24,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:48:24,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:48:24,391 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2025-01-09 16:48:24,391 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 45 transitions, 180 flow. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:48:24,391 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:48:24,391 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2025-01-09 16:48:24,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:48:24,631 INFO L124 PetriNetUnfolderBase]: 2362/3861 cut-off events. [2025-01-09 16:48:24,632 INFO L125 PetriNetUnfolderBase]: For 3292/3292 co-relation queries the response was YES. [2025-01-09 16:48:24,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9132 conditions, 3861 events. 2362/3861 cut-off events. For 3292/3292 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 20761 event pairs, 494 based on Foata normal form. 92/3938 useless extension candidates. Maximal degree in co-relation 4953. Up to 2248 conditions per place. [2025-01-09 16:48:24,651 INFO L140 encePairwiseOnDemand]: 37/41 looper letters, 65 selfloop transitions, 4 changer transitions 0/78 dead transitions. [2025-01-09 16:48:24,652 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 78 transitions, 448 flow [2025-01-09 16:48:24,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:48:24,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 16:48:24,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 100 transitions. [2025-01-09 16:48:24,653 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6097560975609756 [2025-01-09 16:48:24,653 INFO L175 Difference]: Start difference. First operand has 55 places, 45 transitions, 180 flow. Second operand 4 states and 100 transitions. [2025-01-09 16:48:24,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 78 transitions, 448 flow [2025-01-09 16:48:24,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 78 transitions, 401 flow, removed 10 selfloop flow, removed 5 redundant places. [2025-01-09 16:48:24,657 INFO L231 Difference]: Finished difference. Result has 55 places, 48 transitions, 178 flow [2025-01-09 16:48:24,657 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=178, PETRI_PLACES=55, PETRI_TRANSITIONS=48} [2025-01-09 16:48:24,659 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 14 predicate places. [2025-01-09 16:48:24,659 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 48 transitions, 178 flow [2025-01-09 16:48:24,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:48:24,660 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:48:24,660 INFO L206 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] [2025-01-09 16:48:24,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 16:48:24,660 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)] === [2025-01-09 16:48:24,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:48:24,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1227983084, now seen corresponding path program 1 times [2025-01-09 16:48:24,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:48:24,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210606955] [2025-01-09 16:48:24,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:48:24,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:48:24,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-09 16:48:24,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 16:48:24,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:48:24,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:48:24,737 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:48:24,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:48:24,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210606955] [2025-01-09 16:48:24,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210606955] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:48:24,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [225954169] [2025-01-09 16:48:24,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:48:24,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:48:24,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:48:24,740 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:48:24,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 16:48:24,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-09 16:48:24,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 16:48:24,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:48:24,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:48:24,803 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 16:48:24,804 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:48:24,839 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:48:24,839 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:48:24,870 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:48:24,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [225954169] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 16:48:24,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 16:48:24,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2025-01-09 16:48:24,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795430192] [2025-01-09 16:48:24,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:48:24,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:48:24,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:48:24,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:48:24,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-01-09 16:48:24,880 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41 [2025-01-09 16:48:24,881 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 48 transitions, 178 flow. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 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) [2025-01-09 16:48:24,881 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:48:24,881 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41 [2025-01-09 16:48:24,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:48:25,120 INFO L124 PetriNetUnfolderBase]: 2190/3559 cut-off events. [2025-01-09 16:48:25,121 INFO L125 PetriNetUnfolderBase]: For 1910/1910 co-relation queries the response was YES. [2025-01-09 16:48:25,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8451 conditions, 3559 events. 2190/3559 cut-off events. For 1910/1910 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 19465 event pairs, 607 based on Foata normal form. 0/3386 useless extension candidates. Maximal degree in co-relation 4796. Up to 1207 conditions per place. [2025-01-09 16:48:25,136 INFO L140 encePairwiseOnDemand]: 34/41 looper letters, 74 selfloop transitions, 8 changer transitions 0/94 dead transitions. [2025-01-09 16:48:25,137 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 94 transitions, 482 flow [2025-01-09 16:48:25,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:48:25,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 16:48:25,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 144 transitions. [2025-01-09 16:48:25,138 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5853658536585366 [2025-01-09 16:48:25,138 INFO L175 Difference]: Start difference. First operand has 55 places, 48 transitions, 178 flow. Second operand 6 states and 144 transitions. [2025-01-09 16:48:25,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 94 transitions, 482 flow [2025-01-09 16:48:25,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 94 transitions, 482 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 16:48:25,140 INFO L231 Difference]: Finished difference. Result has 62 places, 52 transitions, 215 flow [2025-01-09 16:48:25,140 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=215, PETRI_PLACES=62, PETRI_TRANSITIONS=52} [2025-01-09 16:48:25,141 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 21 predicate places. [2025-01-09 16:48:25,141 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 52 transitions, 215 flow [2025-01-09 16:48:25,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 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) [2025-01-09 16:48:25,141 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:48:25,141 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:48:25,147 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 16:48:25,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:48:25,345 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)] === [2025-01-09 16:48:25,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:48:25,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1721779663, now seen corresponding path program 1 times [2025-01-09 16:48:25,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:48:25,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089818807] [2025-01-09 16:48:25,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:48:25,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:48:25,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-09 16:48:25,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 16:48:25,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:48:25,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:48:25,414 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:48:25,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:48:25,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089818807] [2025-01-09 16:48:25,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089818807] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:48:25,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:48:25,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:48:25,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950130503] [2025-01-09 16:48:25,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:48:25,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:48:25,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:48:25,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:48:25,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:48:25,427 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2025-01-09 16:48:25,427 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 52 transitions, 215 flow. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:48:25,427 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:48:25,427 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2025-01-09 16:48:25,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:48:25,773 INFO L124 PetriNetUnfolderBase]: 3274/5403 cut-off events. [2025-01-09 16:48:25,773 INFO L125 PetriNetUnfolderBase]: For 3676/3712 co-relation queries the response was YES. [2025-01-09 16:48:25,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13885 conditions, 5403 events. 3274/5403 cut-off events. For 3676/3712 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 32021 event pairs, 1121 based on Foata normal form. 128/5495 useless extension candidates. Maximal degree in co-relation 8024. Up to 2792 conditions per place. [2025-01-09 16:48:25,802 INFO L140 encePairwiseOnDemand]: 34/41 looper letters, 92 selfloop transitions, 15 changer transitions 0/118 dead transitions. [2025-01-09 16:48:25,802 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 118 transitions, 681 flow [2025-01-09 16:48:25,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:48:25,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 16:48:25,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 147 transitions. [2025-01-09 16:48:25,804 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5975609756097561 [2025-01-09 16:48:25,804 INFO L175 Difference]: Start difference. First operand has 62 places, 52 transitions, 215 flow. Second operand 6 states and 147 transitions. [2025-01-09 16:48:25,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 118 transitions, 681 flow [2025-01-09 16:48:25,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 118 transitions, 678 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 16:48:25,808 INFO L231 Difference]: Finished difference. Result has 70 places, 65 transitions, 344 flow [2025-01-09 16:48:25,808 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=344, PETRI_PLACES=70, PETRI_TRANSITIONS=65} [2025-01-09 16:48:25,808 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 29 predicate places. [2025-01-09 16:48:25,808 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 65 transitions, 344 flow [2025-01-09 16:48:25,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:48:25,808 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:48:25,809 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:48:25,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 16:48:25,809 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)] === [2025-01-09 16:48:25,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:48:25,809 INFO L85 PathProgramCache]: Analyzing trace with hash 1098910701, now seen corresponding path program 2 times [2025-01-09 16:48:25,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:48:25,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94657650] [2025-01-09 16:48:25,809 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:48:25,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:48:25,821 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 1 equivalence classes. [2025-01-09 16:48:25,828 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 16:48:25,829 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:48:25,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:48:25,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:48:25,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:48:25,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94657650] [2025-01-09 16:48:25,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94657650] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:48:25,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:48:25,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:48:25,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906908287] [2025-01-09 16:48:25,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:48:25,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:48:25,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:48:25,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:48:25,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:48:25,936 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2025-01-09 16:48:25,936 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 65 transitions, 344 flow. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:48:25,936 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:48:25,937 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2025-01-09 16:48:25,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:48:26,358 INFO L124 PetriNetUnfolderBase]: 4202/6994 cut-off events. [2025-01-09 16:48:26,359 INFO L125 PetriNetUnfolderBase]: For 9508/9582 co-relation queries the response was YES. [2025-01-09 16:48:26,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20362 conditions, 6994 events. 4202/6994 cut-off events. For 9508/9582 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 42815 event pairs, 1417 based on Foata normal form. 140/7124 useless extension candidates. Maximal degree in co-relation 12858. Up to 2557 conditions per place. [2025-01-09 16:48:26,396 INFO L140 encePairwiseOnDemand]: 34/41 looper letters, 102 selfloop transitions, 13 changer transitions 1/127 dead transitions. [2025-01-09 16:48:26,396 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 127 transitions, 851 flow [2025-01-09 16:48:26,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:48:26,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 16:48:26,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 144 transitions. [2025-01-09 16:48:26,399 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5853658536585366 [2025-01-09 16:48:26,399 INFO L175 Difference]: Start difference. First operand has 70 places, 65 transitions, 344 flow. Second operand 6 states and 144 transitions. [2025-01-09 16:48:26,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 127 transitions, 851 flow [2025-01-09 16:48:26,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 127 transitions, 849 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-01-09 16:48:26,409 INFO L231 Difference]: Finished difference. Result has 78 places, 71 transitions, 442 flow [2025-01-09 16:48:26,409 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=342, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=442, PETRI_PLACES=78, PETRI_TRANSITIONS=71} [2025-01-09 16:48:26,410 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 37 predicate places. [2025-01-09 16:48:26,410 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 71 transitions, 442 flow [2025-01-09 16:48:26,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:48:26,410 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:48:26,410 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:48:26,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 16:48:26,410 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)] === [2025-01-09 16:48:26,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:48:26,410 INFO L85 PathProgramCache]: Analyzing trace with hash -577498989, now seen corresponding path program 3 times [2025-01-09 16:48:26,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:48:26,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732572902] [2025-01-09 16:48:26,411 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:48:26,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:48:26,417 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 2 equivalence classes. [2025-01-09 16:48:26,421 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 26 of 31 statements. [2025-01-09 16:48:26,421 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-09 16:48:26,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:48:26,483 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:48:26,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:48:26,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732572902] [2025-01-09 16:48:26,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732572902] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:48:26,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:48:26,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:48:26,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479537963] [2025-01-09 16:48:26,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:48:26,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:48:26,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:48:26,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:48:26,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:48:26,491 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41 [2025-01-09 16:48:26,491 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 71 transitions, 442 flow. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:48:26,491 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:48:26,491 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41 [2025-01-09 16:48:26,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:48:26,784 INFO L124 PetriNetUnfolderBase]: 2795/4670 cut-off events. [2025-01-09 16:48:26,785 INFO L125 PetriNetUnfolderBase]: For 9121/9123 co-relation queries the response was YES. [2025-01-09 16:48:26,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14330 conditions, 4670 events. 2795/4670 cut-off events. For 9121/9123 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 25910 event pairs, 2031 based on Foata normal form. 41/4655 useless extension candidates. Maximal degree in co-relation 13486. Up to 3611 conditions per place. [2025-01-09 16:48:26,809 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 38 selfloop transitions, 4 changer transitions 27/83 dead transitions. [2025-01-09 16:48:26,810 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 83 transitions, 603 flow [2025-01-09 16:48:26,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:48:26,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 16:48:26,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 123 transitions. [2025-01-09 16:48:26,818 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-01-09 16:48:26,818 INFO L175 Difference]: Start difference. First operand has 78 places, 71 transitions, 442 flow. Second operand 6 states and 123 transitions. [2025-01-09 16:48:26,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 83 transitions, 603 flow [2025-01-09 16:48:26,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 83 transitions, 587 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-01-09 16:48:26,831 INFO L231 Difference]: Finished difference. Result has 80 places, 56 transitions, 329 flow [2025-01-09 16:48:26,831 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=379, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=329, PETRI_PLACES=80, PETRI_TRANSITIONS=56} [2025-01-09 16:48:26,833 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 39 predicate places. [2025-01-09 16:48:26,833 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 56 transitions, 329 flow [2025-01-09 16:48:26,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:48:26,833 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:48:26,833 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:48:26,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 16:48:26,835 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)] === [2025-01-09 16:48:26,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:48:26,835 INFO L85 PathProgramCache]: Analyzing trace with hash 876823154, now seen corresponding path program 1 times [2025-01-09 16:48:26,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:48:26,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819462378] [2025-01-09 16:48:26,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:48:26,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:48:26,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-09 16:48:26,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 16:48:26,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:48:26,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:48:26,912 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:48:26,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:48:26,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819462378] [2025-01-09 16:48:26,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819462378] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:48:26,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [159583557] [2025-01-09 16:48:26,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:48:26,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:48:26,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:48:26,914 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:48:26,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 16:48:26,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-09 16:48:26,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 16:48:26,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:48:26,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:48:26,992 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 16:48:26,993 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:48:27,046 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:48:27,047 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:48:27,082 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:48:27,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [159583557] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 16:48:27,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 16:48:27,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2025-01-09 16:48:27,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401030908] [2025-01-09 16:48:27,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:48:27,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:48:27,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:48:27,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:48:27,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-01-09 16:48:27,100 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41 [2025-01-09 16:48:27,100 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 56 transitions, 329 flow. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:48:27,100 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:48:27,100 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41 [2025-01-09 16:48:27,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:48:27,303 INFO L124 PetriNetUnfolderBase]: 2264/3796 cut-off events. [2025-01-09 16:48:27,304 INFO L125 PetriNetUnfolderBase]: For 7431/7435 co-relation queries the response was YES. [2025-01-09 16:48:27,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11716 conditions, 3796 events. 2264/3796 cut-off events. For 7431/7435 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 21029 event pairs, 574 based on Foata normal form. 0/3662 useless extension candidates. Maximal degree in co-relation 11674. Up to 2072 conditions per place. [2025-01-09 16:48:27,322 INFO L140 encePairwiseOnDemand]: 35/41 looper letters, 44 selfloop transitions, 10 changer transitions 0/69 dead transitions. [2025-01-09 16:48:27,322 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 69 transitions, 498 flow [2025-01-09 16:48:27,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:48:27,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:48:27,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 99 transitions. [2025-01-09 16:48:27,323 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48292682926829267 [2025-01-09 16:48:27,323 INFO L175 Difference]: Start difference. First operand has 80 places, 56 transitions, 329 flow. Second operand 5 states and 99 transitions. [2025-01-09 16:48:27,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 69 transitions, 498 flow [2025-01-09 16:48:27,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 69 transitions, 469 flow, removed 4 selfloop flow, removed 5 redundant places. [2025-01-09 16:48:27,330 INFO L231 Difference]: Finished difference. Result has 74 places, 57 transitions, 347 flow [2025-01-09 16:48:27,330 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=347, PETRI_PLACES=74, PETRI_TRANSITIONS=57} [2025-01-09 16:48:27,330 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 33 predicate places. [2025-01-09 16:48:27,331 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 57 transitions, 347 flow [2025-01-09 16:48:27,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:48:27,331 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:48:27,331 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:48:27,337 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 16:48:27,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-01-09 16:48:27,531 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)] === [2025-01-09 16:48:27,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:48:27,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1900816575, now seen corresponding path program 1 times [2025-01-09 16:48:27,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:48:27,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047579959] [2025-01-09 16:48:27,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:48:27,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:48:27,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-09 16:48:27,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 16:48:27,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:48:27,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:48:27,594 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 16:48:27,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:48:27,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047579959] [2025-01-09 16:48:27,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047579959] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:48:27,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:48:27,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:48:27,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668084059] [2025-01-09 16:48:27,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:48:27,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:48:27,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:48:27,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:48:27,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:48:27,605 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2025-01-09 16:48:27,605 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 57 transitions, 347 flow. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:48:27,605 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:48:27,605 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2025-01-09 16:48:27,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:48:27,960 INFO L124 PetriNetUnfolderBase]: 2152/3638 cut-off events. [2025-01-09 16:48:27,960 INFO L125 PetriNetUnfolderBase]: For 9620/9642 co-relation queries the response was YES. [2025-01-09 16:48:27,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11688 conditions, 3638 events. 2152/3638 cut-off events. For 9620/9642 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 18986 event pairs, 418 based on Foata normal form. 78/3708 useless extension candidates. Maximal degree in co-relation 11649. Up to 1763 conditions per place. [2025-01-09 16:48:27,981 INFO L140 encePairwiseOnDemand]: 35/41 looper letters, 72 selfloop transitions, 15 changer transitions 2/99 dead transitions. [2025-01-09 16:48:27,981 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 99 transitions, 681 flow [2025-01-09 16:48:27,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:48:27,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 16:48:27,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 141 transitions. [2025-01-09 16:48:27,982 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.573170731707317 [2025-01-09 16:48:27,982 INFO L175 Difference]: Start difference. First operand has 74 places, 57 transitions, 347 flow. Second operand 6 states and 141 transitions. [2025-01-09 16:48:27,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 99 transitions, 681 flow [2025-01-09 16:48:27,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 99 transitions, 670 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-09 16:48:27,989 INFO L231 Difference]: Finished difference. Result has 79 places, 59 transitions, 411 flow [2025-01-09 16:48:27,989 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=325, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=411, PETRI_PLACES=79, PETRI_TRANSITIONS=59} [2025-01-09 16:48:27,989 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 38 predicate places. [2025-01-09 16:48:27,989 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 59 transitions, 411 flow [2025-01-09 16:48:27,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:48:27,990 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:48:27,990 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:48:27,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 16:48:27,990 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)] === [2025-01-09 16:48:27,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:48:27,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1494218451, now seen corresponding path program 2 times [2025-01-09 16:48:27,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:48:27,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149792335] [2025-01-09 16:48:27,990 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:48:27,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:48:27,998 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-01-09 16:48:28,011 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 16:48:28,011 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:48:28,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:48:28,116 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 16:48:28,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:48:28,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149792335] [2025-01-09 16:48:28,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149792335] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:48:28,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [933180365] [2025-01-09 16:48:28,117 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:48:28,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:48:28,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:48:28,124 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:48:28,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 16:48:28,173 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-01-09 16:48:28,196 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 16:48:28,196 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:48:28,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:48:28,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 16:48:28,198 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:48:28,268 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 16:48:28,269 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:48:28,332 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 16:48:28,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [933180365] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:48:28,332 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:48:28,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 16 [2025-01-09 16:48:28,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532168661] [2025-01-09 16:48:28,333 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:48:28,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 16:48:28,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:48:28,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 16:48:28,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2025-01-09 16:48:28,374 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 41 [2025-01-09 16:48:28,375 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 59 transitions, 411 flow. Second operand has 16 states, 16 states have (on average 10.1875) internal successors, (163), 16 states have internal predecessors, (163), 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) [2025-01-09 16:48:28,375 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:48:28,375 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 41 [2025-01-09 16:48:28,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:48:30,507 INFO L124 PetriNetUnfolderBase]: 16526/24069 cut-off events. [2025-01-09 16:48:30,507 INFO L125 PetriNetUnfolderBase]: For 70186/70186 co-relation queries the response was YES. [2025-01-09 16:48:30,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79028 conditions, 24069 events. 16526/24069 cut-off events. For 70186/70186 co-relation queries the response was YES. Maximal size of possible extension queue 394. Compared 137482 event pairs, 2839 based on Foata normal form. 381/24374 useless extension candidates. Maximal degree in co-relation 78986. Up to 5225 conditions per place. [2025-01-09 16:48:30,640 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 394 selfloop transitions, 98 changer transitions 41/536 dead transitions. [2025-01-09 16:48:30,640 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 536 transitions, 4463 flow [2025-01-09 16:48:30,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-01-09 16:48:30,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2025-01-09 16:48:30,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 604 transitions. [2025-01-09 16:48:30,643 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4332855093256815 [2025-01-09 16:48:30,643 INFO L175 Difference]: Start difference. First operand has 79 places, 59 transitions, 411 flow. Second operand 34 states and 604 transitions. [2025-01-09 16:48:30,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 536 transitions, 4463 flow [2025-01-09 16:48:30,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 536 transitions, 4259 flow, removed 49 selfloop flow, removed 3 redundant places. [2025-01-09 16:48:30,677 INFO L231 Difference]: Finished difference. Result has 136 places, 174 transitions, 1771 flow [2025-01-09 16:48:30,677 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=385, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=1771, PETRI_PLACES=136, PETRI_TRANSITIONS=174} [2025-01-09 16:48:30,678 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 95 predicate places. [2025-01-09 16:48:30,678 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 174 transitions, 1771 flow [2025-01-09 16:48:30,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 10.1875) internal successors, (163), 16 states have internal predecessors, (163), 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) [2025-01-09 16:48:30,678 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:48:30,678 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:48:30,687 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 16:48:30,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-01-09 16:48:30,879 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)] === [2025-01-09 16:48:30,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:48:30,879 INFO L85 PathProgramCache]: Analyzing trace with hash 69489179, now seen corresponding path program 3 times [2025-01-09 16:48:30,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:48:30,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956610756] [2025-01-09 16:48:30,879 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:48:30,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:48:30,887 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 42 statements into 2 equivalence classes. [2025-01-09 16:48:30,900 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 16:48:30,900 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-09 16:48:30,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:48:30,974 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 16:48:30,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:48:30,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956610756] [2025-01-09 16:48:30,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956610756] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:48:30,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1543711572] [2025-01-09 16:48:30,974 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:48:30,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:48:30,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:48:30,977 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:48:30,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 16:48:31,019 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 42 statements into 2 equivalence classes. [2025-01-09 16:48:31,043 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 16:48:31,043 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-09 16:48:31,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:48:31,044 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 16:48:31,045 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:48:31,128 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 16:48:31,129 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:48:31,193 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 16:48:31,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1543711572] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:48:31,193 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:48:31,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2025-01-09 16:48:31,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758816722] [2025-01-09 16:48:31,194 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:48:31,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 16:48:31,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:48:31,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 16:48:31,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2025-01-09 16:48:31,242 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2025-01-09 16:48:31,243 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 174 transitions, 1771 flow. Second operand has 15 states, 15 states have (on average 14.6) internal successors, (219), 15 states have internal predecessors, (219), 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) [2025-01-09 16:48:31,243 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:48:31,243 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2025-01-09 16:48:31,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:48:35,734 INFO L124 PetriNetUnfolderBase]: 26524/41445 cut-off events. [2025-01-09 16:48:35,734 INFO L125 PetriNetUnfolderBase]: For 350796/352172 co-relation queries the response was YES. [2025-01-09 16:48:36,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 192256 conditions, 41445 events. 26524/41445 cut-off events. For 350796/352172 co-relation queries the response was YES. Maximal size of possible extension queue 984. Compared 294964 event pairs, 1621 based on Foata normal form. 642/41730 useless extension candidates. Maximal degree in co-relation 192188. Up to 5835 conditions per place. [2025-01-09 16:48:36,440 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 662 selfloop transitions, 229 changer transitions 14/958 dead transitions. [2025-01-09 16:48:36,440 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 958 transitions, 10130 flow [2025-01-09 16:48:36,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-01-09 16:48:36,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2025-01-09 16:48:36,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 645 transitions. [2025-01-09 16:48:36,442 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5424726661059714 [2025-01-09 16:48:36,442 INFO L175 Difference]: Start difference. First operand has 136 places, 174 transitions, 1771 flow. Second operand 29 states and 645 transitions. [2025-01-09 16:48:36,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 958 transitions, 10130 flow [2025-01-09 16:48:37,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 958 transitions, 9773 flow, removed 175 selfloop flow, removed 1 redundant places. [2025-01-09 16:48:37,935 INFO L231 Difference]: Finished difference. Result has 184 places, 373 transitions, 4698 flow [2025-01-09 16:48:37,935 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1651, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=4698, PETRI_PLACES=184, PETRI_TRANSITIONS=373} [2025-01-09 16:48:37,936 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 143 predicate places. [2025-01-09 16:48:37,936 INFO L471 AbstractCegarLoop]: Abstraction has has 184 places, 373 transitions, 4698 flow [2025-01-09 16:48:37,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 14.6) internal successors, (219), 15 states have internal predecessors, (219), 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) [2025-01-09 16:48:37,936 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:48:37,936 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:48:37,942 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-09 16:48:38,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-01-09 16:48:38,137 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)] === [2025-01-09 16:48:38,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:48:38,137 INFO L85 PathProgramCache]: Analyzing trace with hash -250825439, now seen corresponding path program 4 times [2025-01-09 16:48:38,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:48:38,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638497573] [2025-01-09 16:48:38,137 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 16:48:38,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:48:38,144 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 42 statements into 2 equivalence classes. [2025-01-09 16:48:38,150 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 39 of 42 statements. [2025-01-09 16:48:38,150 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-09 16:48:38,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:48:38,196 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 16:48:38,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:48:38,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638497573] [2025-01-09 16:48:38,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638497573] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:48:38,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1238040481] [2025-01-09 16:48:38,197 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 16:48:38,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:48:38,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:48:38,199 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:48:38,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-09 16:48:38,243 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 42 statements into 2 equivalence classes. [2025-01-09 16:48:38,256 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 39 of 42 statements. [2025-01-09 16:48:38,256 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-09 16:48:38,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:48:38,257 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 16:48:38,258 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:48:38,298 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 16:48:38,301 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:48:38,340 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 16:48:38,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1238040481] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:48:38,340 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:48:38,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 9 [2025-01-09 16:48:38,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698495108] [2025-01-09 16:48:38,341 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:48:38,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 16:48:38,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:48:38,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 16:48:38,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-01-09 16:48:38,357 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2025-01-09 16:48:38,357 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 373 transitions, 4698 flow. Second operand has 9 states, 9 states have (on average 14.333333333333334) internal successors, (129), 9 states have internal predecessors, (129), 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) [2025-01-09 16:48:38,358 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:48:38,358 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2025-01-09 16:48:38,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:48:39,371 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L60-->L60-1: Formula: (= v_thread2Thread1of1ForFork1_~i~1_11 v_~p~0_1) InVars {thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_11} OutVars{thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_11, ~p~0=v_~p~0_1} AuxVars[] AssignedVars[~p~0][91], [Black: 512#(= thread3Thread1of1ForFork2_~i~2 0), Black: 514#(and (= ~p~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), 1390#(<= 0 thread2Thread1of1ForFork1_~i~1), 735#true, Black: 1018#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1))), 39#L69-2true, Black: 1044#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 1016#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1))), Black: 1008#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~p~0 0) (<= ~N~0 1) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 1038#(and (<= ~p~0 0) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2)), Black: 998#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 1042#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~N~0 1) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 739#(<= ~N~0 1), Black: 1030#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 1040#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 1010#(and (= thread3Thread1of1ForFork2_~i~2 0) (= ~p~0 thread2Thread1of1ForFork1_~i~1) (<= ~N~0 1) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 1000#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~N~0 1) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 1024#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1))), Black: 1006#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~p~0 0) (<= ~N~0 1)), Black: 738#(<= thread1Thread1of1ForFork0_~i~0 1), Black: 1014#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1))), Black: 740#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~N~0 1)), Black: 737#(= thread1Thread1of1ForFork0_~i~0 0), Black: 1026#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 1036#(and (<= ~p~0 0) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 811#(and (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2)), Black: 1022#(and (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 1002#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 1028#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~N~0 1)), Black: 1004#(and (<= ~N~0 1) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), 57#(<= 1 ~N~0), Black: 898#(<= ~p~0 thread3Thread1of1ForFork2_~i~2), Black: 51#(and (= ~asum~0 0) (<= (mod ~N~0 4294967296) 0) (= ~csum~0 0)), Black: 50#(and (= ~asum~0 0) (or (and (<= 0 ~N~0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0)) (< (mod ~N~0 4294967296) 1)) (= ~csum~0 0)), 335#true, Black: 184#(and (<= 1 ~N~0) (<= (+ |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 11#L60-1true, 1338#(and (= thread2Thread1of1ForFork1_~i~1 0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 323#(and (<= 1 ~N~0) (<= (+ thread1Thread1of1ForFork0_~i~0 1) ~N~0)), 190#(<= 1 ~N~0), Black: 531#(<= 1 ~N~0), Black: 337#(= ~p~0 0), Black: 338#(and (= ~p~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), 495#(and (<= 1 ~N~0) (<= (+ thread2Thread1of1ForFork1_~i~1 1) ~N~0)), Black: 1360#(and (<= thread3Thread1of1ForFork2_~i~2 thread2Thread1of1ForFork1_~i~1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 1358#(and (<= (+ thread3Thread1of1ForFork2_~i~2 1) thread2Thread1of1ForFork1_~i~1) (<= thread3Thread1of1ForFork2_~i~2 1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= (+ 2 thread3Thread1of1ForFork2_~i~2) ~N~0) (<= 2 ~N~0)), Black: 1340#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork2_~i~2 0) (<= 1 thread2Thread1of1ForFork1_~i~1)), Black: 1076#(= thread2Thread1of1ForFork1_~i~1 0), Black: 1108#(<= 0 thread2Thread1of1ForFork1_~i~1), Black: 1362#(and (<= (+ thread3Thread1of1ForFork2_~i~2 1) thread2Thread1of1ForFork1_~i~1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 724#(= ~p~0 0), Black: 1078#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= 1 thread2Thread1of1ForFork1_~i~1)), Black: 1178#(and (<= thread3Thread1of1ForFork2_~i~2 1) (<= 2 ~N~0)), Black: 725#(and (= ~p~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 1077#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread2Thread1of1ForFork1_~i~1 0)), Black: 1352#(and (<= thread3Thread1of1ForFork2_~i~2 thread2Thread1of1ForFork1_~i~1) (<= thread3Thread1of1ForFork2_~i~2 1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= 2 ~N~0)), Black: 1364#(and (<= thread3Thread1of1ForFork2_~i~2 1) (<= (+ 2 thread3Thread1of1ForFork2_~i~2) ~N~0) (<= 2 ~N~0)), Black: 1354#(and (<= thread3Thread1of1ForFork2_~i~2 thread2Thread1of1ForFork1_~i~1) (<= 0 thread2Thread1of1ForFork1_~i~1)), 8#L50-5true, Black: 1080#(<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0), 37#L88-4true, Black: 1074#true, Black: 1127#(and (<= 0 thread2Thread1of1ForFork1_~i~1) (<= thread3Thread1of1ForFork2_~i~2 0)), Black: 1346#(and (<= 0 thread2Thread1of1ForFork1_~i~1) (<= thread3Thread1of1ForFork2_~i~2 0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 1348#(and (<= thread3Thread1of1ForFork2_~i~2 0) (<= 1 thread2Thread1of1ForFork1_~i~1) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 1366#(and (<= (+ thread3Thread1of1ForFork2_~i~2 1) thread2Thread1of1ForFork1_~i~1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= (+ 2 thread3Thread1of1ForFork2_~i~2) ~N~0)), Black: 1245#(< (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0), Black: 1143#(and (<= thread3Thread1of1ForFork2_~i~2 0) (<= 1 thread2Thread1of1ForFork1_~i~1)), Black: 1356#(and (<= (+ thread3Thread1of1ForFork2_~i~2 1) thread2Thread1of1ForFork1_~i~1) (<= thread3Thread1of1ForFork2_~i~2 1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= 2 ~N~0)), 516#(and (= ~p~0 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread2Thread1of1ForFork1_~i~1 0)), Black: 501#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread2Thread1of1ForFork1_~i~1 0)), Black: 502#(and (= ~p~0 0) (= thread3Thread1of1ForFork2_~i~2 0))]) [2025-01-09 16:48:39,371 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is not cut-off event [2025-01-09 16:48:39,371 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is not cut-off event [2025-01-09 16:48:39,371 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is not cut-off event [2025-01-09 16:48:39,372 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is not cut-off event [2025-01-09 16:48:39,429 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([435] L69-->L69-2: Formula: (<= v_~p~0_3 v_thread3Thread1of1ForFork2_~i~2_9) InVars {~p~0=v_~p~0_3, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_9} OutVars{~p~0=v_~p~0_3, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_9} AuxVars[] AssignedVars[][58], [323#(and (<= 1 ~N~0) (<= (+ thread1Thread1of1ForFork0_~i~0 1) ~N~0)), Black: 514#(and (= ~p~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), 998#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 1018#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1))), 39#L69-2true, Black: 1044#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 1016#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1))), Black: 1008#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~p~0 0) (<= ~N~0 1) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 1038#(and (<= ~p~0 0) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2)), Black: 1042#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~N~0 1) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 739#(<= ~N~0 1), Black: 1030#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 735#true, Black: 1040#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 1010#(and (= thread3Thread1of1ForFork2_~i~2 0) (= ~p~0 thread2Thread1of1ForFork1_~i~1) (<= ~N~0 1) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 1000#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~N~0 1) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 1024#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1))), Black: 1006#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~p~0 0) (<= ~N~0 1)), Black: 738#(<= thread1Thread1of1ForFork0_~i~0 1), 721#true, Black: 1014#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1))), Black: 740#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~N~0 1)), Black: 737#(= thread1Thread1of1ForFork0_~i~0 0), Black: 1026#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 1036#(and (<= ~p~0 0) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 811#(and (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2)), Black: 1022#(and (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 1002#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 1028#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~N~0 1)), Black: 1004#(and (<= ~N~0 1) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), 57#(<= 1 ~N~0), Black: 898#(<= ~p~0 thread3Thread1of1ForFork2_~i~2), Black: 51#(and (= ~asum~0 0) (<= (mod ~N~0 4294967296) 0) (= ~csum~0 0)), Black: 50#(and (= ~asum~0 0) (or (and (<= 0 ~N~0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0)) (< (mod ~N~0 4294967296) 1)) (= ~csum~0 0)), 1651#(and (<= thread1Thread1of1ForFork0_~i~0 0) (<= 1 thread2Thread1of1ForFork1_~i~1) (<= 2 ~N~0)), 335#true, 11#L60-1true, Black: 184#(and (<= 1 ~N~0) (<= (+ |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 512#(= thread3Thread1of1ForFork2_~i~2 0), 498#true, Black: 531#(<= 1 ~N~0), Black: 337#(= ~p~0 0), Black: 338#(and (= ~p~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), 1346#(and (<= 0 thread2Thread1of1ForFork1_~i~1) (<= thread3Thread1of1ForFork2_~i~2 0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), 495#(and (<= 1 ~N~0) (<= (+ thread2Thread1of1ForFork1_~i~1 1) ~N~0)), Black: 1360#(and (<= thread3Thread1of1ForFork2_~i~2 thread2Thread1of1ForFork1_~i~1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 1358#(and (<= (+ thread3Thread1of1ForFork2_~i~2 1) thread2Thread1of1ForFork1_~i~1) (<= thread3Thread1of1ForFork2_~i~2 1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= (+ 2 thread3Thread1of1ForFork2_~i~2) ~N~0) (<= 2 ~N~0)), Black: 1340#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork2_~i~2 0) (<= 1 thread2Thread1of1ForFork1_~i~1)), Black: 1076#(= thread2Thread1of1ForFork1_~i~1 0), Black: 1108#(<= 0 thread2Thread1of1ForFork1_~i~1), Black: 730#(and (= ~p~0 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread2Thread1of1ForFork1_~i~1 0)), Black: 1362#(and (<= (+ thread3Thread1of1ForFork2_~i~2 1) thread2Thread1of1ForFork1_~i~1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 724#(= ~p~0 0), Black: 1078#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= 1 thread2Thread1of1ForFork1_~i~1)), Black: 1178#(and (<= thread3Thread1of1ForFork2_~i~2 1) (<= 2 ~N~0)), Black: 725#(and (= ~p~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 1077#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread2Thread1of1ForFork1_~i~1 0)), Black: 1352#(and (<= thread3Thread1of1ForFork2_~i~2 thread2Thread1of1ForFork1_~i~1) (<= thread3Thread1of1ForFork2_~i~2 1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= 2 ~N~0)), Black: 1364#(and (<= thread3Thread1of1ForFork2_~i~2 1) (<= (+ 2 thread3Thread1of1ForFork2_~i~2) ~N~0) (<= 2 ~N~0)), 8#L50-5true, Black: 1354#(and (<= thread3Thread1of1ForFork2_~i~2 thread2Thread1of1ForFork1_~i~1) (<= 0 thread2Thread1of1ForFork1_~i~1)), Black: 1080#(<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0), 37#L88-4true, Black: 1074#true, Black: 1127#(and (<= 0 thread2Thread1of1ForFork1_~i~1) (<= thread3Thread1of1ForFork2_~i~2 0)), Black: 1348#(and (<= thread3Thread1of1ForFork2_~i~2 0) (<= 1 thread2Thread1of1ForFork1_~i~1) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 1366#(and (<= (+ thread3Thread1of1ForFork2_~i~2 1) thread2Thread1of1ForFork1_~i~1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= (+ 2 thread3Thread1of1ForFork2_~i~2) ~N~0)), Black: 1245#(< (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0), Black: 1143#(and (<= thread3Thread1of1ForFork2_~i~2 0) (<= 1 thread2Thread1of1ForFork1_~i~1)), Black: 1356#(and (<= (+ thread3Thread1of1ForFork2_~i~2 1) thread2Thread1of1ForFork1_~i~1) (<= thread3Thread1of1ForFork2_~i~2 1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= 2 ~N~0)), Black: 501#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread2Thread1of1ForFork1_~i~1 0)), Black: 500#(= thread2Thread1of1ForFork1_~i~1 0), Black: 502#(and (= ~p~0 0) (= thread3Thread1of1ForFork2_~i~2 0))]) [2025-01-09 16:48:39,429 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2025-01-09 16:48:39,429 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-01-09 16:48:39,429 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-01-09 16:48:39,429 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-01-09 16:48:39,503 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L60-->L60-1: Formula: (= v_thread2Thread1of1ForFork1_~i~1_11 v_~p~0_1) InVars {thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_11} OutVars{thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_11, ~p~0=v_~p~0_1} AuxVars[] AssignedVars[~p~0][91], [Black: 512#(= thread3Thread1of1ForFork2_~i~2 0), Black: 514#(and (= ~p~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), 1390#(<= 0 thread2Thread1of1ForFork1_~i~1), 735#true, Black: 1018#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1))), 39#L69-2true, Black: 1044#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 1016#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1))), Black: 1008#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~p~0 0) (<= ~N~0 1) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 1038#(and (<= ~p~0 0) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2)), Black: 998#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 1042#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~N~0 1) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 739#(<= ~N~0 1), Black: 1030#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 1040#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 1010#(and (= thread3Thread1of1ForFork2_~i~2 0) (= ~p~0 thread2Thread1of1ForFork1_~i~1) (<= ~N~0 1) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 1000#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~N~0 1) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 1024#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1))), Black: 1006#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~p~0 0) (<= ~N~0 1)), Black: 738#(<= thread1Thread1of1ForFork0_~i~0 1), Black: 1014#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1))), Black: 740#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~N~0 1)), Black: 737#(= thread1Thread1of1ForFork0_~i~0 0), Black: 1026#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 1036#(and (<= ~p~0 0) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 811#(and (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2)), Black: 1022#(and (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 1002#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 1028#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~N~0 1)), Black: 1004#(and (<= ~N~0 1) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), 57#(<= 1 ~N~0), Black: 898#(<= ~p~0 thread3Thread1of1ForFork2_~i~2), Black: 51#(and (= ~asum~0 0) (<= (mod ~N~0 4294967296) 0) (= ~csum~0 0)), Black: 50#(and (= ~asum~0 0) (or (and (<= 0 ~N~0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0)) (< (mod ~N~0 4294967296) 1)) (= ~csum~0 0)), 335#true, Black: 184#(and (<= 1 ~N~0) (<= (+ |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 11#L60-1true, 1338#(and (= thread2Thread1of1ForFork1_~i~1 0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 323#(and (<= 1 ~N~0) (<= (+ thread1Thread1of1ForFork0_~i~0 1) ~N~0)), 190#(<= 1 ~N~0), Black: 531#(<= 1 ~N~0), Black: 337#(= ~p~0 0), Black: 338#(and (= ~p~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), 495#(and (<= 1 ~N~0) (<= (+ thread2Thread1of1ForFork1_~i~1 1) ~N~0)), Black: 1360#(and (<= thread3Thread1of1ForFork2_~i~2 thread2Thread1of1ForFork1_~i~1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 1358#(and (<= (+ thread3Thread1of1ForFork2_~i~2 1) thread2Thread1of1ForFork1_~i~1) (<= thread3Thread1of1ForFork2_~i~2 1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= (+ 2 thread3Thread1of1ForFork2_~i~2) ~N~0) (<= 2 ~N~0)), Black: 1340#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork2_~i~2 0) (<= 1 thread2Thread1of1ForFork1_~i~1)), Black: 1076#(= thread2Thread1of1ForFork1_~i~1 0), Black: 1108#(<= 0 thread2Thread1of1ForFork1_~i~1), Black: 1362#(and (<= (+ thread3Thread1of1ForFork2_~i~2 1) thread2Thread1of1ForFork1_~i~1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 724#(= ~p~0 0), Black: 1078#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= 1 thread2Thread1of1ForFork1_~i~1)), Black: 1178#(and (<= thread3Thread1of1ForFork2_~i~2 1) (<= 2 ~N~0)), Black: 725#(and (= ~p~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 1077#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread2Thread1of1ForFork1_~i~1 0)), Black: 1352#(and (<= thread3Thread1of1ForFork2_~i~2 thread2Thread1of1ForFork1_~i~1) (<= thread3Thread1of1ForFork2_~i~2 1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= 2 ~N~0)), Black: 1364#(and (<= thread3Thread1of1ForFork2_~i~2 1) (<= (+ 2 thread3Thread1of1ForFork2_~i~2) ~N~0) (<= 2 ~N~0)), Black: 1354#(and (<= thread3Thread1of1ForFork2_~i~2 thread2Thread1of1ForFork1_~i~1) (<= 0 thread2Thread1of1ForFork1_~i~1)), 8#L50-5true, Black: 1080#(<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0), Black: 1074#true, Black: 1127#(and (<= 0 thread2Thread1of1ForFork1_~i~1) (<= thread3Thread1of1ForFork2_~i~2 0)), Black: 1346#(and (<= 0 thread2Thread1of1ForFork1_~i~1) (<= thread3Thread1of1ForFork2_~i~2 0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 1348#(and (<= thread3Thread1of1ForFork2_~i~2 0) (<= 1 thread2Thread1of1ForFork1_~i~1) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 1366#(and (<= (+ thread3Thread1of1ForFork2_~i~2 1) thread2Thread1of1ForFork1_~i~1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= (+ 2 thread3Thread1of1ForFork2_~i~2) ~N~0)), Black: 1245#(< (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0), Black: 1143#(and (<= thread3Thread1of1ForFork2_~i~2 0) (<= 1 thread2Thread1of1ForFork1_~i~1)), Black: 1356#(and (<= (+ thread3Thread1of1ForFork2_~i~2 1) thread2Thread1of1ForFork1_~i~1) (<= thread3Thread1of1ForFork2_~i~2 1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= 2 ~N~0)), 5#L89true, 516#(and (= ~p~0 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread2Thread1of1ForFork1_~i~1 0)), Black: 501#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread2Thread1of1ForFork1_~i~1 0)), Black: 502#(and (= ~p~0 0) (= thread3Thread1of1ForFork2_~i~2 0))]) [2025-01-09 16:48:39,503 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is not cut-off event [2025-01-09 16:48:39,503 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is not cut-off event [2025-01-09 16:48:39,503 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is not cut-off event [2025-01-09 16:48:39,503 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is not cut-off event [2025-01-09 16:48:39,554 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([435] L69-->L69-2: Formula: (<= v_~p~0_3 v_thread3Thread1of1ForFork2_~i~2_9) InVars {~p~0=v_~p~0_3, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_9} OutVars{~p~0=v_~p~0_3, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_9} AuxVars[] AssignedVars[][58], [323#(and (<= 1 ~N~0) (<= (+ thread1Thread1of1ForFork0_~i~0 1) ~N~0)), Black: 514#(and (= ~p~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), 998#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 1018#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1))), 39#L69-2true, Black: 1044#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 1016#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1))), Black: 1008#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~p~0 0) (<= ~N~0 1) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 1038#(and (<= ~p~0 0) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2)), Black: 1042#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~N~0 1) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 739#(<= ~N~0 1), Black: 1030#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 735#true, Black: 1040#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 1010#(and (= thread3Thread1of1ForFork2_~i~2 0) (= ~p~0 thread2Thread1of1ForFork1_~i~1) (<= ~N~0 1) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 1000#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~N~0 1) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 1024#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1))), Black: 1006#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~p~0 0) (<= ~N~0 1)), Black: 738#(<= thread1Thread1of1ForFork0_~i~0 1), 721#true, Black: 1014#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1))), Black: 740#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~N~0 1)), Black: 737#(= thread1Thread1of1ForFork0_~i~0 0), Black: 1026#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 1036#(and (<= ~p~0 0) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 811#(and (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2)), Black: 1022#(and (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 1002#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 1028#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~N~0 1)), Black: 1004#(and (<= ~N~0 1) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), 57#(<= 1 ~N~0), Black: 898#(<= ~p~0 thread3Thread1of1ForFork2_~i~2), Black: 51#(and (= ~asum~0 0) (<= (mod ~N~0 4294967296) 0) (= ~csum~0 0)), Black: 50#(and (= ~asum~0 0) (or (and (<= 0 ~N~0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0)) (< (mod ~N~0 4294967296) 1)) (= ~csum~0 0)), 1651#(and (<= thread1Thread1of1ForFork0_~i~0 0) (<= 1 thread2Thread1of1ForFork1_~i~1) (<= 2 ~N~0)), 335#true, 512#(= thread3Thread1of1ForFork2_~i~2 0), Black: 184#(and (<= 1 ~N~0) (<= (+ |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 11#L60-1true, 498#true, Black: 531#(<= 1 ~N~0), Black: 337#(= ~p~0 0), Black: 338#(and (= ~p~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), 1346#(and (<= 0 thread2Thread1of1ForFork1_~i~1) (<= thread3Thread1of1ForFork2_~i~2 0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), 495#(and (<= 1 ~N~0) (<= (+ thread2Thread1of1ForFork1_~i~1 1) ~N~0)), Black: 1360#(and (<= thread3Thread1of1ForFork2_~i~2 thread2Thread1of1ForFork1_~i~1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 1358#(and (<= (+ thread3Thread1of1ForFork2_~i~2 1) thread2Thread1of1ForFork1_~i~1) (<= thread3Thread1of1ForFork2_~i~2 1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= (+ 2 thread3Thread1of1ForFork2_~i~2) ~N~0) (<= 2 ~N~0)), Black: 1340#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork2_~i~2 0) (<= 1 thread2Thread1of1ForFork1_~i~1)), Black: 1076#(= thread2Thread1of1ForFork1_~i~1 0), Black: 1108#(<= 0 thread2Thread1of1ForFork1_~i~1), Black: 730#(and (= ~p~0 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread2Thread1of1ForFork1_~i~1 0)), Black: 1362#(and (<= (+ thread3Thread1of1ForFork2_~i~2 1) thread2Thread1of1ForFork1_~i~1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 724#(= ~p~0 0), Black: 1078#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= 1 thread2Thread1of1ForFork1_~i~1)), Black: 1178#(and (<= thread3Thread1of1ForFork2_~i~2 1) (<= 2 ~N~0)), Black: 725#(and (= ~p~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 1077#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread2Thread1of1ForFork1_~i~1 0)), Black: 1352#(and (<= thread3Thread1of1ForFork2_~i~2 thread2Thread1of1ForFork1_~i~1) (<= thread3Thread1of1ForFork2_~i~2 1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= 2 ~N~0)), Black: 1364#(and (<= thread3Thread1of1ForFork2_~i~2 1) (<= (+ 2 thread3Thread1of1ForFork2_~i~2) ~N~0) (<= 2 ~N~0)), Black: 1354#(and (<= thread3Thread1of1ForFork2_~i~2 thread2Thread1of1ForFork1_~i~1) (<= 0 thread2Thread1of1ForFork1_~i~1)), 8#L50-5true, Black: 1080#(<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0), Black: 1074#true, Black: 1127#(and (<= 0 thread2Thread1of1ForFork1_~i~1) (<= thread3Thread1of1ForFork2_~i~2 0)), Black: 1348#(and (<= thread3Thread1of1ForFork2_~i~2 0) (<= 1 thread2Thread1of1ForFork1_~i~1) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 1366#(and (<= (+ thread3Thread1of1ForFork2_~i~2 1) thread2Thread1of1ForFork1_~i~1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= (+ 2 thread3Thread1of1ForFork2_~i~2) ~N~0)), Black: 1245#(< (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0), Black: 1143#(and (<= thread3Thread1of1ForFork2_~i~2 0) (<= 1 thread2Thread1of1ForFork1_~i~1)), Black: 1356#(and (<= (+ thread3Thread1of1ForFork2_~i~2 1) thread2Thread1of1ForFork1_~i~1) (<= thread3Thread1of1ForFork2_~i~2 1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= 2 ~N~0)), 5#L89true, Black: 501#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread2Thread1of1ForFork1_~i~1 0)), Black: 500#(= thread2Thread1of1ForFork1_~i~1 0), Black: 502#(and (= ~p~0 0) (= thread3Thread1of1ForFork2_~i~2 0))]) [2025-01-09 16:48:39,555 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2025-01-09 16:48:39,555 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-01-09 16:48:39,555 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-01-09 16:48:39,555 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-01-09 16:48:40,009 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([435] L69-->L69-2: Formula: (<= v_~p~0_3 v_thread3Thread1of1ForFork2_~i~2_9) InVars {~p~0=v_~p~0_3, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_9} OutVars{~p~0=v_~p~0_3, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_9} AuxVars[] AssignedVars[][77], [Black: 514#(and (= ~p~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 1018#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1))), 39#L69-2true, Black: 1044#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 1016#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1))), Black: 1008#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~p~0 0) (<= ~N~0 1) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 1038#(and (<= ~p~0 0) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2)), Black: 998#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 1042#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~N~0 1) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 739#(<= ~N~0 1), Black: 1030#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 735#true, Black: 1040#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 1010#(and (= thread3Thread1of1ForFork2_~i~2 0) (= ~p~0 thread2Thread1of1ForFork1_~i~1) (<= ~N~0 1) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 1000#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~N~0 1) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 1024#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1))), Black: 1006#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~p~0 0) (<= ~N~0 1)), Black: 738#(<= thread1Thread1of1ForFork0_~i~0 1), 721#true, Black: 1014#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1))), Black: 740#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~N~0 1)), Black: 737#(= thread1Thread1of1ForFork0_~i~0 0), Black: 1026#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 1036#(and (<= ~p~0 0) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 811#(and (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2)), Black: 1022#(and (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 1028#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~N~0 1)), Black: 1004#(and (<= ~N~0 1) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), 57#(<= 1 ~N~0), Black: 898#(<= ~p~0 thread3Thread1of1ForFork2_~i~2), Black: 51#(and (= ~asum~0 0) (<= (mod ~N~0 4294967296) 0) (= ~csum~0 0)), Black: 50#(and (= ~asum~0 0) (or (and (<= 0 ~N~0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0)) (< (mod ~N~0 4294967296) 1)) (= ~csum~0 0)), 335#true, Black: 184#(and (<= 1 ~N~0) (<= (+ |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 11#L60-1true, 512#(= thread3Thread1of1ForFork2_~i~2 0), Black: 323#(and (<= 1 ~N~0) (<= (+ thread1Thread1of1ForFork0_~i~0 1) ~N~0)), 190#(<= 1 ~N~0), 498#true, Black: 531#(<= 1 ~N~0), Black: 337#(= ~p~0 0), Black: 338#(and (= ~p~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), 1346#(and (<= 0 thread2Thread1of1ForFork1_~i~1) (<= thread3Thread1of1ForFork2_~i~2 0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), 495#(and (<= 1 ~N~0) (<= (+ thread2Thread1of1ForFork1_~i~1 1) ~N~0)), Black: 1360#(and (<= thread3Thread1of1ForFork2_~i~2 thread2Thread1of1ForFork1_~i~1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 1358#(and (<= (+ thread3Thread1of1ForFork2_~i~2 1) thread2Thread1of1ForFork1_~i~1) (<= thread3Thread1of1ForFork2_~i~2 1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= (+ 2 thread3Thread1of1ForFork2_~i~2) ~N~0) (<= 2 ~N~0)), 1659#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= 1 thread2Thread1of1ForFork1_~i~1) (<= 2 ~N~0)), Black: 1340#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork2_~i~2 0) (<= 1 thread2Thread1of1ForFork1_~i~1)), Black: 1076#(= thread2Thread1of1ForFork1_~i~1 0), Black: 1108#(<= 0 thread2Thread1of1ForFork1_~i~1), Black: 730#(and (= ~p~0 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread2Thread1of1ForFork1_~i~1 0)), Black: 1362#(and (<= (+ thread3Thread1of1ForFork2_~i~2 1) thread2Thread1of1ForFork1_~i~1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 724#(= ~p~0 0), Black: 1078#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= 1 thread2Thread1of1ForFork1_~i~1)), Black: 1178#(and (<= thread3Thread1of1ForFork2_~i~2 1) (<= 2 ~N~0)), Black: 725#(and (= ~p~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 1077#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread2Thread1of1ForFork1_~i~1 0)), Black: 1352#(and (<= thread3Thread1of1ForFork2_~i~2 thread2Thread1of1ForFork1_~i~1) (<= thread3Thread1of1ForFork2_~i~2 1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= 2 ~N~0)), Black: 1364#(and (<= thread3Thread1of1ForFork2_~i~2 1) (<= (+ 2 thread3Thread1of1ForFork2_~i~2) ~N~0) (<= 2 ~N~0)), Black: 1354#(and (<= thread3Thread1of1ForFork2_~i~2 thread2Thread1of1ForFork1_~i~1) (<= 0 thread2Thread1of1ForFork1_~i~1)), 8#L50-5true, Black: 1080#(<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0), Black: 1074#true, 37#L88-4true, Black: 1127#(and (<= 0 thread2Thread1of1ForFork1_~i~1) (<= thread3Thread1of1ForFork2_~i~2 0)), Black: 1348#(and (<= thread3Thread1of1ForFork2_~i~2 0) (<= 1 thread2Thread1of1ForFork1_~i~1) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 1366#(and (<= (+ thread3Thread1of1ForFork2_~i~2 1) thread2Thread1of1ForFork1_~i~1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= (+ 2 thread3Thread1of1ForFork2_~i~2) ~N~0)), Black: 1245#(< (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0), Black: 1143#(and (<= thread3Thread1of1ForFork2_~i~2 0) (<= 1 thread2Thread1of1ForFork1_~i~1)), Black: 1356#(and (<= (+ thread3Thread1of1ForFork2_~i~2 1) thread2Thread1of1ForFork1_~i~1) (<= thread3Thread1of1ForFork2_~i~2 1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= 2 ~N~0)), 1002#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 501#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread2Thread1of1ForFork1_~i~1 0)), Black: 500#(= thread2Thread1of1ForFork1_~i~1 0), Black: 502#(and (= ~p~0 0) (= thread3Thread1of1ForFork2_~i~2 0))]) [2025-01-09 16:48:40,009 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2025-01-09 16:48:40,009 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2025-01-09 16:48:40,009 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2025-01-09 16:48:40,009 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2025-01-09 16:48:40,180 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([435] L69-->L69-2: Formula: (<= v_~p~0_3 v_thread3Thread1of1ForFork2_~i~2_9) InVars {~p~0=v_~p~0_3, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_9} OutVars{~p~0=v_~p~0_3, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_9} AuxVars[] AssignedVars[][77], [Black: 514#(and (= ~p~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 1018#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1))), 39#L69-2true, Black: 1044#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 1016#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1))), Black: 1008#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~p~0 0) (<= ~N~0 1) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 1038#(and (<= ~p~0 0) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2)), Black: 998#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 1042#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~N~0 1) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 739#(<= ~N~0 1), Black: 1030#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 735#true, Black: 1040#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 1010#(and (= thread3Thread1of1ForFork2_~i~2 0) (= ~p~0 thread2Thread1of1ForFork1_~i~1) (<= ~N~0 1) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 1000#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~N~0 1) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 1024#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1))), Black: 1006#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~p~0 0) (<= ~N~0 1)), Black: 738#(<= thread1Thread1of1ForFork0_~i~0 1), 721#true, Black: 1014#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1))), Black: 740#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~N~0 1)), Black: 737#(= thread1Thread1of1ForFork0_~i~0 0), Black: 1026#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 1036#(and (<= ~p~0 0) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 811#(and (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2)), Black: 1022#(and (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 1028#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~N~0 1)), Black: 1004#(and (<= ~N~0 1) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), 57#(<= 1 ~N~0), Black: 898#(<= ~p~0 thread3Thread1of1ForFork2_~i~2), Black: 51#(and (= ~asum~0 0) (<= (mod ~N~0 4294967296) 0) (= ~csum~0 0)), Black: 50#(and (= ~asum~0 0) (or (and (<= 0 ~N~0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0)) (< (mod ~N~0 4294967296) 1)) (= ~csum~0 0)), 335#true, Black: 184#(and (<= 1 ~N~0) (<= (+ |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 512#(= thread3Thread1of1ForFork2_~i~2 0), 11#L60-1true, Black: 323#(and (<= 1 ~N~0) (<= (+ thread1Thread1of1ForFork0_~i~0 1) ~N~0)), 190#(<= 1 ~N~0), 498#true, Black: 531#(<= 1 ~N~0), Black: 337#(= ~p~0 0), Black: 338#(and (= ~p~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), 1346#(and (<= 0 thread2Thread1of1ForFork1_~i~1) (<= thread3Thread1of1ForFork2_~i~2 0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), 495#(and (<= 1 ~N~0) (<= (+ thread2Thread1of1ForFork1_~i~1 1) ~N~0)), Black: 1360#(and (<= thread3Thread1of1ForFork2_~i~2 thread2Thread1of1ForFork1_~i~1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 1358#(and (<= (+ thread3Thread1of1ForFork2_~i~2 1) thread2Thread1of1ForFork1_~i~1) (<= thread3Thread1of1ForFork2_~i~2 1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= (+ 2 thread3Thread1of1ForFork2_~i~2) ~N~0) (<= 2 ~N~0)), 1659#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= 1 thread2Thread1of1ForFork1_~i~1) (<= 2 ~N~0)), Black: 1340#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork2_~i~2 0) (<= 1 thread2Thread1of1ForFork1_~i~1)), Black: 1076#(= thread2Thread1of1ForFork1_~i~1 0), Black: 1108#(<= 0 thread2Thread1of1ForFork1_~i~1), Black: 730#(and (= ~p~0 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread2Thread1of1ForFork1_~i~1 0)), Black: 1362#(and (<= (+ thread3Thread1of1ForFork2_~i~2 1) thread2Thread1of1ForFork1_~i~1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 1078#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= 1 thread2Thread1of1ForFork1_~i~1)), Black: 724#(= ~p~0 0), Black: 1178#(and (<= thread3Thread1of1ForFork2_~i~2 1) (<= 2 ~N~0)), Black: 725#(and (= ~p~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 1077#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread2Thread1of1ForFork1_~i~1 0)), Black: 1352#(and (<= thread3Thread1of1ForFork2_~i~2 thread2Thread1of1ForFork1_~i~1) (<= thread3Thread1of1ForFork2_~i~2 1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= 2 ~N~0)), Black: 1364#(and (<= thread3Thread1of1ForFork2_~i~2 1) (<= (+ 2 thread3Thread1of1ForFork2_~i~2) ~N~0) (<= 2 ~N~0)), Black: 1354#(and (<= thread3Thread1of1ForFork2_~i~2 thread2Thread1of1ForFork1_~i~1) (<= 0 thread2Thread1of1ForFork1_~i~1)), 8#L50-5true, Black: 1080#(<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0), Black: 1074#true, Black: 1127#(and (<= 0 thread2Thread1of1ForFork1_~i~1) (<= thread3Thread1of1ForFork2_~i~2 0)), Black: 1348#(and (<= thread3Thread1of1ForFork2_~i~2 0) (<= 1 thread2Thread1of1ForFork1_~i~1) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 1366#(and (<= (+ thread3Thread1of1ForFork2_~i~2 1) thread2Thread1of1ForFork1_~i~1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= (+ 2 thread3Thread1of1ForFork2_~i~2) ~N~0)), Black: 1245#(< (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0), Black: 1143#(and (<= thread3Thread1of1ForFork2_~i~2 0) (<= 1 thread2Thread1of1ForFork1_~i~1)), Black: 1356#(and (<= (+ thread3Thread1of1ForFork2_~i~2 1) thread2Thread1of1ForFork1_~i~1) (<= thread3Thread1of1ForFork2_~i~2 1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= 2 ~N~0)), 5#L89true, 1002#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 501#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread2Thread1of1ForFork1_~i~1 0)), Black: 500#(= thread2Thread1of1ForFork1_~i~1 0), Black: 502#(and (= ~p~0 0) (= thread3Thread1of1ForFork2_~i~2 0))]) [2025-01-09 16:48:40,180 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2025-01-09 16:48:40,180 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2025-01-09 16:48:40,180 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2025-01-09 16:48:40,180 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2025-01-09 16:48:41,031 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([435] L69-->L69-2: Formula: (<= v_~p~0_3 v_thread3Thread1of1ForFork2_~i~2_9) InVars {~p~0=v_~p~0_3, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_9} OutVars{~p~0=v_~p~0_3, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_9} AuxVars[] AssignedVars[][77], [Black: 514#(and (= ~p~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 1018#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1))), 39#L69-2true, Black: 1044#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 1016#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1))), Black: 1008#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~p~0 0) (<= ~N~0 1) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 1038#(and (<= ~p~0 0) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2)), Black: 998#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 1042#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~N~0 1) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 739#(<= ~N~0 1), Black: 1030#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 735#true, Black: 1040#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 1010#(and (= thread3Thread1of1ForFork2_~i~2 0) (= ~p~0 thread2Thread1of1ForFork1_~i~1) (<= ~N~0 1) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 1000#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~N~0 1) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 1024#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1))), Black: 1006#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~p~0 0) (<= ~N~0 1)), Black: 738#(<= thread1Thread1of1ForFork0_~i~0 1), 721#true, Black: 1014#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1))), Black: 740#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~N~0 1)), Black: 737#(= thread1Thread1of1ForFork0_~i~0 0), Black: 1026#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 1036#(and (<= ~p~0 0) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 811#(and (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2)), Black: 1022#(and (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 1028#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~N~0 1)), Black: 1004#(and (<= ~N~0 1) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), 57#(<= 1 ~N~0), Black: 898#(<= ~p~0 thread3Thread1of1ForFork2_~i~2), Black: 51#(and (= ~asum~0 0) (<= (mod ~N~0 4294967296) 0) (= ~csum~0 0)), Black: 50#(and (= ~asum~0 0) (or (and (<= 0 ~N~0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0)) (< (mod ~N~0 4294967296) 1)) (= ~csum~0 0)), 335#true, 11#L60-1true, Black: 184#(and (<= 1 ~N~0) (<= (+ |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 512#(= thread3Thread1of1ForFork2_~i~2 0), Black: 323#(and (<= 1 ~N~0) (<= (+ thread1Thread1of1ForFork0_~i~0 1) ~N~0)), 190#(<= 1 ~N~0), 498#true, Black: 531#(<= 1 ~N~0), Black: 337#(= ~p~0 0), Black: 338#(and (= ~p~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), 1346#(and (<= 0 thread2Thread1of1ForFork1_~i~1) (<= thread3Thread1of1ForFork2_~i~2 0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), 495#(and (<= 1 ~N~0) (<= (+ thread2Thread1of1ForFork1_~i~1 1) ~N~0)), Black: 1360#(and (<= thread3Thread1of1ForFork2_~i~2 thread2Thread1of1ForFork1_~i~1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 1358#(and (<= (+ thread3Thread1of1ForFork2_~i~2 1) thread2Thread1of1ForFork1_~i~1) (<= thread3Thread1of1ForFork2_~i~2 1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= (+ 2 thread3Thread1of1ForFork2_~i~2) ~N~0) (<= 2 ~N~0)), 1659#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= 1 thread2Thread1of1ForFork1_~i~1) (<= 2 ~N~0)), Black: 1340#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork2_~i~2 0) (<= 1 thread2Thread1of1ForFork1_~i~1)), Black: 1076#(= thread2Thread1of1ForFork1_~i~1 0), Black: 1108#(<= 0 thread2Thread1of1ForFork1_~i~1), Black: 730#(and (= ~p~0 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread2Thread1of1ForFork1_~i~1 0)), Black: 1362#(and (<= (+ thread3Thread1of1ForFork2_~i~2 1) thread2Thread1of1ForFork1_~i~1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 1078#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= 1 thread2Thread1of1ForFork1_~i~1)), Black: 724#(= ~p~0 0), Black: 725#(and (= ~p~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 1178#(and (<= thread3Thread1of1ForFork2_~i~2 1) (<= 2 ~N~0)), Black: 1077#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread2Thread1of1ForFork1_~i~1 0)), Black: 1352#(and (<= thread3Thread1of1ForFork2_~i~2 thread2Thread1of1ForFork1_~i~1) (<= thread3Thread1of1ForFork2_~i~2 1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= 2 ~N~0)), Black: 1364#(and (<= thread3Thread1of1ForFork2_~i~2 1) (<= (+ 2 thread3Thread1of1ForFork2_~i~2) ~N~0) (<= 2 ~N~0)), Black: 1354#(and (<= thread3Thread1of1ForFork2_~i~2 thread2Thread1of1ForFork1_~i~1) (<= 0 thread2Thread1of1ForFork1_~i~1)), 8#L50-5true, Black: 1080#(<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0), Black: 1074#true, 37#L88-4true, Black: 1127#(and (<= 0 thread2Thread1of1ForFork1_~i~1) (<= thread3Thread1of1ForFork2_~i~2 0)), Black: 1348#(and (<= thread3Thread1of1ForFork2_~i~2 0) (<= 1 thread2Thread1of1ForFork1_~i~1) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 1366#(and (<= (+ thread3Thread1of1ForFork2_~i~2 1) thread2Thread1of1ForFork1_~i~1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= (+ 2 thread3Thread1of1ForFork2_~i~2) ~N~0)), Black: 1245#(< (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0), Black: 1143#(and (<= thread3Thread1of1ForFork2_~i~2 0) (<= 1 thread2Thread1of1ForFork1_~i~1)), Black: 1356#(and (<= (+ thread3Thread1of1ForFork2_~i~2 1) thread2Thread1of1ForFork1_~i~1) (<= thread3Thread1of1ForFork2_~i~2 1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= 2 ~N~0)), 1002#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 501#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread2Thread1of1ForFork1_~i~1 0)), Black: 500#(= thread2Thread1of1ForFork1_~i~1 0), Black: 502#(and (= ~p~0 0) (= thread3Thread1of1ForFork2_~i~2 0))]) [2025-01-09 16:48:41,031 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2025-01-09 16:48:41,031 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2025-01-09 16:48:41,031 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2025-01-09 16:48:41,031 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2025-01-09 16:48:41,031 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2025-01-09 16:48:41,451 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([435] L69-->L69-2: Formula: (<= v_~p~0_3 v_thread3Thread1of1ForFork2_~i~2_9) InVars {~p~0=v_~p~0_3, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_9} OutVars{~p~0=v_~p~0_3, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_9} AuxVars[] AssignedVars[][77], [Black: 514#(and (= ~p~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 1018#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1))), 39#L69-2true, Black: 1044#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 1016#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1))), Black: 1008#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~p~0 0) (<= ~N~0 1) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 1038#(and (<= ~p~0 0) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2)), Black: 998#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 1042#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~N~0 1) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 739#(<= ~N~0 1), Black: 1030#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 735#true, Black: 1040#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 1010#(and (= thread3Thread1of1ForFork2_~i~2 0) (= ~p~0 thread2Thread1of1ForFork1_~i~1) (<= ~N~0 1) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 1000#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~N~0 1) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 1024#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1))), Black: 1006#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~p~0 0) (<= ~N~0 1)), 721#true, Black: 738#(<= thread1Thread1of1ForFork0_~i~0 1), Black: 1014#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1))), Black: 740#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~N~0 1)), Black: 737#(= thread1Thread1of1ForFork0_~i~0 0), Black: 1026#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 1036#(and (<= ~p~0 0) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 811#(and (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2)), Black: 1022#(and (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 1028#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~N~0 1)), 57#(<= 1 ~N~0), Black: 1004#(and (<= ~N~0 1) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 898#(<= ~p~0 thread3Thread1of1ForFork2_~i~2), Black: 51#(and (= ~asum~0 0) (<= (mod ~N~0 4294967296) 0) (= ~csum~0 0)), Black: 50#(and (= ~asum~0 0) (or (and (<= 0 ~N~0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0)) (< (mod ~N~0 4294967296) 1)) (= ~csum~0 0)), 335#true, 512#(= thread3Thread1of1ForFork2_~i~2 0), Black: 184#(and (<= 1 ~N~0) (<= (+ |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 11#L60-1true, Black: 323#(and (<= 1 ~N~0) (<= (+ thread1Thread1of1ForFork0_~i~0 1) ~N~0)), 190#(<= 1 ~N~0), 498#true, Black: 531#(<= 1 ~N~0), Black: 337#(= ~p~0 0), Black: 338#(and (= ~p~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), 1346#(and (<= 0 thread2Thread1of1ForFork1_~i~1) (<= thread3Thread1of1ForFork2_~i~2 0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), 495#(and (<= 1 ~N~0) (<= (+ thread2Thread1of1ForFork1_~i~1 1) ~N~0)), Black: 1360#(and (<= thread3Thread1of1ForFork2_~i~2 thread2Thread1of1ForFork1_~i~1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 1358#(and (<= (+ thread3Thread1of1ForFork2_~i~2 1) thread2Thread1of1ForFork1_~i~1) (<= thread3Thread1of1ForFork2_~i~2 1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= (+ 2 thread3Thread1of1ForFork2_~i~2) ~N~0) (<= 2 ~N~0)), 1659#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= 1 thread2Thread1of1ForFork1_~i~1) (<= 2 ~N~0)), Black: 1340#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork2_~i~2 0) (<= 1 thread2Thread1of1ForFork1_~i~1)), Black: 1076#(= thread2Thread1of1ForFork1_~i~1 0), Black: 1108#(<= 0 thread2Thread1of1ForFork1_~i~1), Black: 1362#(and (<= (+ thread3Thread1of1ForFork2_~i~2 1) thread2Thread1of1ForFork1_~i~1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 730#(and (= ~p~0 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread2Thread1of1ForFork1_~i~1 0)), Black: 724#(= ~p~0 0), Black: 1078#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= 1 thread2Thread1of1ForFork1_~i~1)), Black: 725#(and (= ~p~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 1178#(and (<= thread3Thread1of1ForFork2_~i~2 1) (<= 2 ~N~0)), Black: 1077#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread2Thread1of1ForFork1_~i~1 0)), Black: 1352#(and (<= thread3Thread1of1ForFork2_~i~2 thread2Thread1of1ForFork1_~i~1) (<= thread3Thread1of1ForFork2_~i~2 1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= 2 ~N~0)), Black: 1364#(and (<= thread3Thread1of1ForFork2_~i~2 1) (<= (+ 2 thread3Thread1of1ForFork2_~i~2) ~N~0) (<= 2 ~N~0)), Black: 1354#(and (<= thread3Thread1of1ForFork2_~i~2 thread2Thread1of1ForFork1_~i~1) (<= 0 thread2Thread1of1ForFork1_~i~1)), 8#L50-5true, Black: 1080#(<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0), Black: 1074#true, Black: 1127#(and (<= 0 thread2Thread1of1ForFork1_~i~1) (<= thread3Thread1of1ForFork2_~i~2 0)), Black: 1348#(and (<= thread3Thread1of1ForFork2_~i~2 0) (<= 1 thread2Thread1of1ForFork1_~i~1) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 1366#(and (<= (+ thread3Thread1of1ForFork2_~i~2 1) thread2Thread1of1ForFork1_~i~1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= (+ 2 thread3Thread1of1ForFork2_~i~2) ~N~0)), Black: 1245#(< (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0), Black: 1143#(and (<= thread3Thread1of1ForFork2_~i~2 0) (<= 1 thread2Thread1of1ForFork1_~i~1)), Black: 1356#(and (<= (+ thread3Thread1of1ForFork2_~i~2 1) thread2Thread1of1ForFork1_~i~1) (<= thread3Thread1of1ForFork2_~i~2 1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= 2 ~N~0)), 5#L89true, 1002#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 501#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread2Thread1of1ForFork1_~i~1 0)), Black: 500#(= thread2Thread1of1ForFork1_~i~1 0), Black: 502#(and (= ~p~0 0) (= thread3Thread1of1ForFork2_~i~2 0))]) [2025-01-09 16:48:41,451 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2025-01-09 16:48:41,451 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2025-01-09 16:48:41,451 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2025-01-09 16:48:41,451 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2025-01-09 16:48:41,451 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2025-01-09 16:48:44,258 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([435] L69-->L69-2: Formula: (<= v_~p~0_3 v_thread3Thread1of1ForFork2_~i~2_9) InVars {~p~0=v_~p~0_3, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_9} OutVars{~p~0=v_~p~0_3, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_9} AuxVars[] AssignedVars[][77], [Black: 514#(and (= ~p~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 1018#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1))), 39#L69-2true, Black: 1044#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 1016#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1))), Black: 1008#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~p~0 0) (<= ~N~0 1) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 1038#(and (<= ~p~0 0) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2)), Black: 998#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 1042#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~N~0 1) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 739#(<= ~N~0 1), Black: 1030#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 735#true, Black: 1040#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 1010#(and (= thread3Thread1of1ForFork2_~i~2 0) (= ~p~0 thread2Thread1of1ForFork1_~i~1) (<= ~N~0 1) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 1000#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~N~0 1) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 1024#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1))), Black: 1006#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~p~0 0) (<= ~N~0 1)), 721#true, Black: 738#(<= thread1Thread1of1ForFork0_~i~0 1), Black: 1014#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1))), Black: 740#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~N~0 1)), Black: 737#(= thread1Thread1of1ForFork0_~i~0 0), Black: 1026#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 1036#(and (<= ~p~0 0) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 811#(and (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2)), Black: 1022#(and (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 1028#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~N~0 1)), Black: 1004#(and (<= ~N~0 1) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), 57#(<= 1 ~N~0), Black: 898#(<= ~p~0 thread3Thread1of1ForFork2_~i~2), Black: 51#(and (= ~asum~0 0) (<= (mod ~N~0 4294967296) 0) (= ~csum~0 0)), Black: 50#(and (= ~asum~0 0) (or (and (<= 0 ~N~0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0)) (< (mod ~N~0 4294967296) 1)) (= ~csum~0 0)), 335#true, 11#L60-1true, Black: 184#(and (<= 1 ~N~0) (<= (+ |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 512#(= thread3Thread1of1ForFork2_~i~2 0), Black: 323#(and (<= 1 ~N~0) (<= (+ thread1Thread1of1ForFork0_~i~0 1) ~N~0)), 190#(<= 1 ~N~0), 498#true, Black: 531#(<= 1 ~N~0), Black: 337#(= ~p~0 0), Black: 338#(and (= ~p~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), 495#(and (<= 1 ~N~0) (<= (+ thread2Thread1of1ForFork1_~i~1 1) ~N~0)), Black: 1360#(and (<= thread3Thread1of1ForFork2_~i~2 thread2Thread1of1ForFork1_~i~1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), 1659#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= 1 thread2Thread1of1ForFork1_~i~1) (<= 2 ~N~0)), Black: 1358#(and (<= (+ thread3Thread1of1ForFork2_~i~2 1) thread2Thread1of1ForFork1_~i~1) (<= thread3Thread1of1ForFork2_~i~2 1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= (+ 2 thread3Thread1of1ForFork2_~i~2) ~N~0) (<= 2 ~N~0)), Black: 1340#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork2_~i~2 0) (<= 1 thread2Thread1of1ForFork1_~i~1)), Black: 1076#(= thread2Thread1of1ForFork1_~i~1 0), Black: 1108#(<= 0 thread2Thread1of1ForFork1_~i~1), Black: 1362#(and (<= (+ thread3Thread1of1ForFork2_~i~2 1) thread2Thread1of1ForFork1_~i~1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 730#(and (= ~p~0 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread2Thread1of1ForFork1_~i~1 0)), Black: 1078#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= 1 thread2Thread1of1ForFork1_~i~1)), Black: 724#(= ~p~0 0), Black: 1178#(and (<= thread3Thread1of1ForFork2_~i~2 1) (<= 2 ~N~0)), Black: 725#(and (= ~p~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 1077#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread2Thread1of1ForFork1_~i~1 0)), Black: 1352#(and (<= thread3Thread1of1ForFork2_~i~2 thread2Thread1of1ForFork1_~i~1) (<= thread3Thread1of1ForFork2_~i~2 1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= 2 ~N~0)), Black: 1364#(and (<= thread3Thread1of1ForFork2_~i~2 1) (<= (+ 2 thread3Thread1of1ForFork2_~i~2) ~N~0) (<= 2 ~N~0)), Black: 1354#(and (<= thread3Thread1of1ForFork2_~i~2 thread2Thread1of1ForFork1_~i~1) (<= 0 thread2Thread1of1ForFork1_~i~1)), 8#L50-5true, Black: 1080#(<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0), Black: 1074#true, 37#L88-4true, Black: 1127#(and (<= 0 thread2Thread1of1ForFork1_~i~1) (<= thread3Thread1of1ForFork2_~i~2 0)), Black: 1346#(and (<= 0 thread2Thread1of1ForFork1_~i~1) (<= thread3Thread1of1ForFork2_~i~2 0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 1348#(and (<= thread3Thread1of1ForFork2_~i~2 0) (<= 1 thread2Thread1of1ForFork1_~i~1) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 1366#(and (<= (+ thread3Thread1of1ForFork2_~i~2 1) thread2Thread1of1ForFork1_~i~1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= (+ 2 thread3Thread1of1ForFork2_~i~2) ~N~0)), Black: 1245#(< (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0), Black: 1143#(and (<= thread3Thread1of1ForFork2_~i~2 0) (<= 1 thread2Thread1of1ForFork1_~i~1)), Black: 1356#(and (<= (+ thread3Thread1of1ForFork2_~i~2 1) thread2Thread1of1ForFork1_~i~1) (<= thread3Thread1of1ForFork2_~i~2 1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= 2 ~N~0)), 1002#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 501#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread2Thread1of1ForFork1_~i~1 0)), Black: 500#(= thread2Thread1of1ForFork1_~i~1 0), Black: 502#(and (= ~p~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), 1350#(and (<= thread3Thread1of1ForFork2_~i~2 0) (<= 1 thread2Thread1of1ForFork1_~i~1) (<= 2 ~N~0))]) [2025-01-09 16:48:44,258 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2025-01-09 16:48:44,258 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2025-01-09 16:48:44,258 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-01-09 16:48:44,258 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2025-01-09 16:48:44,258 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([430] L60-1-->L58-4: Formula: (= v_thread2Thread1of1ForFork1_~i~1_14 (+ v_thread2Thread1of1ForFork1_~i~1_13 1)) InVars {thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_13} OutVars{thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_14, thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~i~1, thread2Thread1of1ForFork1_#t~post4][218], [323#(and (<= 1 ~N~0) (<= (+ thread1Thread1of1ForFork0_~i~0 1) ~N~0)), Black: 514#(and (= ~p~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), 15#L69true, Black: 1018#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1))), Black: 1044#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 1016#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1))), Black: 1008#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~p~0 0) (<= ~N~0 1) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 1038#(and (<= ~p~0 0) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2)), Black: 998#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 1042#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~N~0 1) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 739#(<= ~N~0 1), Black: 1030#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 735#true, Black: 1040#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 1010#(and (= thread3Thread1of1ForFork2_~i~2 0) (= ~p~0 thread2Thread1of1ForFork1_~i~1) (<= ~N~0 1) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 1000#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~N~0 1) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 1024#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1))), Black: 1006#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~p~0 0) (<= ~N~0 1)), 721#true, Black: 1014#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1))), Black: 740#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~N~0 1)), Black: 737#(= thread1Thread1of1ForFork0_~i~0 0), Black: 1026#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 1036#(and (<= ~p~0 0) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 811#(and (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2)), Black: 1022#(and (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 1002#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 1028#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~N~0 1)), Black: 1004#(and (<= ~N~0 1) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), 57#(<= 1 ~N~0), Black: 898#(<= ~p~0 thread3Thread1of1ForFork2_~i~2), Black: 51#(and (= ~asum~0 0) (<= (mod ~N~0 4294967296) 0) (= ~csum~0 0)), Black: 50#(and (= ~asum~0 0) (or (and (<= 0 ~N~0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0)) (< (mod ~N~0 4294967296) 1)) (= ~csum~0 0)), 12#L51true, 335#true, Black: 184#(and (<= 1 ~N~0) (<= (+ |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 512#(= thread3Thread1of1ForFork2_~i~2 0), 498#true, Black: 531#(<= 1 ~N~0), Black: 337#(= ~p~0 0), Black: 338#(and (= ~p~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 1360#(and (<= thread3Thread1of1ForFork2_~i~2 thread2Thread1of1ForFork1_~i~1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 1358#(and (<= (+ thread3Thread1of1ForFork2_~i~2 1) thread2Thread1of1ForFork1_~i~1) (<= thread3Thread1of1ForFork2_~i~2 1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= (+ 2 thread3Thread1of1ForFork2_~i~2) ~N~0) (<= 2 ~N~0)), 1659#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= 1 thread2Thread1of1ForFork1_~i~1) (<= 2 ~N~0)), Black: 1340#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork2_~i~2 0) (<= 1 thread2Thread1of1ForFork1_~i~1)), Black: 1076#(= thread2Thread1of1ForFork1_~i~1 0), Black: 1108#(<= 0 thread2Thread1of1ForFork1_~i~1), Black: 1362#(and (<= (+ thread3Thread1of1ForFork2_~i~2 1) thread2Thread1of1ForFork1_~i~1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 730#(and (= ~p~0 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread2Thread1of1ForFork1_~i~1 0)), Black: 1078#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= 1 thread2Thread1of1ForFork1_~i~1)), Black: 724#(= ~p~0 0), Black: 1178#(and (<= thread3Thread1of1ForFork2_~i~2 1) (<= 2 ~N~0)), Black: 725#(and (= ~p~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 1077#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread2Thread1of1ForFork1_~i~1 0)), Black: 1352#(and (<= thread3Thread1of1ForFork2_~i~2 thread2Thread1of1ForFork1_~i~1) (<= thread3Thread1of1ForFork2_~i~2 1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= 2 ~N~0)), Black: 1364#(and (<= thread3Thread1of1ForFork2_~i~2 1) (<= (+ 2 thread3Thread1of1ForFork2_~i~2) ~N~0) (<= 2 ~N~0)), Black: 1354#(and (<= thread3Thread1of1ForFork2_~i~2 thread2Thread1of1ForFork1_~i~1) (<= 0 thread2Thread1of1ForFork1_~i~1)), Black: 1080#(<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0), Black: 1074#true, 738#(<= thread1Thread1of1ForFork0_~i~0 1), 37#L88-4true, Black: 1127#(and (<= 0 thread2Thread1of1ForFork1_~i~1) (<= thread3Thread1of1ForFork2_~i~2 0)), Black: 1346#(and (<= 0 thread2Thread1of1ForFork1_~i~1) (<= thread3Thread1of1ForFork2_~i~2 0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 1348#(and (<= thread3Thread1of1ForFork2_~i~2 0) (<= 1 thread2Thread1of1ForFork1_~i~1) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 1366#(and (<= (+ thread3Thread1of1ForFork2_~i~2 1) thread2Thread1of1ForFork1_~i~1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= (+ 2 thread3Thread1of1ForFork2_~i~2) ~N~0)), Black: 1245#(< (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0), Black: 1143#(and (<= thread3Thread1of1ForFork2_~i~2 0) (<= 1 thread2Thread1of1ForFork1_~i~1)), Black: 1356#(and (<= (+ thread3Thread1of1ForFork2_~i~2 1) thread2Thread1of1ForFork1_~i~1) (<= thread3Thread1of1ForFork2_~i~2 1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= 2 ~N~0)), 344#(<= 1 ~N~0), Black: 495#(and (<= 1 ~N~0) (<= (+ thread2Thread1of1ForFork1_~i~1 1) ~N~0)), 35#L58-4true, Black: 501#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread2Thread1of1ForFork1_~i~1 0)), Black: 500#(= thread2Thread1of1ForFork1_~i~1 0), Black: 502#(and (= ~p~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), 1350#(and (<= thread3Thread1of1ForFork2_~i~2 0) (<= 1 thread2Thread1of1ForFork1_~i~1) (<= 2 ~N~0))]) [2025-01-09 16:48:44,258 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is cut-off event [2025-01-09 16:48:44,258 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-01-09 16:48:44,258 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-01-09 16:48:44,258 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-01-09 16:48:44,258 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([430] L60-1-->L58-4: Formula: (= v_thread2Thread1of1ForFork1_~i~1_14 (+ v_thread2Thread1of1ForFork1_~i~1_13 1)) InVars {thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_13} OutVars{thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_14, thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~i~1, thread2Thread1of1ForFork1_#t~post4][218], [Black: 514#(and (= ~p~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), 15#L69true, Black: 1018#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1))), Black: 1044#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 1016#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1))), Black: 1008#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~p~0 0) (<= ~N~0 1) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 1038#(and (<= ~p~0 0) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2)), Black: 998#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 1042#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~N~0 1) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 739#(<= ~N~0 1), Black: 1030#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 735#true, Black: 1040#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 1010#(and (= thread3Thread1of1ForFork2_~i~2 0) (= ~p~0 thread2Thread1of1ForFork1_~i~1) (<= ~N~0 1) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 1000#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~N~0 1) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 1024#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1))), Black: 1006#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~p~0 0) (<= ~N~0 1)), 721#true, Black: 1014#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1))), Black: 740#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~N~0 1)), Black: 737#(= thread1Thread1of1ForFork0_~i~0 0), Black: 1026#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 1036#(and (<= ~p~0 0) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 811#(and (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2)), Black: 1022#(and (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 1002#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 1028#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~N~0 1)), Black: 1004#(and (<= ~N~0 1) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), 57#(<= 1 ~N~0), Black: 898#(<= ~p~0 thread3Thread1of1ForFork2_~i~2), Black: 51#(and (= ~asum~0 0) (<= (mod ~N~0 4294967296) 0) (= ~csum~0 0)), Black: 50#(and (= ~asum~0 0) (or (and (<= 0 ~N~0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0)) (< (mod ~N~0 4294967296) 1)) (= ~csum~0 0)), 335#true, 512#(= thread3Thread1of1ForFork2_~i~2 0), Black: 184#(and (<= 1 ~N~0) (<= (+ |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 323#(and (<= 1 ~N~0) (<= (+ thread1Thread1of1ForFork0_~i~0 1) ~N~0)), 190#(<= 1 ~N~0), 498#true, Black: 531#(<= 1 ~N~0), Black: 337#(= ~p~0 0), Black: 338#(and (= ~p~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 1360#(and (<= thread3Thread1of1ForFork2_~i~2 thread2Thread1of1ForFork1_~i~1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), 1659#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= 1 thread2Thread1of1ForFork1_~i~1) (<= 2 ~N~0)), Black: 1358#(and (<= (+ thread3Thread1of1ForFork2_~i~2 1) thread2Thread1of1ForFork1_~i~1) (<= thread3Thread1of1ForFork2_~i~2 1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= (+ 2 thread3Thread1of1ForFork2_~i~2) ~N~0) (<= 2 ~N~0)), Black: 1340#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork2_~i~2 0) (<= 1 thread2Thread1of1ForFork1_~i~1)), Black: 1076#(= thread2Thread1of1ForFork1_~i~1 0), Black: 1108#(<= 0 thread2Thread1of1ForFork1_~i~1), Black: 1362#(and (<= (+ thread3Thread1of1ForFork2_~i~2 1) thread2Thread1of1ForFork1_~i~1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 730#(and (= ~p~0 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread2Thread1of1ForFork1_~i~1 0)), Black: 724#(= ~p~0 0), Black: 1078#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= 1 thread2Thread1of1ForFork1_~i~1)), Black: 1178#(and (<= thread3Thread1of1ForFork2_~i~2 1) (<= 2 ~N~0)), Black: 725#(and (= ~p~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 1077#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread2Thread1of1ForFork1_~i~1 0)), Black: 1352#(and (<= thread3Thread1of1ForFork2_~i~2 thread2Thread1of1ForFork1_~i~1) (<= thread3Thread1of1ForFork2_~i~2 1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= 2 ~N~0)), Black: 1364#(and (<= thread3Thread1of1ForFork2_~i~2 1) (<= (+ 2 thread3Thread1of1ForFork2_~i~2) ~N~0) (<= 2 ~N~0)), Black: 1354#(and (<= thread3Thread1of1ForFork2_~i~2 thread2Thread1of1ForFork1_~i~1) (<= 0 thread2Thread1of1ForFork1_~i~1)), 8#L50-5true, Black: 1080#(<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0), 37#L88-4true, Black: 1074#true, 738#(<= thread1Thread1of1ForFork0_~i~0 1), Black: 1127#(and (<= 0 thread2Thread1of1ForFork1_~i~1) (<= thread3Thread1of1ForFork2_~i~2 0)), Black: 1346#(and (<= 0 thread2Thread1of1ForFork1_~i~1) (<= thread3Thread1of1ForFork2_~i~2 0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 1348#(and (<= thread3Thread1of1ForFork2_~i~2 0) (<= 1 thread2Thread1of1ForFork1_~i~1) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 1366#(and (<= (+ thread3Thread1of1ForFork2_~i~2 1) thread2Thread1of1ForFork1_~i~1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= (+ 2 thread3Thread1of1ForFork2_~i~2) ~N~0)), Black: 1245#(< (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0), Black: 1143#(and (<= thread3Thread1of1ForFork2_~i~2 0) (<= 1 thread2Thread1of1ForFork1_~i~1)), Black: 1356#(and (<= (+ thread3Thread1of1ForFork2_~i~2 1) thread2Thread1of1ForFork1_~i~1) (<= thread3Thread1of1ForFork2_~i~2 1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= 2 ~N~0)), 344#(<= 1 ~N~0), Black: 495#(and (<= 1 ~N~0) (<= (+ thread2Thread1of1ForFork1_~i~1 1) ~N~0)), 35#L58-4true, Black: 501#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread2Thread1of1ForFork1_~i~1 0)), Black: 500#(= thread2Thread1of1ForFork1_~i~1 0), Black: 502#(and (= ~p~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), 1350#(and (<= thread3Thread1of1ForFork2_~i~2 0) (<= 1 thread2Thread1of1ForFork1_~i~1) (<= 2 ~N~0))]) [2025-01-09 16:48:44,259 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2025-01-09 16:48:44,259 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2025-01-09 16:48:44,259 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2025-01-09 16:48:44,259 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-01-09 16:48:44,262 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([430] L60-1-->L58-4: Formula: (= v_thread2Thread1of1ForFork1_~i~1_14 (+ v_thread2Thread1of1ForFork1_~i~1_13 1)) InVars {thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_13} OutVars{thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_14, thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~i~1, thread2Thread1of1ForFork1_#t~post4][218], [323#(and (<= 1 ~N~0) (<= (+ thread1Thread1of1ForFork0_~i~0 1) ~N~0)), Black: 514#(and (= ~p~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), 15#L69true, Black: 1018#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1))), Black: 1044#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 1016#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1))), Black: 1008#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~p~0 0) (<= ~N~0 1) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 1038#(and (<= ~p~0 0) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2)), Black: 998#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 1042#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~N~0 1) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 739#(<= ~N~0 1), Black: 1030#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 735#true, Black: 1040#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 1010#(and (= thread3Thread1of1ForFork2_~i~2 0) (= ~p~0 thread2Thread1of1ForFork1_~i~1) (<= ~N~0 1) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 1000#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~N~0 1) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 1024#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1))), Black: 1006#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~p~0 0) (<= ~N~0 1)), 721#true, Black: 1014#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1))), Black: 740#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~N~0 1)), Black: 737#(= thread1Thread1of1ForFork0_~i~0 0), Black: 1026#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 1036#(and (<= ~p~0 0) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 811#(and (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2)), Black: 1022#(and (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 1002#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 1028#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~N~0 1)), Black: 1004#(and (<= ~N~0 1) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), 57#(<= 1 ~N~0), Black: 898#(<= ~p~0 thread3Thread1of1ForFork2_~i~2), Black: 51#(and (= ~asum~0 0) (<= (mod ~N~0 4294967296) 0) (= ~csum~0 0)), Black: 50#(and (= ~asum~0 0) (or (and (<= 0 ~N~0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0)) (< (mod ~N~0 4294967296) 1)) (= ~csum~0 0)), 335#true, Black: 184#(and (<= 1 ~N~0) (<= (+ |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 512#(= thread3Thread1of1ForFork2_~i~2 0), 498#true, Black: 531#(<= 1 ~N~0), Black: 337#(= ~p~0 0), Black: 338#(and (= ~p~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 1360#(and (<= thread3Thread1of1ForFork2_~i~2 thread2Thread1of1ForFork1_~i~1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 1358#(and (<= (+ thread3Thread1of1ForFork2_~i~2 1) thread2Thread1of1ForFork1_~i~1) (<= thread3Thread1of1ForFork2_~i~2 1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= (+ 2 thread3Thread1of1ForFork2_~i~2) ~N~0) (<= 2 ~N~0)), 1659#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= 1 thread2Thread1of1ForFork1_~i~1) (<= 2 ~N~0)), Black: 1340#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork2_~i~2 0) (<= 1 thread2Thread1of1ForFork1_~i~1)), Black: 1076#(= thread2Thread1of1ForFork1_~i~1 0), Black: 1108#(<= 0 thread2Thread1of1ForFork1_~i~1), Black: 1362#(and (<= (+ thread3Thread1of1ForFork2_~i~2 1) thread2Thread1of1ForFork1_~i~1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 730#(and (= ~p~0 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread2Thread1of1ForFork1_~i~1 0)), Black: 1078#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= 1 thread2Thread1of1ForFork1_~i~1)), Black: 724#(= ~p~0 0), Black: 1178#(and (<= thread3Thread1of1ForFork2_~i~2 1) (<= 2 ~N~0)), Black: 725#(and (= ~p~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 1077#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread2Thread1of1ForFork1_~i~1 0)), Black: 1352#(and (<= thread3Thread1of1ForFork2_~i~2 thread2Thread1of1ForFork1_~i~1) (<= thread3Thread1of1ForFork2_~i~2 1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= 2 ~N~0)), Black: 1364#(and (<= thread3Thread1of1ForFork2_~i~2 1) (<= (+ 2 thread3Thread1of1ForFork2_~i~2) ~N~0) (<= 2 ~N~0)), Black: 1354#(and (<= thread3Thread1of1ForFork2_~i~2 thread2Thread1of1ForFork1_~i~1) (<= 0 thread2Thread1of1ForFork1_~i~1)), Black: 1080#(<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0), Black: 1074#true, 738#(<= thread1Thread1of1ForFork0_~i~0 1), 37#L88-4true, Black: 1127#(and (<= 0 thread2Thread1of1ForFork1_~i~1) (<= thread3Thread1of1ForFork2_~i~2 0)), Black: 1346#(and (<= 0 thread2Thread1of1ForFork1_~i~1) (<= thread3Thread1of1ForFork2_~i~2 0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 1348#(and (<= thread3Thread1of1ForFork2_~i~2 0) (<= 1 thread2Thread1of1ForFork1_~i~1) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 1366#(and (<= (+ thread3Thread1of1ForFork2_~i~2 1) thread2Thread1of1ForFork1_~i~1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= (+ 2 thread3Thread1of1ForFork2_~i~2) ~N~0)), Black: 1245#(< (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0), Black: 1143#(and (<= thread3Thread1of1ForFork2_~i~2 0) (<= 1 thread2Thread1of1ForFork1_~i~1)), Black: 1356#(and (<= (+ thread3Thread1of1ForFork2_~i~2 1) thread2Thread1of1ForFork1_~i~1) (<= thread3Thread1of1ForFork2_~i~2 1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= 2 ~N~0)), 344#(<= 1 ~N~0), Black: 495#(and (<= 1 ~N~0) (<= (+ thread2Thread1of1ForFork1_~i~1 1) ~N~0)), 35#L58-4true, Black: 501#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread2Thread1of1ForFork1_~i~1 0)), 13#L51-3true, Black: 500#(= thread2Thread1of1ForFork1_~i~1 0), Black: 502#(and (= ~p~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), 1350#(and (<= thread3Thread1of1ForFork2_~i~2 0) (<= 1 thread2Thread1of1ForFork1_~i~1) (<= 2 ~N~0))]) [2025-01-09 16:48:44,262 INFO L294 olderBase$Statistics]: this new event has 45 ancestors and is cut-off event [2025-01-09 16:48:44,262 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2025-01-09 16:48:44,262 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-01-09 16:48:44,262 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-01-09 16:48:44,418 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([435] L69-->L69-2: Formula: (<= v_~p~0_3 v_thread3Thread1of1ForFork2_~i~2_9) InVars {~p~0=v_~p~0_3, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_9} OutVars{~p~0=v_~p~0_3, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_9} AuxVars[] AssignedVars[][77], [Black: 514#(and (= ~p~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 1018#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1))), 39#L69-2true, Black: 1044#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 1016#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1))), Black: 1008#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~p~0 0) (<= ~N~0 1) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 1038#(and (<= ~p~0 0) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2)), Black: 998#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 1042#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~N~0 1) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 739#(<= ~N~0 1), Black: 1030#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 735#true, Black: 1040#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 1010#(and (= thread3Thread1of1ForFork2_~i~2 0) (= ~p~0 thread2Thread1of1ForFork1_~i~1) (<= ~N~0 1) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 1000#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~N~0 1) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 1024#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1))), Black: 1006#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~p~0 0) (<= ~N~0 1)), Black: 738#(<= thread1Thread1of1ForFork0_~i~0 1), 721#true, Black: 1014#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1))), Black: 740#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~N~0 1)), Black: 737#(= thread1Thread1of1ForFork0_~i~0 0), Black: 1026#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 1036#(and (<= ~p~0 0) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 811#(and (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2)), Black: 1022#(and (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 1028#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~N~0 1)), 57#(<= 1 ~N~0), Black: 1004#(and (<= ~N~0 1) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 898#(<= ~p~0 thread3Thread1of1ForFork2_~i~2), Black: 51#(and (= ~asum~0 0) (<= (mod ~N~0 4294967296) 0) (= ~csum~0 0)), Black: 50#(and (= ~asum~0 0) (or (and (<= 0 ~N~0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0)) (< (mod ~N~0 4294967296) 1)) (= ~csum~0 0)), 335#true, 512#(= thread3Thread1of1ForFork2_~i~2 0), Black: 184#(and (<= 1 ~N~0) (<= (+ |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 11#L60-1true, Black: 323#(and (<= 1 ~N~0) (<= (+ thread1Thread1of1ForFork0_~i~0 1) ~N~0)), 190#(<= 1 ~N~0), 498#true, Black: 531#(<= 1 ~N~0), Black: 337#(= ~p~0 0), Black: 338#(and (= ~p~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), 495#(and (<= 1 ~N~0) (<= (+ thread2Thread1of1ForFork1_~i~1 1) ~N~0)), Black: 1360#(and (<= thread3Thread1of1ForFork2_~i~2 thread2Thread1of1ForFork1_~i~1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 1358#(and (<= (+ thread3Thread1of1ForFork2_~i~2 1) thread2Thread1of1ForFork1_~i~1) (<= thread3Thread1of1ForFork2_~i~2 1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= (+ 2 thread3Thread1of1ForFork2_~i~2) ~N~0) (<= 2 ~N~0)), 1659#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= 1 thread2Thread1of1ForFork1_~i~1) (<= 2 ~N~0)), Black: 1340#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork2_~i~2 0) (<= 1 thread2Thread1of1ForFork1_~i~1)), Black: 1076#(= thread2Thread1of1ForFork1_~i~1 0), Black: 1108#(<= 0 thread2Thread1of1ForFork1_~i~1), Black: 1362#(and (<= (+ thread3Thread1of1ForFork2_~i~2 1) thread2Thread1of1ForFork1_~i~1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 730#(and (= ~p~0 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread2Thread1of1ForFork1_~i~1 0)), Black: 1078#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= 1 thread2Thread1of1ForFork1_~i~1)), Black: 724#(= ~p~0 0), Black: 1178#(and (<= thread3Thread1of1ForFork2_~i~2 1) (<= 2 ~N~0)), Black: 725#(and (= ~p~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 1077#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread2Thread1of1ForFork1_~i~1 0)), Black: 1352#(and (<= thread3Thread1of1ForFork2_~i~2 thread2Thread1of1ForFork1_~i~1) (<= thread3Thread1of1ForFork2_~i~2 1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= 2 ~N~0)), Black: 1364#(and (<= thread3Thread1of1ForFork2_~i~2 1) (<= (+ 2 thread3Thread1of1ForFork2_~i~2) ~N~0) (<= 2 ~N~0)), Black: 1354#(and (<= thread3Thread1of1ForFork2_~i~2 thread2Thread1of1ForFork1_~i~1) (<= 0 thread2Thread1of1ForFork1_~i~1)), 8#L50-5true, Black: 1080#(<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0), Black: 1074#true, Black: 1127#(and (<= 0 thread2Thread1of1ForFork1_~i~1) (<= thread3Thread1of1ForFork2_~i~2 0)), Black: 1346#(and (<= 0 thread2Thread1of1ForFork1_~i~1) (<= thread3Thread1of1ForFork2_~i~2 0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 1348#(and (<= thread3Thread1of1ForFork2_~i~2 0) (<= 1 thread2Thread1of1ForFork1_~i~1) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 1366#(and (<= (+ thread3Thread1of1ForFork2_~i~2 1) thread2Thread1of1ForFork1_~i~1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= (+ 2 thread3Thread1of1ForFork2_~i~2) ~N~0)), Black: 1245#(< (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0), Black: 1143#(and (<= thread3Thread1of1ForFork2_~i~2 0) (<= 1 thread2Thread1of1ForFork1_~i~1)), Black: 1356#(and (<= (+ thread3Thread1of1ForFork2_~i~2 1) thread2Thread1of1ForFork1_~i~1) (<= thread3Thread1of1ForFork2_~i~2 1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= 2 ~N~0)), 5#L89true, 1002#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 501#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread2Thread1of1ForFork1_~i~1 0)), Black: 500#(= thread2Thread1of1ForFork1_~i~1 0), Black: 502#(and (= ~p~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), 1350#(and (<= thread3Thread1of1ForFork2_~i~2 0) (<= 1 thread2Thread1of1ForFork1_~i~1) (<= 2 ~N~0))]) [2025-01-09 16:48:44,419 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is cut-off event [2025-01-09 16:48:44,419 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-01-09 16:48:44,419 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-01-09 16:48:44,419 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-01-09 16:48:44,419 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([430] L60-1-->L58-4: Formula: (= v_thread2Thread1of1ForFork1_~i~1_14 (+ v_thread2Thread1of1ForFork1_~i~1_13 1)) InVars {thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_13} OutVars{thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_14, thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~i~1, thread2Thread1of1ForFork1_#t~post4][218], [Black: 514#(and (= ~p~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), 15#L69true, Black: 1018#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1))), Black: 1044#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 1016#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1))), Black: 1008#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~p~0 0) (<= ~N~0 1) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 1038#(and (<= ~p~0 0) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2)), Black: 998#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 1042#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~N~0 1) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 739#(<= ~N~0 1), Black: 1030#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 735#true, Black: 1040#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 1010#(and (= thread3Thread1of1ForFork2_~i~2 0) (= ~p~0 thread2Thread1of1ForFork1_~i~1) (<= ~N~0 1) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 1000#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~N~0 1) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 1024#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1))), Black: 1006#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~p~0 0) (<= ~N~0 1)), 721#true, Black: 1014#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1))), Black: 740#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~N~0 1)), Black: 737#(= thread1Thread1of1ForFork0_~i~0 0), Black: 1026#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 1036#(and (<= ~p~0 0) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 811#(and (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2)), Black: 1022#(and (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 1002#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 1028#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~N~0 1)), 57#(<= 1 ~N~0), Black: 1004#(and (<= ~N~0 1) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 898#(<= ~p~0 thread3Thread1of1ForFork2_~i~2), Black: 51#(and (= ~asum~0 0) (<= (mod ~N~0 4294967296) 0) (= ~csum~0 0)), Black: 50#(and (= ~asum~0 0) (or (and (<= 0 ~N~0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0)) (< (mod ~N~0 4294967296) 1)) (= ~csum~0 0)), 335#true, 512#(= thread3Thread1of1ForFork2_~i~2 0), Black: 184#(and (<= 1 ~N~0) (<= (+ |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 323#(and (<= 1 ~N~0) (<= (+ thread1Thread1of1ForFork0_~i~0 1) ~N~0)), 190#(<= 1 ~N~0), 498#true, Black: 531#(<= 1 ~N~0), Black: 337#(= ~p~0 0), Black: 338#(and (= ~p~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 1360#(and (<= thread3Thread1of1ForFork2_~i~2 thread2Thread1of1ForFork1_~i~1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 1358#(and (<= (+ thread3Thread1of1ForFork2_~i~2 1) thread2Thread1of1ForFork1_~i~1) (<= thread3Thread1of1ForFork2_~i~2 1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= (+ 2 thread3Thread1of1ForFork2_~i~2) ~N~0) (<= 2 ~N~0)), 1659#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= 1 thread2Thread1of1ForFork1_~i~1) (<= 2 ~N~0)), Black: 1340#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork2_~i~2 0) (<= 1 thread2Thread1of1ForFork1_~i~1)), Black: 1076#(= thread2Thread1of1ForFork1_~i~1 0), Black: 1108#(<= 0 thread2Thread1of1ForFork1_~i~1), Black: 1362#(and (<= (+ thread3Thread1of1ForFork2_~i~2 1) thread2Thread1of1ForFork1_~i~1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 730#(and (= ~p~0 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread2Thread1of1ForFork1_~i~1 0)), Black: 1078#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= 1 thread2Thread1of1ForFork1_~i~1)), Black: 724#(= ~p~0 0), Black: 1178#(and (<= thread3Thread1of1ForFork2_~i~2 1) (<= 2 ~N~0)), Black: 725#(and (= ~p~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 1077#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread2Thread1of1ForFork1_~i~1 0)), Black: 1352#(and (<= thread3Thread1of1ForFork2_~i~2 thread2Thread1of1ForFork1_~i~1) (<= thread3Thread1of1ForFork2_~i~2 1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= 2 ~N~0)), Black: 1364#(and (<= thread3Thread1of1ForFork2_~i~2 1) (<= (+ 2 thread3Thread1of1ForFork2_~i~2) ~N~0) (<= 2 ~N~0)), Black: 1354#(and (<= thread3Thread1of1ForFork2_~i~2 thread2Thread1of1ForFork1_~i~1) (<= 0 thread2Thread1of1ForFork1_~i~1)), 8#L50-5true, Black: 1080#(<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0), 738#(<= thread1Thread1of1ForFork0_~i~0 1), Black: 1074#true, Black: 1127#(and (<= 0 thread2Thread1of1ForFork1_~i~1) (<= thread3Thread1of1ForFork2_~i~2 0)), Black: 1346#(and (<= 0 thread2Thread1of1ForFork1_~i~1) (<= thread3Thread1of1ForFork2_~i~2 0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 1348#(and (<= thread3Thread1of1ForFork2_~i~2 0) (<= 1 thread2Thread1of1ForFork1_~i~1) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 1366#(and (<= (+ thread3Thread1of1ForFork2_~i~2 1) thread2Thread1of1ForFork1_~i~1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= (+ 2 thread3Thread1of1ForFork2_~i~2) ~N~0)), Black: 1245#(< (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0), Black: 1143#(and (<= thread3Thread1of1ForFork2_~i~2 0) (<= 1 thread2Thread1of1ForFork1_~i~1)), Black: 1356#(and (<= (+ thread3Thread1of1ForFork2_~i~2 1) thread2Thread1of1ForFork1_~i~1) (<= thread3Thread1of1ForFork2_~i~2 1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= 2 ~N~0)), 344#(<= 1 ~N~0), 5#L89true, Black: 495#(and (<= 1 ~N~0) (<= (+ thread2Thread1of1ForFork1_~i~1 1) ~N~0)), 35#L58-4true, Black: 501#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread2Thread1of1ForFork1_~i~1 0)), Black: 500#(= thread2Thread1of1ForFork1_~i~1 0), Black: 502#(and (= ~p~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), 1350#(and (<= thread3Thread1of1ForFork2_~i~2 0) (<= 1 thread2Thread1of1ForFork1_~i~1) (<= 2 ~N~0))]) [2025-01-09 16:48:44,419 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is cut-off event [2025-01-09 16:48:44,419 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-01-09 16:48:44,419 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-01-09 16:48:44,419 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-01-09 16:48:44,419 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([430] L60-1-->L58-4: Formula: (= v_thread2Thread1of1ForFork1_~i~1_14 (+ v_thread2Thread1of1ForFork1_~i~1_13 1)) InVars {thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_13} OutVars{thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_14, thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~i~1, thread2Thread1of1ForFork1_#t~post4][218], [323#(and (<= 1 ~N~0) (<= (+ thread1Thread1of1ForFork0_~i~0 1) ~N~0)), Black: 514#(and (= ~p~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), 15#L69true, Black: 1018#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1))), Black: 1044#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 1016#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1))), Black: 1008#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~p~0 0) (<= ~N~0 1) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 1038#(and (<= ~p~0 0) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2)), Black: 998#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 1042#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~N~0 1) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 739#(<= ~N~0 1), Black: 1030#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 735#true, Black: 1040#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 1010#(and (= thread3Thread1of1ForFork2_~i~2 0) (= ~p~0 thread2Thread1of1ForFork1_~i~1) (<= ~N~0 1) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 1000#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~N~0 1) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 1024#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1))), Black: 1006#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~p~0 0) (<= ~N~0 1)), 721#true, Black: 1014#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1))), Black: 740#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~N~0 1)), Black: 737#(= thread1Thread1of1ForFork0_~i~0 0), Black: 1026#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 1036#(and (<= ~p~0 0) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 811#(and (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2)), Black: 1022#(and (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 1002#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 1028#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~N~0 1)), 57#(<= 1 ~N~0), Black: 1004#(and (<= ~N~0 1) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 898#(<= ~p~0 thread3Thread1of1ForFork2_~i~2), Black: 51#(and (= ~asum~0 0) (<= (mod ~N~0 4294967296) 0) (= ~csum~0 0)), Black: 50#(and (= ~asum~0 0) (or (and (<= 0 ~N~0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0)) (< (mod ~N~0 4294967296) 1)) (= ~csum~0 0)), 12#L51true, 335#true, 512#(= thread3Thread1of1ForFork2_~i~2 0), Black: 184#(and (<= 1 ~N~0) (<= (+ |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 498#true, Black: 531#(<= 1 ~N~0), Black: 337#(= ~p~0 0), Black: 338#(and (= ~p~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 1360#(and (<= thread3Thread1of1ForFork2_~i~2 thread2Thread1of1ForFork1_~i~1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 1358#(and (<= (+ thread3Thread1of1ForFork2_~i~2 1) thread2Thread1of1ForFork1_~i~1) (<= thread3Thread1of1ForFork2_~i~2 1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= (+ 2 thread3Thread1of1ForFork2_~i~2) ~N~0) (<= 2 ~N~0)), 1659#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= 1 thread2Thread1of1ForFork1_~i~1) (<= 2 ~N~0)), Black: 1340#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork2_~i~2 0) (<= 1 thread2Thread1of1ForFork1_~i~1)), Black: 1076#(= thread2Thread1of1ForFork1_~i~1 0), Black: 1108#(<= 0 thread2Thread1of1ForFork1_~i~1), Black: 1362#(and (<= (+ thread3Thread1of1ForFork2_~i~2 1) thread2Thread1of1ForFork1_~i~1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 730#(and (= ~p~0 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread2Thread1of1ForFork1_~i~1 0)), Black: 1078#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= 1 thread2Thread1of1ForFork1_~i~1)), Black: 724#(= ~p~0 0), Black: 1178#(and (<= thread3Thread1of1ForFork2_~i~2 1) (<= 2 ~N~0)), Black: 725#(and (= ~p~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 1077#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread2Thread1of1ForFork1_~i~1 0)), Black: 1352#(and (<= thread3Thread1of1ForFork2_~i~2 thread2Thread1of1ForFork1_~i~1) (<= thread3Thread1of1ForFork2_~i~2 1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= 2 ~N~0)), Black: 1364#(and (<= thread3Thread1of1ForFork2_~i~2 1) (<= (+ 2 thread3Thread1of1ForFork2_~i~2) ~N~0) (<= 2 ~N~0)), Black: 1354#(and (<= thread3Thread1of1ForFork2_~i~2 thread2Thread1of1ForFork1_~i~1) (<= 0 thread2Thread1of1ForFork1_~i~1)), Black: 1080#(<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0), Black: 1074#true, 738#(<= thread1Thread1of1ForFork0_~i~0 1), Black: 1127#(and (<= 0 thread2Thread1of1ForFork1_~i~1) (<= thread3Thread1of1ForFork2_~i~2 0)), Black: 1346#(and (<= 0 thread2Thread1of1ForFork1_~i~1) (<= thread3Thread1of1ForFork2_~i~2 0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 1348#(and (<= thread3Thread1of1ForFork2_~i~2 0) (<= 1 thread2Thread1of1ForFork1_~i~1) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 1366#(and (<= (+ thread3Thread1of1ForFork2_~i~2 1) thread2Thread1of1ForFork1_~i~1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= (+ 2 thread3Thread1of1ForFork2_~i~2) ~N~0)), Black: 1245#(< (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0), Black: 1143#(and (<= thread3Thread1of1ForFork2_~i~2 0) (<= 1 thread2Thread1of1ForFork1_~i~1)), Black: 1356#(and (<= (+ thread3Thread1of1ForFork2_~i~2 1) thread2Thread1of1ForFork1_~i~1) (<= thread3Thread1of1ForFork2_~i~2 1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= 2 ~N~0)), 344#(<= 1 ~N~0), 5#L89true, Black: 495#(and (<= 1 ~N~0) (<= (+ thread2Thread1of1ForFork1_~i~1 1) ~N~0)), 35#L58-4true, Black: 501#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread2Thread1of1ForFork1_~i~1 0)), Black: 500#(= thread2Thread1of1ForFork1_~i~1 0), Black: 502#(and (= ~p~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), 1350#(and (<= thread3Thread1of1ForFork2_~i~2 0) (<= 1 thread2Thread1of1ForFork1_~i~1) (<= 2 ~N~0))]) [2025-01-09 16:48:44,419 INFO L294 olderBase$Statistics]: this new event has 45 ancestors and is cut-off event [2025-01-09 16:48:44,419 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-01-09 16:48:44,419 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2025-01-09 16:48:44,419 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-01-09 16:48:44,422 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([430] L60-1-->L58-4: Formula: (= v_thread2Thread1of1ForFork1_~i~1_14 (+ v_thread2Thread1of1ForFork1_~i~1_13 1)) InVars {thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_13} OutVars{thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_14, thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~i~1, thread2Thread1of1ForFork1_#t~post4][218], [323#(and (<= 1 ~N~0) (<= (+ thread1Thread1of1ForFork0_~i~0 1) ~N~0)), Black: 514#(and (= ~p~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), 15#L69true, Black: 1018#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1))), Black: 1044#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 1016#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1))), Black: 1008#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~p~0 0) (<= ~N~0 1) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 1038#(and (<= ~p~0 0) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2)), Black: 998#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 1042#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~N~0 1) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 739#(<= ~N~0 1), Black: 1030#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 735#true, Black: 1040#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 1010#(and (= thread3Thread1of1ForFork2_~i~2 0) (= ~p~0 thread2Thread1of1ForFork1_~i~1) (<= ~N~0 1) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 1000#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~N~0 1) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 1024#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1))), Black: 1006#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~p~0 0) (<= ~N~0 1)), 721#true, Black: 1014#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1))), Black: 740#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~N~0 1)), Black: 737#(= thread1Thread1of1ForFork0_~i~0 0), Black: 1026#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 1036#(and (<= ~p~0 0) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 811#(and (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2)), Black: 1022#(and (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 1002#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 1028#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~N~0 1)), 57#(<= 1 ~N~0), Black: 1004#(and (<= ~N~0 1) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 898#(<= ~p~0 thread3Thread1of1ForFork2_~i~2), Black: 51#(and (= ~asum~0 0) (<= (mod ~N~0 4294967296) 0) (= ~csum~0 0)), Black: 50#(and (= ~asum~0 0) (or (and (<= 0 ~N~0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0)) (< (mod ~N~0 4294967296) 1)) (= ~csum~0 0)), 335#true, 512#(= thread3Thread1of1ForFork2_~i~2 0), Black: 184#(and (<= 1 ~N~0) (<= (+ |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 498#true, Black: 531#(<= 1 ~N~0), Black: 337#(= ~p~0 0), Black: 338#(and (= ~p~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 1360#(and (<= thread3Thread1of1ForFork2_~i~2 thread2Thread1of1ForFork1_~i~1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 1358#(and (<= (+ thread3Thread1of1ForFork2_~i~2 1) thread2Thread1of1ForFork1_~i~1) (<= thread3Thread1of1ForFork2_~i~2 1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= (+ 2 thread3Thread1of1ForFork2_~i~2) ~N~0) (<= 2 ~N~0)), 1659#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= 1 thread2Thread1of1ForFork1_~i~1) (<= 2 ~N~0)), Black: 1340#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork2_~i~2 0) (<= 1 thread2Thread1of1ForFork1_~i~1)), Black: 1076#(= thread2Thread1of1ForFork1_~i~1 0), Black: 1108#(<= 0 thread2Thread1of1ForFork1_~i~1), Black: 1362#(and (<= (+ thread3Thread1of1ForFork2_~i~2 1) thread2Thread1of1ForFork1_~i~1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 730#(and (= ~p~0 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread2Thread1of1ForFork1_~i~1 0)), Black: 1078#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= 1 thread2Thread1of1ForFork1_~i~1)), Black: 724#(= ~p~0 0), Black: 1178#(and (<= thread3Thread1of1ForFork2_~i~2 1) (<= 2 ~N~0)), Black: 725#(and (= ~p~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 1077#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread2Thread1of1ForFork1_~i~1 0)), Black: 1352#(and (<= thread3Thread1of1ForFork2_~i~2 thread2Thread1of1ForFork1_~i~1) (<= thread3Thread1of1ForFork2_~i~2 1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= 2 ~N~0)), Black: 1364#(and (<= thread3Thread1of1ForFork2_~i~2 1) (<= (+ 2 thread3Thread1of1ForFork2_~i~2) ~N~0) (<= 2 ~N~0)), Black: 1354#(and (<= thread3Thread1of1ForFork2_~i~2 thread2Thread1of1ForFork1_~i~1) (<= 0 thread2Thread1of1ForFork1_~i~1)), Black: 1080#(<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0), Black: 1074#true, 738#(<= thread1Thread1of1ForFork0_~i~0 1), Black: 1127#(and (<= 0 thread2Thread1of1ForFork1_~i~1) (<= thread3Thread1of1ForFork2_~i~2 0)), Black: 1346#(and (<= 0 thread2Thread1of1ForFork1_~i~1) (<= thread3Thread1of1ForFork2_~i~2 0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 1348#(and (<= thread3Thread1of1ForFork2_~i~2 0) (<= 1 thread2Thread1of1ForFork1_~i~1) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 1366#(and (<= (+ thread3Thread1of1ForFork2_~i~2 1) thread2Thread1of1ForFork1_~i~1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= (+ 2 thread3Thread1of1ForFork2_~i~2) ~N~0)), Black: 1245#(< (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0), Black: 1143#(and (<= thread3Thread1of1ForFork2_~i~2 0) (<= 1 thread2Thread1of1ForFork1_~i~1)), Black: 1356#(and (<= (+ thread3Thread1of1ForFork2_~i~2 1) thread2Thread1of1ForFork1_~i~1) (<= thread3Thread1of1ForFork2_~i~2 1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= 2 ~N~0)), 344#(<= 1 ~N~0), 5#L89true, Black: 495#(and (<= 1 ~N~0) (<= (+ thread2Thread1of1ForFork1_~i~1 1) ~N~0)), 35#L58-4true, Black: 501#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread2Thread1of1ForFork1_~i~1 0)), 13#L51-3true, Black: 500#(= thread2Thread1of1ForFork1_~i~1 0), Black: 502#(and (= ~p~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), 1350#(and (<= thread3Thread1of1ForFork2_~i~2 0) (<= 1 thread2Thread1of1ForFork1_~i~1) (<= 2 ~N~0))]) [2025-01-09 16:48:44,422 INFO L294 olderBase$Statistics]: this new event has 46 ancestors and is cut-off event [2025-01-09 16:48:44,422 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2025-01-09 16:48:44,422 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-01-09 16:48:44,422 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-01-09 16:48:45,014 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([436] L70-->L70-3: Formula: (= |v_thread3Thread1of1ForFork2_#t~mem5_1| (select (select |v_#memory_int#1_28| v_~C~0.base_11) (+ v_~C~0.offset_11 (* v_thread3Thread1of1ForFork2_~i~2_11 4)))) InVars {~C~0.offset=v_~C~0.offset_11, #memory_int#1=|v_#memory_int#1_28|, ~C~0.base=v_~C~0.base_11, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_11} OutVars{~C~0.offset=v_~C~0.offset_11, #memory_int#1=|v_#memory_int#1_28|, ~C~0.base=v_~C~0.base_11, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_11, thread3Thread1of1ForFork2_#t~mem5=|v_thread3Thread1of1ForFork2_#t~mem5_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~mem5][346], [323#(and (<= 1 ~N~0) (<= (+ thread1Thread1of1ForFork0_~i~0 1) ~N~0)), Black: 512#(= thread3Thread1of1ForFork2_~i~2 0), Black: 514#(and (= ~p~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), 1342#(and (<= 0 thread2Thread1of1ForFork1_~i~1) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), 735#true, Black: 1018#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1))), Black: 1044#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 1016#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1))), Black: 1008#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~p~0 0) (<= ~N~0 1) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 1038#(and (<= ~p~0 0) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2)), Black: 998#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 1042#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~N~0 1) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 739#(<= ~N~0 1), Black: 1030#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 1040#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 1010#(and (= thread3Thread1of1ForFork2_~i~2 0) (= ~p~0 thread2Thread1of1ForFork1_~i~1) (<= ~N~0 1) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 1000#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~N~0 1) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 1024#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1))), Black: 1006#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~p~0 0) (<= ~N~0 1)), 721#true, Black: 738#(<= thread1Thread1of1ForFork0_~i~0 1), Black: 1014#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1))), Black: 740#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~N~0 1)), Black: 737#(= thread1Thread1of1ForFork0_~i~0 0), Black: 1026#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 1036#(and (<= ~p~0 0) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 811#(and (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2)), Black: 1022#(and (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 1002#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 1028#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~N~0 1)), 57#(<= 1 ~N~0), Black: 1004#(and (<= ~N~0 1) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), 40#L70-3true, Black: 898#(<= ~p~0 thread3Thread1of1ForFork2_~i~2), Black: 51#(and (= ~asum~0 0) (<= (mod ~N~0 4294967296) 0) (= ~csum~0 0)), Black: 50#(and (= ~asum~0 0) (or (and (<= 0 ~N~0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0)) (< (mod ~N~0 4294967296) 1)) (= ~csum~0 0)), 12#L51true, 335#true, Black: 184#(and (<= 1 ~N~0) (<= (+ |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 1654#(and (<= (+ thread1Thread1of1ForFork0_~i~0 1) ~N~0) (<= 1 thread2Thread1of1ForFork1_~i~1) (<= 2 ~N~0)), 2#L59-3true, 498#true, Black: 531#(<= 1 ~N~0), Black: 337#(= ~p~0 0), Black: 338#(and (= ~p~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), 495#(and (<= 1 ~N~0) (<= (+ thread2Thread1of1ForFork1_~i~1 1) ~N~0)), Black: 1360#(and (<= thread3Thread1of1ForFork2_~i~2 thread2Thread1of1ForFork1_~i~1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 1358#(and (<= (+ thread3Thread1of1ForFork2_~i~2 1) thread2Thread1of1ForFork1_~i~1) (<= thread3Thread1of1ForFork2_~i~2 1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= (+ 2 thread3Thread1of1ForFork2_~i~2) ~N~0) (<= 2 ~N~0)), Black: 1340#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork2_~i~2 0) (<= 1 thread2Thread1of1ForFork1_~i~1)), Black: 1076#(= thread2Thread1of1ForFork1_~i~1 0), Black: 1108#(<= 0 thread2Thread1of1ForFork1_~i~1), Black: 730#(and (= ~p~0 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread2Thread1of1ForFork1_~i~1 0)), Black: 1362#(and (<= (+ thread3Thread1of1ForFork2_~i~2 1) thread2Thread1of1ForFork1_~i~1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 1078#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= 1 thread2Thread1of1ForFork1_~i~1)), Black: 724#(= ~p~0 0), Black: 1178#(and (<= thread3Thread1of1ForFork2_~i~2 1) (<= 2 ~N~0)), Black: 725#(and (= ~p~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 1077#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread2Thread1of1ForFork1_~i~1 0)), Black: 1352#(and (<= thread3Thread1of1ForFork2_~i~2 thread2Thread1of1ForFork1_~i~1) (<= thread3Thread1of1ForFork2_~i~2 1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= 2 ~N~0)), Black: 1364#(and (<= thread3Thread1of1ForFork2_~i~2 1) (<= (+ 2 thread3Thread1of1ForFork2_~i~2) ~N~0) (<= 2 ~N~0)), Black: 1354#(and (<= thread3Thread1of1ForFork2_~i~2 thread2Thread1of1ForFork1_~i~1) (<= 0 thread2Thread1of1ForFork1_~i~1)), Black: 1080#(<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0), 37#L88-4true, Black: 1074#true, Black: 1127#(and (<= 0 thread2Thread1of1ForFork1_~i~1) (<= thread3Thread1of1ForFork2_~i~2 0)), Black: 1346#(and (<= 0 thread2Thread1of1ForFork1_~i~1) (<= thread3Thread1of1ForFork2_~i~2 0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 1348#(and (<= thread3Thread1of1ForFork2_~i~2 0) (<= 1 thread2Thread1of1ForFork1_~i~1) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 1366#(and (<= (+ thread3Thread1of1ForFork2_~i~2 1) thread2Thread1of1ForFork1_~i~1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= (+ 2 thread3Thread1of1ForFork2_~i~2) ~N~0)), Black: 1245#(< (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0), Black: 1143#(and (<= thread3Thread1of1ForFork2_~i~2 0) (<= 1 thread2Thread1of1ForFork1_~i~1)), Black: 1356#(and (<= (+ thread3Thread1of1ForFork2_~i~2 1) thread2Thread1of1ForFork1_~i~1) (<= thread3Thread1of1ForFork2_~i~2 1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= 2 ~N~0)), Black: 501#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread2Thread1of1ForFork1_~i~1 0)), Black: 500#(= thread2Thread1of1ForFork1_~i~1 0), Black: 502#(and (= ~p~0 0) (= thread3Thread1of1ForFork2_~i~2 0))]) [2025-01-09 16:48:45,014 INFO L294 olderBase$Statistics]: this new event has 50 ancestors and is cut-off event [2025-01-09 16:48:45,014 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2025-01-09 16:48:45,014 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2025-01-09 16:48:45,015 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2025-01-09 16:48:45,015 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([436] L70-->L70-3: Formula: (= |v_thread3Thread1of1ForFork2_#t~mem5_1| (select (select |v_#memory_int#1_28| v_~C~0.base_11) (+ v_~C~0.offset_11 (* v_thread3Thread1of1ForFork2_~i~2_11 4)))) InVars {~C~0.offset=v_~C~0.offset_11, #memory_int#1=|v_#memory_int#1_28|, ~C~0.base=v_~C~0.base_11, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_11} OutVars{~C~0.offset=v_~C~0.offset_11, #memory_int#1=|v_#memory_int#1_28|, ~C~0.base=v_~C~0.base_11, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_11, thread3Thread1of1ForFork2_#t~mem5=|v_thread3Thread1of1ForFork2_#t~mem5_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~mem5][346], [323#(and (<= 1 ~N~0) (<= (+ thread1Thread1of1ForFork0_~i~0 1) ~N~0)), Black: 512#(= thread3Thread1of1ForFork2_~i~2 0), Black: 514#(and (= ~p~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), 1342#(and (<= 0 thread2Thread1of1ForFork1_~i~1) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), 735#true, Black: 1018#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1))), Black: 1044#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 1016#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1))), Black: 1008#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~p~0 0) (<= ~N~0 1) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 1038#(and (<= ~p~0 0) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2)), Black: 998#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 1042#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~N~0 1) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 739#(<= ~N~0 1), Black: 1030#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 1040#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 1010#(and (= thread3Thread1of1ForFork2_~i~2 0) (= ~p~0 thread2Thread1of1ForFork1_~i~1) (<= ~N~0 1) (<= thread2Thread1of1ForFork1_~i~1 0)), 9#L59-6true, Black: 1000#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~N~0 1) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 1024#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1))), Black: 1006#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~p~0 0) (<= ~N~0 1)), 721#true, Black: 738#(<= thread1Thread1of1ForFork0_~i~0 1), Black: 1014#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1))), Black: 740#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~N~0 1)), Black: 737#(= thread1Thread1of1ForFork0_~i~0 0), Black: 1026#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 1036#(and (<= ~p~0 0) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 811#(and (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2)), Black: 1022#(and (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 1002#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 1028#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~N~0 1)), 57#(<= 1 ~N~0), Black: 1004#(and (<= ~N~0 1) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), 40#L70-3true, Black: 898#(<= ~p~0 thread3Thread1of1ForFork2_~i~2), Black: 51#(and (= ~asum~0 0) (<= (mod ~N~0 4294967296) 0) (= ~csum~0 0)), Black: 50#(and (= ~asum~0 0) (or (and (<= 0 ~N~0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0)) (< (mod ~N~0 4294967296) 1)) (= ~csum~0 0)), 12#L51true, 335#true, Black: 184#(and (<= 1 ~N~0) (<= (+ |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 1654#(and (<= (+ thread1Thread1of1ForFork0_~i~0 1) ~N~0) (<= 1 thread2Thread1of1ForFork1_~i~1) (<= 2 ~N~0)), 498#true, Black: 531#(<= 1 ~N~0), Black: 337#(= ~p~0 0), Black: 338#(and (= ~p~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), 495#(and (<= 1 ~N~0) (<= (+ thread2Thread1of1ForFork1_~i~1 1) ~N~0)), Black: 1360#(and (<= thread3Thread1of1ForFork2_~i~2 thread2Thread1of1ForFork1_~i~1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 1358#(and (<= (+ thread3Thread1of1ForFork2_~i~2 1) thread2Thread1of1ForFork1_~i~1) (<= thread3Thread1of1ForFork2_~i~2 1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= (+ 2 thread3Thread1of1ForFork2_~i~2) ~N~0) (<= 2 ~N~0)), Black: 1340#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork2_~i~2 0) (<= 1 thread2Thread1of1ForFork1_~i~1)), Black: 1076#(= thread2Thread1of1ForFork1_~i~1 0), Black: 1108#(<= 0 thread2Thread1of1ForFork1_~i~1), Black: 730#(and (= ~p~0 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread2Thread1of1ForFork1_~i~1 0)), Black: 1362#(and (<= (+ thread3Thread1of1ForFork2_~i~2 1) thread2Thread1of1ForFork1_~i~1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 1078#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= 1 thread2Thread1of1ForFork1_~i~1)), Black: 724#(= ~p~0 0), Black: 1178#(and (<= thread3Thread1of1ForFork2_~i~2 1) (<= 2 ~N~0)), Black: 725#(and (= ~p~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 1077#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread2Thread1of1ForFork1_~i~1 0)), Black: 1352#(and (<= thread3Thread1of1ForFork2_~i~2 thread2Thread1of1ForFork1_~i~1) (<= thread3Thread1of1ForFork2_~i~2 1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= 2 ~N~0)), Black: 1364#(and (<= thread3Thread1of1ForFork2_~i~2 1) (<= (+ 2 thread3Thread1of1ForFork2_~i~2) ~N~0) (<= 2 ~N~0)), Black: 1354#(and (<= thread3Thread1of1ForFork2_~i~2 thread2Thread1of1ForFork1_~i~1) (<= 0 thread2Thread1of1ForFork1_~i~1)), Black: 1080#(<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0), 37#L88-4true, Black: 1074#true, Black: 1127#(and (<= 0 thread2Thread1of1ForFork1_~i~1) (<= thread3Thread1of1ForFork2_~i~2 0)), Black: 1346#(and (<= 0 thread2Thread1of1ForFork1_~i~1) (<= thread3Thread1of1ForFork2_~i~2 0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 1348#(and (<= thread3Thread1of1ForFork2_~i~2 0) (<= 1 thread2Thread1of1ForFork1_~i~1) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 1366#(and (<= (+ thread3Thread1of1ForFork2_~i~2 1) thread2Thread1of1ForFork1_~i~1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= (+ 2 thread3Thread1of1ForFork2_~i~2) ~N~0)), Black: 1245#(< (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0), Black: 1143#(and (<= thread3Thread1of1ForFork2_~i~2 0) (<= 1 thread2Thread1of1ForFork1_~i~1)), Black: 1356#(and (<= (+ thread3Thread1of1ForFork2_~i~2 1) thread2Thread1of1ForFork1_~i~1) (<= thread3Thread1of1ForFork2_~i~2 1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= 2 ~N~0)), Black: 501#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread2Thread1of1ForFork1_~i~1 0)), Black: 500#(= thread2Thread1of1ForFork1_~i~1 0), Black: 502#(and (= ~p~0 0) (= thread3Thread1of1ForFork2_~i~2 0))]) [2025-01-09 16:48:45,015 INFO L294 olderBase$Statistics]: this new event has 51 ancestors and is cut-off event [2025-01-09 16:48:45,015 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2025-01-09 16:48:45,015 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2025-01-09 16:48:45,015 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2025-01-09 16:48:45,272 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([436] L70-->L70-3: Formula: (= |v_thread3Thread1of1ForFork2_#t~mem5_1| (select (select |v_#memory_int#1_28| v_~C~0.base_11) (+ v_~C~0.offset_11 (* v_thread3Thread1of1ForFork2_~i~2_11 4)))) InVars {~C~0.offset=v_~C~0.offset_11, #memory_int#1=|v_#memory_int#1_28|, ~C~0.base=v_~C~0.base_11, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_11} OutVars{~C~0.offset=v_~C~0.offset_11, #memory_int#1=|v_#memory_int#1_28|, ~C~0.base=v_~C~0.base_11, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_11, thread3Thread1of1ForFork2_#t~mem5=|v_thread3Thread1of1ForFork2_#t~mem5_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~mem5][346], [323#(and (<= 1 ~N~0) (<= (+ thread1Thread1of1ForFork0_~i~0 1) ~N~0)), Black: 512#(= thread3Thread1of1ForFork2_~i~2 0), Black: 514#(and (= ~p~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), 1342#(and (<= 0 thread2Thread1of1ForFork1_~i~1) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), 735#true, Black: 1018#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1))), Black: 1044#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 1016#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1))), Black: 1008#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~p~0 0) (<= ~N~0 1) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 1038#(and (<= ~p~0 0) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2)), Black: 998#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 1042#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~N~0 1) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 739#(<= ~N~0 1), Black: 1030#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 1040#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 1010#(and (= thread3Thread1of1ForFork2_~i~2 0) (= ~p~0 thread2Thread1of1ForFork1_~i~1) (<= ~N~0 1) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 1000#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~N~0 1) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 1024#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1))), Black: 1006#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~p~0 0) (<= ~N~0 1)), Black: 738#(<= thread1Thread1of1ForFork0_~i~0 1), 721#true, Black: 1014#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1))), Black: 740#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~N~0 1)), Black: 737#(= thread1Thread1of1ForFork0_~i~0 0), Black: 1026#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 1036#(and (<= ~p~0 0) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 811#(and (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2)), Black: 1022#(and (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 1002#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 1028#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~N~0 1)), 57#(<= 1 ~N~0), Black: 1004#(and (<= ~N~0 1) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), 40#L70-3true, Black: 898#(<= ~p~0 thread3Thread1of1ForFork2_~i~2), Black: 51#(and (= ~asum~0 0) (<= (mod ~N~0 4294967296) 0) (= ~csum~0 0)), Black: 50#(and (= ~asum~0 0) (or (and (<= 0 ~N~0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0)) (< (mod ~N~0 4294967296) 1)) (= ~csum~0 0)), 12#L51true, 335#true, Black: 184#(and (<= 1 ~N~0) (<= (+ |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 1654#(and (<= (+ thread1Thread1of1ForFork0_~i~0 1) ~N~0) (<= 1 thread2Thread1of1ForFork1_~i~1) (<= 2 ~N~0)), 2#L59-3true, 498#true, Black: 531#(<= 1 ~N~0), Black: 337#(= ~p~0 0), Black: 338#(and (= ~p~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), 495#(and (<= 1 ~N~0) (<= (+ thread2Thread1of1ForFork1_~i~1 1) ~N~0)), Black: 1360#(and (<= thread3Thread1of1ForFork2_~i~2 thread2Thread1of1ForFork1_~i~1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 1358#(and (<= (+ thread3Thread1of1ForFork2_~i~2 1) thread2Thread1of1ForFork1_~i~1) (<= thread3Thread1of1ForFork2_~i~2 1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= (+ 2 thread3Thread1of1ForFork2_~i~2) ~N~0) (<= 2 ~N~0)), Black: 1340#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork2_~i~2 0) (<= 1 thread2Thread1of1ForFork1_~i~1)), Black: 1076#(= thread2Thread1of1ForFork1_~i~1 0), Black: 1108#(<= 0 thread2Thread1of1ForFork1_~i~1), Black: 1362#(and (<= (+ thread3Thread1of1ForFork2_~i~2 1) thread2Thread1of1ForFork1_~i~1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 730#(and (= ~p~0 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread2Thread1of1ForFork1_~i~1 0)), Black: 1078#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= 1 thread2Thread1of1ForFork1_~i~1)), Black: 724#(= ~p~0 0), Black: 1178#(and (<= thread3Thread1of1ForFork2_~i~2 1) (<= 2 ~N~0)), Black: 725#(and (= ~p~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 1077#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread2Thread1of1ForFork1_~i~1 0)), Black: 1352#(and (<= thread3Thread1of1ForFork2_~i~2 thread2Thread1of1ForFork1_~i~1) (<= thread3Thread1of1ForFork2_~i~2 1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= 2 ~N~0)), Black: 1364#(and (<= thread3Thread1of1ForFork2_~i~2 1) (<= (+ 2 thread3Thread1of1ForFork2_~i~2) ~N~0) (<= 2 ~N~0)), Black: 1354#(and (<= thread3Thread1of1ForFork2_~i~2 thread2Thread1of1ForFork1_~i~1) (<= 0 thread2Thread1of1ForFork1_~i~1)), Black: 1080#(<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0), Black: 1074#true, Black: 1127#(and (<= 0 thread2Thread1of1ForFork1_~i~1) (<= thread3Thread1of1ForFork2_~i~2 0)), Black: 1346#(and (<= 0 thread2Thread1of1ForFork1_~i~1) (<= thread3Thread1of1ForFork2_~i~2 0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 1348#(and (<= thread3Thread1of1ForFork2_~i~2 0) (<= 1 thread2Thread1of1ForFork1_~i~1) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 1366#(and (<= (+ thread3Thread1of1ForFork2_~i~2 1) thread2Thread1of1ForFork1_~i~1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= (+ 2 thread3Thread1of1ForFork2_~i~2) ~N~0)), Black: 1245#(< (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0), Black: 1143#(and (<= thread3Thread1of1ForFork2_~i~2 0) (<= 1 thread2Thread1of1ForFork1_~i~1)), Black: 1356#(and (<= (+ thread3Thread1of1ForFork2_~i~2 1) thread2Thread1of1ForFork1_~i~1) (<= thread3Thread1of1ForFork2_~i~2 1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= 2 ~N~0)), 5#L89true, Black: 501#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread2Thread1of1ForFork1_~i~1 0)), Black: 500#(= thread2Thread1of1ForFork1_~i~1 0), Black: 502#(and (= ~p~0 0) (= thread3Thread1of1ForFork2_~i~2 0))]) [2025-01-09 16:48:45,272 INFO L294 olderBase$Statistics]: this new event has 51 ancestors and is cut-off event [2025-01-09 16:48:45,272 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2025-01-09 16:48:45,272 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2025-01-09 16:48:45,272 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2025-01-09 16:48:45,273 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([436] L70-->L70-3: Formula: (= |v_thread3Thread1of1ForFork2_#t~mem5_1| (select (select |v_#memory_int#1_28| v_~C~0.base_11) (+ v_~C~0.offset_11 (* v_thread3Thread1of1ForFork2_~i~2_11 4)))) InVars {~C~0.offset=v_~C~0.offset_11, #memory_int#1=|v_#memory_int#1_28|, ~C~0.base=v_~C~0.base_11, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_11} OutVars{~C~0.offset=v_~C~0.offset_11, #memory_int#1=|v_#memory_int#1_28|, ~C~0.base=v_~C~0.base_11, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_11, thread3Thread1of1ForFork2_#t~mem5=|v_thread3Thread1of1ForFork2_#t~mem5_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~mem5][346], [323#(and (<= 1 ~N~0) (<= (+ thread1Thread1of1ForFork0_~i~0 1) ~N~0)), Black: 512#(= thread3Thread1of1ForFork2_~i~2 0), Black: 514#(and (= ~p~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), 1342#(and (<= 0 thread2Thread1of1ForFork1_~i~1) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), 735#true, Black: 1018#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1))), Black: 1044#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 1016#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1))), Black: 1008#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~p~0 0) (<= ~N~0 1) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 1038#(and (<= ~p~0 0) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2)), Black: 998#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 1042#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~N~0 1) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 739#(<= ~N~0 1), Black: 1030#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 1040#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 1010#(and (= thread3Thread1of1ForFork2_~i~2 0) (= ~p~0 thread2Thread1of1ForFork1_~i~1) (<= ~N~0 1) (<= thread2Thread1of1ForFork1_~i~1 0)), 9#L59-6true, Black: 1000#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~N~0 1) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 1024#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1))), Black: 1006#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~p~0 0) (<= ~N~0 1)), Black: 738#(<= thread1Thread1of1ForFork0_~i~0 1), 721#true, Black: 1014#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1))), Black: 740#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~N~0 1)), Black: 737#(= thread1Thread1of1ForFork0_~i~0 0), Black: 1026#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 1036#(and (<= ~p~0 0) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 811#(and (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2)), Black: 1022#(and (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 1002#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 1028#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~N~0 1)), 57#(<= 1 ~N~0), Black: 1004#(and (<= ~N~0 1) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), 40#L70-3true, Black: 898#(<= ~p~0 thread3Thread1of1ForFork2_~i~2), Black: 51#(and (= ~asum~0 0) (<= (mod ~N~0 4294967296) 0) (= ~csum~0 0)), Black: 50#(and (= ~asum~0 0) (or (and (<= 0 ~N~0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0)) (< (mod ~N~0 4294967296) 1)) (= ~csum~0 0)), 12#L51true, 335#true, Black: 184#(and (<= 1 ~N~0) (<= (+ |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 1654#(and (<= (+ thread1Thread1of1ForFork0_~i~0 1) ~N~0) (<= 1 thread2Thread1of1ForFork1_~i~1) (<= 2 ~N~0)), 498#true, Black: 531#(<= 1 ~N~0), Black: 337#(= ~p~0 0), Black: 338#(and (= ~p~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), 495#(and (<= 1 ~N~0) (<= (+ thread2Thread1of1ForFork1_~i~1 1) ~N~0)), Black: 1360#(and (<= thread3Thread1of1ForFork2_~i~2 thread2Thread1of1ForFork1_~i~1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 1358#(and (<= (+ thread3Thread1of1ForFork2_~i~2 1) thread2Thread1of1ForFork1_~i~1) (<= thread3Thread1of1ForFork2_~i~2 1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= (+ 2 thread3Thread1of1ForFork2_~i~2) ~N~0) (<= 2 ~N~0)), Black: 1340#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork2_~i~2 0) (<= 1 thread2Thread1of1ForFork1_~i~1)), Black: 1076#(= thread2Thread1of1ForFork1_~i~1 0), Black: 1108#(<= 0 thread2Thread1of1ForFork1_~i~1), Black: 1362#(and (<= (+ thread3Thread1of1ForFork2_~i~2 1) thread2Thread1of1ForFork1_~i~1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 730#(and (= ~p~0 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread2Thread1of1ForFork1_~i~1 0)), Black: 1078#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= 1 thread2Thread1of1ForFork1_~i~1)), Black: 724#(= ~p~0 0), Black: 1178#(and (<= thread3Thread1of1ForFork2_~i~2 1) (<= 2 ~N~0)), Black: 725#(and (= ~p~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 1077#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread2Thread1of1ForFork1_~i~1 0)), Black: 1352#(and (<= thread3Thread1of1ForFork2_~i~2 thread2Thread1of1ForFork1_~i~1) (<= thread3Thread1of1ForFork2_~i~2 1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= 2 ~N~0)), Black: 1364#(and (<= thread3Thread1of1ForFork2_~i~2 1) (<= (+ 2 thread3Thread1of1ForFork2_~i~2) ~N~0) (<= 2 ~N~0)), Black: 1354#(and (<= thread3Thread1of1ForFork2_~i~2 thread2Thread1of1ForFork1_~i~1) (<= 0 thread2Thread1of1ForFork1_~i~1)), Black: 1080#(<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0), Black: 1074#true, Black: 1127#(and (<= 0 thread2Thread1of1ForFork1_~i~1) (<= thread3Thread1of1ForFork2_~i~2 0)), Black: 1346#(and (<= 0 thread2Thread1of1ForFork1_~i~1) (<= thread3Thread1of1ForFork2_~i~2 0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 1348#(and (<= thread3Thread1of1ForFork2_~i~2 0) (<= 1 thread2Thread1of1ForFork1_~i~1) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 1366#(and (<= (+ thread3Thread1of1ForFork2_~i~2 1) thread2Thread1of1ForFork1_~i~1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= (+ 2 thread3Thread1of1ForFork2_~i~2) ~N~0)), Black: 1245#(< (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0), Black: 1143#(and (<= thread3Thread1of1ForFork2_~i~2 0) (<= 1 thread2Thread1of1ForFork1_~i~1)), Black: 1356#(and (<= (+ thread3Thread1of1ForFork2_~i~2 1) thread2Thread1of1ForFork1_~i~1) (<= thread3Thread1of1ForFork2_~i~2 1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= 2 ~N~0)), 5#L89true, Black: 501#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread2Thread1of1ForFork1_~i~1 0)), Black: 500#(= thread2Thread1of1ForFork1_~i~1 0), Black: 502#(and (= ~p~0 0) (= thread3Thread1of1ForFork2_~i~2 0))]) [2025-01-09 16:48:45,273 INFO L294 olderBase$Statistics]: this new event has 52 ancestors and is cut-off event [2025-01-09 16:48:45,274 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2025-01-09 16:48:45,274 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2025-01-09 16:48:45,274 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2025-01-09 16:48:45,282 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([436] L70-->L70-3: Formula: (= |v_thread3Thread1of1ForFork2_#t~mem5_1| (select (select |v_#memory_int#1_28| v_~C~0.base_11) (+ v_~C~0.offset_11 (* v_thread3Thread1of1ForFork2_~i~2_11 4)))) InVars {~C~0.offset=v_~C~0.offset_11, #memory_int#1=|v_#memory_int#1_28|, ~C~0.base=v_~C~0.base_11, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_11} OutVars{~C~0.offset=v_~C~0.offset_11, #memory_int#1=|v_#memory_int#1_28|, ~C~0.base=v_~C~0.base_11, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_11, thread3Thread1of1ForFork2_#t~mem5=|v_thread3Thread1of1ForFork2_#t~mem5_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~mem5][346], [323#(and (<= 1 ~N~0) (<= (+ thread1Thread1of1ForFork0_~i~0 1) ~N~0)), Black: 512#(= thread3Thread1of1ForFork2_~i~2 0), Black: 514#(and (= ~p~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), 1342#(and (<= 0 thread2Thread1of1ForFork1_~i~1) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), 735#true, Black: 1018#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1))), Black: 1044#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 1016#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1))), Black: 1008#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~p~0 0) (<= ~N~0 1) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 1038#(and (<= ~p~0 0) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2)), Black: 998#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 1042#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~N~0 1) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 739#(<= ~N~0 1), Black: 1030#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 1040#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 1010#(and (= thread3Thread1of1ForFork2_~i~2 0) (= ~p~0 thread2Thread1of1ForFork1_~i~1) (<= ~N~0 1) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 1000#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~N~0 1) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 1024#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1))), Black: 1006#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~p~0 0) (<= ~N~0 1)), 721#true, Black: 738#(<= thread1Thread1of1ForFork0_~i~0 1), Black: 1014#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1))), Black: 740#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~N~0 1)), Black: 737#(= thread1Thread1of1ForFork0_~i~0 0), Black: 1026#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 1036#(and (<= ~p~0 0) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 811#(and (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2)), Black: 1022#(and (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 1002#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 1028#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~N~0 1)), 57#(<= 1 ~N~0), Black: 1004#(and (<= ~N~0 1) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), 40#L70-3true, Black: 898#(<= ~p~0 thread3Thread1of1ForFork2_~i~2), Black: 51#(and (= ~asum~0 0) (<= (mod ~N~0 4294967296) 0) (= ~csum~0 0)), Black: 50#(and (= ~asum~0 0) (or (and (<= 0 ~N~0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0)) (< (mod ~N~0 4294967296) 1)) (= ~csum~0 0)), 335#true, Black: 184#(and (<= 1 ~N~0) (<= (+ |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 1654#(and (<= (+ thread1Thread1of1ForFork0_~i~0 1) ~N~0) (<= 1 thread2Thread1of1ForFork1_~i~1) (<= 2 ~N~0)), 2#L59-3true, 498#true, Black: 531#(<= 1 ~N~0), Black: 337#(= ~p~0 0), Black: 338#(and (= ~p~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), 495#(and (<= 1 ~N~0) (<= (+ thread2Thread1of1ForFork1_~i~1 1) ~N~0)), Black: 1360#(and (<= thread3Thread1of1ForFork2_~i~2 thread2Thread1of1ForFork1_~i~1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 1358#(and (<= (+ thread3Thread1of1ForFork2_~i~2 1) thread2Thread1of1ForFork1_~i~1) (<= thread3Thread1of1ForFork2_~i~2 1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= (+ 2 thread3Thread1of1ForFork2_~i~2) ~N~0) (<= 2 ~N~0)), Black: 1340#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork2_~i~2 0) (<= 1 thread2Thread1of1ForFork1_~i~1)), Black: 1076#(= thread2Thread1of1ForFork1_~i~1 0), Black: 1108#(<= 0 thread2Thread1of1ForFork1_~i~1), Black: 1362#(and (<= (+ thread3Thread1of1ForFork2_~i~2 1) thread2Thread1of1ForFork1_~i~1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 730#(and (= ~p~0 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread2Thread1of1ForFork1_~i~1 0)), Black: 1078#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= 1 thread2Thread1of1ForFork1_~i~1)), Black: 724#(= ~p~0 0), Black: 1178#(and (<= thread3Thread1of1ForFork2_~i~2 1) (<= 2 ~N~0)), Black: 725#(and (= ~p~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 1077#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread2Thread1of1ForFork1_~i~1 0)), Black: 1352#(and (<= thread3Thread1of1ForFork2_~i~2 thread2Thread1of1ForFork1_~i~1) (<= thread3Thread1of1ForFork2_~i~2 1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= 2 ~N~0)), Black: 1364#(and (<= thread3Thread1of1ForFork2_~i~2 1) (<= (+ 2 thread3Thread1of1ForFork2_~i~2) ~N~0) (<= 2 ~N~0)), Black: 1354#(and (<= thread3Thread1of1ForFork2_~i~2 thread2Thread1of1ForFork1_~i~1) (<= 0 thread2Thread1of1ForFork1_~i~1)), Black: 1080#(<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0), 37#L88-4true, Black: 1074#true, Black: 1127#(and (<= 0 thread2Thread1of1ForFork1_~i~1) (<= thread3Thread1of1ForFork2_~i~2 0)), Black: 1346#(and (<= 0 thread2Thread1of1ForFork1_~i~1) (<= thread3Thread1of1ForFork2_~i~2 0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 1348#(and (<= thread3Thread1of1ForFork2_~i~2 0) (<= 1 thread2Thread1of1ForFork1_~i~1) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 1366#(and (<= (+ thread3Thread1of1ForFork2_~i~2 1) thread2Thread1of1ForFork1_~i~1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= (+ 2 thread3Thread1of1ForFork2_~i~2) ~N~0)), Black: 1245#(< (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0), Black: 1143#(and (<= thread3Thread1of1ForFork2_~i~2 0) (<= 1 thread2Thread1of1ForFork1_~i~1)), Black: 1356#(and (<= (+ thread3Thread1of1ForFork2_~i~2 1) thread2Thread1of1ForFork1_~i~1) (<= thread3Thread1of1ForFork2_~i~2 1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= 2 ~N~0)), Black: 501#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread2Thread1of1ForFork1_~i~1 0)), 13#L51-3true, Black: 500#(= thread2Thread1of1ForFork1_~i~1 0), Black: 502#(and (= ~p~0 0) (= thread3Thread1of1ForFork2_~i~2 0))]) [2025-01-09 16:48:45,282 INFO L294 olderBase$Statistics]: this new event has 51 ancestors and is cut-off event [2025-01-09 16:48:45,282 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2025-01-09 16:48:45,282 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2025-01-09 16:48:45,282 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2025-01-09 16:48:45,283 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([436] L70-->L70-3: Formula: (= |v_thread3Thread1of1ForFork2_#t~mem5_1| (select (select |v_#memory_int#1_28| v_~C~0.base_11) (+ v_~C~0.offset_11 (* v_thread3Thread1of1ForFork2_~i~2_11 4)))) InVars {~C~0.offset=v_~C~0.offset_11, #memory_int#1=|v_#memory_int#1_28|, ~C~0.base=v_~C~0.base_11, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_11} OutVars{~C~0.offset=v_~C~0.offset_11, #memory_int#1=|v_#memory_int#1_28|, ~C~0.base=v_~C~0.base_11, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_11, thread3Thread1of1ForFork2_#t~mem5=|v_thread3Thread1of1ForFork2_#t~mem5_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~mem5][346], [323#(and (<= 1 ~N~0) (<= (+ thread1Thread1of1ForFork0_~i~0 1) ~N~0)), Black: 512#(= thread3Thread1of1ForFork2_~i~2 0), Black: 514#(and (= ~p~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), 1342#(and (<= 0 thread2Thread1of1ForFork1_~i~1) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), 735#true, Black: 1018#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1))), Black: 1044#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 1016#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1))), Black: 1008#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~p~0 0) (<= ~N~0 1) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 1038#(and (<= ~p~0 0) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2)), Black: 998#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 1042#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~N~0 1) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 739#(<= ~N~0 1), Black: 1030#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 1040#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 1010#(and (= thread3Thread1of1ForFork2_~i~2 0) (= ~p~0 thread2Thread1of1ForFork1_~i~1) (<= ~N~0 1) (<= thread2Thread1of1ForFork1_~i~1 0)), 9#L59-6true, Black: 1000#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~N~0 1) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 1024#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1))), Black: 1006#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~p~0 0) (<= ~N~0 1)), 721#true, Black: 738#(<= thread1Thread1of1ForFork0_~i~0 1), Black: 1014#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1))), Black: 740#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~N~0 1)), Black: 737#(= thread1Thread1of1ForFork0_~i~0 0), Black: 1026#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 1036#(and (<= ~p~0 0) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 811#(and (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2)), Black: 1022#(and (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 1002#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 1028#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~N~0 1)), 57#(<= 1 ~N~0), Black: 1004#(and (<= ~N~0 1) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), 40#L70-3true, Black: 898#(<= ~p~0 thread3Thread1of1ForFork2_~i~2), Black: 51#(and (= ~asum~0 0) (<= (mod ~N~0 4294967296) 0) (= ~csum~0 0)), Black: 50#(and (= ~asum~0 0) (or (and (<= 0 ~N~0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0)) (< (mod ~N~0 4294967296) 1)) (= ~csum~0 0)), 335#true, Black: 184#(and (<= 1 ~N~0) (<= (+ |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 1654#(and (<= (+ thread1Thread1of1ForFork0_~i~0 1) ~N~0) (<= 1 thread2Thread1of1ForFork1_~i~1) (<= 2 ~N~0)), 498#true, Black: 531#(<= 1 ~N~0), Black: 337#(= ~p~0 0), Black: 338#(and (= ~p~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), 495#(and (<= 1 ~N~0) (<= (+ thread2Thread1of1ForFork1_~i~1 1) ~N~0)), Black: 1360#(and (<= thread3Thread1of1ForFork2_~i~2 thread2Thread1of1ForFork1_~i~1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 1358#(and (<= (+ thread3Thread1of1ForFork2_~i~2 1) thread2Thread1of1ForFork1_~i~1) (<= thread3Thread1of1ForFork2_~i~2 1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= (+ 2 thread3Thread1of1ForFork2_~i~2) ~N~0) (<= 2 ~N~0)), Black: 1340#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork2_~i~2 0) (<= 1 thread2Thread1of1ForFork1_~i~1)), Black: 1076#(= thread2Thread1of1ForFork1_~i~1 0), Black: 1108#(<= 0 thread2Thread1of1ForFork1_~i~1), Black: 1362#(and (<= (+ thread3Thread1of1ForFork2_~i~2 1) thread2Thread1of1ForFork1_~i~1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 730#(and (= ~p~0 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread2Thread1of1ForFork1_~i~1 0)), Black: 1078#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= 1 thread2Thread1of1ForFork1_~i~1)), Black: 724#(= ~p~0 0), Black: 1178#(and (<= thread3Thread1of1ForFork2_~i~2 1) (<= 2 ~N~0)), Black: 725#(and (= ~p~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 1077#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread2Thread1of1ForFork1_~i~1 0)), Black: 1352#(and (<= thread3Thread1of1ForFork2_~i~2 thread2Thread1of1ForFork1_~i~1) (<= thread3Thread1of1ForFork2_~i~2 1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= 2 ~N~0)), Black: 1364#(and (<= thread3Thread1of1ForFork2_~i~2 1) (<= (+ 2 thread3Thread1of1ForFork2_~i~2) ~N~0) (<= 2 ~N~0)), Black: 1354#(and (<= thread3Thread1of1ForFork2_~i~2 thread2Thread1of1ForFork1_~i~1) (<= 0 thread2Thread1of1ForFork1_~i~1)), Black: 1080#(<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0), 37#L88-4true, Black: 1074#true, Black: 1127#(and (<= 0 thread2Thread1of1ForFork1_~i~1) (<= thread3Thread1of1ForFork2_~i~2 0)), Black: 1346#(and (<= 0 thread2Thread1of1ForFork1_~i~1) (<= thread3Thread1of1ForFork2_~i~2 0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 1348#(and (<= thread3Thread1of1ForFork2_~i~2 0) (<= 1 thread2Thread1of1ForFork1_~i~1) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 1366#(and (<= (+ thread3Thread1of1ForFork2_~i~2 1) thread2Thread1of1ForFork1_~i~1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= (+ 2 thread3Thread1of1ForFork2_~i~2) ~N~0)), Black: 1245#(< (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0), Black: 1143#(and (<= thread3Thread1of1ForFork2_~i~2 0) (<= 1 thread2Thread1of1ForFork1_~i~1)), Black: 1356#(and (<= (+ thread3Thread1of1ForFork2_~i~2 1) thread2Thread1of1ForFork1_~i~1) (<= thread3Thread1of1ForFork2_~i~2 1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= 2 ~N~0)), Black: 501#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread2Thread1of1ForFork1_~i~1 0)), 13#L51-3true, Black: 500#(= thread2Thread1of1ForFork1_~i~1 0), Black: 502#(and (= ~p~0 0) (= thread3Thread1of1ForFork2_~i~2 0))]) [2025-01-09 16:48:45,283 INFO L294 olderBase$Statistics]: this new event has 52 ancestors and is cut-off event [2025-01-09 16:48:45,283 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2025-01-09 16:48:45,283 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2025-01-09 16:48:45,283 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2025-01-09 16:48:45,357 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([436] L70-->L70-3: Formula: (= |v_thread3Thread1of1ForFork2_#t~mem5_1| (select (select |v_#memory_int#1_28| v_~C~0.base_11) (+ v_~C~0.offset_11 (* v_thread3Thread1of1ForFork2_~i~2_11 4)))) InVars {~C~0.offset=v_~C~0.offset_11, #memory_int#1=|v_#memory_int#1_28|, ~C~0.base=v_~C~0.base_11, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_11} OutVars{~C~0.offset=v_~C~0.offset_11, #memory_int#1=|v_#memory_int#1_28|, ~C~0.base=v_~C~0.base_11, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_11, thread3Thread1of1ForFork2_#t~mem5=|v_thread3Thread1of1ForFork2_#t~mem5_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~mem5][346], [323#(and (<= 1 ~N~0) (<= (+ thread1Thread1of1ForFork0_~i~0 1) ~N~0)), Black: 512#(= thread3Thread1of1ForFork2_~i~2 0), Black: 514#(and (= ~p~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), 1342#(and (<= 0 thread2Thread1of1ForFork1_~i~1) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), 735#true, Black: 1018#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1))), Black: 1044#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 1016#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1))), Black: 1008#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~p~0 0) (<= ~N~0 1) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 1038#(and (<= ~p~0 0) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2)), Black: 998#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 1042#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~N~0 1) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 739#(<= ~N~0 1), Black: 1030#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 1040#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 1010#(and (= thread3Thread1of1ForFork2_~i~2 0) (= ~p~0 thread2Thread1of1ForFork1_~i~1) (<= ~N~0 1) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 1000#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~N~0 1) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 1024#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1))), Black: 1006#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~p~0 0) (<= ~N~0 1)), 721#true, Black: 738#(<= thread1Thread1of1ForFork0_~i~0 1), Black: 1014#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1))), Black: 740#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~N~0 1)), Black: 737#(= thread1Thread1of1ForFork0_~i~0 0), Black: 1026#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 1036#(and (<= ~p~0 0) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 811#(and (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2)), Black: 1022#(and (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 1002#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 1028#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~N~0 1)), 57#(<= 1 ~N~0), Black: 1004#(and (<= ~N~0 1) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 898#(<= ~p~0 thread3Thread1of1ForFork2_~i~2), 40#L70-3true, Black: 51#(and (= ~asum~0 0) (<= (mod ~N~0 4294967296) 0) (= ~csum~0 0)), Black: 50#(and (= ~asum~0 0) (or (and (<= 0 ~N~0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0)) (< (mod ~N~0 4294967296) 1)) (= ~csum~0 0)), 335#true, Black: 184#(and (<= 1 ~N~0) (<= (+ |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 1654#(and (<= (+ thread1Thread1of1ForFork0_~i~0 1) ~N~0) (<= 1 thread2Thread1of1ForFork1_~i~1) (<= 2 ~N~0)), 2#L59-3true, 498#true, Black: 531#(<= 1 ~N~0), Black: 337#(= ~p~0 0), Black: 338#(and (= ~p~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), 495#(and (<= 1 ~N~0) (<= (+ thread2Thread1of1ForFork1_~i~1 1) ~N~0)), Black: 1360#(and (<= thread3Thread1of1ForFork2_~i~2 thread2Thread1of1ForFork1_~i~1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 1358#(and (<= (+ thread3Thread1of1ForFork2_~i~2 1) thread2Thread1of1ForFork1_~i~1) (<= thread3Thread1of1ForFork2_~i~2 1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= (+ 2 thread3Thread1of1ForFork2_~i~2) ~N~0) (<= 2 ~N~0)), Black: 1340#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork2_~i~2 0) (<= 1 thread2Thread1of1ForFork1_~i~1)), Black: 1076#(= thread2Thread1of1ForFork1_~i~1 0), Black: 1108#(<= 0 thread2Thread1of1ForFork1_~i~1), Black: 730#(and (= ~p~0 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread2Thread1of1ForFork1_~i~1 0)), Black: 1362#(and (<= (+ thread3Thread1of1ForFork2_~i~2 1) thread2Thread1of1ForFork1_~i~1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 1078#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= 1 thread2Thread1of1ForFork1_~i~1)), Black: 724#(= ~p~0 0), Black: 1178#(and (<= thread3Thread1of1ForFork2_~i~2 1) (<= 2 ~N~0)), Black: 725#(and (= ~p~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 1077#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread2Thread1of1ForFork1_~i~1 0)), Black: 1352#(and (<= thread3Thread1of1ForFork2_~i~2 thread2Thread1of1ForFork1_~i~1) (<= thread3Thread1of1ForFork2_~i~2 1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= 2 ~N~0)), Black: 1364#(and (<= thread3Thread1of1ForFork2_~i~2 1) (<= (+ 2 thread3Thread1of1ForFork2_~i~2) ~N~0) (<= 2 ~N~0)), Black: 1354#(and (<= thread3Thread1of1ForFork2_~i~2 thread2Thread1of1ForFork1_~i~1) (<= 0 thread2Thread1of1ForFork1_~i~1)), Black: 1080#(<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0), Black: 1074#true, Black: 1127#(and (<= 0 thread2Thread1of1ForFork1_~i~1) (<= thread3Thread1of1ForFork2_~i~2 0)), Black: 1346#(and (<= 0 thread2Thread1of1ForFork1_~i~1) (<= thread3Thread1of1ForFork2_~i~2 0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 1348#(and (<= thread3Thread1of1ForFork2_~i~2 0) (<= 1 thread2Thread1of1ForFork1_~i~1) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 1366#(and (<= (+ thread3Thread1of1ForFork2_~i~2 1) thread2Thread1of1ForFork1_~i~1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= (+ 2 thread3Thread1of1ForFork2_~i~2) ~N~0)), Black: 1245#(< (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0), Black: 1143#(and (<= thread3Thread1of1ForFork2_~i~2 0) (<= 1 thread2Thread1of1ForFork1_~i~1)), Black: 1356#(and (<= (+ thread3Thread1of1ForFork2_~i~2 1) thread2Thread1of1ForFork1_~i~1) (<= thread3Thread1of1ForFork2_~i~2 1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= 2 ~N~0)), 5#L89true, Black: 501#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread2Thread1of1ForFork1_~i~1 0)), 13#L51-3true, Black: 500#(= thread2Thread1of1ForFork1_~i~1 0), Black: 502#(and (= ~p~0 0) (= thread3Thread1of1ForFork2_~i~2 0))]) [2025-01-09 16:48:45,358 INFO L294 olderBase$Statistics]: this new event has 52 ancestors and is cut-off event [2025-01-09 16:48:45,358 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2025-01-09 16:48:45,358 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2025-01-09 16:48:45,358 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2025-01-09 16:48:45,358 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([436] L70-->L70-3: Formula: (= |v_thread3Thread1of1ForFork2_#t~mem5_1| (select (select |v_#memory_int#1_28| v_~C~0.base_11) (+ v_~C~0.offset_11 (* v_thread3Thread1of1ForFork2_~i~2_11 4)))) InVars {~C~0.offset=v_~C~0.offset_11, #memory_int#1=|v_#memory_int#1_28|, ~C~0.base=v_~C~0.base_11, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_11} OutVars{~C~0.offset=v_~C~0.offset_11, #memory_int#1=|v_#memory_int#1_28|, ~C~0.base=v_~C~0.base_11, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_11, thread3Thread1of1ForFork2_#t~mem5=|v_thread3Thread1of1ForFork2_#t~mem5_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~mem5][346], [323#(and (<= 1 ~N~0) (<= (+ thread1Thread1of1ForFork0_~i~0 1) ~N~0)), Black: 512#(= thread3Thread1of1ForFork2_~i~2 0), Black: 514#(and (= ~p~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), 1342#(and (<= 0 thread2Thread1of1ForFork1_~i~1) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), 735#true, Black: 1018#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1))), Black: 1044#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 1016#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1))), Black: 1008#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~p~0 0) (<= ~N~0 1) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 1038#(and (<= ~p~0 0) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2)), Black: 998#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 1042#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~N~0 1) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 739#(<= ~N~0 1), Black: 1030#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 1040#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 1010#(and (= thread3Thread1of1ForFork2_~i~2 0) (= ~p~0 thread2Thread1of1ForFork1_~i~1) (<= ~N~0 1) (<= thread2Thread1of1ForFork1_~i~1 0)), 9#L59-6true, Black: 1000#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~N~0 1) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 1024#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1))), Black: 1006#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~p~0 0) (<= ~N~0 1)), 721#true, Black: 738#(<= thread1Thread1of1ForFork0_~i~0 1), Black: 1014#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1))), Black: 740#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~N~0 1)), Black: 737#(= thread1Thread1of1ForFork0_~i~0 0), Black: 1026#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 1036#(and (<= ~p~0 0) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 811#(and (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2)), Black: 1022#(and (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 1002#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 1028#(and (<= thread2Thread1of1ForFork1_~i~1 thread3Thread1of1ForFork2_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (<= ~N~0 1)), 57#(<= 1 ~N~0), Black: 1004#(and (<= ~N~0 1) (<= ~p~0 thread3Thread1of1ForFork2_~i~2)), Black: 898#(<= ~p~0 thread3Thread1of1ForFork2_~i~2), 40#L70-3true, Black: 51#(and (= ~asum~0 0) (<= (mod ~N~0 4294967296) 0) (= ~csum~0 0)), Black: 50#(and (= ~asum~0 0) (or (and (<= 0 ~N~0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0)) (< (mod ~N~0 4294967296) 1)) (= ~csum~0 0)), 335#true, Black: 184#(and (<= 1 ~N~0) (<= (+ |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 1654#(and (<= (+ thread1Thread1of1ForFork0_~i~0 1) ~N~0) (<= 1 thread2Thread1of1ForFork1_~i~1) (<= 2 ~N~0)), 498#true, Black: 531#(<= 1 ~N~0), Black: 337#(= ~p~0 0), Black: 338#(and (= ~p~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), 495#(and (<= 1 ~N~0) (<= (+ thread2Thread1of1ForFork1_~i~1 1) ~N~0)), Black: 1360#(and (<= thread3Thread1of1ForFork2_~i~2 thread2Thread1of1ForFork1_~i~1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 1358#(and (<= (+ thread3Thread1of1ForFork2_~i~2 1) thread2Thread1of1ForFork1_~i~1) (<= thread3Thread1of1ForFork2_~i~2 1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= (+ 2 thread3Thread1of1ForFork2_~i~2) ~N~0) (<= 2 ~N~0)), Black: 1340#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork2_~i~2 0) (<= 1 thread2Thread1of1ForFork1_~i~1)), Black: 1076#(= thread2Thread1of1ForFork1_~i~1 0), Black: 1108#(<= 0 thread2Thread1of1ForFork1_~i~1), Black: 730#(and (= ~p~0 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread2Thread1of1ForFork1_~i~1 0)), Black: 1362#(and (<= (+ thread3Thread1of1ForFork2_~i~2 1) thread2Thread1of1ForFork1_~i~1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 1078#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= 1 thread2Thread1of1ForFork1_~i~1)), Black: 724#(= ~p~0 0), Black: 1178#(and (<= thread3Thread1of1ForFork2_~i~2 1) (<= 2 ~N~0)), Black: 725#(and (= ~p~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 1077#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread2Thread1of1ForFork1_~i~1 0)), Black: 1352#(and (<= thread3Thread1of1ForFork2_~i~2 thread2Thread1of1ForFork1_~i~1) (<= thread3Thread1of1ForFork2_~i~2 1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= 2 ~N~0)), Black: 1364#(and (<= thread3Thread1of1ForFork2_~i~2 1) (<= (+ 2 thread3Thread1of1ForFork2_~i~2) ~N~0) (<= 2 ~N~0)), Black: 1354#(and (<= thread3Thread1of1ForFork2_~i~2 thread2Thread1of1ForFork1_~i~1) (<= 0 thread2Thread1of1ForFork1_~i~1)), Black: 1080#(<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0), Black: 1074#true, Black: 1127#(and (<= 0 thread2Thread1of1ForFork1_~i~1) (<= thread3Thread1of1ForFork2_~i~2 0)), Black: 1346#(and (<= 0 thread2Thread1of1ForFork1_~i~1) (<= thread3Thread1of1ForFork2_~i~2 0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 1348#(and (<= thread3Thread1of1ForFork2_~i~2 0) (<= 1 thread2Thread1of1ForFork1_~i~1) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 1366#(and (<= (+ thread3Thread1of1ForFork2_~i~2 1) thread2Thread1of1ForFork1_~i~1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= (+ 2 thread3Thread1of1ForFork2_~i~2) ~N~0)), Black: 1245#(< (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0), Black: 1143#(and (<= thread3Thread1of1ForFork2_~i~2 0) (<= 1 thread2Thread1of1ForFork1_~i~1)), Black: 1356#(and (<= (+ thread3Thread1of1ForFork2_~i~2 1) thread2Thread1of1ForFork1_~i~1) (<= thread3Thread1of1ForFork2_~i~2 1) (<= 0 thread2Thread1of1ForFork1_~i~1) (<= 2 ~N~0)), 5#L89true, Black: 501#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread2Thread1of1ForFork1_~i~1 0)), 13#L51-3true, Black: 500#(= thread2Thread1of1ForFork1_~i~1 0), Black: 502#(and (= ~p~0 0) (= thread3Thread1of1ForFork2_~i~2 0))]) [2025-01-09 16:48:45,358 INFO L294 olderBase$Statistics]: this new event has 53 ancestors and is cut-off event [2025-01-09 16:48:45,358 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2025-01-09 16:48:45,358 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2025-01-09 16:48:45,358 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2025-01-09 16:48:45,581 INFO L124 PetriNetUnfolderBase]: 35680/57574 cut-off events. [2025-01-09 16:48:45,581 INFO L125 PetriNetUnfolderBase]: For 822169/829738 co-relation queries the response was YES. [2025-01-09 16:48:46,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 322209 conditions, 57574 events. 35680/57574 cut-off events. For 822169/829738 co-relation queries the response was YES. Maximal size of possible extension queue 1456. Compared 450400 event pairs, 3285 based on Foata normal form. 2081/57673 useless extension candidates. Maximal degree in co-relation 322121. Up to 13668 conditions per place. [2025-01-09 16:48:46,718 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 562 selfloop transitions, 220 changer transitions 4/854 dead transitions. [2025-01-09 16:48:46,719 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 854 transitions, 11952 flow [2025-01-09 16:48:46,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 16:48:46,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-01-09 16:48:46,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 322 transitions. [2025-01-09 16:48:46,720 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5235772357723577 [2025-01-09 16:48:46,720 INFO L175 Difference]: Start difference. First operand has 184 places, 373 transitions, 4698 flow. Second operand 15 states and 322 transitions. [2025-01-09 16:48:46,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 854 transitions, 11952 flow [2025-01-09 16:48:50,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 854 transitions, 10849 flow, removed 545 selfloop flow, removed 1 redundant places. [2025-01-09 16:48:50,944 INFO L231 Difference]: Finished difference. Result has 203 places, 535 transitions, 6550 flow [2025-01-09 16:48:50,944 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4263, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=373, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=297, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=6550, PETRI_PLACES=203, PETRI_TRANSITIONS=535} [2025-01-09 16:48:50,944 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 162 predicate places. [2025-01-09 16:48:50,944 INFO L471 AbstractCegarLoop]: Abstraction has has 203 places, 535 transitions, 6550 flow [2025-01-09 16:48:50,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.333333333333334) internal successors, (129), 9 states have internal predecessors, (129), 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) [2025-01-09 16:48:50,944 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:48:50,945 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:48:50,950 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-09 16:48:51,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:48:51,145 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)] === [2025-01-09 16:48:51,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:48:51,146 INFO L85 PathProgramCache]: Analyzing trace with hash -951171659, now seen corresponding path program 5 times [2025-01-09 16:48:51,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:48:51,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029358929] [2025-01-09 16:48:51,146 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 16:48:51,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:48:51,158 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 42 statements into 3 equivalence classes. [2025-01-09 16:48:51,171 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 16:48:51,171 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-01-09 16:48:51,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:48:51,220 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 16:48:51,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:48:51,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029358929] [2025-01-09 16:48:51,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029358929] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:48:51,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2021054331] [2025-01-09 16:48:51,221 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 16:48:51,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:48:51,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:48:51,223 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:48:51,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-09 16:48:51,269 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 42 statements into 3 equivalence classes. [2025-01-09 16:48:51,298 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 16:48:51,298 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-01-09 16:48:51,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:48:51,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 16:48:51,304 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:48:51,379 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 16:48:51,379 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:48:51,447 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 16:48:51,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2021054331] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:48:51,447 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:48:51,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2025-01-09 16:48:51,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699615596] [2025-01-09 16:48:51,448 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:48:51,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 16:48:51,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:48:51,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 16:48:51,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2025-01-09 16:48:51,497 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2025-01-09 16:48:51,497 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 535 transitions, 6550 flow. Second operand has 15 states, 15 states have (on average 12.466666666666667) internal successors, (187), 15 states have internal predecessors, (187), 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) [2025-01-09 16:48:51,497 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:48:51,497 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2025-01-09 16:48:51,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:49:04,285 INFO L124 PetriNetUnfolderBase]: 53832/80174 cut-off events. [2025-01-09 16:49:04,286 INFO L125 PetriNetUnfolderBase]: For 1247043/1247410 co-relation queries the response was YES. [2025-01-09 16:49:05,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 482137 conditions, 80174 events. 53832/80174 cut-off events. For 1247043/1247410 co-relation queries the response was YES. Maximal size of possible extension queue 1409. Compared 552181 event pairs, 3419 based on Foata normal form. 949/80764 useless extension candidates. Maximal degree in co-relation 475453. Up to 28421 conditions per place. [2025-01-09 16:49:05,540 INFO L140 encePairwiseOnDemand]: 25/41 looper letters, 0 selfloop transitions, 0 changer transitions 1089/1089 dead transitions. [2025-01-09 16:49:05,540 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 1089 transitions, 14676 flow [2025-01-09 16:49:05,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-01-09 16:49:05,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2025-01-09 16:49:05,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 476 transitions. [2025-01-09 16:49:05,542 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4146341463414634 [2025-01-09 16:49:05,542 INFO L175 Difference]: Start difference. First operand has 203 places, 535 transitions, 6550 flow. Second operand 28 states and 476 transitions. [2025-01-09 16:49:05,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 1089 transitions, 14676 flow [2025-01-09 16:49:16,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 1089 transitions, 13739 flow, removed 274 selfloop flow, removed 16 redundant places. [2025-01-09 16:49:16,579 INFO L231 Difference]: Finished difference. Result has 194 places, 0 transitions, 0 flow [2025-01-09 16:49:16,579 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5240, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=459, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=459, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=0, PETRI_PLACES=194, PETRI_TRANSITIONS=0} [2025-01-09 16:49:16,580 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 153 predicate places. [2025-01-09 16:49:16,580 INFO L471 AbstractCegarLoop]: Abstraction has has 194 places, 0 transitions, 0 flow [2025-01-09 16:49:16,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 12.466666666666667) internal successors, (187), 15 states have internal predecessors, (187), 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) [2025-01-09 16:49:16,583 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2025-01-09 16:49:16,583 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-01-09 16:49:16,583 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-01-09 16:49:16,583 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-01-09 16:49:16,590 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-01-09 16:49:16,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-01-09 16:49:16,784 INFO L422 BasicCegarLoop]: Path program histogram: [5, 3, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:49:16,787 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-09 16:49:16,787 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 16:49:16,790 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 04:49:16 BasicIcfg [2025-01-09 16:49:16,790 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 16:49:16,791 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 16:49:16,791 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 16:49:16,791 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 16:49:16,792 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:48:21" (3/4) ... [2025-01-09 16:49:16,793 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 16:49:16,795 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-01-09 16:49:16,795 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-01-09 16:49:16,796 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-01-09 16:49:16,799 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 106 nodes and edges [2025-01-09 16:49:16,799 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 26 nodes and edges [2025-01-09 16:49:16,799 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-01-09 16:49:16,799 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-01-09 16:49:16,860 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 16:49:16,861 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 16:49:16,861 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 16:49:16,862 INFO L158 Benchmark]: Toolchain (without parser) took 56387.67ms. Allocated memory was 167.8MB in the beginning and 4.8GB in the end (delta: 4.6GB). Free memory was 122.5MB in the beginning and 2.8GB in the end (delta: -2.6GB). Peak memory consumption was 1.9GB. Max. memory is 16.1GB. [2025-01-09 16:49:16,862 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 121.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 16:49:16,862 INFO L158 Benchmark]: CACSL2BoogieTranslator took 167.41ms. Allocated memory is still 167.8MB. Free memory was 122.5MB in the beginning and 110.5MB in the end (delta: 12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 16:49:16,863 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.48ms. Allocated memory is still 167.8MB. Free memory was 110.5MB in the beginning and 109.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 16:49:16,864 INFO L158 Benchmark]: Boogie Preprocessor took 29.76ms. Allocated memory is still 167.8MB. Free memory was 109.1MB in the beginning and 107.1MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 16:49:16,864 INFO L158 Benchmark]: RCFGBuilder took 451.80ms. Allocated memory is still 167.8MB. Free memory was 107.1MB in the beginning and 69.1MB in the end (delta: 38.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-01-09 16:49:16,865 INFO L158 Benchmark]: TraceAbstraction took 55643.07ms. Allocated memory was 167.8MB in the beginning and 4.8GB in the end (delta: 4.6GB). Free memory was 68.5MB in the beginning and 2.8GB in the end (delta: -2.7GB). Peak memory consumption was 6.7GB. Max. memory is 16.1GB. [2025-01-09 16:49:16,866 INFO L158 Benchmark]: Witness Printer took 69.92ms. Allocated memory is still 4.8GB. Free memory was 2.8GB in the beginning and 2.8GB in the end (delta: 5.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 16:49:16,866 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 121.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 167.41ms. Allocated memory is still 167.8MB. Free memory was 122.5MB in the beginning and 110.5MB in the end (delta: 12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 19.48ms. Allocated memory is still 167.8MB. Free memory was 110.5MB in the beginning and 109.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 29.76ms. Allocated memory is still 167.8MB. Free memory was 109.1MB in the beginning and 107.1MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 451.80ms. Allocated memory is still 167.8MB. Free memory was 107.1MB in the beginning and 69.1MB in the end (delta: 38.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 55643.07ms. Allocated memory was 167.8MB in the beginning and 4.8GB in the end (delta: 4.6GB). Free memory was 68.5MB in the beginning and 2.8GB in the end (delta: -2.7GB). Peak memory consumption was 6.7GB. Max. memory is 16.1GB. * Witness Printer took 69.92ms. Allocated memory is still 4.8GB. Free memory was 2.8GB in the beginning and 2.8GB in the end (delta: 5.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 94]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 59 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 55.5s, OverallIterations: 15, TraceHistogramMax: 2, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 50.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1365 SdHoareTripleChecker+Valid, 3.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1281 mSDsluCounter, 201 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 169 mSDsCounter, 64 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6083 IncrementalHoareTripleChecker+Invalid, 6147 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 64 mSolverCounterUnsat, 32 mSDtfsCounter, 6083 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 702 GetRequests, 516 SyntacticMatches, 15 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 923 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6550occurred in iteration=14, InterpolantAutomatonStates: 166, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 731 NumberOfCodeBlocks, 720 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 967 ConstructedInterpolants, 0 QuantifiedInterpolants, 2915 SizeOfPredicates, 27 NumberOfNonLiveVariables, 1722 ConjunctsInSsa, 53 ConjunctsInUnsatCore, 31 InterpolantComputations, 11 PerfectInterpolantSequences, 80/133 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-09 16:49:16,878 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE