./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 735b3cc8 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-simple-array-sum.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0c7c5c48eda3eba87519854c38b7495ee97c35417d2a6e287791b53fe49d6c07 --- Real Ultimate output --- This is Ultimate 0.3.0-?-735b3cc-m [2025-03-14 01:10:15,030 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 01:10:15,088 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-14 01:10:15,094 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-14 01:10:15,096 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-14 01:10:15,121 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 01:10:15,122 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-14 01:10:15,122 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-14 01:10:15,123 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-14 01:10:15,123 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-14 01:10:15,123 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 01:10:15,123 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 01:10:15,124 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 01:10:15,124 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 01:10:15,124 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 01:10:15,124 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 01:10:15,124 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 01:10:15,124 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 01:10:15,124 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 01:10:15,124 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 01:10:15,125 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 01:10:15,125 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 01:10:15,125 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 01:10:15,125 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 01:10:15,125 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 01:10:15,125 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 01:10:15,125 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-14 01:10:15,125 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 01:10:15,125 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-14 01:10:15,125 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 01:10:15,126 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-14 01:10:15,126 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 01:10:15,126 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:10:15,126 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 01:10:15,126 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 01:10:15,126 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-14 01:10:15,126 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-14 01:10:15,127 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 01:10:15,127 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 01:10:15,127 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 01:10:15,127 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 01:10:15,127 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-14 01:10:15,127 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-14 01:10:15,127 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/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-03-14 01:10:15,388 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 01:10:15,396 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 01:10:15,397 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 01:10:15,398 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 01:10:15,399 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 01:10:15,400 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-simple-array-sum.wvr.c [2025-03-14 01:10:16,654 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b193c2bf/976eb36072944aaf89a7205f3d16ddc3/FLAG6b1ce03ad [2025-03-14 01:10:16,959 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 01:10:16,960 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-simple-array-sum.wvr.c [2025-03-14 01:10:16,970 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b193c2bf/976eb36072944aaf89a7205f3d16ddc3/FLAG6b1ce03ad [2025-03-14 01:10:17,252 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b193c2bf/976eb36072944aaf89a7205f3d16ddc3 [2025-03-14 01:10:17,254 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 01:10:17,256 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-14 01:10:17,257 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 01:10:17,258 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 01:10:17,261 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 01:10:17,262 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:10:17" (1/1) ... [2025-03-14 01:10:17,264 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30eec23c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:10:17, skipping insertion in model container [2025-03-14 01:10:17,264 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:10:17" (1/1) ... [2025-03-14 01:10:17,279 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 01:10:17,414 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-simple-array-sum.wvr.c[2429,2442] [2025-03-14 01:10:17,423 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:10:17,430 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 01:10:17,448 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-simple-array-sum.wvr.c[2429,2442] [2025-03-14 01:10:17,451 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:10:17,466 INFO L204 MainTranslator]: Completed translation [2025-03-14 01:10:17,466 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:10:17 WrapperNode [2025-03-14 01:10:17,466 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 01:10:17,467 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 01:10:17,467 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 01:10:17,467 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 01:10:17,472 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:10:17" (1/1) ... [2025-03-14 01:10:17,476 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:10:17" (1/1) ... [2025-03-14 01:10:17,493 INFO L138 Inliner]: procedures = 23, calls = 20, calls flagged for inlining = 7, calls inlined = 9, statements flattened = 103 [2025-03-14 01:10:17,496 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 01:10:17,496 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 01:10:17,496 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 01:10:17,497 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 01:10:17,504 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:10:17" (1/1) ... [2025-03-14 01:10:17,504 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:10:17" (1/1) ... [2025-03-14 01:10:17,511 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:10:17" (1/1) ... [2025-03-14 01:10:17,528 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-03-14 01:10:17,530 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:10:17" (1/1) ... [2025-03-14 01:10:17,531 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:10:17" (1/1) ... [2025-03-14 01:10:17,536 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:10:17" (1/1) ... [2025-03-14 01:10:17,540 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:10:17" (1/1) ... [2025-03-14 01:10:17,542 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:10:17" (1/1) ... [2025-03-14 01:10:17,542 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:10:17" (1/1) ... [2025-03-14 01:10:17,546 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 01:10:17,550 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-14 01:10:17,550 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-14 01:10:17,550 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-14 01:10:17,551 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:10:17" (1/1) ... [2025-03-14 01:10:17,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:10:17,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:10:17,581 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-14 01:10:17,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-14 01:10:17,603 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 01:10:17,604 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-14 01:10:17,604 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-14 01:10:17,604 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-14 01:10:17,604 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-14 01:10:17,604 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-14 01:10:17,604 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-14 01:10:17,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-14 01:10:17,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-14 01:10:17,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-14 01:10:17,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-14 01:10:17,605 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-14 01:10:17,605 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 01:10:17,605 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 01:10:17,605 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-14 01:10:17,605 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-14 01:10:17,606 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-14 01:10:17,689 INFO L256 CfgBuilder]: Building ICFG [2025-03-14 01:10:17,691 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 01:10:17,934 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 01:10:17,935 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 01:10:17,935 INFO L318 CfgBuilder]: Performing block encoding [2025-03-14 01:10:18,129 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 01:10:18,130 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:10:18 BoogieIcfgContainer [2025-03-14 01:10:18,130 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-14 01:10:18,132 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 01:10:18,132 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 01:10:18,137 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 01:10:18,138 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 01:10:17" (1/3) ... [2025-03-14 01:10:18,138 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d6caea9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:10:18, skipping insertion in model container [2025-03-14 01:10:18,138 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:10:17" (2/3) ... [2025-03-14 01:10:18,139 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d6caea9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:10:18, skipping insertion in model container [2025-03-14 01:10:18,139 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:10:18" (3/3) ... [2025-03-14 01:10:18,140 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-simple-array-sum.wvr.c [2025-03-14 01:10:18,155 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 01:10:18,157 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-03-14 01:10:18,157 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 01:10:18,214 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-14 01:10:18,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 41 transitions, 103 flow [2025-03-14 01:10:18,273 INFO L124 PetriNetUnfolderBase]: 6/38 cut-off events. [2025-03-14 01:10:18,275 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-14 01:10:18,279 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 56 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-03-14 01:10:18,280 INFO L82 GeneralOperation]: Start removeDead. Operand has 45 places, 41 transitions, 103 flow [2025-03-14 01:10:18,283 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 41 places, 37 transitions, 92 flow [2025-03-14 01:10:18,296 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:10:18,309 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;@3ef56679, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:10:18,310 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-14 01:10:18,325 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:10:18,325 INFO L124 PetriNetUnfolderBase]: 6/36 cut-off events. [2025-03-14 01:10:18,325 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-14 01:10:18,326 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:10:18,326 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-03-14 01:10:18,327 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-03-14 01:10:18,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:10:18,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1990313920, now seen corresponding path program 1 times [2025-03-14 01:10:18,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:10:18,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175999033] [2025-03-14 01:10:18,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:10:18,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:10:18,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-14 01:10:18,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-14 01:10:18,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:10:18,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:10:19,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:10:19,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:10:19,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175999033] [2025-03-14 01:10:19,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175999033] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:10:19,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:10:19,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 01:10:19,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208608038] [2025-03-14 01:10:19,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:10:19,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-14 01:10:19,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:10:19,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-14 01:10:19,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-14 01:10:19,179 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2025-03-14 01:10:19,182 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 37 transitions, 92 flow. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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-03-14 01:10:19,182 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:10:19,182 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2025-03-14 01:10:19,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:10:19,571 INFO L124 PetriNetUnfolderBase]: 1474/2293 cut-off events. [2025-03-14 01:10:19,572 INFO L125 PetriNetUnfolderBase]: For 185/185 co-relation queries the response was YES. [2025-03-14 01:10:19,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4505 conditions, 2293 events. 1474/2293 cut-off events. For 185/185 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 11683 event pairs, 952 based on Foata normal form. 1/2175 useless extension candidates. Maximal degree in co-relation 2189. Up to 1226 conditions per place. [2025-03-14 01:10:19,603 INFO L140 encePairwiseOnDemand]: 35/41 looper letters, 51 selfloop transitions, 5 changer transitions 1/64 dead transitions. [2025-03-14 01:10:19,605 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 64 transitions, 278 flow [2025-03-14 01:10:19,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-14 01:10:19,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-14 01:10:19,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 98 transitions. [2025-03-14 01:10:19,616 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5975609756097561 [2025-03-14 01:10:19,618 INFO L175 Difference]: Start difference. First operand has 41 places, 37 transitions, 92 flow. Second operand 4 states and 98 transitions. [2025-03-14 01:10:19,618 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 64 transitions, 278 flow [2025-03-14 01:10:19,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 64 transitions, 254 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-14 01:10:19,631 INFO L231 Difference]: Finished difference. Result has 40 places, 41 transitions, 114 flow [2025-03-14 01:10:19,632 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-03-14 01:10:19,635 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, -1 predicate places. [2025-03-14 01:10:19,636 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 41 transitions, 114 flow [2025-03-14 01:10:19,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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-03-14 01:10:19,637 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:10:19,637 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-03-14 01:10:19,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 01:10:19,638 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-03-14 01:10:19,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:10:19,639 INFO L85 PathProgramCache]: Analyzing trace with hash 801851109, now seen corresponding path program 1 times [2025-03-14 01:10:19,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:10:19,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892058488] [2025-03-14 01:10:19,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:10:19,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:10:19,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-14 01:10:19,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-14 01:10:19,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:10:19,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:10:19,793 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:10:19,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:10:19,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892058488] [2025-03-14 01:10:19,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892058488] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:10:19,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1162223443] [2025-03-14 01:10:19,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:10:19,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:10:19,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:10:19,799 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:10:19,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-14 01:10:19,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-14 01:10:19,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-14 01:10:19,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:10:19,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:10:19,894 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-14 01:10:19,898 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:10:19,970 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:10:19,972 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:10:20,014 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:10:20,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1162223443] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-14 01:10:20,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-14 01:10:20,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2025-03-14 01:10:20,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627916668] [2025-03-14 01:10:20,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:10:20,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 01:10:20,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:10:20,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 01:10:20,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-14 01:10:20,028 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2025-03-14 01:10:20,029 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 41 transitions, 114 flow. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 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-03-14 01:10:20,029 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:10:20,029 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2025-03-14 01:10:20,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:10:20,469 INFO L124 PetriNetUnfolderBase]: 2892/4504 cut-off events. [2025-03-14 01:10:20,469 INFO L125 PetriNetUnfolderBase]: For 419/419 co-relation queries the response was YES. [2025-03-14 01:10:20,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9315 conditions, 4504 events. 2892/4504 cut-off events. For 419/419 co-relation queries the response was YES. Maximal size of possible extension queue 257. Compared 25985 event pairs, 2113 based on Foata normal form. 0/4274 useless extension candidates. Maximal degree in co-relation 7176. Up to 2025 conditions per place. [2025-03-14 01:10:20,501 INFO L140 encePairwiseOnDemand]: 36/41 looper letters, 58 selfloop transitions, 6 changer transitions 0/71 dead transitions. [2025-03-14 01:10:20,501 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 71 transitions, 320 flow [2025-03-14 01:10:20,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-14 01:10:20,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-14 01:10:20,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 111 transitions. [2025-03-14 01:10:20,504 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5414634146341464 [2025-03-14 01:10:20,504 INFO L175 Difference]: Start difference. First operand has 40 places, 41 transitions, 114 flow. Second operand 5 states and 111 transitions. [2025-03-14 01:10:20,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 71 transitions, 320 flow [2025-03-14 01:10:20,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 71 transitions, 312 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-14 01:10:20,506 INFO L231 Difference]: Finished difference. Result has 45 places, 44 transitions, 138 flow [2025-03-14 01:10:20,506 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-03-14 01:10:20,509 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 4 predicate places. [2025-03-14 01:10:20,509 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 44 transitions, 138 flow [2025-03-14 01:10:20,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 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-03-14 01:10:20,510 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:10:20,510 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-03-14 01:10:20,517 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-14 01:10:20,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:10:20,711 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-03-14 01:10:20,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:10:20,711 INFO L85 PathProgramCache]: Analyzing trace with hash 2032431742, now seen corresponding path program 1 times [2025-03-14 01:10:20,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:10:20,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921421832] [2025-03-14 01:10:20,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:10:20,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:10:20,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-14 01:10:20,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-14 01:10:20,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:10:20,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:10:20,808 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:10:20,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:10:20,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921421832] [2025-03-14 01:10:20,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921421832] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:10:20,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [773658908] [2025-03-14 01:10:20,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:10:20,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:10:20,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:10:20,812 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:10:20,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-14 01:10:20,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-14 01:10:20,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-14 01:10:20,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:10:20,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:10:20,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-14 01:10:20,912 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:10:20,966 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:10:20,966 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:10:21,003 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:10:21,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [773658908] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-14 01:10:21,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-14 01:10:21,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2025-03-14 01:10:21,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235815601] [2025-03-14 01:10:21,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:10:21,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 01:10:21,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:10:21,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 01:10:21,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-14 01:10:21,015 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2025-03-14 01:10:21,015 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 44 transitions, 138 flow. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 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-03-14 01:10:21,016 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:10:21,016 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2025-03-14 01:10:21,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:10:21,486 INFO L124 PetriNetUnfolderBase]: 3466/5234 cut-off events. [2025-03-14 01:10:21,487 INFO L125 PetriNetUnfolderBase]: For 303/303 co-relation queries the response was YES. [2025-03-14 01:10:21,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10773 conditions, 5234 events. 3466/5234 cut-off events. For 303/303 co-relation queries the response was YES. Maximal size of possible extension queue 276. Compared 29371 event pairs, 1402 based on Foata normal form. 0/4849 useless extension candidates. Maximal degree in co-relation 8868. Up to 1478 conditions per place. [2025-03-14 01:10:21,521 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 90 selfloop transitions, 11 changer transitions 0/107 dead transitions. [2025-03-14 01:10:21,522 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 107 transitions, 494 flow [2025-03-14 01:10:21,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:10:21,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:10:21,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 149 transitions. [2025-03-14 01:10:21,523 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6056910569105691 [2025-03-14 01:10:21,524 INFO L175 Difference]: Start difference. First operand has 45 places, 44 transitions, 138 flow. Second operand 6 states and 149 transitions. [2025-03-14 01:10:21,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 107 transitions, 494 flow [2025-03-14 01:10:21,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 107 transitions, 490 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-14 01:10:21,527 INFO L231 Difference]: Finished difference. Result has 51 places, 49 transitions, 186 flow [2025-03-14 01:10:21,527 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-03-14 01:10:21,528 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 10 predicate places. [2025-03-14 01:10:21,528 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 49 transitions, 186 flow [2025-03-14 01:10:21,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 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-03-14 01:10:21,528 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:10:21,528 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-03-14 01:10:21,539 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-14 01:10:21,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-14 01:10:21,729 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-03-14 01:10:21,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:10:21,730 INFO L85 PathProgramCache]: Analyzing trace with hash -729988007, now seen corresponding path program 1 times [2025-03-14 01:10:21,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:10:21,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198145609] [2025-03-14 01:10:21,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:10:21,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:10:21,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-14 01:10:21,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-14 01:10:21,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:10:21,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:10:21,808 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:10:21,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:10:21,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198145609] [2025-03-14 01:10:21,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198145609] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:10:21,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:10:21,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-14 01:10:21,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747355911] [2025-03-14 01:10:21,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:10:21,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 01:10:21,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:10:21,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 01:10:21,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-14 01:10:21,819 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2025-03-14 01:10:21,820 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 49 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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-03-14 01:10:21,820 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:10:21,820 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2025-03-14 01:10:21,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:10:22,190 INFO L124 PetriNetUnfolderBase]: 2455/3863 cut-off events. [2025-03-14 01:10:22,191 INFO L125 PetriNetUnfolderBase]: For 1572/1572 co-relation queries the response was YES. [2025-03-14 01:10:22,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8736 conditions, 3863 events. 2455/3863 cut-off events. For 1572/1572 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 21303 event pairs, 1471 based on Foata normal form. 220/3928 useless extension candidates. Maximal degree in co-relation 4504. Up to 1609 conditions per place. [2025-03-14 01:10:22,215 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 69 selfloop transitions, 8 changer transitions 4/87 dead transitions. [2025-03-14 01:10:22,216 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 87 transitions, 436 flow [2025-03-14 01:10:22,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:10:22,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:10:22,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 130 transitions. [2025-03-14 01:10:22,217 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5284552845528455 [2025-03-14 01:10:22,218 INFO L175 Difference]: Start difference. First operand has 51 places, 49 transitions, 186 flow. Second operand 6 states and 130 transitions. [2025-03-14 01:10:22,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 87 transitions, 436 flow [2025-03-14 01:10:22,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 87 transitions, 430 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:10:22,222 INFO L231 Difference]: Finished difference. Result has 56 places, 45 transitions, 184 flow [2025-03-14 01:10:22,222 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=184, PETRI_PLACES=56, PETRI_TRANSITIONS=45} [2025-03-14 01:10:22,223 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 15 predicate places. [2025-03-14 01:10:22,223 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 45 transitions, 184 flow [2025-03-14 01:10:22,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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-03-14 01:10:22,223 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:10:22,223 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-03-14 01:10:22,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-14 01:10:22,223 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-03-14 01:10:22,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:10:22,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1881026838, now seen corresponding path program 1 times [2025-03-14 01:10:22,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:10:22,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424365756] [2025-03-14 01:10:22,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:10:22,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:10:22,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-14 01:10:22,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-14 01:10:22,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:10:22,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:10:22,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:10:22,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:10:22,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424365756] [2025-03-14 01:10:22,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424365756] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:10:22,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:10:22,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 01:10:22,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259576716] [2025-03-14 01:10:22,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:10:22,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-14 01:10:22,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:10:22,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-14 01:10:22,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-14 01:10:22,296 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2025-03-14 01:10:22,297 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 45 transitions, 184 flow. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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-03-14 01:10:22,297 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:10:22,297 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2025-03-14 01:10:22,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:10:22,594 INFO L124 PetriNetUnfolderBase]: 2565/4068 cut-off events. [2025-03-14 01:10:22,594 INFO L125 PetriNetUnfolderBase]: For 3523/3523 co-relation queries the response was YES. [2025-03-14 01:10:22,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9772 conditions, 4068 events. 2565/4068 cut-off events. For 3523/3523 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 21151 event pairs, 568 based on Foata normal form. 92/4144 useless extension candidates. Maximal degree in co-relation 5303. Up to 2578 conditions per place. [2025-03-14 01:10:22,648 INFO L140 encePairwiseOnDemand]: 37/41 looper letters, 67 selfloop transitions, 4 changer transitions 0/78 dead transitions. [2025-03-14 01:10:22,648 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 78 transitions, 456 flow [2025-03-14 01:10:22,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-14 01:10:22,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-14 01:10:22,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 97 transitions. [2025-03-14 01:10:22,651 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5914634146341463 [2025-03-14 01:10:22,651 INFO L175 Difference]: Start difference. First operand has 56 places, 45 transitions, 184 flow. Second operand 4 states and 97 transitions. [2025-03-14 01:10:22,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 78 transitions, 456 flow [2025-03-14 01:10:22,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 78 transitions, 405 flow, removed 11 selfloop flow, removed 6 redundant places. [2025-03-14 01:10:22,657 INFO L231 Difference]: Finished difference. Result has 55 places, 48 transitions, 178 flow [2025-03-14 01:10:22,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-03-14 01:10:22,658 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 14 predicate places. [2025-03-14 01:10:22,659 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 48 transitions, 178 flow [2025-03-14 01:10:22,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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-03-14 01:10:22,659 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:10:22,659 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-03-14 01:10:22,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-14 01:10:22,659 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-03-14 01:10:22,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:10:22,660 INFO L85 PathProgramCache]: Analyzing trace with hash -10383743, now seen corresponding path program 1 times [2025-03-14 01:10:22,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:10:22,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750581782] [2025-03-14 01:10:22,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:10:22,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:10:22,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-14 01:10:22,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-14 01:10:22,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:10:22,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:10:22,746 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:10:22,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:10:22,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750581782] [2025-03-14 01:10:22,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750581782] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:10:22,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [420552553] [2025-03-14 01:10:22,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:10:22,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:10:22,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:10:22,752 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:10:22,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-14 01:10:22,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-14 01:10:22,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-14 01:10:22,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:10:22,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:10:22,821 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-14 01:10:22,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:10:22,870 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:10:22,870 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:10:22,907 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:10:22,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [420552553] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-14 01:10:22,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-14 01:10:22,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2025-03-14 01:10:22,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668587337] [2025-03-14 01:10:22,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:10:22,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 01:10:22,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:10:22,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 01:10:22,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-14 01:10:22,916 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2025-03-14 01:10:22,917 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 48 transitions, 178 flow. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 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-03-14 01:10:22,917 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:10:22,917 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2025-03-14 01:10:22,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:10:23,297 INFO L124 PetriNetUnfolderBase]: 2537/3996 cut-off events. [2025-03-14 01:10:23,297 INFO L125 PetriNetUnfolderBase]: For 2349/2349 co-relation queries the response was YES. [2025-03-14 01:10:23,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9728 conditions, 3996 events. 2537/3996 cut-off events. For 2349/2349 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 20832 event pairs, 672 based on Foata normal form. 0/3821 useless extension candidates. Maximal degree in co-relation 5339. Up to 1455 conditions per place. [2025-03-14 01:10:23,325 INFO L140 encePairwiseOnDemand]: 34/41 looper letters, 86 selfloop transitions, 8 changer transitions 0/101 dead transitions. [2025-03-14 01:10:23,325 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 101 transitions, 536 flow [2025-03-14 01:10:23,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:10:23,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:10:23,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 138 transitions. [2025-03-14 01:10:23,327 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5609756097560976 [2025-03-14 01:10:23,327 INFO L175 Difference]: Start difference. First operand has 55 places, 48 transitions, 178 flow. Second operand 6 states and 138 transitions. [2025-03-14 01:10:23,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 101 transitions, 536 flow [2025-03-14 01:10:23,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 101 transitions, 536 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:10:23,331 INFO L231 Difference]: Finished difference. Result has 62 places, 52 transitions, 215 flow [2025-03-14 01:10:23,332 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-03-14 01:10:23,332 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 21 predicate places. [2025-03-14 01:10:23,332 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 52 transitions, 215 flow [2025-03-14 01:10:23,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 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-03-14 01:10:23,333 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:10:23,333 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-03-14 01:10:23,348 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-14 01:10:23,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:10:23,534 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-03-14 01:10:23,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:10:23,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1380326540, now seen corresponding path program 1 times [2025-03-14 01:10:23,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:10:23,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860469616] [2025-03-14 01:10:23,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:10:23,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:10:23,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-14 01:10:23,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-14 01:10:23,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:10:23,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:10:23,631 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:10:23,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:10:23,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860469616] [2025-03-14 01:10:23,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860469616] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:10:23,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:10:23,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:10:23,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932058836] [2025-03-14 01:10:23,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:10:23,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 01:10:23,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:10:23,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 01:10:23,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-14 01:10:23,648 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2025-03-14 01:10:23,649 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 52 transitions, 215 flow. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:10:23,649 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:10:23,649 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2025-03-14 01:10:23,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:10:24,048 INFO L124 PetriNetUnfolderBase]: 3531/5766 cut-off events. [2025-03-14 01:10:24,048 INFO L125 PetriNetUnfolderBase]: For 3995/4031 co-relation queries the response was YES. [2025-03-14 01:10:24,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14886 conditions, 5766 events. 3531/5766 cut-off events. For 3995/4031 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 34065 event pairs, 1205 based on Foata normal form. 128/5872 useless extension candidates. Maximal degree in co-relation 8432. Up to 3056 conditions per place. [2025-03-14 01:10:24,078 INFO L140 encePairwiseOnDemand]: 34/41 looper letters, 98 selfloop transitions, 15 changer transitions 0/122 dead transitions. [2025-03-14 01:10:24,078 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 122 transitions, 709 flow [2025-03-14 01:10:24,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:10:24,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:10:24,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 144 transitions. [2025-03-14 01:10:24,079 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5853658536585366 [2025-03-14 01:10:24,079 INFO L175 Difference]: Start difference. First operand has 62 places, 52 transitions, 215 flow. Second operand 6 states and 144 transitions. [2025-03-14 01:10:24,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 122 transitions, 709 flow [2025-03-14 01:10:24,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 122 transitions, 706 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:10:24,087 INFO L231 Difference]: Finished difference. Result has 70 places, 65 transitions, 344 flow [2025-03-14 01:10:24,087 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-03-14 01:10:24,087 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 29 predicate places. [2025-03-14 01:10:24,088 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 65 transitions, 344 flow [2025-03-14 01:10:24,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:10:24,088 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:10:24,088 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-03-14 01:10:24,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-14 01:10:24,089 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-03-14 01:10:24,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:10:24,090 INFO L85 PathProgramCache]: Analyzing trace with hash 590096366, now seen corresponding path program 2 times [2025-03-14 01:10:24,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:10:24,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785043313] [2025-03-14 01:10:24,090 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:10:24,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:10:24,101 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-14 01:10:24,109 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-14 01:10:24,110 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:10:24,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:10:24,170 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:10:24,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:10:24,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785043313] [2025-03-14 01:10:24,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785043313] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:10:24,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:10:24,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:10:24,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489609855] [2025-03-14 01:10:24,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:10:24,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 01:10:24,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:10:24,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 01:10:24,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-14 01:10:24,183 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2025-03-14 01:10:24,184 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 65 transitions, 344 flow. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:10:24,184 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:10:24,184 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2025-03-14 01:10:24,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:10:24,831 INFO L124 PetriNetUnfolderBase]: 4662/7456 cut-off events. [2025-03-14 01:10:24,831 INFO L125 PetriNetUnfolderBase]: For 10111/10163 co-relation queries the response was YES. [2025-03-14 01:10:24,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22016 conditions, 7456 events. 4662/7456 cut-off events. For 10111/10163 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 43657 event pairs, 1629 based on Foata normal form. 140/7588 useless extension candidates. Maximal degree in co-relation 13850. Up to 2886 conditions per place. [2025-03-14 01:10:24,882 INFO L140 encePairwiseOnDemand]: 34/41 looper letters, 105 selfloop transitions, 13 changer transitions 1/128 dead transitions. [2025-03-14 01:10:24,883 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 128 transitions, 861 flow [2025-03-14 01:10:24,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:10:24,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:10:24,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 140 transitions. [2025-03-14 01:10:24,884 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5691056910569106 [2025-03-14 01:10:24,884 INFO L175 Difference]: Start difference. First operand has 70 places, 65 transitions, 344 flow. Second operand 6 states and 140 transitions. [2025-03-14 01:10:24,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 128 transitions, 861 flow [2025-03-14 01:10:24,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 128 transitions, 859 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-03-14 01:10:24,897 INFO L231 Difference]: Finished difference. Result has 78 places, 71 transitions, 442 flow [2025-03-14 01:10:24,898 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-03-14 01:10:24,898 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 37 predicate places. [2025-03-14 01:10:24,898 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 71 transitions, 442 flow [2025-03-14 01:10:24,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:10:24,899 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:10:24,899 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-03-14 01:10:24,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-14 01:10:24,899 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-03-14 01:10:24,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:10:24,900 INFO L85 PathProgramCache]: Analyzing trace with hash -280730008, now seen corresponding path program 3 times [2025-03-14 01:10:24,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:10:24,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925701165] [2025-03-14 01:10:24,900 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 01:10:24,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:10:24,908 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 2 equivalence classes. [2025-03-14 01:10:24,913 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 26 of 31 statements. [2025-03-14 01:10:24,913 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-14 01:10:24,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:10:24,977 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:10:24,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:10:24,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925701165] [2025-03-14 01:10:24,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925701165] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:10:24,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:10:24,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-14 01:10:24,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218771753] [2025-03-14 01:10:24,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:10:24,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 01:10:24,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:10:24,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 01:10:24,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-14 01:10:24,987 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2025-03-14 01:10:24,987 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 71 transitions, 442 flow. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:10:24,988 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:10:24,988 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2025-03-14 01:10:24,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:10:25,459 INFO L124 PetriNetUnfolderBase]: 3378/5300 cut-off events. [2025-03-14 01:10:25,459 INFO L125 PetriNetUnfolderBase]: For 10037/10037 co-relation queries the response was YES. [2025-03-14 01:10:25,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16580 conditions, 5300 events. 3378/5300 cut-off events. For 10037/10037 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 27344 event pairs, 2471 based on Foata normal form. 41/5335 useless extension candidates. Maximal degree in co-relation 15736. Up to 4525 conditions per place. [2025-03-14 01:10:25,504 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 45 selfloop transitions, 4 changer transitions 27/83 dead transitions. [2025-03-14 01:10:25,504 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 83 transitions, 617 flow [2025-03-14 01:10:25,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:10:25,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:10:25,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 113 transitions. [2025-03-14 01:10:25,505 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45934959349593496 [2025-03-14 01:10:25,505 INFO L175 Difference]: Start difference. First operand has 78 places, 71 transitions, 442 flow. Second operand 6 states and 113 transitions. [2025-03-14 01:10:25,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 83 transitions, 617 flow [2025-03-14 01:10:25,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 83 transitions, 601 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-03-14 01:10:25,524 INFO L231 Difference]: Finished difference. Result has 80 places, 56 transitions, 329 flow [2025-03-14 01:10:25,524 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-03-14 01:10:25,525 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 39 predicate places. [2025-03-14 01:10:25,525 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 56 transitions, 329 flow [2025-03-14 01:10:25,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:10:25,526 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:10:25,526 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-03-14 01:10:25,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-14 01:10:25,527 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-03-14 01:10:25,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:10:25,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1159447761, now seen corresponding path program 1 times [2025-03-14 01:10:25,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:10:25,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278152480] [2025-03-14 01:10:25,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:10:25,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:10:25,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-14 01:10:25,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-14 01:10:25,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:10:25,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:10:25,634 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:10:25,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:10:25,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278152480] [2025-03-14 01:10:25,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278152480] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:10:25,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1778982828] [2025-03-14 01:10:25,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:10:25,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:10:25,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:10:25,637 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:10:25,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-14 01:10:25,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-14 01:10:25,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-14 01:10:25,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:10:25,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:10:25,707 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-14 01:10:25,708 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:10:25,755 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:10:25,755 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:10:25,797 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:10:25,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1778982828] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-14 01:10:25,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-14 01:10:25,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2025-03-14 01:10:25,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565073760] [2025-03-14 01:10:25,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:10:25,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 01:10:25,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:10:25,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 01:10:25,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-14 01:10:25,814 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2025-03-14 01:10:25,814 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 56 transitions, 329 flow. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:10:25,814 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:10:25,814 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2025-03-14 01:10:25,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:10:26,189 INFO L124 PetriNetUnfolderBase]: 2917/4545 cut-off events. [2025-03-14 01:10:26,189 INFO L125 PetriNetUnfolderBase]: For 8402/8422 co-relation queries the response was YES. [2025-03-14 01:10:26,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14208 conditions, 4545 events. 2917/4545 cut-off events. For 8402/8422 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 23462 event pairs, 677 based on Foata normal form. 20/4489 useless extension candidates. Maximal degree in co-relation 14166. Up to 2865 conditions per place. [2025-03-14 01:10:26,237 INFO L140 encePairwiseOnDemand]: 35/41 looper letters, 52 selfloop transitions, 10 changer transitions 0/70 dead transitions. [2025-03-14 01:10:26,237 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 70 transitions, 522 flow [2025-03-14 01:10:26,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-14 01:10:26,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-14 01:10:26,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 92 transitions. [2025-03-14 01:10:26,238 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44878048780487806 [2025-03-14 01:10:26,238 INFO L175 Difference]: Start difference. First operand has 80 places, 56 transitions, 329 flow. Second operand 5 states and 92 transitions. [2025-03-14 01:10:26,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 70 transitions, 522 flow [2025-03-14 01:10:26,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 70 transitions, 493 flow, removed 4 selfloop flow, removed 5 redundant places. [2025-03-14 01:10:26,253 INFO L231 Difference]: Finished difference. Result has 74 places, 57 transitions, 347 flow [2025-03-14 01:10:26,254 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-03-14 01:10:26,254 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 33 predicate places. [2025-03-14 01:10:26,254 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 57 transitions, 347 flow [2025-03-14 01:10:26,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:10:26,254 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:10:26,255 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-03-14 01:10:26,264 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-14 01:10:26,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:10:26,459 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-03-14 01:10:26,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:10:26,460 INFO L85 PathProgramCache]: Analyzing trace with hash -362069113, now seen corresponding path program 1 times [2025-03-14 01:10:26,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:10:26,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276149097] [2025-03-14 01:10:26,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:10:26,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:10:26,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-14 01:10:26,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-14 01:10:26,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:10:26,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:10:26,541 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 01:10:26,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:10:26,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276149097] [2025-03-14 01:10:26,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276149097] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:10:26,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:10:26,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:10:26,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368782231] [2025-03-14 01:10:26,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:10:26,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 01:10:26,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:10:26,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 01:10:26,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-14 01:10:26,557 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2025-03-14 01:10:26,557 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 57 transitions, 347 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-03-14 01:10:26,558 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:10:26,558 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2025-03-14 01:10:26,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:10:26,909 INFO L124 PetriNetUnfolderBase]: 2404/3895 cut-off events. [2025-03-14 01:10:26,910 INFO L125 PetriNetUnfolderBase]: For 9546/9568 co-relation queries the response was YES. [2025-03-14 01:10:26,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12552 conditions, 3895 events. 2404/3895 cut-off events. For 9546/9568 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 19423 event pairs, 508 based on Foata normal form. 78/3964 useless extension candidates. Maximal degree in co-relation 12513. Up to 2127 conditions per place. [2025-03-14 01:10:26,944 INFO L140 encePairwiseOnDemand]: 35/41 looper letters, 73 selfloop transitions, 15 changer transitions 2/99 dead transitions. [2025-03-14 01:10:26,944 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 99 transitions, 683 flow [2025-03-14 01:10:26,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:10:26,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:10:26,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 136 transitions. [2025-03-14 01:10:26,949 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5528455284552846 [2025-03-14 01:10:26,949 INFO L175 Difference]: Start difference. First operand has 74 places, 57 transitions, 347 flow. Second operand 6 states and 136 transitions. [2025-03-14 01:10:26,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 99 transitions, 683 flow [2025-03-14 01:10:26,961 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 99 transitions, 672 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-14 01:10:26,962 INFO L231 Difference]: Finished difference. Result has 79 places, 59 transitions, 411 flow [2025-03-14 01:10:26,962 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-03-14 01:10:26,963 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 38 predicate places. [2025-03-14 01:10:26,963 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 59 transitions, 411 flow [2025-03-14 01:10:26,963 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-03-14 01:10:26,964 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:10:26,964 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-03-14 01:10:26,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-14 01:10:26,964 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-03-14 01:10:26,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:10:26,965 INFO L85 PathProgramCache]: Analyzing trace with hash 233877883, now seen corresponding path program 2 times [2025-03-14 01:10:26,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:10:26,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854258823] [2025-03-14 01:10:26,965 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:10:26,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:10:26,974 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-03-14 01:10:26,994 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-03-14 01:10:26,994 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:10:26,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:10:27,148 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 01:10:27,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:10:27,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854258823] [2025-03-14 01:10:27,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854258823] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:10:27,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1089522726] [2025-03-14 01:10:27,149 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:10:27,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:10:27,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:10:27,151 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:10:27,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-14 01:10:27,215 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-03-14 01:10:27,248 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-03-14 01:10:27,248 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:10:27,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:10:27,250 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-14 01:10:27,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:10:27,368 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 01:10:27,369 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:10:27,460 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 01:10:27,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1089522726] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:10:27,460 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:10:27,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 16 [2025-03-14 01:10:27,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555377428] [2025-03-14 01:10:27,461 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:10:27,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-14 01:10:27,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:10:27,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-14 01:10:27,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2025-03-14 01:10:27,524 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 41 [2025-03-14 01:10:27,525 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 59 transitions, 411 flow. Second operand has 16 states, 16 states have (on average 9.25) internal successors, (148), 16 states have internal predecessors, (148), 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-03-14 01:10:27,525 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:10:27,525 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 41 [2025-03-14 01:10:27,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:10:30,536 INFO L124 PetriNetUnfolderBase]: 17380/25146 cut-off events. [2025-03-14 01:10:30,536 INFO L125 PetriNetUnfolderBase]: For 71510/71510 co-relation queries the response was YES. [2025-03-14 01:10:30,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82456 conditions, 25146 events. 17380/25146 cut-off events. For 71510/71510 co-relation queries the response was YES. Maximal size of possible extension queue 394. Compared 142095 event pairs, 3071 based on Foata normal form. 381/25519 useless extension candidates. Maximal degree in co-relation 82414. Up to 5637 conditions per place. [2025-03-14 01:10:30,811 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 403 selfloop transitions, 98 changer transitions 41/544 dead transitions. [2025-03-14 01:10:30,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 544 transitions, 4513 flow [2025-03-14 01:10:30,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-03-14 01:10:30,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2025-03-14 01:10:30,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 579 transitions. [2025-03-14 01:10:30,940 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.415351506456241 [2025-03-14 01:10:30,940 INFO L175 Difference]: Start difference. First operand has 79 places, 59 transitions, 411 flow. Second operand 34 states and 579 transitions. [2025-03-14 01:10:30,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 544 transitions, 4513 flow [2025-03-14 01:10:30,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 544 transitions, 4309 flow, removed 49 selfloop flow, removed 3 redundant places. [2025-03-14 01:10:31,004 INFO L231 Difference]: Finished difference. Result has 136 places, 174 transitions, 1771 flow [2025-03-14 01:10:31,004 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-03-14 01:10:31,005 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 95 predicate places. [2025-03-14 01:10:31,007 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 174 transitions, 1771 flow [2025-03-14 01:10:31,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 9.25) internal successors, (148), 16 states have internal predecessors, (148), 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-03-14 01:10:31,008 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:10:31,008 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-03-14 01:10:31,023 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-14 01:10:31,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-14 01:10:31,212 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-03-14 01:10:31,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:10:31,213 INFO L85 PathProgramCache]: Analyzing trace with hash -763672747, now seen corresponding path program 3 times [2025-03-14 01:10:31,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:10:31,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380109628] [2025-03-14 01:10:31,213 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 01:10:31,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:10:31,228 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 42 statements into 2 equivalence classes. [2025-03-14 01:10:31,251 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-03-14 01:10:31,251 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-14 01:10:31,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:10:31,336 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-14 01:10:31,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:10:31,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380109628] [2025-03-14 01:10:31,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380109628] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:10:31,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [171019743] [2025-03-14 01:10:31,337 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 01:10:31,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:10:31,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:10:31,339 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:10:31,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-14 01:10:31,383 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 42 statements into 2 equivalence classes. [2025-03-14 01:10:31,408 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-03-14 01:10:31,408 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-14 01:10:31,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:10:31,409 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-14 01:10:31,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:10:31,513 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-14 01:10:31,513 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:10:31,581 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-14 01:10:31,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [171019743] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:10:31,581 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:10:31,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2025-03-14 01:10:31,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496025053] [2025-03-14 01:10:31,581 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:10:31,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-14 01:10:31,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:10:31,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-14 01:10:31,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2025-03-14 01:10:31,629 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2025-03-14 01:10:31,630 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 174 transitions, 1771 flow. Second operand has 15 states, 15 states have (on average 13.2) internal successors, (198), 15 states have internal predecessors, (198), 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-03-14 01:10:31,630 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:10:31,630 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2025-03-14 01:10:31,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:10:37,024 INFO L124 PetriNetUnfolderBase]: 30175/45457 cut-off events. [2025-03-14 01:10:37,024 INFO L125 PetriNetUnfolderBase]: For 415186/416408 co-relation queries the response was YES. [2025-03-14 01:10:37,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 212313 conditions, 45457 events. 30175/45457 cut-off events. For 415186/416408 co-relation queries the response was YES. Maximal size of possible extension queue 994. Compared 306641 event pairs, 1818 based on Foata normal form. 726/46091 useless extension candidates. Maximal degree in co-relation 212245. Up to 6119 conditions per place. [2025-03-14 01:10:37,775 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 774 selfloop transitions, 221 changer transitions 30/1036 dead transitions. [2025-03-14 01:10:37,776 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 1036 transitions, 11421 flow [2025-03-14 01:10:37,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-14 01:10:37,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2025-03-14 01:10:37,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 618 transitions. [2025-03-14 01:10:37,778 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5197645079899075 [2025-03-14 01:10:37,778 INFO L175 Difference]: Start difference. First operand has 136 places, 174 transitions, 1771 flow. Second operand 29 states and 618 transitions. [2025-03-14 01:10:37,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 1036 transitions, 11421 flow [2025-03-14 01:10:39,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 1036 transitions, 10997 flow, removed 208 selfloop flow, removed 1 redundant places. [2025-03-14 01:10:39,742 INFO L231 Difference]: Finished difference. Result has 184 places, 366 transitions, 4585 flow [2025-03-14 01:10:39,745 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=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=4585, PETRI_PLACES=184, PETRI_TRANSITIONS=366} [2025-03-14 01:10:39,745 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 143 predicate places. [2025-03-14 01:10:39,746 INFO L471 AbstractCegarLoop]: Abstraction has has 184 places, 366 transitions, 4585 flow [2025-03-14 01:10:39,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 13.2) internal successors, (198), 15 states have internal predecessors, (198), 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-03-14 01:10:39,746 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:10:39,746 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-03-14 01:10:39,752 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-14 01:10:39,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:10:39,947 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-03-14 01:10:39,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:10:39,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1479094825, now seen corresponding path program 4 times [2025-03-14 01:10:39,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:10:39,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885922242] [2025-03-14 01:10:39,948 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 01:10:39,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:10:39,960 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 42 statements into 2 equivalence classes. [2025-03-14 01:10:39,969 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 39 of 42 statements. [2025-03-14 01:10:39,969 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-14 01:10:39,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:10:40,049 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-14 01:10:40,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:10:40,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885922242] [2025-03-14 01:10:40,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885922242] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:10:40,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [165854893] [2025-03-14 01:10:40,050 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 01:10:40,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:10:40,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:10:40,053 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:10:40,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-14 01:10:40,100 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 42 statements into 2 equivalence classes. [2025-03-14 01:10:40,117 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 39 of 42 statements. [2025-03-14 01:10:40,117 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-14 01:10:40,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:10:40,119 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-14 01:10:40,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:10:40,176 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-14 01:10:40,176 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:10:40,223 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-14 01:10:40,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [165854893] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:10:40,224 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:10:40,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 9 [2025-03-14 01:10:40,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904446016] [2025-03-14 01:10:40,225 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:10:40,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-14 01:10:40,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:10:40,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-14 01:10:40,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-14 01:10:40,246 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2025-03-14 01:10:40,247 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 366 transitions, 4585 flow. Second operand has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 9 states have internal predecessors, (114), 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-03-14 01:10:40,247 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:10:40,247 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2025-03-14 01:10:40,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:10:41,277 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([388] L60-1-->L58-3: Formula: (= v_thread2Thread1of1ForFork2_~i~1_11 v_~p~0_9) InVars {thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_11} OutVars{~p~0=v_~p~0_9, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_11} AuxVars[] AssignedVars[~p~0][168], [323#(and (<= 1 ~N~0) (<= (+ thread1Thread1of1ForFork0_~i~0 1) ~N~0)), Black: 515#(and (= ~p~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 739#(<= thread1Thread1of1ForFork0_~i~0 1), 513#(= thread3Thread1of1ForFork1_~i~2 0), Black: 999#(and (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 1005#(and (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 1)), Black: 1009#(and (<= ~p~0 0) (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1015#(and (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 1037#(and (<= ~p~0 0) (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 0) (<= 0 thread3Thread1of1ForFork1_~i~2)), Black: 1007#(and (<= ~p~0 0) (<= ~N~0 1) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1023#(and (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 0) (<= 0 thread3Thread1of1ForFork1_~i~2)), Black: 899#(<= ~p~0 thread3Thread1of1ForFork1_~i~2), Black: 1001#(and (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1043#(and (<= ~p~0 0) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork1_~i~2)), Black: 1027#(and (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 1011#(and (= ~p~0 thread2Thread1of1ForFork2_~i~1) (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1029#(and (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 738#(= thread1Thread1of1ForFork0_~i~0 0), Black: 1045#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 740#(<= ~N~0 1), Black: 1041#(and (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 1025#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 1003#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~p~0 thread3Thread1of1ForFork1_~i~2)), Black: 1039#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 736#true, Black: 741#(and (<= ~N~0 1) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1031#(and (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (= thread1Thread1of1ForFork0_~i~0 0) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 812#(and (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork1_~i~2)), 57#(<= 1 ~N~0), Black: 1017#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), 4#L88-3true, Black: 1019#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 51#(and (= ~asum~0 0) (<= (mod ~N~0 4294967296) 0) (= ~csum~0 0)), Black: 50#(and (or (and (<= 0 ~N~0) (<= (+ |ULTIMATE.start_create_fresh_uint_array_~i~3#1| ~N~0) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (< (mod ~N~0 4294967296) 1)) (= ~asum~0 0) (= ~csum~0 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#L51-4true, 1337#(and (<= 1 ~N~0) (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 532#(<= 1 ~N~0), 1645#(and (<= (+ thread1Thread1of1ForFork0_~i~0 1) ~N~0) (<= 0 thread2Thread1of1ForFork2_~i~1)), Black: 338#(= ~p~0 0), Black: 339#(and (= ~p~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 505#(and (= ~p~0 0) (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1144#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 1 thread2Thread1of1ForFork2_~i~1)), Black: 1345#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), Black: 1353#(and (<= thread3Thread1of1ForFork1_~i~2 thread2Thread1of1ForFork2_~i~1) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= 2 ~N~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 1079#(and (<= 1 thread2Thread1of1ForFork2_~i~1) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1078#(and (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 726#(and (= ~p~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1361#(and (<= thread3Thread1of1ForFork1_~i~2 thread2Thread1of1ForFork2_~i~1) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), Black: 1359#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) thread2Thread1of1ForFork2_~i~1) (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= 2 ~N~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 725#(= ~p~0 0), Black: 1077#(= thread2Thread1of1ForFork2_~i~1 0), 23#L68true, Black: 1363#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) thread2Thread1of1ForFork2_~i~1) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), Black: 1341#(and (<= 1 ~N~0) (<= 1 thread2Thread1of1ForFork2_~i~1) (= thread3Thread1of1ForFork1_~i~2 0)), 336#true, Black: 1355#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) thread2Thread1of1ForFork2_~i~1) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= 2 ~N~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 1367#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) thread2Thread1of1ForFork2_~i~1) (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (<= 0 thread2Thread1of1ForFork2_~i~1)), Black: 1075#true, Black: 1128#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 0 thread2Thread1of1ForFork2_~i~1)), Black: 1109#(<= 0 thread2Thread1of1ForFork2_~i~1), Black: 1349#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 1 thread2Thread1of1ForFork2_~i~1) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), Black: 1246#(< (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0), Black: 1179#(and (<= 2 ~N~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 1365#(and (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (<= 2 ~N~0) (<= thread3Thread1of1ForFork1_~i~2 1)), 36#L58-3true, Black: 1357#(and (<= thread3Thread1of1ForFork1_~i~2 thread2Thread1of1ForFork2_~i~1) (<= 0 thread2Thread1of1ForFork2_~i~1)), Black: 1081#(<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0), 496#(and (<= 1 ~N~0) (<= (+ thread2Thread1of1ForFork2_~i~1 1) ~N~0)), Black: 501#(= thread2Thread1of1ForFork2_~i~1 0), Black: 503#(and (= ~p~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 502#(and (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0))]) [2025-03-14 01:10:41,278 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2025-03-14 01:10:41,278 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2025-03-14 01:10:41,278 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2025-03-14 01:10:41,278 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2025-03-14 01:10:41,278 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([388] L60-1-->L58-3: Formula: (= v_thread2Thread1of1ForFork2_~i~1_11 v_~p~0_9) InVars {thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_11} OutVars{~p~0=v_~p~0_9, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_11} AuxVars[] AssignedVars[~p~0][168], [323#(and (<= 1 ~N~0) (<= (+ thread1Thread1of1ForFork0_~i~0 1) ~N~0)), Black: 515#(and (= ~p~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 739#(<= thread1Thread1of1ForFork0_~i~0 1), 513#(= thread3Thread1of1ForFork1_~i~2 0), Black: 999#(and (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 1005#(and (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 1)), Black: 1009#(and (<= ~p~0 0) (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1015#(and (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 1037#(and (<= ~p~0 0) (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 0) (<= 0 thread3Thread1of1ForFork1_~i~2)), Black: 1007#(and (<= ~p~0 0) (<= ~N~0 1) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1023#(and (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 0) (<= 0 thread3Thread1of1ForFork1_~i~2)), Black: 899#(<= ~p~0 thread3Thread1of1ForFork1_~i~2), Black: 1001#(and (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1043#(and (<= ~p~0 0) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork1_~i~2)), Black: 1027#(and (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 1011#(and (= ~p~0 thread2Thread1of1ForFork2_~i~1) (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1029#(and (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 738#(= thread1Thread1of1ForFork0_~i~0 0), Black: 1045#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 740#(<= ~N~0 1), Black: 1041#(and (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 1025#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 1003#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~p~0 thread3Thread1of1ForFork1_~i~2)), Black: 1039#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 736#true, Black: 741#(and (<= ~N~0 1) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1031#(and (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (= thread1Thread1of1ForFork0_~i~0 0) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 812#(and (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork1_~i~2)), 57#(<= 1 ~N~0), Black: 1017#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), 4#L88-3true, Black: 1019#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 51#(and (= ~asum~0 0) (<= (mod ~N~0 4294967296) 0) (= ~csum~0 0)), Black: 50#(and (or (and (<= 0 ~N~0) (<= (+ |ULTIMATE.start_create_fresh_uint_array_~i~3#1| ~N~0) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (< (mod ~N~0 4294967296) 1)) (= ~asum~0 0) (= ~csum~0 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|)), 1337#(and (<= 1 ~N~0) (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 532#(<= 1 ~N~0), 1645#(and (<= (+ thread1Thread1of1ForFork0_~i~0 1) ~N~0) (<= 0 thread2Thread1of1ForFork2_~i~1)), Black: 338#(= ~p~0 0), Black: 339#(and (= ~p~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 505#(and (= ~p~0 0) (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1144#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 1 thread2Thread1of1ForFork2_~i~1)), Black: 1345#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), Black: 1353#(and (<= thread3Thread1of1ForFork1_~i~2 thread2Thread1of1ForFork2_~i~1) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= 2 ~N~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 1079#(and (<= 1 thread2Thread1of1ForFork2_~i~1) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1078#(and (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 726#(and (= ~p~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1361#(and (<= thread3Thread1of1ForFork1_~i~2 thread2Thread1of1ForFork2_~i~1) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), Black: 1359#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) thread2Thread1of1ForFork2_~i~1) (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= 2 ~N~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 725#(= ~p~0 0), Black: 1077#(= thread2Thread1of1ForFork2_~i~1 0), 23#L68true, Black: 1363#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) thread2Thread1of1ForFork2_~i~1) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), Black: 1341#(and (<= 1 ~N~0) (<= 1 thread2Thread1of1ForFork2_~i~1) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1355#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) thread2Thread1of1ForFork2_~i~1) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= 2 ~N~0) (<= thread3Thread1of1ForFork1_~i~2 1)), 336#true, Black: 1367#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) thread2Thread1of1ForFork2_~i~1) (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (<= 0 thread2Thread1of1ForFork2_~i~1)), Black: 1075#true, Black: 1128#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 0 thread2Thread1of1ForFork2_~i~1)), Black: 1109#(<= 0 thread2Thread1of1ForFork2_~i~1), Black: 1349#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 1 thread2Thread1of1ForFork2_~i~1) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), 3#L51-1true, Black: 1246#(< (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0), Black: 1179#(and (<= 2 ~N~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 1365#(and (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (<= 2 ~N~0) (<= thread3Thread1of1ForFork1_~i~2 1)), 36#L58-3true, Black: 1357#(and (<= thread3Thread1of1ForFork1_~i~2 thread2Thread1of1ForFork2_~i~1) (<= 0 thread2Thread1of1ForFork2_~i~1)), Black: 1081#(<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0), 496#(and (<= 1 ~N~0) (<= (+ thread2Thread1of1ForFork2_~i~1 1) ~N~0)), Black: 501#(= thread2Thread1of1ForFork2_~i~1 0), Black: 503#(and (= ~p~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 502#(and (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0))]) [2025-03-14 01:10:41,278 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2025-03-14 01:10:41,278 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-03-14 01:10:41,279 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-03-14 01:10:41,279 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-03-14 01:10:41,447 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([388] L60-1-->L58-3: Formula: (= v_thread2Thread1of1ForFork2_~i~1_11 v_~p~0_9) InVars {thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_11} OutVars{~p~0=v_~p~0_9, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_11} AuxVars[] AssignedVars[~p~0][168], [323#(and (<= 1 ~N~0) (<= (+ thread1Thread1of1ForFork0_~i~0 1) ~N~0)), Black: 515#(and (= ~p~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 739#(<= thread1Thread1of1ForFork0_~i~0 1), 513#(= thread3Thread1of1ForFork1_~i~2 0), Black: 999#(and (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 1005#(and (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 1)), Black: 1009#(and (<= ~p~0 0) (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1015#(and (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 1037#(and (<= ~p~0 0) (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 0) (<= 0 thread3Thread1of1ForFork1_~i~2)), Black: 1007#(and (<= ~p~0 0) (<= ~N~0 1) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1023#(and (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 0) (<= 0 thread3Thread1of1ForFork1_~i~2)), Black: 899#(<= ~p~0 thread3Thread1of1ForFork1_~i~2), Black: 1001#(and (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1043#(and (<= ~p~0 0) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork1_~i~2)), Black: 1027#(and (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 1011#(and (= ~p~0 thread2Thread1of1ForFork2_~i~1) (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1029#(and (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 738#(= thread1Thread1of1ForFork0_~i~0 0), Black: 1045#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 740#(<= ~N~0 1), Black: 1041#(and (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 1025#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 1003#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~p~0 thread3Thread1of1ForFork1_~i~2)), Black: 1039#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 736#true, Black: 741#(and (<= ~N~0 1) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1031#(and (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (= thread1Thread1of1ForFork0_~i~0 0) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 812#(and (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork1_~i~2)), 57#(<= 1 ~N~0), Black: 1017#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 1019#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 51#(and (= ~asum~0 0) (<= (mod ~N~0 4294967296) 0) (= ~csum~0 0)), Black: 50#(and (or (and (<= 0 ~N~0) (<= (+ |ULTIMATE.start_create_fresh_uint_array_~i~3#1| ~N~0) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (< (mod ~N~0 4294967296) 1)) (= ~asum~0 0) (= ~csum~0 0)), 11#L51-4true, Black: 184#(and (<= 1 ~N~0) (<= (+ |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 1337#(and (<= 1 ~N~0) (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 532#(<= 1 ~N~0), 1645#(and (<= (+ thread1Thread1of1ForFork0_~i~0 1) ~N~0) (<= 0 thread2Thread1of1ForFork2_~i~1)), Black: 338#(= ~p~0 0), Black: 339#(and (= ~p~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 505#(and (= ~p~0 0) (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1144#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 1 thread2Thread1of1ForFork2_~i~1)), 7#L89true, Black: 1345#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), Black: 1353#(and (<= thread3Thread1of1ForFork1_~i~2 thread2Thread1of1ForFork2_~i~1) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= 2 ~N~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 1079#(and (<= 1 thread2Thread1of1ForFork2_~i~1) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1078#(and (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 726#(and (= ~p~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1361#(and (<= thread3Thread1of1ForFork1_~i~2 thread2Thread1of1ForFork2_~i~1) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), Black: 1359#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) thread2Thread1of1ForFork2_~i~1) (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= 2 ~N~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 725#(= ~p~0 0), 23#L68true, Black: 1077#(= thread2Thread1of1ForFork2_~i~1 0), Black: 1363#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) thread2Thread1of1ForFork2_~i~1) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), Black: 1341#(and (<= 1 ~N~0) (<= 1 thread2Thread1of1ForFork2_~i~1) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1355#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) thread2Thread1of1ForFork2_~i~1) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= 2 ~N~0) (<= thread3Thread1of1ForFork1_~i~2 1)), 336#true, Black: 1367#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) thread2Thread1of1ForFork2_~i~1) (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (<= 0 thread2Thread1of1ForFork2_~i~1)), Black: 1075#true, Black: 1128#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 0 thread2Thread1of1ForFork2_~i~1)), Black: 1109#(<= 0 thread2Thread1of1ForFork2_~i~1), Black: 1349#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 1 thread2Thread1of1ForFork2_~i~1) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), Black: 1246#(< (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0), Black: 1179#(and (<= 2 ~N~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 1365#(and (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (<= 2 ~N~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 1357#(and (<= thread3Thread1of1ForFork1_~i~2 thread2Thread1of1ForFork2_~i~1) (<= 0 thread2Thread1of1ForFork2_~i~1)), 36#L58-3true, Black: 1081#(<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0), 496#(and (<= 1 ~N~0) (<= (+ thread2Thread1of1ForFork2_~i~1 1) ~N~0)), Black: 501#(= thread2Thread1of1ForFork2_~i~1 0), Black: 503#(and (= ~p~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 502#(and (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0))]) [2025-03-14 01:10:41,447 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2025-03-14 01:10:41,447 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-03-14 01:10:41,447 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-03-14 01:10:41,447 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-03-14 01:10:41,448 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([388] L60-1-->L58-3: Formula: (= v_thread2Thread1of1ForFork2_~i~1_11 v_~p~0_9) InVars {thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_11} OutVars{~p~0=v_~p~0_9, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_11} AuxVars[] AssignedVars[~p~0][168], [323#(and (<= 1 ~N~0) (<= (+ thread1Thread1of1ForFork0_~i~0 1) ~N~0)), Black: 515#(and (= ~p~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 739#(<= thread1Thread1of1ForFork0_~i~0 1), 513#(= thread3Thread1of1ForFork1_~i~2 0), Black: 999#(and (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 1005#(and (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 1)), Black: 1009#(and (<= ~p~0 0) (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1015#(and (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 1037#(and (<= ~p~0 0) (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 0) (<= 0 thread3Thread1of1ForFork1_~i~2)), Black: 1007#(and (<= ~p~0 0) (<= ~N~0 1) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1023#(and (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 0) (<= 0 thread3Thread1of1ForFork1_~i~2)), Black: 899#(<= ~p~0 thread3Thread1of1ForFork1_~i~2), Black: 1001#(and (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1043#(and (<= ~p~0 0) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork1_~i~2)), Black: 1027#(and (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 1011#(and (= ~p~0 thread2Thread1of1ForFork2_~i~1) (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1029#(and (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 738#(= thread1Thread1of1ForFork0_~i~0 0), Black: 1045#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 740#(<= ~N~0 1), Black: 1041#(and (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 1025#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 1003#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~p~0 thread3Thread1of1ForFork1_~i~2)), Black: 1039#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 736#true, Black: 741#(and (<= ~N~0 1) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1031#(and (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (= thread1Thread1of1ForFork0_~i~0 0) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 812#(and (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork1_~i~2)), 57#(<= 1 ~N~0), Black: 1017#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 1019#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 51#(and (= ~asum~0 0) (<= (mod ~N~0 4294967296) 0) (= ~csum~0 0)), Black: 50#(and (or (and (<= 0 ~N~0) (<= (+ |ULTIMATE.start_create_fresh_uint_array_~i~3#1| ~N~0) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (< (mod ~N~0 4294967296) 1)) (= ~asum~0 0) (= ~csum~0 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|)), 1337#(and (<= 1 ~N~0) (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 532#(<= 1 ~N~0), 1645#(and (<= (+ thread1Thread1of1ForFork0_~i~0 1) ~N~0) (<= 0 thread2Thread1of1ForFork2_~i~1)), Black: 338#(= ~p~0 0), Black: 339#(and (= ~p~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 505#(and (= ~p~0 0) (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1144#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 1 thread2Thread1of1ForFork2_~i~1)), 7#L89true, Black: 1345#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), Black: 1353#(and (<= thread3Thread1of1ForFork1_~i~2 thread2Thread1of1ForFork2_~i~1) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= 2 ~N~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 1079#(and (<= 1 thread2Thread1of1ForFork2_~i~1) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1078#(and (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 726#(and (= ~p~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1361#(and (<= thread3Thread1of1ForFork1_~i~2 thread2Thread1of1ForFork2_~i~1) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), Black: 1359#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) thread2Thread1of1ForFork2_~i~1) (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= 2 ~N~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 725#(= ~p~0 0), 23#L68true, Black: 1077#(= thread2Thread1of1ForFork2_~i~1 0), Black: 1363#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) thread2Thread1of1ForFork2_~i~1) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), Black: 1341#(and (<= 1 ~N~0) (<= 1 thread2Thread1of1ForFork2_~i~1) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1355#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) thread2Thread1of1ForFork2_~i~1) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= 2 ~N~0) (<= thread3Thread1of1ForFork1_~i~2 1)), 336#true, Black: 1367#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) thread2Thread1of1ForFork2_~i~1) (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (<= 0 thread2Thread1of1ForFork2_~i~1)), Black: 1075#true, Black: 1128#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 0 thread2Thread1of1ForFork2_~i~1)), Black: 1109#(<= 0 thread2Thread1of1ForFork2_~i~1), Black: 1349#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 1 thread2Thread1of1ForFork2_~i~1) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), Black: 1246#(< (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0), 3#L51-1true, Black: 1179#(and (<= 2 ~N~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 1365#(and (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (<= 2 ~N~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 1357#(and (<= thread3Thread1of1ForFork1_~i~2 thread2Thread1of1ForFork2_~i~1) (<= 0 thread2Thread1of1ForFork2_~i~1)), 36#L58-3true, Black: 1081#(<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0), 496#(and (<= 1 ~N~0) (<= (+ thread2Thread1of1ForFork2_~i~1 1) ~N~0)), Black: 501#(= thread2Thread1of1ForFork2_~i~1 0), Black: 503#(and (= ~p~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 502#(and (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0))]) [2025-03-14 01:10:41,448 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2025-03-14 01:10:41,448 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-03-14 01:10:41,448 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-03-14 01:10:41,448 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-03-14 01:10:41,831 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([388] L60-1-->L58-3: Formula: (= v_thread2Thread1of1ForFork2_~i~1_11 v_~p~0_9) InVars {thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_11} OutVars{~p~0=v_~p~0_9, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_11} AuxVars[] AssignedVars[~p~0][232], [323#(and (<= 1 ~N~0) (<= (+ thread1Thread1of1ForFork0_~i~0 1) ~N~0)), Black: 515#(and (= ~p~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 513#(= thread3Thread1of1ForFork1_~i~2 0), Black: 999#(and (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 1005#(and (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 1)), Black: 739#(<= thread1Thread1of1ForFork0_~i~0 1), Black: 1009#(and (<= ~p~0 0) (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1015#(and (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 1037#(and (<= ~p~0 0) (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 0) (<= 0 thread3Thread1of1ForFork1_~i~2)), Black: 1007#(and (<= ~p~0 0) (<= ~N~0 1) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1023#(and (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 0) (<= 0 thread3Thread1of1ForFork1_~i~2)), Black: 899#(<= ~p~0 thread3Thread1of1ForFork1_~i~2), Black: 1001#(and (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1043#(and (<= ~p~0 0) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork1_~i~2)), Black: 1027#(and (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 1011#(and (= ~p~0 thread2Thread1of1ForFork2_~i~1) (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1029#(and (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 738#(= thread1Thread1of1ForFork0_~i~0 0), Black: 1045#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 740#(<= ~N~0 1), Black: 1041#(and (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 1025#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 1003#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~p~0 thread3Thread1of1ForFork1_~i~2)), Black: 1039#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 741#(and (<= ~N~0 1) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1031#(and (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (= thread1Thread1of1ForFork0_~i~0 0) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 812#(and (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork1_~i~2)), 57#(<= 1 ~N~0), Black: 1017#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), 736#true, 4#L88-3true, Black: 1019#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 51#(and (= ~asum~0 0) (<= (mod ~N~0 4294967296) 0) (= ~csum~0 0)), Black: 50#(and (or (and (<= 0 ~N~0) (<= (+ |ULTIMATE.start_create_fresh_uint_array_~i~3#1| ~N~0) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (< (mod ~N~0 4294967296) 1)) (= ~asum~0 0) (= ~csum~0 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|)), 1337#(and (<= 1 ~N~0) (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 532#(<= 1 ~N~0), 1645#(and (<= (+ thread1Thread1of1ForFork0_~i~0 1) ~N~0) (<= 0 thread2Thread1of1ForFork2_~i~1)), Black: 338#(= ~p~0 0), Black: 339#(and (= ~p~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 505#(and (= ~p~0 0) (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1144#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 1 thread2Thread1of1ForFork2_~i~1)), Black: 1345#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), Black: 1353#(and (<= thread3Thread1of1ForFork1_~i~2 thread2Thread1of1ForFork2_~i~1) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= 2 ~N~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 1079#(and (<= 1 thread2Thread1of1ForFork2_~i~1) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1078#(and (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 726#(and (= ~p~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1361#(and (<= thread3Thread1of1ForFork1_~i~2 thread2Thread1of1ForFork2_~i~1) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), Black: 1359#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) thread2Thread1of1ForFork2_~i~1) (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= 2 ~N~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 725#(= ~p~0 0), 23#L68true, Black: 1077#(= thread2Thread1of1ForFork2_~i~1 0), Black: 1363#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) thread2Thread1of1ForFork2_~i~1) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), Black: 1341#(and (<= 1 ~N~0) (<= 1 thread2Thread1of1ForFork2_~i~1) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1355#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) thread2Thread1of1ForFork2_~i~1) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= 2 ~N~0) (<= thread3Thread1of1ForFork1_~i~2 1)), 336#true, Black: 1367#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) thread2Thread1of1ForFork2_~i~1) (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (<= 0 thread2Thread1of1ForFork2_~i~1)), Black: 1075#true, Black: 1128#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 0 thread2Thread1of1ForFork2_~i~1)), Black: 1109#(<= 0 thread2Thread1of1ForFork2_~i~1), Black: 1349#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 1 thread2Thread1of1ForFork2_~i~1) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), Black: 1246#(< (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0), 3#L51-1true, Black: 1179#(and (<= 2 ~N~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 1365#(and (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (<= 2 ~N~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 1357#(and (<= thread3Thread1of1ForFork1_~i~2 thread2Thread1of1ForFork2_~i~1) (<= 0 thread2Thread1of1ForFork2_~i~1)), 36#L58-3true, Black: 1081#(<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0), 496#(and (<= 1 ~N~0) (<= (+ thread2Thread1of1ForFork2_~i~1 1) ~N~0)), Black: 501#(= thread2Thread1of1ForFork2_~i~1 0), Black: 503#(and (= ~p~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 502#(and (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0))]) [2025-03-14 01:10:41,831 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2025-03-14 01:10:41,831 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2025-03-14 01:10:41,831 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2025-03-14 01:10:41,831 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2025-03-14 01:10:41,831 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([388] L60-1-->L58-3: Formula: (= v_thread2Thread1of1ForFork2_~i~1_11 v_~p~0_9) InVars {thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_11} OutVars{~p~0=v_~p~0_9, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_11} AuxVars[] AssignedVars[~p~0][232], [323#(and (<= 1 ~N~0) (<= (+ thread1Thread1of1ForFork0_~i~0 1) ~N~0)), Black: 515#(and (= ~p~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 513#(= thread3Thread1of1ForFork1_~i~2 0), Black: 999#(and (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 1005#(and (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 1)), Black: 739#(<= thread1Thread1of1ForFork0_~i~0 1), Black: 1009#(and (<= ~p~0 0) (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1015#(and (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 1037#(and (<= ~p~0 0) (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 0) (<= 0 thread3Thread1of1ForFork1_~i~2)), Black: 1007#(and (<= ~p~0 0) (<= ~N~0 1) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1023#(and (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 0) (<= 0 thread3Thread1of1ForFork1_~i~2)), Black: 899#(<= ~p~0 thread3Thread1of1ForFork1_~i~2), Black: 1001#(and (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1043#(and (<= ~p~0 0) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork1_~i~2)), Black: 1027#(and (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 1011#(and (= ~p~0 thread2Thread1of1ForFork2_~i~1) (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1029#(and (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 738#(= thread1Thread1of1ForFork0_~i~0 0), Black: 1045#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 740#(<= ~N~0 1), Black: 1041#(and (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 1025#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 1003#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~p~0 thread3Thread1of1ForFork1_~i~2)), Black: 1039#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 741#(and (<= ~N~0 1) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1031#(and (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (= thread1Thread1of1ForFork0_~i~0 0) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 812#(and (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork1_~i~2)), 57#(<= 1 ~N~0), Black: 1017#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), 736#true, 4#L88-3true, Black: 1019#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 51#(and (= ~asum~0 0) (<= (mod ~N~0 4294967296) 0) (= ~csum~0 0)), Black: 50#(and (or (and (<= 0 ~N~0) (<= (+ |ULTIMATE.start_create_fresh_uint_array_~i~3#1| ~N~0) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (< (mod ~N~0 4294967296) 1)) (= ~asum~0 0) (= ~csum~0 0)), 11#L51-4true, Black: 184#(and (<= 1 ~N~0) (<= (+ |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 1337#(and (<= 1 ~N~0) (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 532#(<= 1 ~N~0), 1645#(and (<= (+ thread1Thread1of1ForFork0_~i~0 1) ~N~0) (<= 0 thread2Thread1of1ForFork2_~i~1)), Black: 338#(= ~p~0 0), Black: 339#(and (= ~p~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 505#(and (= ~p~0 0) (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1144#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 1 thread2Thread1of1ForFork2_~i~1)), Black: 1345#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), Black: 1353#(and (<= thread3Thread1of1ForFork1_~i~2 thread2Thread1of1ForFork2_~i~1) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= 2 ~N~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 1079#(and (<= 1 thread2Thread1of1ForFork2_~i~1) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1078#(and (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 726#(and (= ~p~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1361#(and (<= thread3Thread1of1ForFork1_~i~2 thread2Thread1of1ForFork2_~i~1) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), Black: 1359#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) thread2Thread1of1ForFork2_~i~1) (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= 2 ~N~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 725#(= ~p~0 0), 23#L68true, Black: 1077#(= thread2Thread1of1ForFork2_~i~1 0), Black: 1363#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) thread2Thread1of1ForFork2_~i~1) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), Black: 1341#(and (<= 1 ~N~0) (<= 1 thread2Thread1of1ForFork2_~i~1) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1355#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) thread2Thread1of1ForFork2_~i~1) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= 2 ~N~0) (<= thread3Thread1of1ForFork1_~i~2 1)), 336#true, Black: 1367#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) thread2Thread1of1ForFork2_~i~1) (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (<= 0 thread2Thread1of1ForFork2_~i~1)), Black: 1075#true, Black: 1128#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 0 thread2Thread1of1ForFork2_~i~1)), Black: 1109#(<= 0 thread2Thread1of1ForFork2_~i~1), Black: 1349#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 1 thread2Thread1of1ForFork2_~i~1) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), Black: 1246#(< (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0), Black: 1179#(and (<= 2 ~N~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 1365#(and (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (<= 2 ~N~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 1357#(and (<= thread3Thread1of1ForFork1_~i~2 thread2Thread1of1ForFork2_~i~1) (<= 0 thread2Thread1of1ForFork2_~i~1)), 36#L58-3true, Black: 1081#(<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0), 496#(and (<= 1 ~N~0) (<= (+ thread2Thread1of1ForFork2_~i~1 1) ~N~0)), Black: 501#(= thread2Thread1of1ForFork2_~i~1 0), Black: 503#(and (= ~p~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 502#(and (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0))]) [2025-03-14 01:10:41,831 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2025-03-14 01:10:41,831 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-03-14 01:10:41,831 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-03-14 01:10:41,831 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-03-14 01:10:42,008 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([388] L60-1-->L58-3: Formula: (= v_thread2Thread1of1ForFork2_~i~1_11 v_~p~0_9) InVars {thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_11} OutVars{~p~0=v_~p~0_9, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_11} AuxVars[] AssignedVars[~p~0][232], [323#(and (<= 1 ~N~0) (<= (+ thread1Thread1of1ForFork0_~i~0 1) ~N~0)), Black: 515#(and (= ~p~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 513#(= thread3Thread1of1ForFork1_~i~2 0), Black: 999#(and (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 1005#(and (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 1)), Black: 739#(<= thread1Thread1of1ForFork0_~i~0 1), Black: 1009#(and (<= ~p~0 0) (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1015#(and (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 1037#(and (<= ~p~0 0) (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 0) (<= 0 thread3Thread1of1ForFork1_~i~2)), Black: 1007#(and (<= ~p~0 0) (<= ~N~0 1) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1023#(and (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 0) (<= 0 thread3Thread1of1ForFork1_~i~2)), Black: 899#(<= ~p~0 thread3Thread1of1ForFork1_~i~2), Black: 1001#(and (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1043#(and (<= ~p~0 0) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork1_~i~2)), Black: 1027#(and (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 1011#(and (= ~p~0 thread2Thread1of1ForFork2_~i~1) (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1029#(and (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 738#(= thread1Thread1of1ForFork0_~i~0 0), Black: 1045#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 740#(<= ~N~0 1), Black: 1041#(and (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 1025#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 1003#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~p~0 thread3Thread1of1ForFork1_~i~2)), Black: 1039#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 741#(and (<= ~N~0 1) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1031#(and (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (= thread1Thread1of1ForFork0_~i~0 0) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 812#(and (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork1_~i~2)), 57#(<= 1 ~N~0), Black: 1017#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), 736#true, Black: 1019#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 51#(and (= ~asum~0 0) (<= (mod ~N~0 4294967296) 0) (= ~csum~0 0)), Black: 50#(and (or (and (<= 0 ~N~0) (<= (+ |ULTIMATE.start_create_fresh_uint_array_~i~3#1| ~N~0) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (< (mod ~N~0 4294967296) 1)) (= ~asum~0 0) (= ~csum~0 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|)), 1337#(and (<= 1 ~N~0) (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 532#(<= 1 ~N~0), 1645#(and (<= (+ thread1Thread1of1ForFork0_~i~0 1) ~N~0) (<= 0 thread2Thread1of1ForFork2_~i~1)), Black: 338#(= ~p~0 0), Black: 339#(and (= ~p~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 505#(and (= ~p~0 0) (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1144#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 1 thread2Thread1of1ForFork2_~i~1)), Black: 1345#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), 7#L89true, Black: 1353#(and (<= thread3Thread1of1ForFork1_~i~2 thread2Thread1of1ForFork2_~i~1) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= 2 ~N~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 1079#(and (<= 1 thread2Thread1of1ForFork2_~i~1) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1078#(and (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 726#(and (= ~p~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1361#(and (<= thread3Thread1of1ForFork1_~i~2 thread2Thread1of1ForFork2_~i~1) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), Black: 1359#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) thread2Thread1of1ForFork2_~i~1) (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= 2 ~N~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 725#(= ~p~0 0), Black: 1077#(= thread2Thread1of1ForFork2_~i~1 0), 23#L68true, Black: 1363#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) thread2Thread1of1ForFork2_~i~1) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), Black: 1341#(and (<= 1 ~N~0) (<= 1 thread2Thread1of1ForFork2_~i~1) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1355#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) thread2Thread1of1ForFork2_~i~1) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= 2 ~N~0) (<= thread3Thread1of1ForFork1_~i~2 1)), 336#true, Black: 1367#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) thread2Thread1of1ForFork2_~i~1) (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (<= 0 thread2Thread1of1ForFork2_~i~1)), Black: 1075#true, Black: 1128#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 0 thread2Thread1of1ForFork2_~i~1)), Black: 1109#(<= 0 thread2Thread1of1ForFork2_~i~1), Black: 1349#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 1 thread2Thread1of1ForFork2_~i~1) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), Black: 1246#(< (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0), 3#L51-1true, Black: 1179#(and (<= 2 ~N~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 1365#(and (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (<= 2 ~N~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 1357#(and (<= thread3Thread1of1ForFork1_~i~2 thread2Thread1of1ForFork2_~i~1) (<= 0 thread2Thread1of1ForFork2_~i~1)), 36#L58-3true, Black: 1081#(<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0), 496#(and (<= 1 ~N~0) (<= (+ thread2Thread1of1ForFork2_~i~1 1) ~N~0)), Black: 501#(= thread2Thread1of1ForFork2_~i~1 0), Black: 503#(and (= ~p~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 502#(and (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0))]) [2025-03-14 01:10:42,008 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2025-03-14 01:10:42,008 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2025-03-14 01:10:42,008 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2025-03-14 01:10:42,008 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2025-03-14 01:10:42,009 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([388] L60-1-->L58-3: Formula: (= v_thread2Thread1of1ForFork2_~i~1_11 v_~p~0_9) InVars {thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_11} OutVars{~p~0=v_~p~0_9, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_11} AuxVars[] AssignedVars[~p~0][232], [323#(and (<= 1 ~N~0) (<= (+ thread1Thread1of1ForFork0_~i~0 1) ~N~0)), Black: 515#(and (= ~p~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 513#(= thread3Thread1of1ForFork1_~i~2 0), Black: 999#(and (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 1005#(and (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 1)), Black: 739#(<= thread1Thread1of1ForFork0_~i~0 1), Black: 1009#(and (<= ~p~0 0) (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1015#(and (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 1037#(and (<= ~p~0 0) (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 0) (<= 0 thread3Thread1of1ForFork1_~i~2)), Black: 1007#(and (<= ~p~0 0) (<= ~N~0 1) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1023#(and (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 0) (<= 0 thread3Thread1of1ForFork1_~i~2)), Black: 899#(<= ~p~0 thread3Thread1of1ForFork1_~i~2), Black: 1001#(and (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1043#(and (<= ~p~0 0) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork1_~i~2)), Black: 1027#(and (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 1011#(and (= ~p~0 thread2Thread1of1ForFork2_~i~1) (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1029#(and (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 738#(= thread1Thread1of1ForFork0_~i~0 0), Black: 1045#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 740#(<= ~N~0 1), Black: 1041#(and (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 1025#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 1003#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~p~0 thread3Thread1of1ForFork1_~i~2)), Black: 1039#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 741#(and (<= ~N~0 1) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1031#(and (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (= thread1Thread1of1ForFork0_~i~0 0) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 812#(and (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork1_~i~2)), 57#(<= 1 ~N~0), 736#true, Black: 1017#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 1019#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 51#(and (= ~asum~0 0) (<= (mod ~N~0 4294967296) 0) (= ~csum~0 0)), Black: 50#(and (or (and (<= 0 ~N~0) (<= (+ |ULTIMATE.start_create_fresh_uint_array_~i~3#1| ~N~0) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (< (mod ~N~0 4294967296) 1)) (= ~asum~0 0) (= ~csum~0 0)), 11#L51-4true, Black: 184#(and (<= 1 ~N~0) (<= (+ |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 1337#(and (<= 1 ~N~0) (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 532#(<= 1 ~N~0), 1645#(and (<= (+ thread1Thread1of1ForFork0_~i~0 1) ~N~0) (<= 0 thread2Thread1of1ForFork2_~i~1)), Black: 338#(= ~p~0 0), Black: 339#(and (= ~p~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 505#(and (= ~p~0 0) (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1144#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 1 thread2Thread1of1ForFork2_~i~1)), Black: 1345#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), 7#L89true, Black: 1353#(and (<= thread3Thread1of1ForFork1_~i~2 thread2Thread1of1ForFork2_~i~1) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= 2 ~N~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 1079#(and (<= 1 thread2Thread1of1ForFork2_~i~1) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1078#(and (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 726#(and (= ~p~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1361#(and (<= thread3Thread1of1ForFork1_~i~2 thread2Thread1of1ForFork2_~i~1) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), Black: 1359#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) thread2Thread1of1ForFork2_~i~1) (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= 2 ~N~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 725#(= ~p~0 0), Black: 1077#(= thread2Thread1of1ForFork2_~i~1 0), 23#L68true, Black: 1363#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) thread2Thread1of1ForFork2_~i~1) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), Black: 1341#(and (<= 1 ~N~0) (<= 1 thread2Thread1of1ForFork2_~i~1) (= thread3Thread1of1ForFork1_~i~2 0)), 336#true, Black: 1355#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) thread2Thread1of1ForFork2_~i~1) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= 2 ~N~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 1367#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) thread2Thread1of1ForFork2_~i~1) (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (<= 0 thread2Thread1of1ForFork2_~i~1)), Black: 1075#true, Black: 1128#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 0 thread2Thread1of1ForFork2_~i~1)), Black: 1109#(<= 0 thread2Thread1of1ForFork2_~i~1), Black: 1349#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 1 thread2Thread1of1ForFork2_~i~1) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), Black: 1246#(< (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0), Black: 1179#(and (<= 2 ~N~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 1365#(and (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (<= 2 ~N~0) (<= thread3Thread1of1ForFork1_~i~2 1)), 36#L58-3true, Black: 1357#(and (<= thread3Thread1of1ForFork1_~i~2 thread2Thread1of1ForFork2_~i~1) (<= 0 thread2Thread1of1ForFork2_~i~1)), Black: 1081#(<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0), 496#(and (<= 1 ~N~0) (<= (+ thread2Thread1of1ForFork2_~i~1 1) ~N~0)), Black: 501#(= thread2Thread1of1ForFork2_~i~1 0), Black: 503#(and (= ~p~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 502#(and (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0))]) [2025-03-14 01:10:42,009 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2025-03-14 01:10:42,009 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2025-03-14 01:10:42,009 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2025-03-14 01:10:42,009 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2025-03-14 01:10:49,518 INFO L124 PetriNetUnfolderBase]: 41644/64626 cut-off events. [2025-03-14 01:10:49,519 INFO L125 PetriNetUnfolderBase]: For 993408/1001600 co-relation queries the response was YES. [2025-03-14 01:10:50,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 365881 conditions, 64626 events. 41644/64626 cut-off events. For 993408/1001600 co-relation queries the response was YES. Maximal size of possible extension queue 1530. Compared 479961 event pairs, 4304 based on Foata normal form. 1993/65337 useless extension candidates. Maximal degree in co-relation 365793. Up to 16362 conditions per place. [2025-03-14 01:10:50,892 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 653 selfloop transitions, 220 changer transitions 4/903 dead transitions. [2025-03-14 01:10:50,892 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 903 transitions, 12747 flow [2025-03-14 01:10:50,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-14 01:10:50,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-14 01:10:50,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 306 transitions. [2025-03-14 01:10:50,893 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4975609756097561 [2025-03-14 01:10:50,893 INFO L175 Difference]: Start difference. First operand has 184 places, 366 transitions, 4585 flow. Second operand 15 states and 306 transitions. [2025-03-14 01:10:50,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 903 transitions, 12747 flow [2025-03-14 01:10:57,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 903 transitions, 11656 flow, removed 537 selfloop flow, removed 1 redundant places. [2025-03-14 01:10:57,889 INFO L231 Difference]: Finished difference. Result has 203 places, 528 transitions, 6453 flow [2025-03-14 01:10:57,889 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4166, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=366, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=290, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=6453, PETRI_PLACES=203, PETRI_TRANSITIONS=528} [2025-03-14 01:10:57,890 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 162 predicate places. [2025-03-14 01:10:57,890 INFO L471 AbstractCegarLoop]: Abstraction has has 203 places, 528 transitions, 6453 flow [2025-03-14 01:10:57,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 9 states have internal predecessors, (114), 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-03-14 01:10:57,890 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:10:57,890 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-03-14 01:10:57,896 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-14 01:10:58,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:10:58,091 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-03-14 01:10:58,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:10:58,091 INFO L85 PathProgramCache]: Analyzing trace with hash -892736581, now seen corresponding path program 5 times [2025-03-14 01:10:58,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:10:58,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429618566] [2025-03-14 01:10:58,091 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 01:10:58,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:10:58,097 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 42 statements into 3 equivalence classes. [2025-03-14 01:10:58,105 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 42 of 42 statements. [2025-03-14 01:10:58,105 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-14 01:10:58,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:10:58,158 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 01:10:58,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:10:58,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429618566] [2025-03-14 01:10:58,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429618566] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:10:58,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [73254111] [2025-03-14 01:10:58,159 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 01:10:58,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:10:58,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:10:58,161 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:10:58,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-14 01:10:58,206 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 42 statements into 3 equivalence classes. [2025-03-14 01:10:58,232 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 42 of 42 statements. [2025-03-14 01:10:58,232 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-14 01:10:58,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:10:58,235 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-14 01:10:58,237 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:10:58,304 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 01:10:58,304 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:10:58,351 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 01:10:58,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [73254111] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:10:58,352 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:10:58,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 13 [2025-03-14 01:10:58,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065343255] [2025-03-14 01:10:58,352 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:10:58,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-14 01:10:58,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:10:58,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-14 01:10:58,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2025-03-14 01:10:58,379 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2025-03-14 01:10:58,380 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 528 transitions, 6453 flow. Second operand has 13 states, 13 states have (on average 12.76923076923077) internal successors, (166), 13 states have internal predecessors, (166), 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-03-14 01:10:58,380 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:10:58,380 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2025-03-14 01:10:58,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:11:00,481 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([388] L60-1-->L58-3: Formula: (= v_thread2Thread1of1ForFork2_~i~1_11 v_~p~0_9) InVars {thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_11} OutVars{~p~0=v_~p~0_9, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_11} AuxVars[] AssignedVars[~p~0][240], [323#(and (<= 1 ~N~0) (<= (+ thread1Thread1of1ForFork0_~i~0 1) ~N~0)), Black: 515#(and (= ~p~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 513#(= thread3Thread1of1ForFork1_~i~2 0), Black: 999#(and (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 1005#(and (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 1)), Black: 739#(<= thread1Thread1of1ForFork0_~i~0 1), Black: 1009#(and (<= ~p~0 0) (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1015#(and (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 1037#(and (<= ~p~0 0) (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 0) (<= 0 thread3Thread1of1ForFork1_~i~2)), Black: 1007#(and (<= ~p~0 0) (<= ~N~0 1) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1023#(and (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 0) (<= 0 thread3Thread1of1ForFork1_~i~2)), Black: 899#(<= ~p~0 thread3Thread1of1ForFork1_~i~2), Black: 1001#(and (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1043#(and (<= ~p~0 0) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork1_~i~2)), Black: 1027#(and (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 1011#(and (= ~p~0 thread2Thread1of1ForFork2_~i~1) (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1029#(and (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 738#(= thread1Thread1of1ForFork0_~i~0 0), Black: 1045#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 740#(<= ~N~0 1), Black: 1041#(and (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 1025#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 1003#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~p~0 thread3Thread1of1ForFork1_~i~2)), Black: 1039#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 741#(and (<= ~N~0 1) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1031#(and (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (= thread1Thread1of1ForFork0_~i~0 0) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 812#(and (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork1_~i~2)), 57#(<= 1 ~N~0), Black: 1017#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), 736#true, Black: 1019#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), 4#L88-3true, Black: 51#(and (= ~asum~0 0) (<= (mod ~N~0 4294967296) 0) (= ~csum~0 0)), Black: 50#(and (or (and (<= 0 ~N~0) (<= (+ |ULTIMATE.start_create_fresh_uint_array_~i~3#1| ~N~0) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (< (mod ~N~0 4294967296) 1)) (= ~asum~0 0) (= ~csum~0 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#L51-4true, 1337#(and (<= 1 ~N~0) (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 532#(<= 1 ~N~0), 1645#(and (<= (+ thread1Thread1of1ForFork0_~i~0 1) ~N~0) (<= 0 thread2Thread1of1ForFork2_~i~1)), Black: 338#(= ~p~0 0), Black: 339#(and (= ~p~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 505#(and (= ~p~0 0) (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1144#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 1 thread2Thread1of1ForFork2_~i~1)), Black: 1345#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), Black: 1353#(and (<= thread3Thread1of1ForFork1_~i~2 thread2Thread1of1ForFork2_~i~1) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= 2 ~N~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 1079#(and (<= 1 thread2Thread1of1ForFork2_~i~1) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1078#(and (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1361#(and (<= thread3Thread1of1ForFork1_~i~2 thread2Thread1of1ForFork2_~i~1) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), Black: 726#(and (= ~p~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1359#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) thread2Thread1of1ForFork2_~i~1) (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= 2 ~N~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 725#(= ~p~0 0), 23#L68true, Black: 1077#(= thread2Thread1of1ForFork2_~i~1 0), Black: 1363#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) thread2Thread1of1ForFork2_~i~1) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), Black: 1341#(and (<= 1 ~N~0) (<= 1 thread2Thread1of1ForFork2_~i~1) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1355#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) thread2Thread1of1ForFork2_~i~1) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= 2 ~N~0) (<= thread3Thread1of1ForFork1_~i~2 1)), 336#true, Black: 1367#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) thread2Thread1of1ForFork2_~i~1) (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (<= 0 thread2Thread1of1ForFork2_~i~1)), Black: 1075#true, Black: 1128#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 0 thread2Thread1of1ForFork2_~i~1)), Black: 1109#(<= 0 thread2Thread1of1ForFork2_~i~1), Black: 1349#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 1 thread2Thread1of1ForFork2_~i~1) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), Black: 1246#(< (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0), Black: 1179#(and (<= 2 ~N~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 1365#(and (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (<= 2 ~N~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 1357#(and (<= thread3Thread1of1ForFork1_~i~2 thread2Thread1of1ForFork2_~i~1) (<= 0 thread2Thread1of1ForFork2_~i~1)), 36#L58-3true, Black: 1081#(<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0), 496#(and (<= 1 ~N~0) (<= (+ thread2Thread1of1ForFork2_~i~1 1) ~N~0)), Black: 1502#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= 2 ~N~0)), 1664#true, Black: 1647#(and (<= 1 thread2Thread1of1ForFork2_~i~1) (<= 2 ~N~0)), Black: 501#(= thread2Thread1of1ForFork2_~i~1 0), Black: 503#(and (= ~p~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1393#(<= 2 ~N~0), Black: 1392#(<= 1 thread2Thread1of1ForFork2_~i~1), Black: 1649#(and (<= 1 thread2Thread1of1ForFork2_~i~1) (<= (+ thread1Thread1of1ForFork0_~i~0 1) ~N~0)), Black: 1655#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= 1 thread2Thread1of1ForFork2_~i~1) (<= 2 ~N~0))]) [2025-03-14 01:11:00,481 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2025-03-14 01:11:00,481 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2025-03-14 01:11:00,481 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2025-03-14 01:11:00,481 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2025-03-14 01:11:00,486 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([388] L60-1-->L58-3: Formula: (= v_thread2Thread1of1ForFork2_~i~1_11 v_~p~0_9) InVars {thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_11} OutVars{~p~0=v_~p~0_9, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_11} AuxVars[] AssignedVars[~p~0][240], [323#(and (<= 1 ~N~0) (<= (+ thread1Thread1of1ForFork0_~i~0 1) ~N~0)), Black: 515#(and (= ~p~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 513#(= thread3Thread1of1ForFork1_~i~2 0), Black: 999#(and (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 1005#(and (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 1)), Black: 739#(<= thread1Thread1of1ForFork0_~i~0 1), Black: 1009#(and (<= ~p~0 0) (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1015#(and (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 1037#(and (<= ~p~0 0) (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 0) (<= 0 thread3Thread1of1ForFork1_~i~2)), Black: 1007#(and (<= ~p~0 0) (<= ~N~0 1) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1023#(and (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 0) (<= 0 thread3Thread1of1ForFork1_~i~2)), Black: 899#(<= ~p~0 thread3Thread1of1ForFork1_~i~2), Black: 1001#(and (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1043#(and (<= ~p~0 0) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork1_~i~2)), Black: 1027#(and (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 1011#(and (= ~p~0 thread2Thread1of1ForFork2_~i~1) (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1029#(and (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 738#(= thread1Thread1of1ForFork0_~i~0 0), Black: 1045#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 740#(<= ~N~0 1), Black: 1041#(and (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 1025#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 1003#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~p~0 thread3Thread1of1ForFork1_~i~2)), Black: 1039#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 741#(and (<= ~N~0 1) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1031#(and (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (= thread1Thread1of1ForFork0_~i~0 0) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 812#(and (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork1_~i~2)), 57#(<= 1 ~N~0), Black: 1017#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), 736#true, Black: 1019#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), 4#L88-3true, Black: 51#(and (= ~asum~0 0) (<= (mod ~N~0 4294967296) 0) (= ~csum~0 0)), Black: 50#(and (or (and (<= 0 ~N~0) (<= (+ |ULTIMATE.start_create_fresh_uint_array_~i~3#1| ~N~0) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (< (mod ~N~0 4294967296) 1)) (= ~asum~0 0) (= ~csum~0 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|)), 1337#(and (<= 1 ~N~0) (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 532#(<= 1 ~N~0), 1645#(and (<= (+ thread1Thread1of1ForFork0_~i~0 1) ~N~0) (<= 0 thread2Thread1of1ForFork2_~i~1)), Black: 338#(= ~p~0 0), Black: 339#(and (= ~p~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 505#(and (= ~p~0 0) (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1144#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 1 thread2Thread1of1ForFork2_~i~1)), Black: 1345#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), Black: 1353#(and (<= thread3Thread1of1ForFork1_~i~2 thread2Thread1of1ForFork2_~i~1) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= 2 ~N~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 1079#(and (<= 1 thread2Thread1of1ForFork2_~i~1) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1078#(and (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1361#(and (<= thread3Thread1of1ForFork1_~i~2 thread2Thread1of1ForFork2_~i~1) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), Black: 726#(and (= ~p~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1359#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) thread2Thread1of1ForFork2_~i~1) (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= 2 ~N~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 725#(= ~p~0 0), 23#L68true, Black: 1077#(= thread2Thread1of1ForFork2_~i~1 0), Black: 1363#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) thread2Thread1of1ForFork2_~i~1) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), Black: 1341#(and (<= 1 ~N~0) (<= 1 thread2Thread1of1ForFork2_~i~1) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1355#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) thread2Thread1of1ForFork2_~i~1) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= 2 ~N~0) (<= thread3Thread1of1ForFork1_~i~2 1)), 336#true, Black: 1367#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) thread2Thread1of1ForFork2_~i~1) (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (<= 0 thread2Thread1of1ForFork2_~i~1)), Black: 1075#true, Black: 1128#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 0 thread2Thread1of1ForFork2_~i~1)), Black: 1109#(<= 0 thread2Thread1of1ForFork2_~i~1), Black: 1349#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 1 thread2Thread1of1ForFork2_~i~1) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), Black: 1246#(< (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0), 3#L51-1true, Black: 1179#(and (<= 2 ~N~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 1365#(and (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (<= 2 ~N~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 1357#(and (<= thread3Thread1of1ForFork1_~i~2 thread2Thread1of1ForFork2_~i~1) (<= 0 thread2Thread1of1ForFork2_~i~1)), 36#L58-3true, Black: 1081#(<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0), 496#(and (<= 1 ~N~0) (<= (+ thread2Thread1of1ForFork2_~i~1 1) ~N~0)), Black: 1502#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= 2 ~N~0)), Black: 1647#(and (<= 1 thread2Thread1of1ForFork2_~i~1) (<= 2 ~N~0)), 1664#true, Black: 501#(= thread2Thread1of1ForFork2_~i~1 0), Black: 503#(and (= ~p~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1393#(<= 2 ~N~0), Black: 1392#(<= 1 thread2Thread1of1ForFork2_~i~1), Black: 1649#(and (<= 1 thread2Thread1of1ForFork2_~i~1) (<= (+ thread1Thread1of1ForFork0_~i~0 1) ~N~0)), Black: 1655#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= 1 thread2Thread1of1ForFork2_~i~1) (<= 2 ~N~0))]) [2025-03-14 01:11:00,486 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2025-03-14 01:11:00,486 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2025-03-14 01:11:00,486 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2025-03-14 01:11:00,486 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2025-03-14 01:11:00,751 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([388] L60-1-->L58-3: Formula: (= v_thread2Thread1of1ForFork2_~i~1_11 v_~p~0_9) InVars {thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_11} OutVars{~p~0=v_~p~0_9, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_11} AuxVars[] AssignedVars[~p~0][240], [323#(and (<= 1 ~N~0) (<= (+ thread1Thread1of1ForFork0_~i~0 1) ~N~0)), Black: 515#(and (= ~p~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 513#(= thread3Thread1of1ForFork1_~i~2 0), Black: 999#(and (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 1005#(and (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 1)), Black: 739#(<= thread1Thread1of1ForFork0_~i~0 1), Black: 1009#(and (<= ~p~0 0) (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1015#(and (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 1037#(and (<= ~p~0 0) (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 0) (<= 0 thread3Thread1of1ForFork1_~i~2)), Black: 1007#(and (<= ~p~0 0) (<= ~N~0 1) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1023#(and (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 0) (<= 0 thread3Thread1of1ForFork1_~i~2)), Black: 899#(<= ~p~0 thread3Thread1of1ForFork1_~i~2), Black: 1001#(and (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1043#(and (<= ~p~0 0) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork1_~i~2)), Black: 1027#(and (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 1011#(and (= ~p~0 thread2Thread1of1ForFork2_~i~1) (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1029#(and (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 738#(= thread1Thread1of1ForFork0_~i~0 0), Black: 1045#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 740#(<= ~N~0 1), Black: 1041#(and (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 1025#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 1003#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~p~0 thread3Thread1of1ForFork1_~i~2)), Black: 1039#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 741#(and (<= ~N~0 1) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1031#(and (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (= thread1Thread1of1ForFork0_~i~0 0) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 812#(and (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork1_~i~2)), 57#(<= 1 ~N~0), Black: 1017#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), 736#true, Black: 1019#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 51#(and (= ~asum~0 0) (<= (mod ~N~0 4294967296) 0) (= ~csum~0 0)), Black: 50#(and (or (and (<= 0 ~N~0) (<= (+ |ULTIMATE.start_create_fresh_uint_array_~i~3#1| ~N~0) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (< (mod ~N~0 4294967296) 1)) (= ~asum~0 0) (= ~csum~0 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#L51-4true, 1337#(and (<= 1 ~N~0) (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 532#(<= 1 ~N~0), 1645#(and (<= (+ thread1Thread1of1ForFork0_~i~0 1) ~N~0) (<= 0 thread2Thread1of1ForFork2_~i~1)), Black: 338#(= ~p~0 0), Black: 339#(and (= ~p~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 505#(and (= ~p~0 0) (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1144#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 1 thread2Thread1of1ForFork2_~i~1)), Black: 1345#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), 7#L89true, Black: 1353#(and (<= thread3Thread1of1ForFork1_~i~2 thread2Thread1of1ForFork2_~i~1) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= 2 ~N~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 1079#(and (<= 1 thread2Thread1of1ForFork2_~i~1) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1078#(and (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1361#(and (<= thread3Thread1of1ForFork1_~i~2 thread2Thread1of1ForFork2_~i~1) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), Black: 726#(and (= ~p~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1359#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) thread2Thread1of1ForFork2_~i~1) (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= 2 ~N~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 725#(= ~p~0 0), 23#L68true, Black: 1077#(= thread2Thread1of1ForFork2_~i~1 0), Black: 1363#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) thread2Thread1of1ForFork2_~i~1) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), Black: 1341#(and (<= 1 ~N~0) (<= 1 thread2Thread1of1ForFork2_~i~1) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1355#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) thread2Thread1of1ForFork2_~i~1) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= 2 ~N~0) (<= thread3Thread1of1ForFork1_~i~2 1)), 336#true, Black: 1367#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) thread2Thread1of1ForFork2_~i~1) (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (<= 0 thread2Thread1of1ForFork2_~i~1)), Black: 1075#true, Black: 1128#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 0 thread2Thread1of1ForFork2_~i~1)), Black: 1109#(<= 0 thread2Thread1of1ForFork2_~i~1), Black: 1349#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 1 thread2Thread1of1ForFork2_~i~1) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), Black: 1246#(< (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0), Black: 1179#(and (<= 2 ~N~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 1365#(and (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (<= 2 ~N~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 1357#(and (<= thread3Thread1of1ForFork1_~i~2 thread2Thread1of1ForFork2_~i~1) (<= 0 thread2Thread1of1ForFork2_~i~1)), 36#L58-3true, Black: 1081#(<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0), 496#(and (<= 1 ~N~0) (<= (+ thread2Thread1of1ForFork2_~i~1 1) ~N~0)), Black: 1502#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= 2 ~N~0)), 1664#true, Black: 1647#(and (<= 1 thread2Thread1of1ForFork2_~i~1) (<= 2 ~N~0)), Black: 501#(= thread2Thread1of1ForFork2_~i~1 0), Black: 503#(and (= ~p~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1393#(<= 2 ~N~0), Black: 1392#(<= 1 thread2Thread1of1ForFork2_~i~1), Black: 1649#(and (<= 1 thread2Thread1of1ForFork2_~i~1) (<= (+ thread1Thread1of1ForFork0_~i~0 1) ~N~0)), Black: 1655#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= 1 thread2Thread1of1ForFork2_~i~1) (<= 2 ~N~0))]) [2025-03-14 01:11:00,751 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2025-03-14 01:11:00,751 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2025-03-14 01:11:00,751 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2025-03-14 01:11:00,751 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2025-03-14 01:11:00,758 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([388] L60-1-->L58-3: Formula: (= v_thread2Thread1of1ForFork2_~i~1_11 v_~p~0_9) InVars {thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_11} OutVars{~p~0=v_~p~0_9, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_11} AuxVars[] AssignedVars[~p~0][240], [323#(and (<= 1 ~N~0) (<= (+ thread1Thread1of1ForFork0_~i~0 1) ~N~0)), Black: 515#(and (= ~p~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 513#(= thread3Thread1of1ForFork1_~i~2 0), Black: 999#(and (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 1005#(and (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 1)), Black: 739#(<= thread1Thread1of1ForFork0_~i~0 1), Black: 1009#(and (<= ~p~0 0) (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1015#(and (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 1037#(and (<= ~p~0 0) (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 0) (<= 0 thread3Thread1of1ForFork1_~i~2)), Black: 1007#(and (<= ~p~0 0) (<= ~N~0 1) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1023#(and (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 0) (<= 0 thread3Thread1of1ForFork1_~i~2)), Black: 899#(<= ~p~0 thread3Thread1of1ForFork1_~i~2), Black: 1001#(and (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1043#(and (<= ~p~0 0) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork1_~i~2)), Black: 1027#(and (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 1011#(and (= ~p~0 thread2Thread1of1ForFork2_~i~1) (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1029#(and (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 738#(= thread1Thread1of1ForFork0_~i~0 0), Black: 1045#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 740#(<= ~N~0 1), Black: 1041#(and (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 1025#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 1003#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~p~0 thread3Thread1of1ForFork1_~i~2)), Black: 1039#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 741#(and (<= ~N~0 1) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1031#(and (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (= thread1Thread1of1ForFork0_~i~0 0) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 812#(and (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork1_~i~2)), 57#(<= 1 ~N~0), Black: 1017#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), 736#true, Black: 1019#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 51#(and (= ~asum~0 0) (<= (mod ~N~0 4294967296) 0) (= ~csum~0 0)), Black: 50#(and (or (and (<= 0 ~N~0) (<= (+ |ULTIMATE.start_create_fresh_uint_array_~i~3#1| ~N~0) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (< (mod ~N~0 4294967296) 1)) (= ~asum~0 0) (= ~csum~0 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|)), 1337#(and (<= 1 ~N~0) (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 532#(<= 1 ~N~0), 1645#(and (<= (+ thread1Thread1of1ForFork0_~i~0 1) ~N~0) (<= 0 thread2Thread1of1ForFork2_~i~1)), Black: 338#(= ~p~0 0), Black: 339#(and (= ~p~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 505#(and (= ~p~0 0) (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1144#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 1 thread2Thread1of1ForFork2_~i~1)), Black: 1345#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), 7#L89true, Black: 1353#(and (<= thread3Thread1of1ForFork1_~i~2 thread2Thread1of1ForFork2_~i~1) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= 2 ~N~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 1079#(and (<= 1 thread2Thread1of1ForFork2_~i~1) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1078#(and (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1361#(and (<= thread3Thread1of1ForFork1_~i~2 thread2Thread1of1ForFork2_~i~1) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), Black: 726#(and (= ~p~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1359#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) thread2Thread1of1ForFork2_~i~1) (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= 2 ~N~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 725#(= ~p~0 0), 23#L68true, Black: 1077#(= thread2Thread1of1ForFork2_~i~1 0), Black: 1363#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) thread2Thread1of1ForFork2_~i~1) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), Black: 1341#(and (<= 1 ~N~0) (<= 1 thread2Thread1of1ForFork2_~i~1) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1355#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) thread2Thread1of1ForFork2_~i~1) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= 2 ~N~0) (<= thread3Thread1of1ForFork1_~i~2 1)), 336#true, Black: 1367#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) thread2Thread1of1ForFork2_~i~1) (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (<= 0 thread2Thread1of1ForFork2_~i~1)), Black: 1075#true, Black: 1128#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 0 thread2Thread1of1ForFork2_~i~1)), Black: 1109#(<= 0 thread2Thread1of1ForFork2_~i~1), Black: 1349#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 1 thread2Thread1of1ForFork2_~i~1) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), Black: 1246#(< (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0), 3#L51-1true, Black: 1179#(and (<= 2 ~N~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 1365#(and (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (<= 2 ~N~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 1357#(and (<= thread3Thread1of1ForFork1_~i~2 thread2Thread1of1ForFork2_~i~1) (<= 0 thread2Thread1of1ForFork2_~i~1)), 36#L58-3true, Black: 1081#(<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0), 496#(and (<= 1 ~N~0) (<= (+ thread2Thread1of1ForFork2_~i~1 1) ~N~0)), Black: 1502#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= 2 ~N~0)), Black: 1647#(and (<= 1 thread2Thread1of1ForFork2_~i~1) (<= 2 ~N~0)), Black: 501#(= thread2Thread1of1ForFork2_~i~1 0), 1664#true, Black: 503#(and (= ~p~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1393#(<= 2 ~N~0), Black: 1392#(<= 1 thread2Thread1of1ForFork2_~i~1), Black: 1649#(and (<= 1 thread2Thread1of1ForFork2_~i~1) (<= (+ thread1Thread1of1ForFork0_~i~0 1) ~N~0)), Black: 1655#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= 1 thread2Thread1of1ForFork2_~i~1) (<= 2 ~N~0))]) [2025-03-14 01:11:00,758 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2025-03-14 01:11:00,758 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2025-03-14 01:11:00,758 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2025-03-14 01:11:00,758 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event