./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 8fc3dc66 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-?-8fc3dc6-m [2025-03-17 06:45:46,179 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 06:45:46,226 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 06:45:46,231 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 06:45:46,231 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 06:45:46,249 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 06:45:46,249 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 06:45:46,249 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 06:45:46,250 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 06:45:46,250 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 06:45:46,251 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 06:45:46,251 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 06:45:46,251 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 06:45:46,251 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 06:45:46,251 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 06:45:46,252 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 06:45:46,252 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 06:45:46,252 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 06:45:46,252 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 06:45:46,252 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 06:45:46,252 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 06:45:46,252 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 06:45:46,252 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 06:45:46,252 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 06:45:46,252 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 06:45:46,253 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 06:45:46,253 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 06:45:46,253 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 06:45:46,253 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 06:45:46,253 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 06:45:46,253 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 06:45:46,253 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 06:45:46,253 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:45:46,254 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 06:45:46,254 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 06:45:46,254 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 06:45:46,254 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 06:45:46,254 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 06:45:46,254 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 06:45:46,254 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 06:45:46,254 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 06:45:46,254 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 06:45:46,254 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 06:45:46,254 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-17 06:45:46,491 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 06:45:46,500 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 06:45:46,502 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 06:45:46,503 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 06:45:46,503 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 06:45:46,505 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-17 06:45:47,818 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca13c32ea/c93c68959ba74491832286756f41c1d9/FLAG8a64a314e [2025-03-17 06:45:48,063 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 06:45:48,064 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-simple-array-sum.wvr.c [2025-03-17 06:45:48,071 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca13c32ea/c93c68959ba74491832286756f41c1d9/FLAG8a64a314e [2025-03-17 06:45:48,083 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca13c32ea/c93c68959ba74491832286756f41c1d9 [2025-03-17 06:45:48,085 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 06:45:48,086 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 06:45:48,087 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 06:45:48,087 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 06:45:48,091 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 06:45:48,092 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:45:48" (1/1) ... [2025-03-17 06:45:48,093 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ae63379 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:45:48, skipping insertion in model container [2025-03-17 06:45:48,093 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:45:48" (1/1) ... [2025-03-17 06:45:48,105 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 06:45:48,266 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-17 06:45:48,277 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:45:48,291 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 06:45:48,317 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-17 06:45:48,322 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:45:48,338 INFO L204 MainTranslator]: Completed translation [2025-03-17 06:45:48,339 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:45:48 WrapperNode [2025-03-17 06:45:48,339 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 06:45:48,340 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 06:45:48,340 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 06:45:48,340 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 06:45:48,345 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:45:48" (1/1) ... [2025-03-17 06:45:48,349 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:45:48" (1/1) ... [2025-03-17 06:45:48,365 INFO L138 Inliner]: procedures = 23, calls = 20, calls flagged for inlining = 7, calls inlined = 9, statements flattened = 103 [2025-03-17 06:45:48,365 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 06:45:48,366 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 06:45:48,366 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 06:45:48,366 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 06:45:48,371 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:45:48" (1/1) ... [2025-03-17 06:45:48,372 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:45:48" (1/1) ... [2025-03-17 06:45:48,373 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:45:48" (1/1) ... [2025-03-17 06:45:48,382 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-17 06:45:48,383 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:45:48" (1/1) ... [2025-03-17 06:45:48,383 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:45:48" (1/1) ... [2025-03-17 06:45:48,390 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:45:48" (1/1) ... [2025-03-17 06:45:48,391 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:45:48" (1/1) ... [2025-03-17 06:45:48,392 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:45:48" (1/1) ... [2025-03-17 06:45:48,396 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:45:48" (1/1) ... [2025-03-17 06:45:48,398 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 06:45:48,398 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 06:45:48,401 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 06:45:48,401 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 06:45:48,402 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:45:48" (1/1) ... [2025-03-17 06:45:48,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:45:48,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:45:48,427 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-17 06:45:48,431 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-17 06:45:48,451 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 06:45:48,451 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-17 06:45:48,451 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-17 06:45:48,451 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-17 06:45:48,451 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-17 06:45:48,451 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-17 06:45:48,451 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-17 06:45:48,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 06:45:48,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 06:45:48,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 06:45:48,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 06:45:48,452 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 06:45:48,452 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 06:45:48,452 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 06:45:48,452 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 06:45:48,452 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 06:45:48,453 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 06:45:48,538 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 06:45:48,540 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 06:45:48,761 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 06:45:48,761 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 06:45:48,907 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 06:45:48,908 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 06:45:48,908 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:45:48 BoogieIcfgContainer [2025-03-17 06:45:48,908 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 06:45:48,910 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 06:45:48,910 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 06:45:48,913 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 06:45:48,913 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 06:45:48" (1/3) ... [2025-03-17 06:45:48,914 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@588acf9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:45:48, skipping insertion in model container [2025-03-17 06:45:48,914 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:45:48" (2/3) ... [2025-03-17 06:45:48,915 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@588acf9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:45:48, skipping insertion in model container [2025-03-17 06:45:48,915 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:45:48" (3/3) ... [2025-03-17 06:45:48,916 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-simple-array-sum.wvr.c [2025-03-17 06:45:48,927 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 06:45:48,928 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-17 06:45:48,929 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 06:45:48,981 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-17 06:45:49,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 41 transitions, 103 flow [2025-03-17 06:45:49,045 INFO L124 PetriNetUnfolderBase]: 6/38 cut-off events. [2025-03-17 06:45:49,048 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-17 06:45:49,052 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-17 06:45:49,053 INFO L82 GeneralOperation]: Start removeDead. Operand has 45 places, 41 transitions, 103 flow [2025-03-17 06:45:49,055 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 41 places, 37 transitions, 92 flow [2025-03-17 06:45:49,063 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 06:45:49,082 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;@2a95c1cd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 06:45:49,083 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-17 06:45:49,104 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 06:45:49,105 INFO L124 PetriNetUnfolderBase]: 6/36 cut-off events. [2025-03-17 06:45:49,105 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-17 06:45:49,105 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:45:49,105 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-17 06:45:49,106 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-17 06:45:49,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:45:49,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1466795163, now seen corresponding path program 1 times [2025-03-17 06:45:49,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:45:49,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343582398] [2025-03-17 06:45:49,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:45:49,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:45:49,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 06:45:49,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 06:45:49,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:45:49,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:45:49,819 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-17 06:45:49,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:45:49,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343582398] [2025-03-17 06:45:49,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343582398] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:45:49,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:45:49,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 06:45:49,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557890396] [2025-03-17 06:45:49,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:45:49,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:45:49,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:45:49,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:45:49,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:45:49,865 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2025-03-17 06:45:49,867 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-17 06:45:49,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:45:49,867 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2025-03-17 06:45:49,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:45:50,183 INFO L124 PetriNetUnfolderBase]: 1474/2293 cut-off events. [2025-03-17 06:45:50,186 INFO L125 PetriNetUnfolderBase]: For 185/185 co-relation queries the response was YES. [2025-03-17 06:45:50,197 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 11679 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-17 06:45:50,209 INFO L140 encePairwiseOnDemand]: 35/41 looper letters, 51 selfloop transitions, 5 changer transitions 1/64 dead transitions. [2025-03-17 06:45:50,210 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 64 transitions, 278 flow [2025-03-17 06:45:50,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:45:50,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 06:45:50,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 98 transitions. [2025-03-17 06:45:50,220 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5975609756097561 [2025-03-17 06:45:50,221 INFO L175 Difference]: Start difference. First operand has 41 places, 37 transitions, 92 flow. Second operand 4 states and 98 transitions. [2025-03-17 06:45:50,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 64 transitions, 278 flow [2025-03-17 06:45:50,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 64 transitions, 254 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-17 06:45:50,232 INFO L231 Difference]: Finished difference. Result has 40 places, 41 transitions, 114 flow [2025-03-17 06:45:50,234 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-17 06:45:50,237 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, -1 predicate places. [2025-03-17 06:45:50,240 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 41 transitions, 114 flow [2025-03-17 06:45:50,240 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-17 06:45:50,240 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:45:50,240 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-17 06:45:50,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 06:45:50,241 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-17 06:45:50,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:45:50,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1005656583, now seen corresponding path program 1 times [2025-03-17 06:45:50,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:45:50,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011954796] [2025-03-17 06:45:50,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:45:50,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:45:50,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-17 06:45:50,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 06:45:50,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:45:50,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:45:50,375 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-17 06:45:50,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:45:50,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011954796] [2025-03-17 06:45:50,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011954796] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:45:50,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [388406506] [2025-03-17 06:45:50,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:45:50,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:45:50,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:45:50,379 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-17 06:45:50,380 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-17 06:45:50,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-17 06:45:50,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 06:45:50,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:45:50,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:45:50,451 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 06:45:50,454 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:45:50,498 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-17 06:45:50,499 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 06:45:50,542 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-17 06:45:50,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [388406506] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 06:45:50,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-17 06:45:50,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 9 [2025-03-17 06:45:50,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037043003] [2025-03-17 06:45:50,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:45:50,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 06:45:50,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:45:50,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 06:45:50,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-17 06:45:50,556 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2025-03-17 06:45:50,556 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-17 06:45:50,557 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:45:50,557 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2025-03-17 06:45:50,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:45:50,952 INFO L124 PetriNetUnfolderBase]: 2892/4504 cut-off events. [2025-03-17 06:45:50,953 INFO L125 PetriNetUnfolderBase]: For 419/419 co-relation queries the response was YES. [2025-03-17 06:45:50,962 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 25928 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-17 06:45:50,986 INFO L140 encePairwiseOnDemand]: 36/41 looper letters, 58 selfloop transitions, 6 changer transitions 0/71 dead transitions. [2025-03-17 06:45:50,986 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 71 transitions, 320 flow [2025-03-17 06:45:50,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 06:45:50,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 06:45:50,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 111 transitions. [2025-03-17 06:45:50,987 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5414634146341464 [2025-03-17 06:45:50,987 INFO L175 Difference]: Start difference. First operand has 40 places, 41 transitions, 114 flow. Second operand 5 states and 111 transitions. [2025-03-17 06:45:50,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 71 transitions, 320 flow [2025-03-17 06:45:50,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 71 transitions, 312 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-17 06:45:50,990 INFO L231 Difference]: Finished difference. Result has 45 places, 44 transitions, 138 flow [2025-03-17 06:45:50,990 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-17 06:45:50,990 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 4 predicate places. [2025-03-17 06:45:50,990 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 44 transitions, 138 flow [2025-03-17 06:45:50,991 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-17 06:45:50,991 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:45:50,991 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-17 06:45:50,998 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 06:45:51,195 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-17 06:45:51,195 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-17 06:45:51,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:45:51,196 INFO L85 PathProgramCache]: Analyzing trace with hash -239528509, now seen corresponding path program 1 times [2025-03-17 06:45:51,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:45:51,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911561819] [2025-03-17 06:45:51,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:45:51,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:45:51,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 06:45:51,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 06:45:51,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:45:51,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:45:51,349 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-17 06:45:51,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:45:51,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911561819] [2025-03-17 06:45:51,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911561819] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:45:51,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [691359169] [2025-03-17 06:45:51,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:45:51,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:45:51,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:45:51,355 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-17 06:45:51,369 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-17 06:45:51,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 06:45:51,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 06:45:51,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:45:51,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:45:51,454 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 06:45:51,455 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:45:51,497 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-17 06:45:51,497 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 06:45:51,537 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-17 06:45:51,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [691359169] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 06:45:51,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-17 06:45:51,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2025-03-17 06:45:51,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086953999] [2025-03-17 06:45:51,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:45:51,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 06:45:51,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:45:51,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 06:45:51,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-17 06:45:51,548 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2025-03-17 06:45:51,549 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-17 06:45:51,549 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:45:51,549 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2025-03-17 06:45:51,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:45:52,039 INFO L124 PetriNetUnfolderBase]: 3466/5174 cut-off events. [2025-03-17 06:45:52,040 INFO L125 PetriNetUnfolderBase]: For 251/251 co-relation queries the response was YES. [2025-03-17 06:45:52,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10713 conditions, 5174 events. 3466/5174 cut-off events. For 251/251 co-relation queries the response was YES. Maximal size of possible extension queue 275. Compared 29081 event pairs, 1260 based on Foata normal form. 0/4781 useless extension candidates. Maximal degree in co-relation 8838. Up to 1478 conditions per place. [2025-03-17 06:45:52,069 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 90 selfloop transitions, 11 changer transitions 0/107 dead transitions. [2025-03-17 06:45:52,069 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 107 transitions, 494 flow [2025-03-17 06:45:52,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 06:45:52,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 06:45:52,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 149 transitions. [2025-03-17 06:45:52,074 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6056910569105691 [2025-03-17 06:45:52,075 INFO L175 Difference]: Start difference. First operand has 45 places, 44 transitions, 138 flow. Second operand 6 states and 149 transitions. [2025-03-17 06:45:52,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 107 transitions, 494 flow [2025-03-17 06:45:52,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 107 transitions, 490 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-17 06:45:52,077 INFO L231 Difference]: Finished difference. Result has 51 places, 49 transitions, 186 flow [2025-03-17 06:45:52,077 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-17 06:45:52,078 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 10 predicate places. [2025-03-17 06:45:52,078 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 49 transitions, 186 flow [2025-03-17 06:45:52,078 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-17 06:45:52,079 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:45:52,079 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-17 06:45:52,085 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-17 06:45:52,283 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-17 06:45:52,283 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-17 06:45:52,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:45:52,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1853692891, now seen corresponding path program 1 times [2025-03-17 06:45:52,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:45:52,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303250004] [2025-03-17 06:45:52,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:45:52,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:45:52,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 06:45:52,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 06:45:52,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:45:52,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:45:52,402 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-17 06:45:52,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:45:52,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303250004] [2025-03-17 06:45:52,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303250004] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:45:52,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:45:52,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 06:45:52,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497987662] [2025-03-17 06:45:52,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:45:52,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 06:45:52,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:45:52,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 06:45:52,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 06:45:52,414 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2025-03-17 06:45:52,414 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-17 06:45:52,415 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:45:52,415 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2025-03-17 06:45:52,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:45:52,709 INFO L124 PetriNetUnfolderBase]: 2023/3198 cut-off events. [2025-03-17 06:45:52,710 INFO L125 PetriNetUnfolderBase]: For 1371/1371 co-relation queries the response was YES. [2025-03-17 06:45:52,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7136 conditions, 3198 events. 2023/3198 cut-off events. For 1371/1371 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 16746 event pairs, 1244 based on Foata normal form. 111/3171 useless extension candidates. Maximal degree in co-relation 4202. Up to 1609 conditions per place. [2025-03-17 06:45:52,726 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 69 selfloop transitions, 8 changer transitions 0/83 dead transitions. [2025-03-17 06:45:52,727 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 83 transitions, 404 flow [2025-03-17 06:45:52,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 06:45:52,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 06:45:52,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 130 transitions. [2025-03-17 06:45:52,729 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5284552845528455 [2025-03-17 06:45:52,729 INFO L175 Difference]: Start difference. First operand has 51 places, 49 transitions, 186 flow. Second operand 6 states and 130 transitions. [2025-03-17 06:45:52,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 83 transitions, 404 flow [2025-03-17 06:45:52,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 83 transitions, 399 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 06:45:52,734 INFO L231 Difference]: Finished difference. Result has 54 places, 45 transitions, 173 flow [2025-03-17 06:45:52,734 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=48, 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=173, PETRI_PLACES=54, PETRI_TRANSITIONS=45} [2025-03-17 06:45:52,735 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 13 predicate places. [2025-03-17 06:45:52,735 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 45 transitions, 173 flow [2025-03-17 06:45:52,736 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-17 06:45:52,736 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:45:52,736 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-17 06:45:52,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 06:45:52,736 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-17 06:45:52,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:45:52,738 INFO L85 PathProgramCache]: Analyzing trace with hash 908399004, now seen corresponding path program 1 times [2025-03-17 06:45:52,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:45:52,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524770908] [2025-03-17 06:45:52,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:45:52,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:45:52,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 06:45:52,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 06:45:52,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:45:52,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:45:52,792 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-17 06:45:52,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:45:52,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524770908] [2025-03-17 06:45:52,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524770908] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:45:52,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:45:52,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 06:45:52,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959670088] [2025-03-17 06:45:52,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:45:52,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:45:52,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:45:52,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:45:52,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:45:52,800 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2025-03-17 06:45:52,800 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 45 transitions, 173 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-17 06:45:52,801 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:45:52,801 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2025-03-17 06:45:52,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:45:53,066 INFO L124 PetriNetUnfolderBase]: 2565/4066 cut-off events. [2025-03-17 06:45:53,066 INFO L125 PetriNetUnfolderBase]: For 2704/2704 co-relation queries the response was YES. [2025-03-17 06:45:53,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9507 conditions, 4066 events. 2565/4066 cut-off events. For 2704/2704 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 21115 event pairs, 568 based on Foata normal form. 92/4144 useless extension candidates. Maximal degree in co-relation 5193. Up to 2578 conditions per place. [2025-03-17 06:45:53,090 INFO L140 encePairwiseOnDemand]: 37/41 looper letters, 67 selfloop transitions, 4 changer transitions 0/78 dead transitions. [2025-03-17 06:45:53,090 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 78 transitions, 437 flow [2025-03-17 06:45:53,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:45:53,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 06:45:53,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 97 transitions. [2025-03-17 06:45:53,091 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5914634146341463 [2025-03-17 06:45:53,091 INFO L175 Difference]: Start difference. First operand has 54 places, 45 transitions, 173 flow. Second operand 4 states and 97 transitions. [2025-03-17 06:45:53,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 78 transitions, 437 flow [2025-03-17 06:45:53,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 78 transitions, 405 flow, removed 6 selfloop flow, removed 4 redundant places. [2025-03-17 06:45:53,098 INFO L231 Difference]: Finished difference. Result has 55 places, 48 transitions, 178 flow [2025-03-17 06:45:53,098 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-17 06:45:53,099 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 14 predicate places. [2025-03-17 06:45:53,099 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 48 transitions, 178 flow [2025-03-17 06:45:53,099 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-17 06:45:53,099 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:45:53,099 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-17 06:45:53,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 06:45:53,099 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-17 06:45:53,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:45:53,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1802201733, now seen corresponding path program 1 times [2025-03-17 06:45:53,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:45:53,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773658908] [2025-03-17 06:45:53,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:45:53,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:45:53,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 06:45:53,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 06:45:53,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:45:53,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:45:53,217 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-17 06:45:53,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:45:53,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773658908] [2025-03-17 06:45:53,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773658908] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:45:53,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1695502473] [2025-03-17 06:45:53,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:45:53,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:45:53,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:45:53,220 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-17 06:45:53,221 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-17 06:45:53,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 06:45:53,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 06:45:53,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:45:53,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:45:53,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 06:45:53,283 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:45:53,337 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-17 06:45:53,338 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 06:45:53,384 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-17 06:45:53,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1695502473] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 06:45:53,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-17 06:45:53,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2025-03-17 06:45:53,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803634706] [2025-03-17 06:45:53,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:45:53,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 06:45:53,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:45:53,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 06:45:53,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-17 06:45:53,393 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2025-03-17 06:45:53,393 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-17 06:45:53,393 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:45:53,393 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2025-03-17 06:45:53,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:45:53,806 INFO L124 PetriNetUnfolderBase]: 2537/3996 cut-off events. [2025-03-17 06:45:53,806 INFO L125 PetriNetUnfolderBase]: For 2377/2377 co-relation queries the response was YES. [2025-03-17 06:45:53,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9728 conditions, 3996 events. 2537/3996 cut-off events. For 2377/2377 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 20909 event pairs, 692 based on Foata normal form. 0/3821 useless extension candidates. Maximal degree in co-relation 5339. Up to 1455 conditions per place. [2025-03-17 06:45:53,833 INFO L140 encePairwiseOnDemand]: 34/41 looper letters, 86 selfloop transitions, 8 changer transitions 0/101 dead transitions. [2025-03-17 06:45:53,834 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 101 transitions, 536 flow [2025-03-17 06:45:53,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 06:45:53,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 06:45:53,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 138 transitions. [2025-03-17 06:45:53,835 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5609756097560976 [2025-03-17 06:45:53,835 INFO L175 Difference]: Start difference. First operand has 55 places, 48 transitions, 178 flow. Second operand 6 states and 138 transitions. [2025-03-17 06:45:53,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 101 transitions, 536 flow [2025-03-17 06:45:53,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 101 transitions, 536 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 06:45:53,838 INFO L231 Difference]: Finished difference. Result has 62 places, 52 transitions, 215 flow [2025-03-17 06:45:53,839 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-17 06:45:53,839 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 21 predicate places. [2025-03-17 06:45:53,839 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 52 transitions, 215 flow [2025-03-17 06:45:53,839 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-17 06:45:53,840 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:45:53,840 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-17 06:45:53,848 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-17 06:45:54,040 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-17 06:45:54,041 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-17 06:45:54,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:45:54,041 INFO L85 PathProgramCache]: Analyzing trace with hash -2038309770, now seen corresponding path program 1 times [2025-03-17 06:45:54,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:45:54,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000544959] [2025-03-17 06:45:54,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:45:54,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:45:54,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-17 06:45:54,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-17 06:45:54,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:45:54,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:45:54,142 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-17 06:45:54,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:45:54,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000544959] [2025-03-17 06:45:54,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000544959] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:45:54,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:45:54,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 06:45:54,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821299220] [2025-03-17 06:45:54,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:45:54,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 06:45:54,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:45:54,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 06:45:54,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 06:45:54,159 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2025-03-17 06:45:54,159 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-17 06:45:54,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:45:54,159 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2025-03-17 06:45:54,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:45:54,674 INFO L124 PetriNetUnfolderBase]: 3531/5766 cut-off events. [2025-03-17 06:45:54,674 INFO L125 PetriNetUnfolderBase]: For 3995/4031 co-relation queries the response was YES. [2025-03-17 06:45:54,687 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 34150 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-17 06:45:54,701 INFO L140 encePairwiseOnDemand]: 34/41 looper letters, 98 selfloop transitions, 15 changer transitions 0/122 dead transitions. [2025-03-17 06:45:54,701 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 122 transitions, 709 flow [2025-03-17 06:45:54,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 06:45:54,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 06:45:54,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 144 transitions. [2025-03-17 06:45:54,702 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5853658536585366 [2025-03-17 06:45:54,702 INFO L175 Difference]: Start difference. First operand has 62 places, 52 transitions, 215 flow. Second operand 6 states and 144 transitions. [2025-03-17 06:45:54,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 122 transitions, 709 flow [2025-03-17 06:45:54,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 122 transitions, 706 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 06:45:54,706 INFO L231 Difference]: Finished difference. Result has 70 places, 65 transitions, 344 flow [2025-03-17 06:45:54,706 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-17 06:45:54,707 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 29 predicate places. [2025-03-17 06:45:54,707 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 65 transitions, 344 flow [2025-03-17 06:45:54,707 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-17 06:45:54,707 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:45:54,707 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-17 06:45:54,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 06:45:54,707 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-17 06:45:54,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:45:54,708 INFO L85 PathProgramCache]: Analyzing trace with hash -67886864, now seen corresponding path program 2 times [2025-03-17 06:45:54,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:45:54,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187589690] [2025-03-17 06:45:54,708 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 06:45:54,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:45:54,715 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-17 06:45:54,728 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-17 06:45:54,728 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 06:45:54,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:45:54,799 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-17 06:45:54,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:45:54,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187589690] [2025-03-17 06:45:54,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187589690] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:45:54,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:45:54,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 06:45:54,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237424334] [2025-03-17 06:45:54,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:45:54,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 06:45:54,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:45:54,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 06:45:54,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 06:45:54,809 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2025-03-17 06:45:54,809 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-17 06:45:54,809 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:45:54,809 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2025-03-17 06:45:54,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:45:55,290 INFO L124 PetriNetUnfolderBase]: 4662/7456 cut-off events. [2025-03-17 06:45:55,291 INFO L125 PetriNetUnfolderBase]: For 10111/10163 co-relation queries the response was YES. [2025-03-17 06:45:55,315 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 43605 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-17 06:45:55,338 INFO L140 encePairwiseOnDemand]: 34/41 looper letters, 105 selfloop transitions, 13 changer transitions 1/128 dead transitions. [2025-03-17 06:45:55,339 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 128 transitions, 861 flow [2025-03-17 06:45:55,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 06:45:55,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 06:45:55,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 140 transitions. [2025-03-17 06:45:55,340 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5691056910569106 [2025-03-17 06:45:55,340 INFO L175 Difference]: Start difference. First operand has 70 places, 65 transitions, 344 flow. Second operand 6 states and 140 transitions. [2025-03-17 06:45:55,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 128 transitions, 861 flow [2025-03-17 06:45:55,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 128 transitions, 859 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-03-17 06:45:55,352 INFO L231 Difference]: Finished difference. Result has 78 places, 71 transitions, 442 flow [2025-03-17 06:45:55,352 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-17 06:45:55,354 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 37 predicate places. [2025-03-17 06:45:55,354 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 71 transitions, 442 flow [2025-03-17 06:45:55,355 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-17 06:45:55,355 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:45:55,355 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-17 06:45:55,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 06:45:55,355 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-17 06:45:55,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:45:55,355 INFO L85 PathProgramCache]: Analyzing trace with hash -938713238, now seen corresponding path program 3 times [2025-03-17 06:45:55,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:45:55,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418971609] [2025-03-17 06:45:55,355 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 06:45:55,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:45:55,363 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 2 equivalence classes. [2025-03-17 06:45:55,370 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 26 of 31 statements. [2025-03-17 06:45:55,371 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-17 06:45:55,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:45:55,430 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-17 06:45:55,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:45:55,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418971609] [2025-03-17 06:45:55,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418971609] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:45:55,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:45:55,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 06:45:55,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924708195] [2025-03-17 06:45:55,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:45:55,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 06:45:55,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:45:55,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 06:45:55,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 06:45:55,439 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2025-03-17 06:45:55,440 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-17 06:45:55,440 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:45:55,440 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2025-03-17 06:45:55,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:45:55,756 INFO L124 PetriNetUnfolderBase]: 3370/5264 cut-off events. [2025-03-17 06:45:55,757 INFO L125 PetriNetUnfolderBase]: For 10239/10239 co-relation queries the response was YES. [2025-03-17 06:45:55,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16544 conditions, 5264 events. 3370/5264 cut-off events. For 10239/10239 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 27166 event pairs, 2471 based on Foata normal form. 41/5279 useless extension candidates. Maximal degree in co-relation 15706. Up to 4525 conditions per place. [2025-03-17 06:45:55,785 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 45 selfloop transitions, 4 changer transitions 27/83 dead transitions. [2025-03-17 06:45:55,785 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 83 transitions, 617 flow [2025-03-17 06:45:55,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 06:45:55,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 06:45:55,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 113 transitions. [2025-03-17 06:45:55,786 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45934959349593496 [2025-03-17 06:45:55,786 INFO L175 Difference]: Start difference. First operand has 78 places, 71 transitions, 442 flow. Second operand 6 states and 113 transitions. [2025-03-17 06:45:55,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 83 transitions, 617 flow [2025-03-17 06:45:55,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 83 transitions, 601 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-03-17 06:45:55,797 INFO L231 Difference]: Finished difference. Result has 80 places, 56 transitions, 329 flow [2025-03-17 06:45:55,797 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-17 06:45:55,798 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 39 predicate places. [2025-03-17 06:45:55,798 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 56 transitions, 329 flow [2025-03-17 06:45:55,798 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-17 06:45:55,798 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:45:55,798 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-17 06:45:55,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 06:45:55,798 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-17 06:45:55,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:45:55,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1691212183, now seen corresponding path program 1 times [2025-03-17 06:45:55,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:45:55,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558068616] [2025-03-17 06:45:55,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:45:55,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:45:55,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-17 06:45:55,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-17 06:45:55,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:45:55,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:45:55,920 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-17 06:45:55,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:45:55,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558068616] [2025-03-17 06:45:55,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558068616] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:45:55,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [925701165] [2025-03-17 06:45:55,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:45:55,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:45:55,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:45:55,923 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-17 06:45:55,939 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-17 06:45:55,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-17 06:45:56,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-17 06:45:56,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:45:56,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:45:56,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 06:45:56,018 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:45:56,070 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-17 06:45:56,071 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 06:45:56,118 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-17 06:45:56,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [925701165] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 06:45:56,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-17 06:45:56,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2025-03-17 06:45:56,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812410260] [2025-03-17 06:45:56,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:45:56,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 06:45:56,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:45:56,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 06:45:56,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-17 06:45:56,131 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2025-03-17 06:45:56,132 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-17 06:45:56,132 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:45:56,132 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2025-03-17 06:45:56,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:45:56,415 INFO L124 PetriNetUnfolderBase]: 2895/4531 cut-off events. [2025-03-17 06:45:56,416 INFO L125 PetriNetUnfolderBase]: For 8402/8422 co-relation queries the response was YES. [2025-03-17 06:45:56,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14202 conditions, 4531 events. 2895/4531 cut-off events. For 8402/8422 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 23498 event pairs, 677 based on Foata normal form. 20/4476 useless extension candidates. Maximal degree in co-relation 14160. Up to 2865 conditions per place. [2025-03-17 06:45:56,443 INFO L140 encePairwiseOnDemand]: 35/41 looper letters, 52 selfloop transitions, 10 changer transitions 0/70 dead transitions. [2025-03-17 06:45:56,443 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 70 transitions, 522 flow [2025-03-17 06:45:56,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 06:45:56,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 06:45:56,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 92 transitions. [2025-03-17 06:45:56,445 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44878048780487806 [2025-03-17 06:45:56,445 INFO L175 Difference]: Start difference. First operand has 80 places, 56 transitions, 329 flow. Second operand 5 states and 92 transitions. [2025-03-17 06:45:56,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 70 transitions, 522 flow [2025-03-17 06:45:56,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 70 transitions, 493 flow, removed 4 selfloop flow, removed 5 redundant places. [2025-03-17 06:45:56,455 INFO L231 Difference]: Finished difference. Result has 74 places, 57 transitions, 347 flow [2025-03-17 06:45:56,455 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-17 06:45:56,456 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 33 predicate places. [2025-03-17 06:45:56,456 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 57 transitions, 347 flow [2025-03-17 06:45:56,457 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-17 06:45:56,457 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:45:56,457 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-17 06:45:56,465 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-17 06:45:56,657 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-17 06:45:56,658 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-17 06:45:56,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:45:56,658 INFO L85 PathProgramCache]: Analyzing trace with hash 407143506, now seen corresponding path program 1 times [2025-03-17 06:45:56,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:45:56,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534770372] [2025-03-17 06:45:56,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:45:56,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:45:56,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-17 06:45:56,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-17 06:45:56,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:45:56,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:45:56,731 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-17 06:45:56,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:45:56,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534770372] [2025-03-17 06:45:56,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534770372] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:45:56,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:45:56,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 06:45:56,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038685684] [2025-03-17 06:45:56,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:45:56,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 06:45:56,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:45:56,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 06:45:56,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 06:45:56,743 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2025-03-17 06:45:56,743 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-17 06:45:56,743 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:45:56,743 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2025-03-17 06:45:56,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:45:57,120 INFO L124 PetriNetUnfolderBase]: 2404/3892 cut-off events. [2025-03-17 06:45:57,121 INFO L125 PetriNetUnfolderBase]: For 9564/9586 co-relation queries the response was YES. [2025-03-17 06:45:57,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12546 conditions, 3892 events. 2404/3892 cut-off events. For 9564/9586 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 19428 event pairs, 508 based on Foata normal form. 78/3962 useless extension candidates. Maximal degree in co-relation 12507. Up to 2127 conditions per place. [2025-03-17 06:45:57,151 INFO L140 encePairwiseOnDemand]: 35/41 looper letters, 73 selfloop transitions, 15 changer transitions 2/99 dead transitions. [2025-03-17 06:45:57,151 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 99 transitions, 683 flow [2025-03-17 06:45:57,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 06:45:57,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 06:45:57,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 136 transitions. [2025-03-17 06:45:57,153 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5528455284552846 [2025-03-17 06:45:57,153 INFO L175 Difference]: Start difference. First operand has 74 places, 57 transitions, 347 flow. Second operand 6 states and 136 transitions. [2025-03-17 06:45:57,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 99 transitions, 683 flow [2025-03-17 06:45:57,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 99 transitions, 672 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-17 06:45:57,163 INFO L231 Difference]: Finished difference. Result has 79 places, 59 transitions, 411 flow [2025-03-17 06:45:57,163 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-17 06:45:57,164 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 38 predicate places. [2025-03-17 06:45:57,164 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 59 transitions, 411 flow [2025-03-17 06:45:57,164 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-17 06:45:57,164 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:45:57,164 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-17 06:45:57,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 06:45:57,164 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-17 06:45:57,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:45:57,165 INFO L85 PathProgramCache]: Analyzing trace with hash -960190378, now seen corresponding path program 2 times [2025-03-17 06:45:57,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:45:57,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266791468] [2025-03-17 06:45:57,165 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 06:45:57,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:45:57,178 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-03-17 06:45:57,190 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-03-17 06:45:57,191 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 06:45:57,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:45:57,279 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 06:45:57,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:45:57,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266791468] [2025-03-17 06:45:57,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266791468] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:45:57,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1865728944] [2025-03-17 06:45:57,280 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 06:45:57,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:45:57,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:45:57,282 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-17 06:45:57,284 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-17 06:45:57,329 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-03-17 06:45:57,351 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-03-17 06:45:57,351 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 06:45:57,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:45:57,352 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 06:45:57,353 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:45:57,426 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 06:45:57,427 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 06:45:57,489 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 06:45:57,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1865728944] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 06:45:57,489 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 06:45:57,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 16 [2025-03-17 06:45:57,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113324546] [2025-03-17 06:45:57,489 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 06:45:57,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 06:45:57,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:45:57,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 06:45:57,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2025-03-17 06:45:57,526 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 41 [2025-03-17 06:45:57,526 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-17 06:45:57,526 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:45:57,526 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 41 [2025-03-17 06:45:57,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:46:00,217 INFO L124 PetriNetUnfolderBase]: 17380/25150 cut-off events. [2025-03-17 06:46:00,217 INFO L125 PetriNetUnfolderBase]: For 71462/71462 co-relation queries the response was YES. [2025-03-17 06:46:00,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82460 conditions, 25150 events. 17380/25150 cut-off events. For 71462/71462 co-relation queries the response was YES. Maximal size of possible extension queue 394. Compared 142128 event pairs, 3071 based on Foata normal form. 381/25527 useless extension candidates. Maximal degree in co-relation 82418. Up to 5637 conditions per place. [2025-03-17 06:46:00,386 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 403 selfloop transitions, 98 changer transitions 41/544 dead transitions. [2025-03-17 06:46:00,387 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 544 transitions, 4513 flow [2025-03-17 06:46:00,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-03-17 06:46:00,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2025-03-17 06:46:00,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 579 transitions. [2025-03-17 06:46:00,390 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.415351506456241 [2025-03-17 06:46:00,391 INFO L175 Difference]: Start difference. First operand has 79 places, 59 transitions, 411 flow. Second operand 34 states and 579 transitions. [2025-03-17 06:46:00,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 544 transitions, 4513 flow [2025-03-17 06:46:00,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 544 transitions, 4309 flow, removed 49 selfloop flow, removed 3 redundant places. [2025-03-17 06:46:00,431 INFO L231 Difference]: Finished difference. Result has 136 places, 174 transitions, 1771 flow [2025-03-17 06:46:00,431 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-17 06:46:00,433 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 95 predicate places. [2025-03-17 06:46:00,433 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 174 transitions, 1771 flow [2025-03-17 06:46:00,433 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-17 06:46:00,433 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:46:00,433 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-17 06:46:00,439 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-17 06:46:00,638 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-17 06:46:00,638 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-17 06:46:00,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:46:00,639 INFO L85 PathProgramCache]: Analyzing trace with hash -718803238, now seen corresponding path program 3 times [2025-03-17 06:46:00,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:46:00,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085295063] [2025-03-17 06:46:00,639 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 06:46:00,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:46:00,652 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 42 statements into 2 equivalence classes. [2025-03-17 06:46:00,671 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-03-17 06:46:00,671 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-17 06:46:00,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:46:00,761 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-17 06:46:00,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:46:00,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085295063] [2025-03-17 06:46:00,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085295063] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:46:00,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1683734201] [2025-03-17 06:46:00,762 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 06:46:00,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:46:00,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:46:00,768 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-17 06:46:00,774 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-17 06:46:00,825 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 42 statements into 2 equivalence classes. [2025-03-17 06:46:00,856 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-03-17 06:46:00,856 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-17 06:46:00,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:46:00,857 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 06:46:00,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:46:00,975 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-17 06:46:00,975 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 06:46:01,062 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-17 06:46:01,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1683734201] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 06:46:01,063 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 06:46:01,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2025-03-17 06:46:01,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911354875] [2025-03-17 06:46:01,063 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 06:46:01,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 06:46:01,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:46:01,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 06:46:01,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2025-03-17 06:46:01,122 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2025-03-17 06:46:01,123 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-17 06:46:01,123 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:46:01,123 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2025-03-17 06:46:01,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:46:06,101 INFO L124 PetriNetUnfolderBase]: 30150/45438 cut-off events. [2025-03-17 06:46:06,101 INFO L125 PetriNetUnfolderBase]: For 413128/414361 co-relation queries the response was YES. [2025-03-17 06:46:06,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 211856 conditions, 45438 events. 30150/45438 cut-off events. For 413128/414361 co-relation queries the response was YES. Maximal size of possible extension queue 991. Compared 306367 event pairs, 1802 based on Foata normal form. 726/46071 useless extension candidates. Maximal degree in co-relation 211788. Up to 6111 conditions per place. [2025-03-17 06:46:06,661 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 774 selfloop transitions, 221 changer transitions 30/1036 dead transitions. [2025-03-17 06:46:06,661 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 1036 transitions, 11421 flow [2025-03-17 06:46:06,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-17 06:46:06,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2025-03-17 06:46:06,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 618 transitions. [2025-03-17 06:46:06,663 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5197645079899075 [2025-03-17 06:46:06,663 INFO L175 Difference]: Start difference. First operand has 136 places, 174 transitions, 1771 flow. Second operand 29 states and 618 transitions. [2025-03-17 06:46:06,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 1036 transitions, 11421 flow [2025-03-17 06:46:08,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 1036 transitions, 10997 flow, removed 208 selfloop flow, removed 1 redundant places. [2025-03-17 06:46:08,206 INFO L231 Difference]: Finished difference. Result has 184 places, 366 transitions, 4585 flow [2025-03-17 06:46:08,206 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-17 06:46:08,207 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 143 predicate places. [2025-03-17 06:46:08,207 INFO L471 AbstractCegarLoop]: Abstraction has has 184 places, 366 transitions, 4585 flow [2025-03-17 06:46:08,207 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-17 06:46:08,207 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:46:08,207 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-17 06:46:08,213 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-17 06:46:08,412 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-17 06:46:08,412 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-17 06:46:08,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:46:08,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1456038086, now seen corresponding path program 4 times [2025-03-17 06:46:08,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:46:08,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272433388] [2025-03-17 06:46:08,413 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 06:46:08,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:46:08,421 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 42 statements into 2 equivalence classes. [2025-03-17 06:46:08,425 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 39 of 42 statements. [2025-03-17 06:46:08,428 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-17 06:46:08,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:46:08,474 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-17 06:46:08,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:46:08,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272433388] [2025-03-17 06:46:08,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272433388] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:46:08,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [593374558] [2025-03-17 06:46:08,475 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 06:46:08,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:46:08,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:46:08,477 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-17 06:46:08,478 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-17 06:46:08,518 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 42 statements into 2 equivalence classes. [2025-03-17 06:46:08,531 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 39 of 42 statements. [2025-03-17 06:46:08,531 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-17 06:46:08,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:46:08,532 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 06:46:08,533 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:46:08,573 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-17 06:46:08,573 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 06:46:08,614 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-17 06:46:08,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [593374558] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 06:46:08,614 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 06:46:08,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 9 [2025-03-17 06:46:08,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9511341] [2025-03-17 06:46:08,615 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 06:46:08,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 06:46:08,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:46:08,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 06:46:08,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-17 06:46:08,622 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2025-03-17 06:46:08,622 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-17 06:46:08,622 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:46:08,622 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2025-03-17 06:46:08,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:46:09,388 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([385] L60-1-->L58-3: Formula: (= v_thread2Thread1of1ForFork2_~i~1_11 v_~p~0_5) InVars {thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_11} OutVars{~p~0=v_~p~0_5, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_11} AuxVars[] AssignedVars[~p~0][168], [Black: 516#(and (= ~p~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 66#(<= 1 ~N~0), 514#(= thread3Thread1of1ForFork1_~i~2 0), Black: 1021#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 1005#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~p~0 thread3Thread1of1ForFork1_~i~2)), Black: 742#(<= ~N~0 1), Black: 1009#(and (<= ~p~0 0) (<= ~N~0 1) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1007#(and (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 1)), Black: 1001#(and (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 1013#(and (= ~p~0 thread2Thread1of1ForFork2_~i~1) (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1043#(and (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 1027#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 1011#(and (<= ~p~0 0) (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1029#(and (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 738#true, Black: 901#(<= ~p~0 thread3Thread1of1ForFork1_~i~2), Black: 1045#(and (<= ~p~0 0) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork1_~i~2)), Black: 1041#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 740#(= thread1Thread1of1ForFork0_~i~0 0), Black: 1025#(and (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 0) (<= 0 thread3Thread1of1ForFork1_~i~2)), 325#(and (<= 1 ~N~0) (<= (+ thread1Thread1of1ForFork0_~i~0 1) ~N~0)), Black: 1003#(and (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1039#(and (<= ~p~0 0) (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 0) (<= 0 thread3Thread1of1ForFork1_~i~2)), Black: 1033#(and (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (= thread1Thread1of1ForFork0_~i~0 0) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 1047#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 1031#(and (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 743#(and (<= ~N~0 1) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1017#(and (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), 4#L88-3true, Black: 814#(and (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork1_~i~2)), Black: 1019#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 51#(and (= ~asum~0 0) (<= (mod ~N~0 4294967296) 0) (= ~csum~0 0)), 741#(<= thread1Thread1of1ForFork0_~i~0 1), Black: 50#(and (= ~asum~0 0) (or (and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0)) (< (mod ~N~0 4294967296) 1) (< (div ~N~0 4294967296) 0)) (= ~csum~0 0)), 11#L51-4true, Black: 185#(and (<= 1 ~N~0) (<= (+ |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 534#(<= 1 ~N~0), Black: 338#(= ~p~0 0), Black: 339#(and (= ~p~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1111#(<= 0 thread2Thread1of1ForFork2_~i~1), Black: 1146#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 1 thread2Thread1of1ForFork2_~i~1)), Black: 1083#(<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0), Black: 1130#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 0 thread2Thread1of1ForFork2_~i~1)), Black: 1079#(= thread2Thread1of1ForFork2_~i~1 0), Black: 1359#(and (<= thread3Thread1of1ForFork1_~i~2 thread2Thread1of1ForFork2_~i~1) (<= 0 thread2Thread1of1ForFork2_~i~1)), 23#L68true, Black: 727#(= ~p~0 0), Black: 728#(and (= ~p~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1181#(and (<= 2 ~N~0) (<= thread3Thread1of1ForFork1_~i~2 1)), 1339#(and (<= 1 ~N~0) (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1361#(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: 1248#(< (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0), 336#true, Black: 1077#true, Black: 1363#(and (<= thread3Thread1of1ForFork1_~i~2 thread2Thread1of1ForFork2_~i~1) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), 37#L58-3true, Black: 1355#(and (<= thread3Thread1of1ForFork1_~i~2 thread2Thread1of1ForFork2_~i~1) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= 2 ~N~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 1367#(and (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (<= 2 ~N~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 1369#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) thread2Thread1of1ForFork2_~i~1) (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (<= 0 thread2Thread1of1ForFork2_~i~1)), Black: 1080#(and (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1343#(and (<= 1 ~N~0) (<= 1 thread2Thread1of1ForFork2_~i~1) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1347#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), Black: 1351#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 1 thread2Thread1of1ForFork2_~i~1) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), Black: 1365#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) thread2Thread1of1ForFork2_~i~1) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), Black: 1081#(and (<= 1 thread2Thread1of1ForFork2_~i~1) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1357#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) thread2Thread1of1ForFork2_~i~1) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= 2 ~N~0) (<= thread3Thread1of1ForFork1_~i~2 1)), 497#(and (<= 1 ~N~0) (<= (+ thread2Thread1of1ForFork2_~i~1 1) ~N~0)), 1647#(and (<= (+ thread1Thread1of1ForFork0_~i~0 1) ~N~0) (<= 0 thread2Thread1of1ForFork2_~i~1)), 506#(and (= ~p~0 0) (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 503#(and (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 504#(and (= ~p~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 502#(= thread2Thread1of1ForFork2_~i~1 0)]) [2025-03-17 06:46:09,388 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2025-03-17 06:46:09,388 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2025-03-17 06:46:09,388 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2025-03-17 06:46:09,388 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2025-03-17 06:46:09,388 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([385] L60-1-->L58-3: Formula: (= v_thread2Thread1of1ForFork2_~i~1_11 v_~p~0_5) InVars {thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_11} OutVars{~p~0=v_~p~0_5, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_11} AuxVars[] AssignedVars[~p~0][168], [Black: 516#(and (= ~p~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 66#(<= 1 ~N~0), 514#(= thread3Thread1of1ForFork1_~i~2 0), Black: 1021#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 1005#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~p~0 thread3Thread1of1ForFork1_~i~2)), Black: 742#(<= ~N~0 1), Black: 1009#(and (<= ~p~0 0) (<= ~N~0 1) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1007#(and (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 1)), Black: 1001#(and (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 1013#(and (= ~p~0 thread2Thread1of1ForFork2_~i~1) (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1043#(and (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 1027#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 1011#(and (<= ~p~0 0) (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1029#(and (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 738#true, Black: 901#(<= ~p~0 thread3Thread1of1ForFork1_~i~2), Black: 1045#(and (<= ~p~0 0) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork1_~i~2)), Black: 1041#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 740#(= thread1Thread1of1ForFork0_~i~0 0), Black: 1025#(and (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 0) (<= 0 thread3Thread1of1ForFork1_~i~2)), 325#(and (<= 1 ~N~0) (<= (+ thread1Thread1of1ForFork0_~i~0 1) ~N~0)), Black: 1003#(and (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1039#(and (<= ~p~0 0) (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 0) (<= 0 thread3Thread1of1ForFork1_~i~2)), Black: 1033#(and (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (= thread1Thread1of1ForFork0_~i~0 0) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 1047#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 1031#(and (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 743#(and (<= ~N~0 1) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1017#(and (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), 4#L88-3true, Black: 814#(and (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork1_~i~2)), Black: 1019#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 51#(and (= ~asum~0 0) (<= (mod ~N~0 4294967296) 0) (= ~csum~0 0)), 741#(<= thread1Thread1of1ForFork0_~i~0 1), Black: 50#(and (= ~asum~0 0) (or (and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0)) (< (mod ~N~0 4294967296) 1) (< (div ~N~0 4294967296) 0)) (= ~csum~0 0)), Black: 185#(and (<= 1 ~N~0) (<= (+ |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 534#(<= 1 ~N~0), Black: 338#(= ~p~0 0), Black: 339#(and (= ~p~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1111#(<= 0 thread2Thread1of1ForFork2_~i~1), Black: 1146#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 1 thread2Thread1of1ForFork2_~i~1)), Black: 1083#(<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0), Black: 1130#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 0 thread2Thread1of1ForFork2_~i~1)), Black: 1079#(= thread2Thread1of1ForFork2_~i~1 0), Black: 1359#(and (<= thread3Thread1of1ForFork1_~i~2 thread2Thread1of1ForFork2_~i~1) (<= 0 thread2Thread1of1ForFork2_~i~1)), 23#L68true, Black: 727#(= ~p~0 0), Black: 728#(and (= ~p~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1181#(and (<= 2 ~N~0) (<= thread3Thread1of1ForFork1_~i~2 1)), 1339#(and (<= 1 ~N~0) (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1361#(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: 1248#(< (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0), 336#true, Black: 1077#true, Black: 1363#(and (<= thread3Thread1of1ForFork1_~i~2 thread2Thread1of1ForFork2_~i~1) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), 37#L58-3true, Black: 1355#(and (<= thread3Thread1of1ForFork1_~i~2 thread2Thread1of1ForFork2_~i~1) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= 2 ~N~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 1367#(and (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (<= 2 ~N~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 1369#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) thread2Thread1of1ForFork2_~i~1) (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (<= 0 thread2Thread1of1ForFork2_~i~1)), 3#L51-1true, Black: 1080#(and (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1343#(and (<= 1 ~N~0) (<= 1 thread2Thread1of1ForFork2_~i~1) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1347#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), Black: 1351#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 1 thread2Thread1of1ForFork2_~i~1) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), Black: 1365#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) thread2Thread1of1ForFork2_~i~1) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), Black: 1081#(and (<= 1 thread2Thread1of1ForFork2_~i~1) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1357#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) thread2Thread1of1ForFork2_~i~1) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= 2 ~N~0) (<= thread3Thread1of1ForFork1_~i~2 1)), 497#(and (<= 1 ~N~0) (<= (+ thread2Thread1of1ForFork2_~i~1 1) ~N~0)), 1647#(and (<= (+ thread1Thread1of1ForFork0_~i~0 1) ~N~0) (<= 0 thread2Thread1of1ForFork2_~i~1)), 506#(and (= ~p~0 0) (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 503#(and (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 504#(and (= ~p~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 502#(= thread2Thread1of1ForFork2_~i~1 0)]) [2025-03-17 06:46:09,389 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2025-03-17 06:46:09,389 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-03-17 06:46:09,389 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-03-17 06:46:09,389 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-03-17 06:46:09,521 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([385] L60-1-->L58-3: Formula: (= v_thread2Thread1of1ForFork2_~i~1_11 v_~p~0_5) InVars {thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_11} OutVars{~p~0=v_~p~0_5, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_11} AuxVars[] AssignedVars[~p~0][168], [Black: 516#(and (= ~p~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 66#(<= 1 ~N~0), 514#(= thread3Thread1of1ForFork1_~i~2 0), Black: 1021#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 1005#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~p~0 thread3Thread1of1ForFork1_~i~2)), Black: 742#(<= ~N~0 1), Black: 1009#(and (<= ~p~0 0) (<= ~N~0 1) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1007#(and (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 1)), Black: 1001#(and (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 1013#(and (= ~p~0 thread2Thread1of1ForFork2_~i~1) (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1043#(and (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 1027#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 1011#(and (<= ~p~0 0) (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1029#(and (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 738#true, Black: 901#(<= ~p~0 thread3Thread1of1ForFork1_~i~2), Black: 1045#(and (<= ~p~0 0) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork1_~i~2)), Black: 1041#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 740#(= thread1Thread1of1ForFork0_~i~0 0), Black: 1025#(and (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 0) (<= 0 thread3Thread1of1ForFork1_~i~2)), 325#(and (<= 1 ~N~0) (<= (+ thread1Thread1of1ForFork0_~i~0 1) ~N~0)), Black: 1003#(and (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1039#(and (<= ~p~0 0) (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 0) (<= 0 thread3Thread1of1ForFork1_~i~2)), Black: 1033#(and (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (= thread1Thread1of1ForFork0_~i~0 0) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 1047#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 1031#(and (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 743#(and (<= ~N~0 1) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1017#(and (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 814#(and (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork1_~i~2)), Black: 1019#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 51#(and (= ~asum~0 0) (<= (mod ~N~0 4294967296) 0) (= ~csum~0 0)), Black: 50#(and (= ~asum~0 0) (or (and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0)) (< (mod ~N~0 4294967296) 1) (< (div ~N~0 4294967296) 0)) (= ~csum~0 0)), 741#(<= thread1Thread1of1ForFork0_~i~0 1), 11#L51-4true, Black: 185#(and (<= 1 ~N~0) (<= (+ |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 534#(<= 1 ~N~0), Black: 338#(= ~p~0 0), Black: 339#(and (= ~p~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 7#L89true, Black: 1111#(<= 0 thread2Thread1of1ForFork2_~i~1), Black: 1146#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 1 thread2Thread1of1ForFork2_~i~1)), Black: 1083#(<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0), Black: 1130#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 0 thread2Thread1of1ForFork2_~i~1)), Black: 1079#(= thread2Thread1of1ForFork2_~i~1 0), Black: 1359#(and (<= thread3Thread1of1ForFork1_~i~2 thread2Thread1of1ForFork2_~i~1) (<= 0 thread2Thread1of1ForFork2_~i~1)), Black: 727#(= ~p~0 0), 23#L68true, Black: 728#(and (= ~p~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1181#(and (<= 2 ~N~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 1361#(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)), 1339#(and (<= 1 ~N~0) (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1248#(< (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0), 336#true, Black: 1077#true, Black: 1363#(and (<= thread3Thread1of1ForFork1_~i~2 thread2Thread1of1ForFork2_~i~1) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), 37#L58-3true, Black: 1355#(and (<= thread3Thread1of1ForFork1_~i~2 thread2Thread1of1ForFork2_~i~1) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= 2 ~N~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 1367#(and (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (<= 2 ~N~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 1369#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) thread2Thread1of1ForFork2_~i~1) (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (<= 0 thread2Thread1of1ForFork2_~i~1)), Black: 1080#(and (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1343#(and (<= 1 ~N~0) (<= 1 thread2Thread1of1ForFork2_~i~1) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1347#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), Black: 1351#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 1 thread2Thread1of1ForFork2_~i~1) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), Black: 1365#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) thread2Thread1of1ForFork2_~i~1) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), Black: 1081#(and (<= 1 thread2Thread1of1ForFork2_~i~1) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1357#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) thread2Thread1of1ForFork2_~i~1) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= 2 ~N~0) (<= thread3Thread1of1ForFork1_~i~2 1)), 497#(and (<= 1 ~N~0) (<= (+ thread2Thread1of1ForFork2_~i~1 1) ~N~0)), 1647#(and (<= (+ thread1Thread1of1ForFork0_~i~0 1) ~N~0) (<= 0 thread2Thread1of1ForFork2_~i~1)), 506#(and (= ~p~0 0) (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 503#(and (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 504#(and (= ~p~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 502#(= thread2Thread1of1ForFork2_~i~1 0)]) [2025-03-17 06:46:09,522 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2025-03-17 06:46:09,522 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-03-17 06:46:09,522 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-03-17 06:46:09,522 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-03-17 06:46:09,522 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([385] L60-1-->L58-3: Formula: (= v_thread2Thread1of1ForFork2_~i~1_11 v_~p~0_5) InVars {thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_11} OutVars{~p~0=v_~p~0_5, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_11} AuxVars[] AssignedVars[~p~0][168], [Black: 516#(and (= ~p~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 66#(<= 1 ~N~0), 514#(= thread3Thread1of1ForFork1_~i~2 0), Black: 1021#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 1005#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~p~0 thread3Thread1of1ForFork1_~i~2)), Black: 742#(<= ~N~0 1), Black: 1009#(and (<= ~p~0 0) (<= ~N~0 1) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1007#(and (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 1)), Black: 1001#(and (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 1013#(and (= ~p~0 thread2Thread1of1ForFork2_~i~1) (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1043#(and (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 1027#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 1011#(and (<= ~p~0 0) (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1029#(and (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 738#true, Black: 901#(<= ~p~0 thread3Thread1of1ForFork1_~i~2), Black: 1045#(and (<= ~p~0 0) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork1_~i~2)), Black: 1041#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 740#(= thread1Thread1of1ForFork0_~i~0 0), Black: 1025#(and (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 0) (<= 0 thread3Thread1of1ForFork1_~i~2)), 325#(and (<= 1 ~N~0) (<= (+ thread1Thread1of1ForFork0_~i~0 1) ~N~0)), Black: 1003#(and (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1039#(and (<= ~p~0 0) (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 0) (<= 0 thread3Thread1of1ForFork1_~i~2)), Black: 1033#(and (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (= thread1Thread1of1ForFork0_~i~0 0) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 1047#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 1031#(and (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 743#(and (<= ~N~0 1) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1017#(and (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 814#(and (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork1_~i~2)), Black: 1019#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 51#(and (= ~asum~0 0) (<= (mod ~N~0 4294967296) 0) (= ~csum~0 0)), Black: 50#(and (= ~asum~0 0) (or (and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0)) (< (mod ~N~0 4294967296) 1) (< (div ~N~0 4294967296) 0)) (= ~csum~0 0)), 741#(<= thread1Thread1of1ForFork0_~i~0 1), Black: 185#(and (<= 1 ~N~0) (<= (+ |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 534#(<= 1 ~N~0), Black: 338#(= ~p~0 0), Black: 339#(and (= ~p~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 7#L89true, Black: 1111#(<= 0 thread2Thread1of1ForFork2_~i~1), Black: 1146#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 1 thread2Thread1of1ForFork2_~i~1)), Black: 1083#(<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0), Black: 1130#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 0 thread2Thread1of1ForFork2_~i~1)), Black: 1079#(= thread2Thread1of1ForFork2_~i~1 0), Black: 1359#(and (<= thread3Thread1of1ForFork1_~i~2 thread2Thread1of1ForFork2_~i~1) (<= 0 thread2Thread1of1ForFork2_~i~1)), Black: 727#(= ~p~0 0), 23#L68true, Black: 728#(and (= ~p~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1181#(and (<= 2 ~N~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 1361#(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)), 1339#(and (<= 1 ~N~0) (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1248#(< (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0), 336#true, Black: 1077#true, Black: 1363#(and (<= thread3Thread1of1ForFork1_~i~2 thread2Thread1of1ForFork2_~i~1) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), 37#L58-3true, Black: 1355#(and (<= thread3Thread1of1ForFork1_~i~2 thread2Thread1of1ForFork2_~i~1) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= 2 ~N~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 1367#(and (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (<= 2 ~N~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 1369#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) thread2Thread1of1ForFork2_~i~1) (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (<= 0 thread2Thread1of1ForFork2_~i~1)), 3#L51-1true, Black: 1080#(and (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1343#(and (<= 1 ~N~0) (<= 1 thread2Thread1of1ForFork2_~i~1) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1347#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), Black: 1351#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 1 thread2Thread1of1ForFork2_~i~1) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), Black: 1365#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) thread2Thread1of1ForFork2_~i~1) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), Black: 1081#(and (<= 1 thread2Thread1of1ForFork2_~i~1) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1357#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) thread2Thread1of1ForFork2_~i~1) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= 2 ~N~0) (<= thread3Thread1of1ForFork1_~i~2 1)), 497#(and (<= 1 ~N~0) (<= (+ thread2Thread1of1ForFork2_~i~1 1) ~N~0)), 1647#(and (<= (+ thread1Thread1of1ForFork0_~i~0 1) ~N~0) (<= 0 thread2Thread1of1ForFork2_~i~1)), 506#(and (= ~p~0 0) (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 503#(and (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 504#(and (= ~p~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 502#(= thread2Thread1of1ForFork2_~i~1 0)]) [2025-03-17 06:46:09,522 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2025-03-17 06:46:09,522 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-03-17 06:46:09,522 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-03-17 06:46:09,522 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-03-17 06:46:09,791 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([385] L60-1-->L58-3: Formula: (= v_thread2Thread1of1ForFork2_~i~1_11 v_~p~0_5) InVars {thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_11} OutVars{~p~0=v_~p~0_5, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_11} AuxVars[] AssignedVars[~p~0][232], [Black: 516#(and (= ~p~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 66#(<= 1 ~N~0), 514#(= thread3Thread1of1ForFork1_~i~2 0), Black: 1021#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 1005#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~p~0 thread3Thread1of1ForFork1_~i~2)), Black: 742#(<= ~N~0 1), Black: 1009#(and (<= ~p~0 0) (<= ~N~0 1) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1007#(and (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 1)), Black: 1001#(and (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 1013#(and (= ~p~0 thread2Thread1of1ForFork2_~i~1) (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1043#(and (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 1027#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 1011#(and (<= ~p~0 0) (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1029#(and (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 901#(<= ~p~0 thread3Thread1of1ForFork1_~i~2), Black: 1045#(and (<= ~p~0 0) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork1_~i~2)), Black: 1041#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 740#(= thread1Thread1of1ForFork0_~i~0 0), Black: 1025#(and (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 0) (<= 0 thread3Thread1of1ForFork1_~i~2)), 325#(and (<= 1 ~N~0) (<= (+ thread1Thread1of1ForFork0_~i~0 1) ~N~0)), Black: 1003#(and (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1039#(and (<= ~p~0 0) (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 0) (<= 0 thread3Thread1of1ForFork1_~i~2)), Black: 1033#(and (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (= thread1Thread1of1ForFork0_~i~0 0) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 741#(<= thread1Thread1of1ForFork0_~i~0 1), Black: 1047#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 1031#(and (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 743#(and (<= ~N~0 1) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1017#(and (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), 4#L88-3true, Black: 814#(and (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork1_~i~2)), Black: 1019#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 51#(and (= ~asum~0 0) (<= (mod ~N~0 4294967296) 0) (= ~csum~0 0)), Black: 50#(and (= ~asum~0 0) (or (and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0)) (< (mod ~N~0 4294967296) 1) (< (div ~N~0 4294967296) 0)) (= ~csum~0 0)), Black: 185#(and (<= 1 ~N~0) (<= (+ |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 534#(<= 1 ~N~0), Black: 338#(= ~p~0 0), Black: 339#(and (= ~p~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1111#(<= 0 thread2Thread1of1ForFork2_~i~1), Black: 1146#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 1 thread2Thread1of1ForFork2_~i~1)), Black: 1083#(<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0), Black: 1130#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 0 thread2Thread1of1ForFork2_~i~1)), Black: 1079#(= thread2Thread1of1ForFork2_~i~1 0), Black: 1359#(and (<= thread3Thread1of1ForFork1_~i~2 thread2Thread1of1ForFork2_~i~1) (<= 0 thread2Thread1of1ForFork2_~i~1)), 23#L68true, Black: 727#(= ~p~0 0), Black: 728#(and (= ~p~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1181#(and (<= 2 ~N~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 1361#(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)), 1339#(and (<= 1 ~N~0) (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1248#(< (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0), 336#true, Black: 1077#true, Black: 1363#(and (<= thread3Thread1of1ForFork1_~i~2 thread2Thread1of1ForFork2_~i~1) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), 738#true, 37#L58-3true, Black: 1355#(and (<= thread3Thread1of1ForFork1_~i~2 thread2Thread1of1ForFork2_~i~1) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= 2 ~N~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 1367#(and (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (<= 2 ~N~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 1369#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) thread2Thread1of1ForFork2_~i~1) (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (<= 0 thread2Thread1of1ForFork2_~i~1)), Black: 1080#(and (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), 3#L51-1true, Black: 1343#(and (<= 1 ~N~0) (<= 1 thread2Thread1of1ForFork2_~i~1) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1347#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), Black: 1351#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 1 thread2Thread1of1ForFork2_~i~1) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), Black: 1365#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) thread2Thread1of1ForFork2_~i~1) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), Black: 1081#(and (<= 1 thread2Thread1of1ForFork2_~i~1) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1357#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) thread2Thread1of1ForFork2_~i~1) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= 2 ~N~0) (<= thread3Thread1of1ForFork1_~i~2 1)), 497#(and (<= 1 ~N~0) (<= (+ thread2Thread1of1ForFork2_~i~1 1) ~N~0)), 1647#(and (<= (+ thread1Thread1of1ForFork0_~i~0 1) ~N~0) (<= 0 thread2Thread1of1ForFork2_~i~1)), 506#(and (= ~p~0 0) (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 503#(and (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 504#(and (= ~p~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 502#(= thread2Thread1of1ForFork2_~i~1 0)]) [2025-03-17 06:46:09,791 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2025-03-17 06:46:09,792 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2025-03-17 06:46:09,792 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2025-03-17 06:46:09,792 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2025-03-17 06:46:09,792 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([385] L60-1-->L58-3: Formula: (= v_thread2Thread1of1ForFork2_~i~1_11 v_~p~0_5) InVars {thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_11} OutVars{~p~0=v_~p~0_5, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_11} AuxVars[] AssignedVars[~p~0][232], [Black: 516#(and (= ~p~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 66#(<= 1 ~N~0), 514#(= thread3Thread1of1ForFork1_~i~2 0), Black: 1021#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 1005#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~p~0 thread3Thread1of1ForFork1_~i~2)), Black: 742#(<= ~N~0 1), Black: 1009#(and (<= ~p~0 0) (<= ~N~0 1) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1007#(and (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 1)), Black: 1001#(and (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 1013#(and (= ~p~0 thread2Thread1of1ForFork2_~i~1) (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1043#(and (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 1027#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 1011#(and (<= ~p~0 0) (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1029#(and (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 901#(<= ~p~0 thread3Thread1of1ForFork1_~i~2), Black: 1045#(and (<= ~p~0 0) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork1_~i~2)), Black: 1041#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 740#(= thread1Thread1of1ForFork0_~i~0 0), Black: 1025#(and (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 0) (<= 0 thread3Thread1of1ForFork1_~i~2)), 325#(and (<= 1 ~N~0) (<= (+ thread1Thread1of1ForFork0_~i~0 1) ~N~0)), Black: 1003#(and (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1039#(and (<= ~p~0 0) (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 0) (<= 0 thread3Thread1of1ForFork1_~i~2)), Black: 1033#(and (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (= thread1Thread1of1ForFork0_~i~0 0) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 741#(<= thread1Thread1of1ForFork0_~i~0 1), Black: 1047#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 1031#(and (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 743#(and (<= ~N~0 1) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1017#(and (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), 4#L88-3true, Black: 814#(and (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork1_~i~2)), Black: 1019#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 51#(and (= ~asum~0 0) (<= (mod ~N~0 4294967296) 0) (= ~csum~0 0)), Black: 50#(and (= ~asum~0 0) (or (and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0)) (< (mod ~N~0 4294967296) 1) (< (div ~N~0 4294967296) 0)) (= ~csum~0 0)), 11#L51-4true, Black: 185#(and (<= 1 ~N~0) (<= (+ |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 534#(<= 1 ~N~0), Black: 338#(= ~p~0 0), Black: 339#(and (= ~p~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1111#(<= 0 thread2Thread1of1ForFork2_~i~1), Black: 1146#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 1 thread2Thread1of1ForFork2_~i~1)), Black: 1083#(<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0), Black: 1130#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 0 thread2Thread1of1ForFork2_~i~1)), Black: 1079#(= thread2Thread1of1ForFork2_~i~1 0), Black: 1359#(and (<= thread3Thread1of1ForFork1_~i~2 thread2Thread1of1ForFork2_~i~1) (<= 0 thread2Thread1of1ForFork2_~i~1)), 23#L68true, Black: 727#(= ~p~0 0), Black: 728#(and (= ~p~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1181#(and (<= 2 ~N~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 1361#(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)), 1339#(and (<= 1 ~N~0) (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1248#(< (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0), 336#true, Black: 1077#true, Black: 1363#(and (<= thread3Thread1of1ForFork1_~i~2 thread2Thread1of1ForFork2_~i~1) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), 738#true, 37#L58-3true, Black: 1355#(and (<= thread3Thread1of1ForFork1_~i~2 thread2Thread1of1ForFork2_~i~1) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= 2 ~N~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 1367#(and (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (<= 2 ~N~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 1369#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) thread2Thread1of1ForFork2_~i~1) (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (<= 0 thread2Thread1of1ForFork2_~i~1)), Black: 1080#(and (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1343#(and (<= 1 ~N~0) (<= 1 thread2Thread1of1ForFork2_~i~1) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1347#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), Black: 1351#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 1 thread2Thread1of1ForFork2_~i~1) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), Black: 1365#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) thread2Thread1of1ForFork2_~i~1) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), Black: 1081#(and (<= 1 thread2Thread1of1ForFork2_~i~1) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1357#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) thread2Thread1of1ForFork2_~i~1) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= 2 ~N~0) (<= thread3Thread1of1ForFork1_~i~2 1)), 497#(and (<= 1 ~N~0) (<= (+ thread2Thread1of1ForFork2_~i~1 1) ~N~0)), 1647#(and (<= (+ thread1Thread1of1ForFork0_~i~0 1) ~N~0) (<= 0 thread2Thread1of1ForFork2_~i~1)), 506#(and (= ~p~0 0) (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 503#(and (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 504#(and (= ~p~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 502#(= thread2Thread1of1ForFork2_~i~1 0)]) [2025-03-17 06:46:09,792 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2025-03-17 06:46:09,792 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-03-17 06:46:09,792 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-03-17 06:46:09,792 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-03-17 06:46:09,971 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([385] L60-1-->L58-3: Formula: (= v_thread2Thread1of1ForFork2_~i~1_11 v_~p~0_5) InVars {thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_11} OutVars{~p~0=v_~p~0_5, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_11} AuxVars[] AssignedVars[~p~0][232], [Black: 516#(and (= ~p~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 66#(<= 1 ~N~0), 514#(= thread3Thread1of1ForFork1_~i~2 0), Black: 1021#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 1005#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~p~0 thread3Thread1of1ForFork1_~i~2)), Black: 742#(<= ~N~0 1), Black: 1009#(and (<= ~p~0 0) (<= ~N~0 1) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1007#(and (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 1)), Black: 1001#(and (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 1013#(and (= ~p~0 thread2Thread1of1ForFork2_~i~1) (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1043#(and (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 1027#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 1011#(and (<= ~p~0 0) (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1029#(and (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 901#(<= ~p~0 thread3Thread1of1ForFork1_~i~2), Black: 1045#(and (<= ~p~0 0) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork1_~i~2)), Black: 1041#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 740#(= thread1Thread1of1ForFork0_~i~0 0), Black: 1025#(and (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 0) (<= 0 thread3Thread1of1ForFork1_~i~2)), Black: 1003#(and (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), 325#(and (<= 1 ~N~0) (<= (+ thread1Thread1of1ForFork0_~i~0 1) ~N~0)), Black: 1039#(and (<= ~p~0 0) (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 0) (<= 0 thread3Thread1of1ForFork1_~i~2)), Black: 1033#(and (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (= thread1Thread1of1ForFork0_~i~0 0) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 741#(<= thread1Thread1of1ForFork0_~i~0 1), Black: 1047#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 1031#(and (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 743#(and (<= ~N~0 1) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1017#(and (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 814#(and (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork1_~i~2)), Black: 1019#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 51#(and (= ~asum~0 0) (<= (mod ~N~0 4294967296) 0) (= ~csum~0 0)), Black: 50#(and (= ~asum~0 0) (or (and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0)) (< (mod ~N~0 4294967296) 1) (< (div ~N~0 4294967296) 0)) (= ~csum~0 0)), 11#L51-4true, Black: 185#(and (<= 1 ~N~0) (<= (+ |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 534#(<= 1 ~N~0), Black: 338#(= ~p~0 0), Black: 339#(and (= ~p~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 7#L89true, Black: 1111#(<= 0 thread2Thread1of1ForFork2_~i~1), Black: 1146#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 1 thread2Thread1of1ForFork2_~i~1)), Black: 1083#(<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0), Black: 1130#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 0 thread2Thread1of1ForFork2_~i~1)), Black: 1079#(= thread2Thread1of1ForFork2_~i~1 0), 23#L68true, Black: 727#(= ~p~0 0), Black: 1359#(and (<= thread3Thread1of1ForFork1_~i~2 thread2Thread1of1ForFork2_~i~1) (<= 0 thread2Thread1of1ForFork2_~i~1)), Black: 728#(and (= ~p~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1181#(and (<= 2 ~N~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 1361#(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)), 1339#(and (<= 1 ~N~0) (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), 336#true, Black: 1248#(< (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0), Black: 1077#true, 738#true, 37#L58-3true, Black: 1363#(and (<= thread3Thread1of1ForFork1_~i~2 thread2Thread1of1ForFork2_~i~1) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), Black: 1355#(and (<= thread3Thread1of1ForFork1_~i~2 thread2Thread1of1ForFork2_~i~1) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= 2 ~N~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 1367#(and (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (<= 2 ~N~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 1369#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) thread2Thread1of1ForFork2_~i~1) (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (<= 0 thread2Thread1of1ForFork2_~i~1)), Black: 1080#(and (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1343#(and (<= 1 ~N~0) (<= 1 thread2Thread1of1ForFork2_~i~1) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1347#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), Black: 1351#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 1 thread2Thread1of1ForFork2_~i~1) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), Black: 1365#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) thread2Thread1of1ForFork2_~i~1) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), Black: 1081#(and (<= 1 thread2Thread1of1ForFork2_~i~1) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1357#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) thread2Thread1of1ForFork2_~i~1) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= 2 ~N~0) (<= thread3Thread1of1ForFork1_~i~2 1)), 497#(and (<= 1 ~N~0) (<= (+ thread2Thread1of1ForFork2_~i~1 1) ~N~0)), 1647#(and (<= (+ thread1Thread1of1ForFork0_~i~0 1) ~N~0) (<= 0 thread2Thread1of1ForFork2_~i~1)), 506#(and (= ~p~0 0) (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 503#(and (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 504#(and (= ~p~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 502#(= thread2Thread1of1ForFork2_~i~1 0)]) [2025-03-17 06:46:09,971 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2025-03-17 06:46:09,971 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2025-03-17 06:46:09,971 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2025-03-17 06:46:09,971 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2025-03-17 06:46:09,971 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([385] L60-1-->L58-3: Formula: (= v_thread2Thread1of1ForFork2_~i~1_11 v_~p~0_5) InVars {thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_11} OutVars{~p~0=v_~p~0_5, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_11} AuxVars[] AssignedVars[~p~0][232], [Black: 516#(and (= ~p~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 66#(<= 1 ~N~0), 514#(= thread3Thread1of1ForFork1_~i~2 0), Black: 1021#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 1005#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~p~0 thread3Thread1of1ForFork1_~i~2)), Black: 742#(<= ~N~0 1), Black: 1009#(and (<= ~p~0 0) (<= ~N~0 1) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1007#(and (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 1)), Black: 1001#(and (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 1013#(and (= ~p~0 thread2Thread1of1ForFork2_~i~1) (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1043#(and (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 1027#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 1011#(and (<= ~p~0 0) (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1029#(and (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 901#(<= ~p~0 thread3Thread1of1ForFork1_~i~2), Black: 1045#(and (<= ~p~0 0) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork1_~i~2)), Black: 1041#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 740#(= thread1Thread1of1ForFork0_~i~0 0), Black: 1025#(and (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 0) (<= 0 thread3Thread1of1ForFork1_~i~2)), Black: 1003#(and (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), 325#(and (<= 1 ~N~0) (<= (+ thread1Thread1of1ForFork0_~i~0 1) ~N~0)), Black: 1039#(and (<= ~p~0 0) (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 0) (<= 0 thread3Thread1of1ForFork1_~i~2)), Black: 1033#(and (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (= thread1Thread1of1ForFork0_~i~0 0) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 741#(<= thread1Thread1of1ForFork0_~i~0 1), Black: 1047#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 1031#(and (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 743#(and (<= ~N~0 1) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1017#(and (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 814#(and (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork1_~i~2)), Black: 1019#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 51#(and (= ~asum~0 0) (<= (mod ~N~0 4294967296) 0) (= ~csum~0 0)), Black: 50#(and (= ~asum~0 0) (or (and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0)) (< (mod ~N~0 4294967296) 1) (< (div ~N~0 4294967296) 0)) (= ~csum~0 0)), Black: 185#(and (<= 1 ~N~0) (<= (+ |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 534#(<= 1 ~N~0), Black: 338#(= ~p~0 0), Black: 339#(and (= ~p~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 7#L89true, Black: 1111#(<= 0 thread2Thread1of1ForFork2_~i~1), Black: 1146#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 1 thread2Thread1of1ForFork2_~i~1)), Black: 1083#(<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0), Black: 1130#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 0 thread2Thread1of1ForFork2_~i~1)), Black: 1079#(= thread2Thread1of1ForFork2_~i~1 0), 23#L68true, Black: 727#(= ~p~0 0), Black: 1359#(and (<= thread3Thread1of1ForFork1_~i~2 thread2Thread1of1ForFork2_~i~1) (<= 0 thread2Thread1of1ForFork2_~i~1)), Black: 728#(and (= ~p~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1181#(and (<= 2 ~N~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 1361#(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)), 1339#(and (<= 1 ~N~0) (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1248#(< (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0), 336#true, Black: 1077#true, Black: 1363#(and (<= thread3Thread1of1ForFork1_~i~2 thread2Thread1of1ForFork2_~i~1) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), 738#true, 37#L58-3true, Black: 1355#(and (<= thread3Thread1of1ForFork1_~i~2 thread2Thread1of1ForFork2_~i~1) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= 2 ~N~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 1367#(and (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (<= 2 ~N~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 1369#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) thread2Thread1of1ForFork2_~i~1) (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (<= 0 thread2Thread1of1ForFork2_~i~1)), 3#L51-1true, Black: 1080#(and (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1343#(and (<= 1 ~N~0) (<= 1 thread2Thread1of1ForFork2_~i~1) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1347#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), Black: 1351#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 1 thread2Thread1of1ForFork2_~i~1) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), Black: 1365#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) thread2Thread1of1ForFork2_~i~1) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), Black: 1081#(and (<= 1 thread2Thread1of1ForFork2_~i~1) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1357#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) thread2Thread1of1ForFork2_~i~1) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= 2 ~N~0) (<= thread3Thread1of1ForFork1_~i~2 1)), 497#(and (<= 1 ~N~0) (<= (+ thread2Thread1of1ForFork2_~i~1 1) ~N~0)), 1647#(and (<= (+ thread1Thread1of1ForFork0_~i~0 1) ~N~0) (<= 0 thread2Thread1of1ForFork2_~i~1)), 506#(and (= ~p~0 0) (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 503#(and (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 504#(and (= ~p~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 502#(= thread2Thread1of1ForFork2_~i~1 0)]) [2025-03-17 06:46:09,971 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2025-03-17 06:46:09,971 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2025-03-17 06:46:09,971 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2025-03-17 06:46:09,971 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2025-03-17 06:46:17,062 INFO L124 PetriNetUnfolderBase]: 41701/64679 cut-off events. [2025-03-17 06:46:17,063 INFO L125 PetriNetUnfolderBase]: For 991671/999471 co-relation queries the response was YES. [2025-03-17 06:46:17,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 365574 conditions, 64679 events. 41701/64679 cut-off events. For 991671/999471 co-relation queries the response was YES. Maximal size of possible extension queue 1532. Compared 479850 event pairs, 4304 based on Foata normal form. 1962/65362 useless extension candidates. Maximal degree in co-relation 365486. Up to 16521 conditions per place. [2025-03-17 06:46:18,152 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 653 selfloop transitions, 220 changer transitions 4/903 dead transitions. [2025-03-17 06:46:18,153 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 903 transitions, 12747 flow [2025-03-17 06:46:18,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 06:46:18,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-17 06:46:18,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 306 transitions. [2025-03-17 06:46:18,154 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4975609756097561 [2025-03-17 06:46:18,154 INFO L175 Difference]: Start difference. First operand has 184 places, 366 transitions, 4585 flow. Second operand 15 states and 306 transitions. [2025-03-17 06:46:18,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 903 transitions, 12747 flow [2025-03-17 06:46:24,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 903 transitions, 11656 flow, removed 537 selfloop flow, removed 1 redundant places. [2025-03-17 06:46:24,939 INFO L231 Difference]: Finished difference. Result has 203 places, 528 transitions, 6453 flow [2025-03-17 06:46:24,940 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-17 06:46:24,940 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 162 predicate places. [2025-03-17 06:46:24,940 INFO L471 AbstractCegarLoop]: Abstraction has has 203 places, 528 transitions, 6453 flow [2025-03-17 06:46:24,941 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-17 06:46:24,941 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:46:24,941 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-17 06:46:24,946 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-17 06:46:25,141 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-17 06:46:25,142 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-17 06:46:25,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:46:25,142 INFO L85 PathProgramCache]: Analyzing trace with hash -847867072, now seen corresponding path program 5 times [2025-03-17 06:46:25,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:46:25,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991362405] [2025-03-17 06:46:25,142 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 06:46:25,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:46:25,149 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 42 statements into 3 equivalence classes. [2025-03-17 06:46:25,157 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 42 of 42 statements. [2025-03-17 06:46:25,157 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-17 06:46:25,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:46:25,206 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-17 06:46:25,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:46:25,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991362405] [2025-03-17 06:46:25,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991362405] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:46:25,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1300868222] [2025-03-17 06:46:25,206 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 06:46:25,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:46:25,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:46:25,208 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-17 06:46:25,210 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-17 06:46:25,254 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 42 statements into 3 equivalence classes. [2025-03-17 06:46:25,279 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 42 of 42 statements. [2025-03-17 06:46:25,279 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-17 06:46:25,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:46:25,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 06:46:25,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:46:25,361 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-17 06:46:25,362 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 06:46:25,414 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-17 06:46:25,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1300868222] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 06:46:25,414 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 06:46:25,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 13 [2025-03-17 06:46:25,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385057598] [2025-03-17 06:46:25,414 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 06:46:25,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 06:46:25,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:46:25,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 06:46:25,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2025-03-17 06:46:25,437 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2025-03-17 06:46:25,437 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-17 06:46:25,437 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:46:25,437 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2025-03-17 06:46:25,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:46:27,397 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([385] L60-1-->L58-3: Formula: (= v_thread2Thread1of1ForFork2_~i~1_11 v_~p~0_5) InVars {thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_11} OutVars{~p~0=v_~p~0_5, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_11} AuxVars[] AssignedVars[~p~0][238], [Black: 1662#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= 1 thread2Thread1of1ForFork2_~i~1) (<= 2 ~N~0)), Black: 1652#(and (<= 1 thread2Thread1of1ForFork2_~i~1) (<= (+ thread1Thread1of1ForFork0_~i~0 1) ~N~0)), Black: 1394#(<= 1 thread2Thread1of1ForFork2_~i~1), Black: 1504#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= 2 ~N~0)), Black: 1395#(<= 2 ~N~0), Black: 516#(and (= ~p~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1650#(and (<= 1 thread2Thread1of1ForFork2_~i~1) (<= 2 ~N~0)), 66#(<= 1 ~N~0), 514#(= thread3Thread1of1ForFork1_~i~2 0), Black: 1021#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 1005#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~p~0 thread3Thread1of1ForFork1_~i~2)), Black: 742#(<= ~N~0 1), Black: 1009#(and (<= ~p~0 0) (<= ~N~0 1) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1007#(and (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 1)), Black: 1001#(and (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 1013#(and (= ~p~0 thread2Thread1of1ForFork2_~i~1) (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1043#(and (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 1027#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 1011#(and (<= ~p~0 0) (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1029#(and (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 901#(<= ~p~0 thread3Thread1of1ForFork1_~i~2), Black: 1045#(and (<= ~p~0 0) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork1_~i~2)), Black: 1041#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 740#(= thread1Thread1of1ForFork0_~i~0 0), Black: 1025#(and (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 0) (<= 0 thread3Thread1of1ForFork1_~i~2)), Black: 1003#(and (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), 325#(and (<= 1 ~N~0) (<= (+ thread1Thread1of1ForFork0_~i~0 1) ~N~0)), Black: 1039#(and (<= ~p~0 0) (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 0) (<= 0 thread3Thread1of1ForFork1_~i~2)), Black: 1033#(and (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (= thread1Thread1of1ForFork0_~i~0 0) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 741#(<= thread1Thread1of1ForFork0_~i~0 1), Black: 1047#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 1031#(and (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 743#(and (<= ~N~0 1) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1017#(and (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), 4#L88-3true, Black: 814#(and (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork1_~i~2)), Black: 1019#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 51#(and (= ~asum~0 0) (<= (mod ~N~0 4294967296) 0) (= ~csum~0 0)), Black: 50#(and (= ~asum~0 0) (or (and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0)) (< (mod ~N~0 4294967296) 1) (< (div ~N~0 4294967296) 0)) (= ~csum~0 0)), 11#L51-4true, Black: 185#(and (<= 1 ~N~0) (<= (+ |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 534#(<= 1 ~N~0), Black: 338#(= ~p~0 0), Black: 339#(and (= ~p~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 1673#true, Black: 1111#(<= 0 thread2Thread1of1ForFork2_~i~1), Black: 1146#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 1 thread2Thread1of1ForFork2_~i~1)), Black: 1083#(<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0), Black: 1130#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 0 thread2Thread1of1ForFork2_~i~1)), Black: 1079#(= thread2Thread1of1ForFork2_~i~1 0), Black: 1359#(and (<= thread3Thread1of1ForFork1_~i~2 thread2Thread1of1ForFork2_~i~1) (<= 0 thread2Thread1of1ForFork2_~i~1)), Black: 727#(= ~p~0 0), 23#L68true, Black: 1181#(and (<= 2 ~N~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 728#(and (= ~p~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1361#(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)), 1339#(and (<= 1 ~N~0) (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1248#(< (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0), 336#true, Black: 1077#true, Black: 1363#(and (<= thread3Thread1of1ForFork1_~i~2 thread2Thread1of1ForFork2_~i~1) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), 37#L58-3true, 738#true, Black: 1355#(and (<= thread3Thread1of1ForFork1_~i~2 thread2Thread1of1ForFork2_~i~1) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= 2 ~N~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 1367#(and (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (<= 2 ~N~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 1369#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) thread2Thread1of1ForFork2_~i~1) (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (<= 0 thread2Thread1of1ForFork2_~i~1)), Black: 1080#(and (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1343#(and (<= 1 ~N~0) (<= 1 thread2Thread1of1ForFork2_~i~1) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1347#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), Black: 1351#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 1 thread2Thread1of1ForFork2_~i~1) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), Black: 1365#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) thread2Thread1of1ForFork2_~i~1) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), Black: 1081#(and (<= 1 thread2Thread1of1ForFork2_~i~1) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1357#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) thread2Thread1of1ForFork2_~i~1) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= 2 ~N~0) (<= thread3Thread1of1ForFork1_~i~2 1)), 497#(and (<= 1 ~N~0) (<= (+ thread2Thread1of1ForFork2_~i~1 1) ~N~0)), 1647#(and (<= (+ thread1Thread1of1ForFork0_~i~0 1) ~N~0) (<= 0 thread2Thread1of1ForFork2_~i~1)), 506#(and (= ~p~0 0) (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 504#(and (= ~p~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 502#(= thread2Thread1of1ForFork2_~i~1 0)]) [2025-03-17 06:46:27,397 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2025-03-17 06:46:27,397 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2025-03-17 06:46:27,397 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2025-03-17 06:46:27,397 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2025-03-17 06:46:27,401 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([385] L60-1-->L58-3: Formula: (= v_thread2Thread1of1ForFork2_~i~1_11 v_~p~0_5) InVars {thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_11} OutVars{~p~0=v_~p~0_5, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_11} AuxVars[] AssignedVars[~p~0][238], [Black: 1662#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= 1 thread2Thread1of1ForFork2_~i~1) (<= 2 ~N~0)), Black: 1652#(and (<= 1 thread2Thread1of1ForFork2_~i~1) (<= (+ thread1Thread1of1ForFork0_~i~0 1) ~N~0)), Black: 1394#(<= 1 thread2Thread1of1ForFork2_~i~1), Black: 1504#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= 2 ~N~0)), Black: 1395#(<= 2 ~N~0), Black: 516#(and (= ~p~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1650#(and (<= 1 thread2Thread1of1ForFork2_~i~1) (<= 2 ~N~0)), 66#(<= 1 ~N~0), 514#(= thread3Thread1of1ForFork1_~i~2 0), Black: 1021#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 1005#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~p~0 thread3Thread1of1ForFork1_~i~2)), Black: 742#(<= ~N~0 1), Black: 1009#(and (<= ~p~0 0) (<= ~N~0 1) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1007#(and (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 1)), Black: 1001#(and (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 1013#(and (= ~p~0 thread2Thread1of1ForFork2_~i~1) (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1043#(and (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 1027#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 1011#(and (<= ~p~0 0) (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1029#(and (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 901#(<= ~p~0 thread3Thread1of1ForFork1_~i~2), Black: 1045#(and (<= ~p~0 0) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork1_~i~2)), Black: 1041#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 740#(= thread1Thread1of1ForFork0_~i~0 0), Black: 1025#(and (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 0) (<= 0 thread3Thread1of1ForFork1_~i~2)), Black: 1003#(and (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), 325#(and (<= 1 ~N~0) (<= (+ thread1Thread1of1ForFork0_~i~0 1) ~N~0)), Black: 1039#(and (<= ~p~0 0) (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 0) (<= 0 thread3Thread1of1ForFork1_~i~2)), Black: 1033#(and (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (= thread1Thread1of1ForFork0_~i~0 0) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 741#(<= thread1Thread1of1ForFork0_~i~0 1), Black: 1047#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 1031#(and (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 743#(and (<= ~N~0 1) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1017#(and (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), 4#L88-3true, Black: 814#(and (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork1_~i~2)), Black: 1019#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 51#(and (= ~asum~0 0) (<= (mod ~N~0 4294967296) 0) (= ~csum~0 0)), Black: 50#(and (= ~asum~0 0) (or (and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0)) (< (mod ~N~0 4294967296) 1) (< (div ~N~0 4294967296) 0)) (= ~csum~0 0)), Black: 185#(and (<= 1 ~N~0) (<= (+ |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 534#(<= 1 ~N~0), Black: 338#(= ~p~0 0), Black: 339#(and (= ~p~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 1673#true, Black: 1111#(<= 0 thread2Thread1of1ForFork2_~i~1), Black: 1146#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 1 thread2Thread1of1ForFork2_~i~1)), Black: 1083#(<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0), Black: 1130#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 0 thread2Thread1of1ForFork2_~i~1)), Black: 1079#(= thread2Thread1of1ForFork2_~i~1 0), Black: 1359#(and (<= thread3Thread1of1ForFork1_~i~2 thread2Thread1of1ForFork2_~i~1) (<= 0 thread2Thread1of1ForFork2_~i~1)), Black: 727#(= ~p~0 0), 23#L68true, Black: 1181#(and (<= 2 ~N~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 728#(and (= ~p~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1361#(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)), 1339#(and (<= 1 ~N~0) (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1248#(< (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0), 336#true, Black: 1077#true, Black: 1363#(and (<= thread3Thread1of1ForFork1_~i~2 thread2Thread1of1ForFork2_~i~1) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), 738#true, 37#L58-3true, Black: 1355#(and (<= thread3Thread1of1ForFork1_~i~2 thread2Thread1of1ForFork2_~i~1) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= 2 ~N~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 1367#(and (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (<= 2 ~N~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 1369#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) thread2Thread1of1ForFork2_~i~1) (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (<= 0 thread2Thread1of1ForFork2_~i~1)), Black: 1080#(and (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), 3#L51-1true, Black: 1343#(and (<= 1 ~N~0) (<= 1 thread2Thread1of1ForFork2_~i~1) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1347#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), Black: 1351#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 1 thread2Thread1of1ForFork2_~i~1) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), Black: 1365#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) thread2Thread1of1ForFork2_~i~1) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), Black: 1081#(and (<= 1 thread2Thread1of1ForFork2_~i~1) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1357#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) thread2Thread1of1ForFork2_~i~1) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= 2 ~N~0) (<= thread3Thread1of1ForFork1_~i~2 1)), 497#(and (<= 1 ~N~0) (<= (+ thread2Thread1of1ForFork2_~i~1 1) ~N~0)), 1647#(and (<= (+ thread1Thread1of1ForFork0_~i~0 1) ~N~0) (<= 0 thread2Thread1of1ForFork2_~i~1)), 506#(and (= ~p~0 0) (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 504#(and (= ~p~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 502#(= thread2Thread1of1ForFork2_~i~1 0)]) [2025-03-17 06:46:27,401 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2025-03-17 06:46:27,401 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2025-03-17 06:46:27,402 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2025-03-17 06:46:27,402 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2025-03-17 06:46:27,672 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([385] L60-1-->L58-3: Formula: (= v_thread2Thread1of1ForFork2_~i~1_11 v_~p~0_5) InVars {thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_11} OutVars{~p~0=v_~p~0_5, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_11} AuxVars[] AssignedVars[~p~0][238], [Black: 1662#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= 1 thread2Thread1of1ForFork2_~i~1) (<= 2 ~N~0)), Black: 1652#(and (<= 1 thread2Thread1of1ForFork2_~i~1) (<= (+ thread1Thread1of1ForFork0_~i~0 1) ~N~0)), Black: 1394#(<= 1 thread2Thread1of1ForFork2_~i~1), Black: 1504#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= 2 ~N~0)), Black: 1395#(<= 2 ~N~0), Black: 516#(and (= ~p~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1650#(and (<= 1 thread2Thread1of1ForFork2_~i~1) (<= 2 ~N~0)), 66#(<= 1 ~N~0), 514#(= thread3Thread1of1ForFork1_~i~2 0), Black: 1021#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 1005#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~p~0 thread3Thread1of1ForFork1_~i~2)), Black: 742#(<= ~N~0 1), Black: 1009#(and (<= ~p~0 0) (<= ~N~0 1) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1007#(and (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 1)), Black: 1001#(and (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 1013#(and (= ~p~0 thread2Thread1of1ForFork2_~i~1) (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1043#(and (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 1027#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 1011#(and (<= ~p~0 0) (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1029#(and (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 901#(<= ~p~0 thread3Thread1of1ForFork1_~i~2), Black: 1045#(and (<= ~p~0 0) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork1_~i~2)), Black: 1041#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 740#(= thread1Thread1of1ForFork0_~i~0 0), Black: 1025#(and (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 0) (<= 0 thread3Thread1of1ForFork1_~i~2)), Black: 1003#(and (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), 325#(and (<= 1 ~N~0) (<= (+ thread1Thread1of1ForFork0_~i~0 1) ~N~0)), Black: 1039#(and (<= ~p~0 0) (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 0) (<= 0 thread3Thread1of1ForFork1_~i~2)), Black: 1033#(and (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (= thread1Thread1of1ForFork0_~i~0 0) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 741#(<= thread1Thread1of1ForFork0_~i~0 1), Black: 1047#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 1031#(and (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 743#(and (<= ~N~0 1) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1017#(and (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 814#(and (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork1_~i~2)), Black: 1019#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 51#(and (= ~asum~0 0) (<= (mod ~N~0 4294967296) 0) (= ~csum~0 0)), Black: 50#(and (= ~asum~0 0) (or (and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0)) (< (mod ~N~0 4294967296) 1) (< (div ~N~0 4294967296) 0)) (= ~csum~0 0)), 11#L51-4true, Black: 185#(and (<= 1 ~N~0) (<= (+ |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 534#(<= 1 ~N~0), Black: 338#(= ~p~0 0), Black: 339#(and (= ~p~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 1673#true, 7#L89true, Black: 1111#(<= 0 thread2Thread1of1ForFork2_~i~1), Black: 1146#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 1 thread2Thread1of1ForFork2_~i~1)), Black: 1083#(<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0), Black: 1130#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 0 thread2Thread1of1ForFork2_~i~1)), Black: 1079#(= thread2Thread1of1ForFork2_~i~1 0), 23#L68true, Black: 1359#(and (<= thread3Thread1of1ForFork1_~i~2 thread2Thread1of1ForFork2_~i~1) (<= 0 thread2Thread1of1ForFork2_~i~1)), Black: 727#(= ~p~0 0), Black: 1181#(and (<= 2 ~N~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 728#(and (= ~p~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1361#(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)), 1339#(and (<= 1 ~N~0) (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1248#(< (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0), 336#true, Black: 1077#true, Black: 1363#(and (<= thread3Thread1of1ForFork1_~i~2 thread2Thread1of1ForFork2_~i~1) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), 738#true, 37#L58-3true, Black: 1355#(and (<= thread3Thread1of1ForFork1_~i~2 thread2Thread1of1ForFork2_~i~1) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= 2 ~N~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 1367#(and (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (<= 2 ~N~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 1369#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) thread2Thread1of1ForFork2_~i~1) (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (<= 0 thread2Thread1of1ForFork2_~i~1)), Black: 1080#(and (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1343#(and (<= 1 ~N~0) (<= 1 thread2Thread1of1ForFork2_~i~1) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1347#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), Black: 1351#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 1 thread2Thread1of1ForFork2_~i~1) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), Black: 1365#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) thread2Thread1of1ForFork2_~i~1) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), Black: 1081#(and (<= 1 thread2Thread1of1ForFork2_~i~1) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1357#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) thread2Thread1of1ForFork2_~i~1) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= 2 ~N~0) (<= thread3Thread1of1ForFork1_~i~2 1)), 497#(and (<= 1 ~N~0) (<= (+ thread2Thread1of1ForFork2_~i~1 1) ~N~0)), 1647#(and (<= (+ thread1Thread1of1ForFork0_~i~0 1) ~N~0) (<= 0 thread2Thread1of1ForFork2_~i~1)), 506#(and (= ~p~0 0) (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 504#(and (= ~p~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 502#(= thread2Thread1of1ForFork2_~i~1 0)]) [2025-03-17 06:46:27,673 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2025-03-17 06:46:27,673 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2025-03-17 06:46:27,673 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2025-03-17 06:46:27,673 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2025-03-17 06:46:27,680 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([385] L60-1-->L58-3: Formula: (= v_thread2Thread1of1ForFork2_~i~1_11 v_~p~0_5) InVars {thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_11} OutVars{~p~0=v_~p~0_5, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_11} AuxVars[] AssignedVars[~p~0][238], [Black: 1662#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= 1 thread2Thread1of1ForFork2_~i~1) (<= 2 ~N~0)), Black: 1652#(and (<= 1 thread2Thread1of1ForFork2_~i~1) (<= (+ thread1Thread1of1ForFork0_~i~0 1) ~N~0)), Black: 1394#(<= 1 thread2Thread1of1ForFork2_~i~1), Black: 1504#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= 2 ~N~0)), Black: 1395#(<= 2 ~N~0), Black: 516#(and (= ~p~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1650#(and (<= 1 thread2Thread1of1ForFork2_~i~1) (<= 2 ~N~0)), 66#(<= 1 ~N~0), 514#(= thread3Thread1of1ForFork1_~i~2 0), Black: 1021#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 1005#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~p~0 thread3Thread1of1ForFork1_~i~2)), Black: 742#(<= ~N~0 1), Black: 1009#(and (<= ~p~0 0) (<= ~N~0 1) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1007#(and (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 1)), Black: 1001#(and (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 1013#(and (= ~p~0 thread2Thread1of1ForFork2_~i~1) (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1043#(and (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 1027#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 1011#(and (<= ~p~0 0) (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1029#(and (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 901#(<= ~p~0 thread3Thread1of1ForFork1_~i~2), Black: 1045#(and (<= ~p~0 0) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork1_~i~2)), Black: 1041#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 740#(= thread1Thread1of1ForFork0_~i~0 0), Black: 1025#(and (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 0) (<= 0 thread3Thread1of1ForFork1_~i~2)), Black: 1003#(and (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), 325#(and (<= 1 ~N~0) (<= (+ thread1Thread1of1ForFork0_~i~0 1) ~N~0)), Black: 1039#(and (<= ~p~0 0) (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 0) (<= 0 thread3Thread1of1ForFork1_~i~2)), Black: 1033#(and (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (= thread1Thread1of1ForFork0_~i~0 0) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 741#(<= thread1Thread1of1ForFork0_~i~0 1), Black: 1047#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= ~p~0 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 1031#(and (<= ~N~0 1) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 743#(and (<= ~N~0 1) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1017#(and (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 814#(and (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork1_~i~2)), Black: 1019#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= thread2Thread1of1ForFork2_~i~1 thread3Thread1of1ForFork1_~i~2) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), Black: 51#(and (= ~asum~0 0) (<= (mod ~N~0 4294967296) 0) (= ~csum~0 0)), Black: 50#(and (= ~asum~0 0) (or (and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0)) (< (mod ~N~0 4294967296) 1) (< (div ~N~0 4294967296) 0)) (= ~csum~0 0)), Black: 185#(and (<= 1 ~N~0) (<= (+ |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 534#(<= 1 ~N~0), Black: 338#(= ~p~0 0), Black: 339#(and (= ~p~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 1673#true, 7#L89true, Black: 1111#(<= 0 thread2Thread1of1ForFork2_~i~1), Black: 1146#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 1 thread2Thread1of1ForFork2_~i~1)), Black: 1083#(<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0), Black: 1130#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 0 thread2Thread1of1ForFork2_~i~1)), Black: 1079#(= thread2Thread1of1ForFork2_~i~1 0), 23#L68true, Black: 1359#(and (<= thread3Thread1of1ForFork1_~i~2 thread2Thread1of1ForFork2_~i~1) (<= 0 thread2Thread1of1ForFork2_~i~1)), Black: 727#(= ~p~0 0), Black: 1181#(and (<= 2 ~N~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 728#(and (= ~p~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1361#(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)), 1339#(and (<= 1 ~N~0) (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1248#(< (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0), 336#true, Black: 1077#true, Black: 1363#(and (<= thread3Thread1of1ForFork1_~i~2 thread2Thread1of1ForFork2_~i~1) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), 37#L58-3true, 738#true, Black: 1355#(and (<= thread3Thread1of1ForFork1_~i~2 thread2Thread1of1ForFork2_~i~1) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= 2 ~N~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 1367#(and (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (<= 2 ~N~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 1369#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) thread2Thread1of1ForFork2_~i~1) (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (<= 0 thread2Thread1of1ForFork2_~i~1)), Black: 1080#(and (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), 3#L51-1true, Black: 1343#(and (<= 1 ~N~0) (<= 1 thread2Thread1of1ForFork2_~i~1) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1347#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), Black: 1351#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 1 thread2Thread1of1ForFork2_~i~1) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), Black: 1365#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) thread2Thread1of1ForFork2_~i~1) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), Black: 1081#(and (<= 1 thread2Thread1of1ForFork2_~i~1) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1357#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) thread2Thread1of1ForFork2_~i~1) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= 2 ~N~0) (<= thread3Thread1of1ForFork1_~i~2 1)), 497#(and (<= 1 ~N~0) (<= (+ thread2Thread1of1ForFork2_~i~1 1) ~N~0)), 1647#(and (<= (+ thread1Thread1of1ForFork0_~i~0 1) ~N~0) (<= 0 thread2Thread1of1ForFork2_~i~1)), 506#(and (= ~p~0 0) (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 504#(and (= ~p~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 502#(= thread2Thread1of1ForFork2_~i~1 0)]) [2025-03-17 06:46:27,680 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2025-03-17 06:46:27,680 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2025-03-17 06:46:27,680 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2025-03-17 06:46:27,680 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2025-03-17 06:46:35,644 INFO L124 PetriNetUnfolderBase]: 45006/70199 cut-off events. [2025-03-17 06:46:35,644 INFO L125 PetriNetUnfolderBase]: For 1112191/1119776 co-relation queries the response was YES. [2025-03-17 06:46:37,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 406956 conditions, 70199 events. 45006/70199 cut-off events. For 1112191/1119776 co-relation queries the response was YES. Maximal size of possible extension queue 1539. Compared 528320 event pairs, 11233 based on Foata normal form. 1618/70358 useless extension candidates. Maximal degree in co-relation 384150. Up to 17309 conditions per place.