./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/test-hard1.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/weaver/test-hard1.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 34f393fd72a97393a0a39d407b9330aa7c1c7e210ad76310ea88c9427f882106 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 13:12:57,041 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 13:12:57,115 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-06 13:12:57,121 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 13:12:57,121 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 13:12:57,142 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 13:12:57,143 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 13:12:57,143 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 13:12:57,143 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 13:12:57,144 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 13:12:57,144 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 13:12:57,144 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 13:12:57,144 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 13:12:57,144 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 13:12:57,144 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 13:12:57,145 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 13:12:57,145 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 13:12:57,145 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 13:12:57,145 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 13:12:57,145 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 13:12:57,145 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 13:12:57,145 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 13:12:57,146 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 13:12:57,146 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 13:12:57,146 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 13:12:57,146 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 13:12:57,146 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 13:12:57,146 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 13:12:57,146 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 13:12:57,146 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 13:12:57,147 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 13:12:57,147 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 13:12:57,147 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 13:12:57,147 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 13:12:57,147 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 13:12:57,147 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 13:12:57,148 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 13:12:57,148 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 13:12:57,148 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 13:12:57,148 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 13:12:57,148 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 13:12:57,148 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 13:12:57,148 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 34f393fd72a97393a0a39d407b9330aa7c1c7e210ad76310ea88c9427f882106 [2025-02-06 13:12:57,434 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 13:12:57,443 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 13:12:57,446 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 13:12:57,447 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 13:12:57,447 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 13:12:57,448 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/test-hard1.wvr.c [2025-02-06 13:12:58,679 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7ae2cdfcb/5922161108494b1eb097bf496186f621/FLAGb159aa0d4 [2025-02-06 13:12:58,964 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 13:12:58,964 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/test-hard1.wvr.c [2025-02-06 13:12:58,992 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7ae2cdfcb/5922161108494b1eb097bf496186f621/FLAGb159aa0d4 [2025-02-06 13:12:59,011 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7ae2cdfcb/5922161108494b1eb097bf496186f621 [2025-02-06 13:12:59,014 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 13:12:59,016 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 13:12:59,018 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 13:12:59,018 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 13:12:59,022 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 13:12:59,023 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:12:59" (1/1) ... [2025-02-06 13:12:59,026 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@dddcdb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:12:59, skipping insertion in model container [2025-02-06 13:12:59,026 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:12:59" (1/1) ... [2025-02-06 13:12:59,042 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 13:12:59,209 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 13:12:59,222 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 13:12:59,243 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 13:12:59,261 INFO L204 MainTranslator]: Completed translation [2025-02-06 13:12:59,262 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:12:59 WrapperNode [2025-02-06 13:12:59,262 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 13:12:59,263 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 13:12:59,263 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 13:12:59,264 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 13:12:59,269 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:12:59" (1/1) ... [2025-02-06 13:12:59,278 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:12:59" (1/1) ... [2025-02-06 13:12:59,297 INFO L138 Inliner]: procedures = 23, calls = 37, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 75 [2025-02-06 13:12:59,299 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 13:12:59,300 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 13:12:59,300 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 13:12:59,300 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 13:12:59,307 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:12:59" (1/1) ... [2025-02-06 13:12:59,308 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:12:59" (1/1) ... [2025-02-06 13:12:59,309 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:12:59" (1/1) ... [2025-02-06 13:12:59,331 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-06 13:12:59,335 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:12:59" (1/1) ... [2025-02-06 13:12:59,336 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:12:59" (1/1) ... [2025-02-06 13:12:59,342 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:12:59" (1/1) ... [2025-02-06 13:12:59,346 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:12:59" (1/1) ... [2025-02-06 13:12:59,347 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:12:59" (1/1) ... [2025-02-06 13:12:59,350 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:12:59" (1/1) ... [2025-02-06 13:12:59,352 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 13:12:59,352 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 13:12:59,353 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 13:12:59,354 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 13:12:59,354 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:12:59" (1/1) ... [2025-02-06 13:12:59,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 13:12:59,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:12:59,390 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 13:12:59,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 13:12:59,417 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 13:12:59,417 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-06 13:12:59,417 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-06 13:12:59,417 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-06 13:12:59,417 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-06 13:12:59,417 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-06 13:12:59,417 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-06 13:12:59,417 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-02-06 13:12:59,417 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-02-06 13:12:59,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 13:12:59,418 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-06 13:12:59,418 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-06 13:12:59,418 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 13:12:59,418 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 13:12:59,419 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 13:12:59,508 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 13:12:59,510 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 13:12:59,812 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 13:12:59,813 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 13:12:59,987 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 13:12:59,987 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 13:12:59,988 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:12:59 BoogieIcfgContainer [2025-02-06 13:12:59,988 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 13:12:59,992 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 13:12:59,992 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 13:12:59,996 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 13:12:59,996 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 01:12:59" (1/3) ... [2025-02-06 13:12:59,998 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b9631a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:12:59, skipping insertion in model container [2025-02-06 13:12:59,998 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:12:59" (2/3) ... [2025-02-06 13:12:59,998 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b9631a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:12:59, skipping insertion in model container [2025-02-06 13:12:59,999 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:12:59" (3/3) ... [2025-02-06 13:13:00,000 INFO L128 eAbstractionObserver]: Analyzing ICFG test-hard1.wvr.c [2025-02-06 13:13:00,012 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 13:13:00,013 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test-hard1.wvr.c that has 5 procedures, 43 locations, 1 initial locations, 4 loop locations, and 2 error locations. [2025-02-06 13:13:00,013 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 13:13:00,067 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-02-06 13:13:00,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 46 transitions, 120 flow [2025-02-06 13:13:00,145 INFO L124 PetriNetUnfolderBase]: 4/42 cut-off events. [2025-02-06 13:13:00,150 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-06 13:13:00,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 42 events. 4/42 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 65 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. [2025-02-06 13:13:00,157 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 46 transitions, 120 flow [2025-02-06 13:13:00,160 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 41 transitions, 106 flow [2025-02-06 13:13:00,170 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 13:13:00,186 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=None, 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;@5bf1e07b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 13:13:00,186 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-02-06 13:13:00,211 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 13:13:00,212 INFO L124 PetriNetUnfolderBase]: 4/38 cut-off events. [2025-02-06 13:13:00,212 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-06 13:13:00,212 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:13:00,213 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] [2025-02-06 13:13:00,213 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 13:13:00,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:13:00,219 INFO L85 PathProgramCache]: Analyzing trace with hash 2045354506, now seen corresponding path program 1 times [2025-02-06 13:13:00,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:13:00,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556127675] [2025-02-06 13:13:00,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:13:00,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:13:00,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-06 13:13:00,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 13:13:00,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:13:00,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:13:00,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:13:00,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:13:00,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556127675] [2025-02-06 13:13:00,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556127675] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:13:00,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:13:00,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 13:13:00,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179696550] [2025-02-06 13:13:00,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:13:00,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:13:00,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:13:00,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:13:00,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:13:00,748 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 46 [2025-02-06 13:13:00,751 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 41 transitions, 106 flow. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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-02-06 13:13:00,752 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:13:00,752 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 46 [2025-02-06 13:13:00,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:13:01,361 INFO L124 PetriNetUnfolderBase]: 3331/4541 cut-off events. [2025-02-06 13:13:01,361 INFO L125 PetriNetUnfolderBase]: For 345/345 co-relation queries the response was YES. [2025-02-06 13:13:01,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9284 conditions, 4541 events. 3331/4541 cut-off events. For 345/345 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 20613 event pairs, 587 based on Foata normal form. 2/4476 useless extension candidates. Maximal degree in co-relation 8234. Up to 3534 conditions per place. [2025-02-06 13:13:01,401 INFO L140 encePairwiseOnDemand]: 39/46 looper letters, 47 selfloop transitions, 5 changer transitions 1/62 dead transitions. [2025-02-06 13:13:01,402 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 62 transitions, 275 flow [2025-02-06 13:13:01,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:13:01,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 13:13:01,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 97 transitions. [2025-02-06 13:13:01,417 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7028985507246377 [2025-02-06 13:13:01,419 INFO L175 Difference]: Start difference. First operand has 50 places, 41 transitions, 106 flow. Second operand 3 states and 97 transitions. [2025-02-06 13:13:01,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 62 transitions, 275 flow [2025-02-06 13:13:01,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 62 transitions, 245 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-02-06 13:13:01,434 INFO L231 Difference]: Finished difference. Result has 43 places, 43 transitions, 119 flow [2025-02-06 13:13:01,437 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=119, PETRI_PLACES=43, PETRI_TRANSITIONS=43} [2025-02-06 13:13:01,442 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, -7 predicate places. [2025-02-06 13:13:01,442 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 43 transitions, 119 flow [2025-02-06 13:13:01,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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-02-06 13:13:01,443 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:13:01,443 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] [2025-02-06 13:13:01,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 13:13:01,444 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 13:13:01,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:13:01,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1225198004, now seen corresponding path program 1 times [2025-02-06 13:13:01,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:13:01,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315801678] [2025-02-06 13:13:01,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:13:01,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:13:01,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 13:13:01,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 13:13:01,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:13:01,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:13:01,934 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:13:01,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:13:01,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315801678] [2025-02-06 13:13:01,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315801678] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:13:01,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:13:01,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 13:13:01,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391930793] [2025-02-06 13:13:01,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:13:01,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 13:13:01,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:13:01,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 13:13:01,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 13:13:01,952 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2025-02-06 13:13:01,952 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 43 transitions, 119 flow. Second operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 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-02-06 13:13:01,953 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:13:01,953 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2025-02-06 13:13:01,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:13:02,945 INFO L124 PetriNetUnfolderBase]: 7323/10064 cut-off events. [2025-02-06 13:13:02,946 INFO L125 PetriNetUnfolderBase]: For 2052/2052 co-relation queries the response was YES. [2025-02-06 13:13:02,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22908 conditions, 10064 events. 7323/10064 cut-off events. For 2052/2052 co-relation queries the response was YES. Maximal size of possible extension queue 503. Compared 54993 event pairs, 1628 based on Foata normal form. 0/9517 useless extension candidates. Maximal degree in co-relation 6147. Up to 3843 conditions per place. [2025-02-06 13:13:03,051 INFO L140 encePairwiseOnDemand]: 37/46 looper letters, 120 selfloop transitions, 17 changer transitions 0/145 dead transitions. [2025-02-06 13:13:03,051 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 145 transitions, 691 flow [2025-02-06 13:13:03,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 13:13:03,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 13:13:03,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 198 transitions. [2025-02-06 13:13:03,053 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.717391304347826 [2025-02-06 13:13:03,053 INFO L175 Difference]: Start difference. First operand has 43 places, 43 transitions, 119 flow. Second operand 6 states and 198 transitions. [2025-02-06 13:13:03,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 145 transitions, 691 flow [2025-02-06 13:13:03,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 145 transitions, 672 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 13:13:03,057 INFO L231 Difference]: Finished difference. Result has 52 places, 59 transitions, 260 flow [2025-02-06 13:13:03,058 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=260, PETRI_PLACES=52, PETRI_TRANSITIONS=59} [2025-02-06 13:13:03,059 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 2 predicate places. [2025-02-06 13:13:03,059 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 59 transitions, 260 flow [2025-02-06 13:13:03,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 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-02-06 13:13:03,059 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:13:03,059 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] [2025-02-06 13:13:03,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 13:13:03,060 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 13:13:03,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:13:03,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1862328500, now seen corresponding path program 2 times [2025-02-06 13:13:03,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:13:03,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864277739] [2025-02-06 13:13:03,062 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:13:03,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:13:03,076 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 1 equivalence classes. [2025-02-06 13:13:03,093 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 13:13:03,094 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 13:13:03,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:13:03,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:13:03,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:13:03,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864277739] [2025-02-06 13:13:03,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864277739] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:13:03,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:13:03,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 13:13:03,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499340491] [2025-02-06 13:13:03,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:13:03,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 13:13:03,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:13:03,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 13:13:03,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-02-06 13:13:03,432 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2025-02-06 13:13:03,432 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 59 transitions, 260 flow. Second operand has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:13:03,433 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:13:03,433 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2025-02-06 13:13:03,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:13:05,455 INFO L124 PetriNetUnfolderBase]: 15994/22238 cut-off events. [2025-02-06 13:13:05,455 INFO L125 PetriNetUnfolderBase]: For 23201/23201 co-relation queries the response was YES. [2025-02-06 13:13:05,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64442 conditions, 22238 events. 15994/22238 cut-off events. For 23201/23201 co-relation queries the response was YES. Maximal size of possible extension queue 1063. Compared 132069 event pairs, 1434 based on Foata normal form. 616/22796 useless extension candidates. Maximal degree in co-relation 33995. Up to 8335 conditions per place. [2025-02-06 13:13:05,592 INFO L140 encePairwiseOnDemand]: 35/46 looper letters, 198 selfloop transitions, 59 changer transitions 0/265 dead transitions. [2025-02-06 13:13:05,592 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 265 transitions, 1707 flow [2025-02-06 13:13:05,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 13:13:05,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-06 13:13:05,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 301 transitions. [2025-02-06 13:13:05,597 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7270531400966184 [2025-02-06 13:13:05,597 INFO L175 Difference]: Start difference. First operand has 52 places, 59 transitions, 260 flow. Second operand 9 states and 301 transitions. [2025-02-06 13:13:05,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 265 transitions, 1707 flow [2025-02-06 13:13:05,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 265 transitions, 1707 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 13:13:05,691 INFO L231 Difference]: Finished difference. Result has 67 places, 115 transitions, 866 flow [2025-02-06 13:13:05,692 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=866, PETRI_PLACES=67, PETRI_TRANSITIONS=115} [2025-02-06 13:13:05,693 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 17 predicate places. [2025-02-06 13:13:05,694 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 115 transitions, 866 flow [2025-02-06 13:13:05,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:13:05,694 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:13:05,694 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] [2025-02-06 13:13:05,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 13:13:05,695 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 13:13:05,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:13:05,696 INFO L85 PathProgramCache]: Analyzing trace with hash 2041237684, now seen corresponding path program 3 times [2025-02-06 13:13:05,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:13:05,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497347268] [2025-02-06 13:13:05,696 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 13:13:05,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:13:05,707 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 2 equivalence classes. [2025-02-06 13:13:05,725 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 13:13:05,726 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-06 13:13:05,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:13:06,061 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:13:06,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:13:06,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497347268] [2025-02-06 13:13:06,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497347268] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:13:06,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:13:06,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 13:13:06,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481022032] [2025-02-06 13:13:06,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:13:06,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 13:13:06,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:13:06,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 13:13:06,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-02-06 13:13:06,069 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2025-02-06 13:13:06,070 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 115 transitions, 866 flow. Second operand has 8 states, 8 states have (on average 16.125) internal successors, (129), 8 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:13:06,070 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:13:06,070 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2025-02-06 13:13:06,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:13:09,169 INFO L124 PetriNetUnfolderBase]: 29359/41539 cut-off events. [2025-02-06 13:13:09,170 INFO L125 PetriNetUnfolderBase]: For 118151/118221 co-relation queries the response was YES. [2025-02-06 13:13:09,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155634 conditions, 41539 events. 29359/41539 cut-off events. For 118151/118221 co-relation queries the response was YES. Maximal size of possible extension queue 2029. Compared 276074 event pairs, 3766 based on Foata normal form. 396/41884 useless extension candidates. Maximal degree in co-relation 75340. Up to 19379 conditions per place. [2025-02-06 13:13:09,459 INFO L140 encePairwiseOnDemand]: 35/46 looper letters, 394 selfloop transitions, 76 changer transitions 0/478 dead transitions. [2025-02-06 13:13:09,460 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 478 transitions, 4278 flow [2025-02-06 13:13:09,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 13:13:09,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-02-06 13:13:09,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 373 transitions. [2025-02-06 13:13:09,462 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6757246376811594 [2025-02-06 13:13:09,462 INFO L175 Difference]: Start difference. First operand has 67 places, 115 transitions, 866 flow. Second operand 12 states and 373 transitions. [2025-02-06 13:13:09,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 478 transitions, 4278 flow [2025-02-06 13:13:09,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 478 transitions, 4278 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 13:13:09,876 INFO L231 Difference]: Finished difference. Result has 88 places, 182 transitions, 1848 flow [2025-02-06 13:13:09,876 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=866, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1848, PETRI_PLACES=88, PETRI_TRANSITIONS=182} [2025-02-06 13:13:09,877 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 38 predicate places. [2025-02-06 13:13:09,877 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 182 transitions, 1848 flow [2025-02-06 13:13:09,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.125) internal successors, (129), 8 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:13:09,877 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:13:09,878 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] [2025-02-06 13:13:09,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 13:13:09,878 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 13:13:09,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:13:09,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1352996406, now seen corresponding path program 1 times [2025-02-06 13:13:09,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:13:09,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887146011] [2025-02-06 13:13:09,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:13:09,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:13:09,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 13:13:09,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 13:13:09,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:13:09,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:13:10,108 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:13:10,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:13:10,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887146011] [2025-02-06 13:13:10,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887146011] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:13:10,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:13:10,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 13:13:10,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544796771] [2025-02-06 13:13:10,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:13:10,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 13:13:10,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:13:10,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 13:13:10,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 13:13:10,116 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2025-02-06 13:13:10,117 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 182 transitions, 1848 flow. Second operand has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 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-02-06 13:13:10,117 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:13:10,117 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2025-02-06 13:13:10,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:13:15,970 INFO L124 PetriNetUnfolderBase]: 53053/74811 cut-off events. [2025-02-06 13:13:15,970 INFO L125 PetriNetUnfolderBase]: For 310032/310342 co-relation queries the response was YES. [2025-02-06 13:13:16,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 310463 conditions, 74811 events. 53053/74811 cut-off events. For 310032/310342 co-relation queries the response was YES. Maximal size of possible extension queue 3651. Compared 533217 event pairs, 8563 based on Foata normal form. 82/70742 useless extension candidates. Maximal degree in co-relation 282957. Up to 42340 conditions per place. [2025-02-06 13:13:16,624 INFO L140 encePairwiseOnDemand]: 37/46 looper letters, 319 selfloop transitions, 77 changer transitions 0/405 dead transitions. [2025-02-06 13:13:16,624 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 405 transitions, 4185 flow [2025-02-06 13:13:16,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 13:13:16,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-06 13:13:16,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 288 transitions. [2025-02-06 13:13:16,626 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6956521739130435 [2025-02-06 13:13:16,626 INFO L175 Difference]: Start difference. First operand has 88 places, 182 transitions, 1848 flow. Second operand 9 states and 288 transitions. [2025-02-06 13:13:16,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 405 transitions, 4185 flow [2025-02-06 13:13:18,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 405 transitions, 4139 flow, removed 23 selfloop flow, removed 0 redundant places. [2025-02-06 13:13:18,824 INFO L231 Difference]: Finished difference. Result has 103 places, 221 transitions, 2600 flow [2025-02-06 13:13:18,825 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=1832, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2600, PETRI_PLACES=103, PETRI_TRANSITIONS=221} [2025-02-06 13:13:18,825 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 53 predicate places. [2025-02-06 13:13:18,826 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 221 transitions, 2600 flow [2025-02-06 13:13:18,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 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-02-06 13:13:18,826 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:13:18,826 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] [2025-02-06 13:13:18,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 13:13:18,826 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 13:13:18,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:13:18,827 INFO L85 PathProgramCache]: Analyzing trace with hash 87611844, now seen corresponding path program 4 times [2025-02-06 13:13:18,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:13:18,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088666560] [2025-02-06 13:13:18,827 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 13:13:18,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:13:18,834 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-02-06 13:13:18,842 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 13:13:18,842 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 13:13:18,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:13:18,976 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:13:18,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:13:18,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088666560] [2025-02-06 13:13:18,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088666560] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:13:18,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:13:18,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 13:13:18,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697900159] [2025-02-06 13:13:18,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:13:18,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 13:13:18,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:13:18,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 13:13:18,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 13:13:18,983 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2025-02-06 13:13:18,983 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 221 transitions, 2600 flow. Second operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 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-02-06 13:13:18,984 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:13:18,984 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2025-02-06 13:13:18,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:13:27,529 INFO L124 PetriNetUnfolderBase]: 63665/92121 cut-off events. [2025-02-06 13:13:27,529 INFO L125 PetriNetUnfolderBase]: For 612826/612926 co-relation queries the response was YES. [2025-02-06 13:13:28,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 432345 conditions, 92121 events. 63665/92121 cut-off events. For 612826/612926 co-relation queries the response was YES. Maximal size of possible extension queue 4293. Compared 711567 event pairs, 12230 based on Foata normal form. 345/91576 useless extension candidates. Maximal degree in co-relation 392431. Up to 35022 conditions per place. [2025-02-06 13:13:28,388 INFO L140 encePairwiseOnDemand]: 38/46 looper letters, 417 selfloop transitions, 111 changer transitions 0/536 dead transitions. [2025-02-06 13:13:28,388 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 536 transitions, 6922 flow [2025-02-06 13:13:28,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 13:13:28,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 13:13:28,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 160 transitions. [2025-02-06 13:13:28,389 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6956521739130435 [2025-02-06 13:13:28,389 INFO L175 Difference]: Start difference. First operand has 103 places, 221 transitions, 2600 flow. Second operand 5 states and 160 transitions. [2025-02-06 13:13:28,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 536 transitions, 6922 flow [2025-02-06 13:13:31,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 536 transitions, 6884 flow, removed 19 selfloop flow, removed 0 redundant places. [2025-02-06 13:13:31,393 INFO L231 Difference]: Finished difference. Result has 110 places, 270 transitions, 3761 flow [2025-02-06 13:13:31,393 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=2566, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3761, PETRI_PLACES=110, PETRI_TRANSITIONS=270} [2025-02-06 13:13:31,394 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 60 predicate places. [2025-02-06 13:13:31,394 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 270 transitions, 3761 flow [2025-02-06 13:13:31,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 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-02-06 13:13:31,394 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:13:31,394 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] [2025-02-06 13:13:31,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 13:13:31,394 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 13:13:31,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:13:31,395 INFO L85 PathProgramCache]: Analyzing trace with hash -693540738, now seen corresponding path program 1 times [2025-02-06 13:13:31,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:13:31,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674118010] [2025-02-06 13:13:31,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:13:31,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:13:31,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 13:13:31,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 13:13:31,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:13:31,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:13:31,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:13:31,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:13:31,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674118010] [2025-02-06 13:13:31,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674118010] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:13:31,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:13:31,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 13:13:31,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113862541] [2025-02-06 13:13:31,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:13:31,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 13:13:31,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:13:31,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 13:13:31,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 13:13:31,627 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2025-02-06 13:13:31,627 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 270 transitions, 3761 flow. Second operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 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-02-06 13:13:31,628 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:13:31,628 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2025-02-06 13:13:31,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:13:40,178 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([333] L104-->L110: Formula: (or (and (= (+ v_~p2~0_68 (* v_~m~0_57 2)) v_~p2~0_67) (< 1 v_~n2~0_87) (= v_~n2~0_87 (+ v_~n2~0_86 2))) (and (= v_~p2~0_68 v_~p2~0_67) (<= v_~n2~0_87 1) (= v_~n2~0_87 v_~n2~0_86))) InVars {~n2~0=v_~n2~0_87, ~p2~0=v_~p2~0_68, ~m~0=v_~m~0_57} OutVars{~n2~0=v_~n2~0_86, ~p2~0=v_~p2~0_67, ~m~0=v_~m~0_57} AuxVars[] AssignedVars[~n2~0, ~p2~0][231], [24#L47true, 20#L65true, Black: 65#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork3_~cond~0 1)) (and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0))) (or (and (<= ~n1~0 0) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork1_~cond~1 1)))), Black: 64#(or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork3_~cond~0 1)) (and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0))), 32#L110true, 145#(or (and (<= ~n1~0 0) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork1_~cond~1 1))), Black: 66#(and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0)), Black: 122#(or (= ~n2~0 ~n1~0) (< 0 ~n1~0)), Black: 68#(and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0) (= thread2Thread1of1ForFork1_~cond~1 0)), Black: 123#(and (or (< ~n2~0 1) (< 0 thread1Thread1of1ForFork3_~cond~0)) (<= (div thread1Thread1of1ForFork3_~cond~0 256) 0)), Black: 131#(and (<= ~n2~0 0) (<= (div thread1Thread1of1ForFork3_~cond~0 256) 0)), Black: 135#(and (<= ~n2~0 0) (<= (div thread1Thread1of1ForFork3_~cond~0 256) 0) (= thread4Thread1of1ForFork2_~cond~3 0)), Black: 133#(and (or (= ~n2~0 ~n1~0) (< 0 ~n1~0)) (<= ~n2~0 0) (<= (div thread1Thread1of1ForFork3_~cond~0 256) 0) (= thread4Thread1of1ForFork2_~cond~3 0)), Black: 129#(and (or (= ~n2~0 ~n1~0) (< 0 ~n1~0)) (<= ~n2~0 0) (<= (div thread1Thread1of1ForFork3_~cond~0 256) 0)), 155#true, Black: 127#(and (or (= ~n2~0 ~n1~0) (< 0 ~n1~0)) (or (< ~n2~0 1) (< 0 thread1Thread1of1ForFork3_~cond~0)) (<= (div thread1Thread1of1ForFork3_~cond~0 256) 0)), Black: 77#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork3_~cond~0 1)) (and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0))) (or (= ~n2~0 ~n1~0) (< 0 ~n2~0))), Black: 78#(< 0 ~n2~0), Black: 79#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)), Black: 80#(and (<= (div thread3Thread1of1ForFork0_~cond~2 256) 0) (<= 1 thread3Thread1of1ForFork0_~cond~2)), Black: 76#(or (= ~n2~0 ~n1~0) (< 0 ~n2~0)), Black: 149#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork1_~cond~1 0)), Black: 151#(and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0) (= thread2Thread1of1ForFork1_~cond~1 0)), Black: 84#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork3_~cond~0 1)) (and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0))) (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)), 48#thread3ENTRYtrue, Black: 82#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork3_~cond~0 1)) (and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0))) (<= 1 ~n2~0)), 92#true, 120#true, 62#true, Black: 101#(and (= ~n2~0 ~n1~0) (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0)))), Black: 99#(and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0)), Black: 107#(and (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (<= ~n1~0 0)), Black: 96#(and (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (or (< 0 ~n2~0) (< ~n1~0 1))), Black: 103#(and (= ~n2~0 ~n1~0) (<= ~n1~0 0) (= thread3Thread1of1ForFork0_~cond~2 0)), Black: 98#(<= ~n1~0 0), 74#true, Black: 109#(and (= thread1Thread1of1ForFork3_~cond~0 0) (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (<= ~n1~0 0)), Black: 105#(and (= thread1Thread1of1ForFork3_~cond~0 0) (= ~n2~0 ~n1~0) (<= ~n1~0 0) (= thread3Thread1of1ForFork0_~cond~2 0)), Black: 97#(or (< ~n1~0 1) (and (<= (div thread3Thread1of1ForFork0_~cond~2 256) 0) (<= 1 thread3Thread1of1ForFork0_~cond~2))), Black: 94#(= ~n2~0 ~n1~0), 13#L133true, Black: 60#(= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))]) [2025-02-06 13:13:40,179 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2025-02-06 13:13:40,179 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2025-02-06 13:13:40,179 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-02-06 13:13:40,179 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2025-02-06 13:13:40,836 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([321] L66-->L72: Formula: (or (and (<= v_~n1~0_97 1) (= v_~p1~0_76 v_~p1~0_75) (= v_~n1~0_97 v_~n1~0_96)) (and (< 1 v_~n1~0_97) (= (+ (* v_~m~0_53 2) v_~p1~0_76) v_~p1~0_75) (= (+ v_~n1~0_96 2) v_~n1~0_97))) InVars {~p1~0=v_~p1~0_76, ~n1~0=v_~n1~0_97, ~m~0=v_~m~0_53} OutVars{~p1~0=v_~p1~0_75, ~n1~0=v_~n1~0_96, ~m~0=v_~m~0_53} AuxVars[] AssignedVars[~p1~0, ~n1~0][82], [24#L47true, Black: 65#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork3_~cond~0 1)) (and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0))) (or (and (<= ~n1~0 0) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork1_~cond~1 1)))), Black: 64#(or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork3_~cond~0 1)) (and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0))), Black: 122#(or (= ~n2~0 ~n1~0) (< 0 ~n1~0)), Black: 66#(and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0)), Black: 68#(and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0) (= thread2Thread1of1ForFork1_~cond~1 0)), Black: 123#(and (or (< ~n2~0 1) (< 0 thread1Thread1of1ForFork3_~cond~0)) (<= (div thread1Thread1of1ForFork3_~cond~0 256) 0)), Black: 131#(and (<= ~n2~0 0) (<= (div thread1Thread1of1ForFork3_~cond~0 256) 0)), Black: 135#(and (<= ~n2~0 0) (<= (div thread1Thread1of1ForFork3_~cond~0 256) 0) (= thread4Thread1of1ForFork2_~cond~3 0)), Black: 133#(and (or (= ~n2~0 ~n1~0) (< 0 ~n1~0)) (<= ~n2~0 0) (<= (div thread1Thread1of1ForFork3_~cond~0 256) 0) (= thread4Thread1of1ForFork2_~cond~3 0)), 155#true, Black: 129#(and (or (= ~n2~0 ~n1~0) (< 0 ~n1~0)) (<= ~n2~0 0) (<= (div thread1Thread1of1ForFork3_~cond~0 256) 0)), Black: 127#(and (or (= ~n2~0 ~n1~0) (< 0 ~n1~0)) (or (< ~n2~0 1) (< 0 thread1Thread1of1ForFork3_~cond~0)) (<= (div thread1Thread1of1ForFork3_~cond~0 256) 0)), Black: 77#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork3_~cond~0 1)) (and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0))) (or (= ~n2~0 ~n1~0) (< 0 ~n2~0))), Black: 79#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)), Black: 80#(and (<= (div thread3Thread1of1ForFork0_~cond~2 256) 0) (<= 1 thread3Thread1of1ForFork0_~cond~2)), Black: 145#(or (and (<= ~n1~0 0) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork1_~cond~1 1))), 7#L72true, Black: 76#(or (= ~n2~0 ~n1~0) (< 0 ~n2~0)), Black: 149#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork1_~cond~1 0)), Black: 151#(and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0) (= thread2Thread1of1ForFork1_~cond~1 0)), Black: 84#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork3_~cond~0 1)) (and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0))) (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)), 48#thread3ENTRYtrue, Black: 82#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork3_~cond~0 1)) (and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0))) (<= 1 ~n2~0)), 92#true, 120#true, 62#true, Black: 101#(and (= ~n2~0 ~n1~0) (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0)))), Black: 99#(and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0)), Black: 107#(and (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (<= ~n1~0 0)), 34#L104true, Black: 96#(and (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (or (< 0 ~n2~0) (< ~n1~0 1))), Black: 103#(and (= ~n2~0 ~n1~0) (<= ~n1~0 0) (= thread3Thread1of1ForFork0_~cond~2 0)), Black: 98#(<= ~n1~0 0), Black: 109#(and (= thread1Thread1of1ForFork3_~cond~0 0) (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (<= ~n1~0 0)), Black: 105#(and (= thread1Thread1of1ForFork3_~cond~0 0) (= ~n2~0 ~n1~0) (<= ~n1~0 0) (= thread3Thread1of1ForFork0_~cond~2 0)), 143#true, Black: 97#(or (< ~n1~0 1) (and (<= (div thread3Thread1of1ForFork0_~cond~2 256) 0) (<= 1 thread3Thread1of1ForFork0_~cond~2))), Black: 94#(= ~n2~0 ~n1~0), 78#(< 0 ~n2~0), 13#L133true, Black: 60#(= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))]) [2025-02-06 13:13:40,836 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2025-02-06 13:13:40,836 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-02-06 13:13:40,836 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-02-06 13:13:40,836 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2025-02-06 13:13:40,837 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([333] L104-->L110: Formula: (or (and (= (+ v_~p2~0_68 (* v_~m~0_57 2)) v_~p2~0_67) (< 1 v_~n2~0_87) (= v_~n2~0_87 (+ v_~n2~0_86 2))) (and (= v_~p2~0_68 v_~p2~0_67) (<= v_~n2~0_87 1) (= v_~n2~0_87 v_~n2~0_86))) InVars {~n2~0=v_~n2~0_87, ~p2~0=v_~p2~0_68, ~m~0=v_~m~0_57} OutVars{~n2~0=v_~n2~0_86, ~p2~0=v_~p2~0_67, ~m~0=v_~m~0_57} AuxVars[] AssignedVars[~n2~0, ~p2~0][231], [24#L47true, Black: 65#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork3_~cond~0 1)) (and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0))) (or (and (<= ~n1~0 0) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork1_~cond~1 1)))), Black: 64#(or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork3_~cond~0 1)) (and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0))), 32#L110true, 145#(or (and (<= ~n1~0 0) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork1_~cond~1 1))), Black: 66#(and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0)), Black: 122#(or (= ~n2~0 ~n1~0) (< 0 ~n1~0)), Black: 68#(and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0) (= thread2Thread1of1ForFork1_~cond~1 0)), Black: 123#(and (or (< ~n2~0 1) (< 0 thread1Thread1of1ForFork3_~cond~0)) (<= (div thread1Thread1of1ForFork3_~cond~0 256) 0)), Black: 131#(and (<= ~n2~0 0) (<= (div thread1Thread1of1ForFork3_~cond~0 256) 0)), Black: 135#(and (<= ~n2~0 0) (<= (div thread1Thread1of1ForFork3_~cond~0 256) 0) (= thread4Thread1of1ForFork2_~cond~3 0)), Black: 133#(and (or (= ~n2~0 ~n1~0) (< 0 ~n1~0)) (<= ~n2~0 0) (<= (div thread1Thread1of1ForFork3_~cond~0 256) 0) (= thread4Thread1of1ForFork2_~cond~3 0)), Black: 129#(and (or (= ~n2~0 ~n1~0) (< 0 ~n1~0)) (<= ~n2~0 0) (<= (div thread1Thread1of1ForFork3_~cond~0 256) 0)), 155#true, Black: 127#(and (or (= ~n2~0 ~n1~0) (< 0 ~n1~0)) (or (< ~n2~0 1) (< 0 thread1Thread1of1ForFork3_~cond~0)) (<= (div thread1Thread1of1ForFork3_~cond~0 256) 0)), Black: 77#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork3_~cond~0 1)) (and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0))) (or (= ~n2~0 ~n1~0) (< 0 ~n2~0))), Black: 78#(< 0 ~n2~0), Black: 79#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)), Black: 80#(and (<= (div thread3Thread1of1ForFork0_~cond~2 256) 0) (<= 1 thread3Thread1of1ForFork0_~cond~2)), Black: 76#(or (= ~n2~0 ~n1~0) (< 0 ~n2~0)), Black: 149#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork1_~cond~1 0)), Black: 151#(and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0) (= thread2Thread1of1ForFork1_~cond~1 0)), Black: 84#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork3_~cond~0 1)) (and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0))) (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)), 48#thread3ENTRYtrue, 19#L66true, Black: 82#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork3_~cond~0 1)) (and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0))) (<= 1 ~n2~0)), 92#true, 120#true, 62#true, Black: 101#(and (= ~n2~0 ~n1~0) (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0)))), Black: 99#(and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0)), Black: 107#(and (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (<= ~n1~0 0)), Black: 96#(and (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (or (< 0 ~n2~0) (< ~n1~0 1))), Black: 103#(and (= ~n2~0 ~n1~0) (<= ~n1~0 0) (= thread3Thread1of1ForFork0_~cond~2 0)), Black: 98#(<= ~n1~0 0), Black: 109#(and (= thread1Thread1of1ForFork3_~cond~0 0) (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (<= ~n1~0 0)), 74#true, Black: 105#(and (= thread1Thread1of1ForFork3_~cond~0 0) (= ~n2~0 ~n1~0) (<= ~n1~0 0) (= thread3Thread1of1ForFork0_~cond~2 0)), Black: 97#(or (< ~n1~0 1) (and (<= (div thread3Thread1of1ForFork0_~cond~2 256) 0) (<= 1 thread3Thread1of1ForFork0_~cond~2))), Black: 94#(= ~n2~0 ~n1~0), 13#L133true, Black: 60#(= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))]) [2025-02-06 13:13:40,837 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2025-02-06 13:13:40,837 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-02-06 13:13:40,837 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-02-06 13:13:40,837 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2025-02-06 13:13:40,838 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([333] L104-->L110: Formula: (or (and (= (+ v_~p2~0_68 (* v_~m~0_57 2)) v_~p2~0_67) (< 1 v_~n2~0_87) (= v_~n2~0_87 (+ v_~n2~0_86 2))) (and (= v_~p2~0_68 v_~p2~0_67) (<= v_~n2~0_87 1) (= v_~n2~0_87 v_~n2~0_86))) InVars {~n2~0=v_~n2~0_87, ~p2~0=v_~p2~0_68, ~m~0=v_~m~0_57} OutVars{~n2~0=v_~n2~0_86, ~p2~0=v_~p2~0_67, ~m~0=v_~m~0_57} AuxVars[] AssignedVars[~n2~0, ~p2~0][231], [24#L47true, Black: 65#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork3_~cond~0 1)) (and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0))) (or (and (<= ~n1~0 0) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork1_~cond~1 1)))), Black: 64#(or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork3_~cond~0 1)) (and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0))), 32#L110true, Black: 66#(and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0)), Black: 122#(or (= ~n2~0 ~n1~0) (< 0 ~n1~0)), Black: 68#(and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0) (= thread2Thread1of1ForFork1_~cond~1 0)), Black: 123#(and (or (< ~n2~0 1) (< 0 thread1Thread1of1ForFork3_~cond~0)) (<= (div thread1Thread1of1ForFork3_~cond~0 256) 0)), Black: 131#(and (<= ~n2~0 0) (<= (div thread1Thread1of1ForFork3_~cond~0 256) 0)), Black: 135#(and (<= ~n2~0 0) (<= (div thread1Thread1of1ForFork3_~cond~0 256) 0) (= thread4Thread1of1ForFork2_~cond~3 0)), Black: 133#(and (or (= ~n2~0 ~n1~0) (< 0 ~n1~0)) (<= ~n2~0 0) (<= (div thread1Thread1of1ForFork3_~cond~0 256) 0) (= thread4Thread1of1ForFork2_~cond~3 0)), Black: 129#(and (or (= ~n2~0 ~n1~0) (< 0 ~n1~0)) (<= ~n2~0 0) (<= (div thread1Thread1of1ForFork3_~cond~0 256) 0)), 155#true, Black: 127#(and (or (= ~n2~0 ~n1~0) (< 0 ~n1~0)) (or (< ~n2~0 1) (< 0 thread1Thread1of1ForFork3_~cond~0)) (<= (div thread1Thread1of1ForFork3_~cond~0 256) 0)), Black: 77#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork3_~cond~0 1)) (and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0))) (or (= ~n2~0 ~n1~0) (< 0 ~n2~0))), Black: 78#(< 0 ~n2~0), Black: 79#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)), Black: 80#(and (<= (div thread3Thread1of1ForFork0_~cond~2 256) 0) (<= 1 thread3Thread1of1ForFork0_~cond~2)), Black: 145#(or (and (<= ~n1~0 0) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork1_~cond~1 1))), Black: 76#(or (= ~n2~0 ~n1~0) (< 0 ~n2~0)), Black: 151#(and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0) (= thread2Thread1of1ForFork1_~cond~1 0)), Black: 84#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork3_~cond~0 1)) (and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0))) (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)), 48#thread3ENTRYtrue, Black: 82#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork3_~cond~0 1)) (and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0))) (<= 1 ~n2~0)), 92#true, 120#true, 62#true, 149#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork1_~cond~1 0)), Black: 101#(and (= ~n2~0 ~n1~0) (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0)))), Black: 99#(and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0)), 5#thread2EXITtrue, Black: 107#(and (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (<= ~n1~0 0)), Black: 96#(and (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (or (< 0 ~n2~0) (< ~n1~0 1))), Black: 103#(and (= ~n2~0 ~n1~0) (<= ~n1~0 0) (= thread3Thread1of1ForFork0_~cond~2 0)), Black: 98#(<= ~n1~0 0), Black: 109#(and (= thread1Thread1of1ForFork3_~cond~0 0) (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (<= ~n1~0 0)), 74#true, Black: 105#(and (= thread1Thread1of1ForFork3_~cond~0 0) (= ~n2~0 ~n1~0) (<= ~n1~0 0) (= thread3Thread1of1ForFork0_~cond~2 0)), Black: 97#(or (< ~n1~0 1) (and (<= (div thread3Thread1of1ForFork0_~cond~2 256) 0) (<= 1 thread3Thread1of1ForFork0_~cond~2))), Black: 94#(= ~n2~0 ~n1~0), 13#L133true, Black: 60#(= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))]) [2025-02-06 13:13:40,838 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2025-02-06 13:13:40,838 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2025-02-06 13:13:40,838 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-02-06 13:13:40,838 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-02-06 13:13:41,490 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([321] L66-->L72: Formula: (or (and (<= v_~n1~0_97 1) (= v_~p1~0_76 v_~p1~0_75) (= v_~n1~0_97 v_~n1~0_96)) (and (< 1 v_~n1~0_97) (= (+ (* v_~m~0_53 2) v_~p1~0_76) v_~p1~0_75) (= (+ v_~n1~0_96 2) v_~n1~0_97))) InVars {~p1~0=v_~p1~0_76, ~n1~0=v_~n1~0_97, ~m~0=v_~m~0_53} OutVars{~p1~0=v_~p1~0_75, ~n1~0=v_~n1~0_96, ~m~0=v_~m~0_53} AuxVars[] AssignedVars[~p1~0, ~n1~0][82], [24#L47true, Black: 65#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork3_~cond~0 1)) (and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0))) (or (and (<= ~n1~0 0) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork1_~cond~1 1)))), Black: 64#(or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork3_~cond~0 1)) (and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0))), Black: 122#(or (= ~n2~0 ~n1~0) (< 0 ~n1~0)), 79#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)), Black: 66#(and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0)), Black: 68#(and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0) (= thread2Thread1of1ForFork1_~cond~1 0)), Black: 123#(and (or (< ~n2~0 1) (< 0 thread1Thread1of1ForFork3_~cond~0)) (<= (div thread1Thread1of1ForFork3_~cond~0 256) 0)), Black: 131#(and (<= ~n2~0 0) (<= (div thread1Thread1of1ForFork3_~cond~0 256) 0)), Black: 135#(and (<= ~n2~0 0) (<= (div thread1Thread1of1ForFork3_~cond~0 256) 0) (= thread4Thread1of1ForFork2_~cond~3 0)), Black: 133#(and (or (= ~n2~0 ~n1~0) (< 0 ~n1~0)) (<= ~n2~0 0) (<= (div thread1Thread1of1ForFork3_~cond~0 256) 0) (= thread4Thread1of1ForFork2_~cond~3 0)), 155#true, Black: 129#(and (or (= ~n2~0 ~n1~0) (< 0 ~n1~0)) (<= ~n2~0 0) (<= (div thread1Thread1of1ForFork3_~cond~0 256) 0)), Black: 127#(and (or (= ~n2~0 ~n1~0) (< 0 ~n1~0)) (or (< ~n2~0 1) (< 0 thread1Thread1of1ForFork3_~cond~0)) (<= (div thread1Thread1of1ForFork3_~cond~0 256) 0)), Black: 77#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork3_~cond~0 1)) (and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0))) (or (= ~n2~0 ~n1~0) (< 0 ~n2~0))), Black: 78#(< 0 ~n2~0), 39#L132-1true, Black: 80#(and (<= (div thread3Thread1of1ForFork0_~cond~2 256) 0) (<= 1 thread3Thread1of1ForFork0_~cond~2)), Black: 145#(or (and (<= ~n1~0 0) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork1_~cond~1 1))), 7#L72true, Black: 76#(or (= ~n2~0 ~n1~0) (< 0 ~n2~0)), Black: 149#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork1_~cond~1 0)), Black: 151#(and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0) (= thread2Thread1of1ForFork1_~cond~1 0)), Black: 84#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork3_~cond~0 1)) (and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0))) (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)), Black: 82#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork3_~cond~0 1)) (and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0))) (<= 1 ~n2~0)), 92#true, 120#true, 62#true, Black: 101#(and (= ~n2~0 ~n1~0) (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0)))), Black: 99#(and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0)), Black: 107#(and (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (<= ~n1~0 0)), 34#L104true, Black: 96#(and (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (or (< 0 ~n2~0) (< ~n1~0 1))), Black: 103#(and (= ~n2~0 ~n1~0) (<= ~n1~0 0) (= thread3Thread1of1ForFork0_~cond~2 0)), Black: 98#(<= ~n1~0 0), Black: 109#(and (= thread1Thread1of1ForFork3_~cond~0 0) (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (<= ~n1~0 0)), Black: 105#(and (= thread1Thread1of1ForFork3_~cond~0 0) (= ~n2~0 ~n1~0) (<= ~n1~0 0) (= thread3Thread1of1ForFork0_~cond~2 0)), 143#true, Black: 97#(or (< ~n1~0 1) (and (<= (div thread3Thread1of1ForFork0_~cond~2 256) 0) (<= 1 thread3Thread1of1ForFork0_~cond~2))), Black: 94#(= ~n2~0 ~n1~0), 12#L84true, Black: 60#(= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))]) [2025-02-06 13:13:41,491 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2025-02-06 13:13:41,491 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-02-06 13:13:41,491 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-02-06 13:13:41,491 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2025-02-06 13:13:41,809 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([321] L66-->L72: Formula: (or (and (<= v_~n1~0_97 1) (= v_~p1~0_76 v_~p1~0_75) (= v_~n1~0_97 v_~n1~0_96)) (and (< 1 v_~n1~0_97) (= (+ (* v_~m~0_53 2) v_~p1~0_76) v_~p1~0_75) (= (+ v_~n1~0_96 2) v_~n1~0_97))) InVars {~p1~0=v_~p1~0_76, ~n1~0=v_~n1~0_97, ~m~0=v_~m~0_53} OutVars{~p1~0=v_~p1~0_75, ~n1~0=v_~n1~0_96, ~m~0=v_~m~0_53} AuxVars[] AssignedVars[~p1~0, ~n1~0][82], [24#L47true, Black: 65#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork3_~cond~0 1)) (and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0))) (or (and (<= ~n1~0 0) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork1_~cond~1 1)))), Black: 64#(or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork3_~cond~0 1)) (and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0))), Black: 122#(or (= ~n2~0 ~n1~0) (< 0 ~n1~0)), Black: 66#(and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0)), 79#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)), Black: 68#(and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0) (= thread2Thread1of1ForFork1_~cond~1 0)), Black: 123#(and (or (< ~n2~0 1) (< 0 thread1Thread1of1ForFork3_~cond~0)) (<= (div thread1Thread1of1ForFork3_~cond~0 256) 0)), Black: 131#(and (<= ~n2~0 0) (<= (div thread1Thread1of1ForFork3_~cond~0 256) 0)), Black: 135#(and (<= ~n2~0 0) (<= (div thread1Thread1of1ForFork3_~cond~0 256) 0) (= thread4Thread1of1ForFork2_~cond~3 0)), Black: 133#(and (or (= ~n2~0 ~n1~0) (< 0 ~n1~0)) (<= ~n2~0 0) (<= (div thread1Thread1of1ForFork3_~cond~0 256) 0) (= thread4Thread1of1ForFork2_~cond~3 0)), Black: 129#(and (or (= ~n2~0 ~n1~0) (< 0 ~n1~0)) (<= ~n2~0 0) (<= (div thread1Thread1of1ForFork3_~cond~0 256) 0)), 155#true, Black: 127#(and (or (= ~n2~0 ~n1~0) (< 0 ~n1~0)) (or (< ~n2~0 1) (< 0 thread1Thread1of1ForFork3_~cond~0)) (<= (div thread1Thread1of1ForFork3_~cond~0 256) 0)), Black: 77#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork3_~cond~0 1)) (and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0))) (or (= ~n2~0 ~n1~0) (< 0 ~n2~0))), Black: 78#(< 0 ~n2~0), Black: 145#(or (and (<= ~n1~0 0) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork1_~cond~1 1))), Black: 80#(and (<= (div thread3Thread1of1ForFork0_~cond~2 256) 0) (<= 1 thread3Thread1of1ForFork0_~cond~2)), 7#L72true, Black: 76#(or (= ~n2~0 ~n1~0) (< 0 ~n2~0)), Black: 149#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork1_~cond~1 0)), Black: 151#(and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0) (= thread2Thread1of1ForFork1_~cond~1 0)), Black: 84#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork3_~cond~0 1)) (and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0))) (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)), Black: 82#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork3_~cond~0 1)) (and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0))) (<= 1 ~n2~0)), 92#true, 120#true, 62#true, Black: 101#(and (= ~n2~0 ~n1~0) (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0)))), Black: 99#(and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0)), Black: 107#(and (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (<= ~n1~0 0)), 34#L104true, Black: 96#(and (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (or (< 0 ~n2~0) (< ~n1~0 1))), Black: 103#(and (= ~n2~0 ~n1~0) (<= ~n1~0 0) (= thread3Thread1of1ForFork0_~cond~2 0)), Black: 98#(<= ~n1~0 0), Black: 109#(and (= thread1Thread1of1ForFork3_~cond~0 0) (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (<= ~n1~0 0)), 143#true, Black: 105#(and (= thread1Thread1of1ForFork3_~cond~0 0) (= ~n2~0 ~n1~0) (<= ~n1~0 0) (= thread3Thread1of1ForFork0_~cond~2 0)), Black: 97#(or (< ~n1~0 1) (and (<= (div thread3Thread1of1ForFork0_~cond~2 256) 0) (<= 1 thread3Thread1of1ForFork0_~cond~2))), Black: 94#(= ~n2~0 ~n1~0), 12#L84true, 13#L133true, Black: 60#(= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))]) [2025-02-06 13:13:41,809 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2025-02-06 13:13:41,809 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-02-06 13:13:41,809 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2025-02-06 13:13:41,809 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-02-06 13:13:41,855 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([321] L66-->L72: Formula: (or (and (<= v_~n1~0_97 1) (= v_~p1~0_76 v_~p1~0_75) (= v_~n1~0_97 v_~n1~0_96)) (and (< 1 v_~n1~0_97) (= (+ (* v_~m~0_53 2) v_~p1~0_76) v_~p1~0_75) (= (+ v_~n1~0_96 2) v_~n1~0_97))) InVars {~p1~0=v_~p1~0_76, ~n1~0=v_~n1~0_97, ~m~0=v_~m~0_53} OutVars{~p1~0=v_~p1~0_75, ~n1~0=v_~n1~0_96, ~m~0=v_~m~0_53} AuxVars[] AssignedVars[~p1~0, ~n1~0][82], [24#L47true, Black: 65#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork3_~cond~0 1)) (and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0))) (or (and (<= ~n1~0 0) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork1_~cond~1 1)))), Black: 64#(or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork3_~cond~0 1)) (and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0))), Black: 122#(or (= ~n2~0 ~n1~0) (< 0 ~n1~0)), Black: 66#(and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0)), Black: 123#(and (or (< ~n2~0 1) (< 0 thread1Thread1of1ForFork3_~cond~0)) (<= (div thread1Thread1of1ForFork3_~cond~0 256) 0)), Black: 68#(and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0) (= thread2Thread1of1ForFork1_~cond~1 0)), Black: 131#(and (<= ~n2~0 0) (<= (div thread1Thread1of1ForFork3_~cond~0 256) 0)), Black: 135#(and (<= ~n2~0 0) (<= (div thread1Thread1of1ForFork3_~cond~0 256) 0) (= thread4Thread1of1ForFork2_~cond~3 0)), Black: 133#(and (or (= ~n2~0 ~n1~0) (< 0 ~n1~0)) (<= ~n2~0 0) (<= (div thread1Thread1of1ForFork3_~cond~0 256) 0) (= thread4Thread1of1ForFork2_~cond~3 0)), Black: 129#(and (or (= ~n2~0 ~n1~0) (< 0 ~n1~0)) (<= ~n2~0 0) (<= (div thread1Thread1of1ForFork3_~cond~0 256) 0)), 155#true, Black: 127#(and (or (= ~n2~0 ~n1~0) (< 0 ~n1~0)) (or (< ~n2~0 1) (< 0 thread1Thread1of1ForFork3_~cond~0)) (<= (div thread1Thread1of1ForFork3_~cond~0 256) 0)), Black: 77#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork3_~cond~0 1)) (and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0))) (or (= ~n2~0 ~n1~0) (< 0 ~n2~0))), Black: 79#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)), Black: 145#(or (and (<= ~n1~0 0) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork1_~cond~1 1))), Black: 80#(and (<= (div thread3Thread1of1ForFork0_~cond~2 256) 0) (<= 1 thread3Thread1of1ForFork0_~cond~2)), 96#(and (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (or (< 0 ~n2~0) (< ~n1~0 1))), 7#L72true, Black: 149#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork1_~cond~1 0)), Black: 76#(or (= ~n2~0 ~n1~0) (< 0 ~n2~0)), Black: 84#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork3_~cond~0 1)) (and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0))) (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)), Black: 151#(and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0) (= thread2Thread1of1ForFork1_~cond~1 0)), Black: 82#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork3_~cond~0 1)) (and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0))) (<= 1 ~n2~0)), 120#true, 62#true, Black: 101#(and (= ~n2~0 ~n1~0) (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0)))), Black: 99#(and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0)), Black: 107#(and (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (<= ~n1~0 0)), 34#L104true, Black: 103#(and (= ~n2~0 ~n1~0) (<= ~n1~0 0) (= thread3Thread1of1ForFork0_~cond~2 0)), Black: 98#(<= ~n1~0 0), Black: 109#(and (= thread1Thread1of1ForFork3_~cond~0 0) (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (<= ~n1~0 0)), 143#true, Black: 105#(and (= thread1Thread1of1ForFork3_~cond~0 0) (= ~n2~0 ~n1~0) (<= ~n1~0 0) (= thread3Thread1of1ForFork0_~cond~2 0)), Black: 97#(or (< ~n1~0 1) (and (<= (div thread3Thread1of1ForFork0_~cond~2 256) 0) (<= 1 thread3Thread1of1ForFork0_~cond~2))), 78#(< 0 ~n2~0), Black: 94#(= ~n2~0 ~n1~0), 12#L84true, 13#L133true, Black: 60#(= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))]) [2025-02-06 13:13:41,855 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2025-02-06 13:13:41,855 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-02-06 13:13:41,855 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2025-02-06 13:13:41,855 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-02-06 13:13:41,856 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([321] L66-->L72: Formula: (or (and (<= v_~n1~0_97 1) (= v_~p1~0_76 v_~p1~0_75) (= v_~n1~0_97 v_~n1~0_96)) (and (< 1 v_~n1~0_97) (= (+ (* v_~m~0_53 2) v_~p1~0_76) v_~p1~0_75) (= (+ v_~n1~0_96 2) v_~n1~0_97))) InVars {~p1~0=v_~p1~0_76, ~n1~0=v_~n1~0_97, ~m~0=v_~m~0_53} OutVars{~p1~0=v_~p1~0_75, ~n1~0=v_~n1~0_96, ~m~0=v_~m~0_53} AuxVars[] AssignedVars[~p1~0, ~n1~0][82], [24#L47true, Black: 65#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork3_~cond~0 1)) (and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0))) (or (and (<= ~n1~0 0) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork1_~cond~1 1)))), Black: 64#(or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork3_~cond~0 1)) (and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0))), Black: 122#(or (= ~n2~0 ~n1~0) (< 0 ~n1~0)), Black: 66#(and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0)), 107#(and (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (<= ~n1~0 0)), Black: 123#(and (or (< ~n2~0 1) (< 0 thread1Thread1of1ForFork3_~cond~0)) (<= (div thread1Thread1of1ForFork3_~cond~0 256) 0)), Black: 68#(and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0) (= thread2Thread1of1ForFork1_~cond~1 0)), Black: 131#(and (<= ~n2~0 0) (<= (div thread1Thread1of1ForFork3_~cond~0 256) 0)), Black: 135#(and (<= ~n2~0 0) (<= (div thread1Thread1of1ForFork3_~cond~0 256) 0) (= thread4Thread1of1ForFork2_~cond~3 0)), Black: 133#(and (or (= ~n2~0 ~n1~0) (< 0 ~n1~0)) (<= ~n2~0 0) (<= (div thread1Thread1of1ForFork3_~cond~0 256) 0) (= thread4Thread1of1ForFork2_~cond~3 0)), Black: 129#(and (or (= ~n2~0 ~n1~0) (< 0 ~n1~0)) (<= ~n2~0 0) (<= (div thread1Thread1of1ForFork3_~cond~0 256) 0)), 155#true, Black: 127#(and (or (= ~n2~0 ~n1~0) (< 0 ~n1~0)) (or (< ~n2~0 1) (< 0 thread1Thread1of1ForFork3_~cond~0)) (<= (div thread1Thread1of1ForFork3_~cond~0 256) 0)), Black: 77#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork3_~cond~0 1)) (and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0))) (or (= ~n2~0 ~n1~0) (< 0 ~n2~0))), Black: 79#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)), 39#L132-1true, Black: 80#(and (<= (div thread3Thread1of1ForFork0_~cond~2 256) 0) (<= 1 thread3Thread1of1ForFork0_~cond~2)), Black: 145#(or (and (<= ~n1~0 0) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork1_~cond~1 1))), Black: 149#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork1_~cond~1 0)), 7#L72true, Black: 76#(or (= ~n2~0 ~n1~0) (< 0 ~n2~0)), Black: 151#(and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0) (= thread2Thread1of1ForFork1_~cond~1 0)), Black: 84#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork3_~cond~0 1)) (and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0))) (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)), Black: 82#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork3_~cond~0 1)) (and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0))) (<= 1 ~n2~0)), 120#true, 16#thread3EXITtrue, 62#true, Black: 101#(and (= ~n2~0 ~n1~0) (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0)))), Black: 99#(and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0)), Black: 96#(and (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (or (< 0 ~n2~0) (< ~n1~0 1))), 34#L104true, Black: 103#(and (= ~n2~0 ~n1~0) (<= ~n1~0 0) (= thread3Thread1of1ForFork0_~cond~2 0)), Black: 98#(<= ~n1~0 0), Black: 109#(and (= thread1Thread1of1ForFork3_~cond~0 0) (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (<= ~n1~0 0)), 143#true, Black: 105#(and (= thread1Thread1of1ForFork3_~cond~0 0) (= ~n2~0 ~n1~0) (<= ~n1~0 0) (= thread3Thread1of1ForFork0_~cond~2 0)), Black: 97#(or (< ~n1~0 1) (and (<= (div thread3Thread1of1ForFork0_~cond~2 256) 0) (<= 1 thread3Thread1of1ForFork0_~cond~2))), 78#(< 0 ~n2~0), Black: 94#(= ~n2~0 ~n1~0), Black: 60#(= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))]) [2025-02-06 13:13:41,856 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2025-02-06 13:13:41,857 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-02-06 13:13:41,857 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2025-02-06 13:13:41,857 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-02-06 13:13:42,067 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([321] L66-->L72: Formula: (or (and (<= v_~n1~0_97 1) (= v_~p1~0_76 v_~p1~0_75) (= v_~n1~0_97 v_~n1~0_96)) (and (< 1 v_~n1~0_97) (= (+ (* v_~m~0_53 2) v_~p1~0_76) v_~p1~0_75) (= (+ v_~n1~0_96 2) v_~n1~0_97))) InVars {~p1~0=v_~p1~0_76, ~n1~0=v_~n1~0_97, ~m~0=v_~m~0_53} OutVars{~p1~0=v_~p1~0_75, ~n1~0=v_~n1~0_96, ~m~0=v_~m~0_53} AuxVars[] AssignedVars[~p1~0, ~n1~0][82], [24#L47true, Black: 65#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork3_~cond~0 1)) (and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0))) (or (and (<= ~n1~0 0) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork1_~cond~1 1)))), Black: 64#(or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork3_~cond~0 1)) (and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0))), Black: 122#(or (= ~n2~0 ~n1~0) (< 0 ~n1~0)), Black: 66#(and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0)), Black: 68#(and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0) (= thread2Thread1of1ForFork1_~cond~1 0)), Black: 123#(and (or (< ~n2~0 1) (< 0 thread1Thread1of1ForFork3_~cond~0)) (<= (div thread1Thread1of1ForFork3_~cond~0 256) 0)), Black: 131#(and (<= ~n2~0 0) (<= (div thread1Thread1of1ForFork3_~cond~0 256) 0)), Black: 135#(and (<= ~n2~0 0) (<= (div thread1Thread1of1ForFork3_~cond~0 256) 0) (= thread4Thread1of1ForFork2_~cond~3 0)), Black: 133#(and (or (= ~n2~0 ~n1~0) (< 0 ~n1~0)) (<= ~n2~0 0) (<= (div thread1Thread1of1ForFork3_~cond~0 256) 0) (= thread4Thread1of1ForFork2_~cond~3 0)), Black: 129#(and (or (= ~n2~0 ~n1~0) (< 0 ~n1~0)) (<= ~n2~0 0) (<= (div thread1Thread1of1ForFork3_~cond~0 256) 0)), 155#true, Black: 127#(and (or (= ~n2~0 ~n1~0) (< 0 ~n1~0)) (or (< ~n2~0 1) (< 0 thread1Thread1of1ForFork3_~cond~0)) (<= (div thread1Thread1of1ForFork3_~cond~0 256) 0)), Black: 77#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork3_~cond~0 1)) (and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0))) (or (= ~n2~0 ~n1~0) (< 0 ~n2~0))), Black: 78#(< 0 ~n2~0), Black: 79#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)), 39#L132-1true, Black: 145#(or (and (<= ~n1~0 0) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork1_~cond~1 1))), 7#L72true, Black: 76#(or (= ~n2~0 ~n1~0) (< 0 ~n2~0)), Black: 149#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork1_~cond~1 0)), Black: 151#(and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0) (= thread2Thread1of1ForFork1_~cond~1 0)), Black: 84#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork3_~cond~0 1)) (and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0))) (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)), Black: 82#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork3_~cond~0 1)) (and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0))) (<= 1 ~n2~0)), 92#true, 120#true, 80#(and (<= (div thread3Thread1of1ForFork0_~cond~2 256) 0) (<= 1 thread3Thread1of1ForFork0_~cond~2)), 3#L91true, 62#true, Black: 101#(and (= ~n2~0 ~n1~0) (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0)))), Black: 99#(and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0)), Black: 107#(and (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (<= ~n1~0 0)), 34#L104true, Black: 96#(and (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (or (< 0 ~n2~0) (< ~n1~0 1))), Black: 103#(and (= ~n2~0 ~n1~0) (<= ~n1~0 0) (= thread3Thread1of1ForFork0_~cond~2 0)), Black: 98#(<= ~n1~0 0), Black: 109#(and (= thread1Thread1of1ForFork3_~cond~0 0) (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (<= ~n1~0 0)), Black: 105#(and (= thread1Thread1of1ForFork3_~cond~0 0) (= ~n2~0 ~n1~0) (<= ~n1~0 0) (= thread3Thread1of1ForFork0_~cond~2 0)), 143#true, Black: 97#(or (< ~n1~0 1) (and (<= (div thread3Thread1of1ForFork0_~cond~2 256) 0) (<= 1 thread3Thread1of1ForFork0_~cond~2))), Black: 94#(= ~n2~0 ~n1~0), Black: 60#(= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))]) [2025-02-06 13:13:42,068 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2025-02-06 13:13:42,068 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2025-02-06 13:13:42,068 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2025-02-06 13:13:42,068 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2025-02-06 13:13:42,389 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([321] L66-->L72: Formula: (or (and (<= v_~n1~0_97 1) (= v_~p1~0_76 v_~p1~0_75) (= v_~n1~0_97 v_~n1~0_96)) (and (< 1 v_~n1~0_97) (= (+ (* v_~m~0_53 2) v_~p1~0_76) v_~p1~0_75) (= (+ v_~n1~0_96 2) v_~n1~0_97))) InVars {~p1~0=v_~p1~0_76, ~n1~0=v_~n1~0_97, ~m~0=v_~m~0_53} OutVars{~p1~0=v_~p1~0_75, ~n1~0=v_~n1~0_96, ~m~0=v_~m~0_53} AuxVars[] AssignedVars[~p1~0, ~n1~0][82], [24#L47true, Black: 65#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork3_~cond~0 1)) (and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0))) (or (and (<= ~n1~0 0) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork1_~cond~1 1)))), Black: 64#(or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork3_~cond~0 1)) (and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0))), Black: 122#(or (= ~n2~0 ~n1~0) (< 0 ~n1~0)), Black: 66#(and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0)), 107#(and (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (<= ~n1~0 0)), Black: 68#(and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0) (= thread2Thread1of1ForFork1_~cond~1 0)), Black: 123#(and (or (< ~n2~0 1) (< 0 thread1Thread1of1ForFork3_~cond~0)) (<= (div thread1Thread1of1ForFork3_~cond~0 256) 0)), Black: 131#(and (<= ~n2~0 0) (<= (div thread1Thread1of1ForFork3_~cond~0 256) 0)), Black: 135#(and (<= ~n2~0 0) (<= (div thread1Thread1of1ForFork3_~cond~0 256) 0) (= thread4Thread1of1ForFork2_~cond~3 0)), Black: 133#(and (or (= ~n2~0 ~n1~0) (< 0 ~n1~0)) (<= ~n2~0 0) (<= (div thread1Thread1of1ForFork3_~cond~0 256) 0) (= thread4Thread1of1ForFork2_~cond~3 0)), Black: 129#(and (or (= ~n2~0 ~n1~0) (< 0 ~n1~0)) (<= ~n2~0 0) (<= (div thread1Thread1of1ForFork3_~cond~0 256) 0)), 155#true, Black: 127#(and (or (= ~n2~0 ~n1~0) (< 0 ~n1~0)) (or (< ~n2~0 1) (< 0 thread1Thread1of1ForFork3_~cond~0)) (<= (div thread1Thread1of1ForFork3_~cond~0 256) 0)), Black: 77#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork3_~cond~0 1)) (and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0))) (or (= ~n2~0 ~n1~0) (< 0 ~n2~0))), Black: 79#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)), Black: 80#(and (<= (div thread3Thread1of1ForFork0_~cond~2 256) 0) (<= 1 thread3Thread1of1ForFork0_~cond~2)), Black: 145#(or (and (<= ~n1~0 0) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork1_~cond~1 1))), Black: 76#(or (= ~n2~0 ~n1~0) (< 0 ~n2~0)), 7#L72true, Black: 149#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork1_~cond~1 0)), Black: 151#(and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0) (= thread2Thread1of1ForFork1_~cond~1 0)), Black: 84#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork3_~cond~0 1)) (and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0))) (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)), Black: 82#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork3_~cond~0 1)) (and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0))) (<= 1 ~n2~0)), 120#true, 16#thread3EXITtrue, 62#true, Black: 101#(and (= ~n2~0 ~n1~0) (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0)))), Black: 99#(and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0)), 34#L104true, Black: 96#(and (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (or (< 0 ~n2~0) (< ~n1~0 1))), Black: 103#(and (= ~n2~0 ~n1~0) (<= ~n1~0 0) (= thread3Thread1of1ForFork0_~cond~2 0)), Black: 98#(<= ~n1~0 0), Black: 109#(and (= thread1Thread1of1ForFork3_~cond~0 0) (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (<= ~n1~0 0)), Black: 105#(and (= thread1Thread1of1ForFork3_~cond~0 0) (= ~n2~0 ~n1~0) (<= ~n1~0 0) (= thread3Thread1of1ForFork0_~cond~2 0)), 143#true, Black: 97#(or (< ~n1~0 1) (and (<= (div thread3Thread1of1ForFork0_~cond~2 256) 0) (<= 1 thread3Thread1of1ForFork0_~cond~2))), Black: 94#(= ~n2~0 ~n1~0), 78#(< 0 ~n2~0), 13#L133true, Black: 60#(= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))]) [2025-02-06 13:13:42,389 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2025-02-06 13:13:42,389 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2025-02-06 13:13:42,389 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2025-02-06 13:13:42,390 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2025-02-06 13:13:42,390 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([321] L66-->L72: Formula: (or (and (<= v_~n1~0_97 1) (= v_~p1~0_76 v_~p1~0_75) (= v_~n1~0_97 v_~n1~0_96)) (and (< 1 v_~n1~0_97) (= (+ (* v_~m~0_53 2) v_~p1~0_76) v_~p1~0_75) (= (+ v_~n1~0_96 2) v_~n1~0_97))) InVars {~p1~0=v_~p1~0_76, ~n1~0=v_~n1~0_97, ~m~0=v_~m~0_53} OutVars{~p1~0=v_~p1~0_75, ~n1~0=v_~n1~0_96, ~m~0=v_~m~0_53} AuxVars[] AssignedVars[~p1~0, ~n1~0][82], [24#L47true, Black: 65#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork3_~cond~0 1)) (and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0))) (or (and (<= ~n1~0 0) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork1_~cond~1 1)))), Black: 64#(or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork3_~cond~0 1)) (and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0))), Black: 122#(or (= ~n2~0 ~n1~0) (< 0 ~n1~0)), Black: 66#(and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0)), Black: 123#(and (or (< ~n2~0 1) (< 0 thread1Thread1of1ForFork3_~cond~0)) (<= (div thread1Thread1of1ForFork3_~cond~0 256) 0)), Black: 68#(and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0) (= thread2Thread1of1ForFork1_~cond~1 0)), Black: 131#(and (<= ~n2~0 0) (<= (div thread1Thread1of1ForFork3_~cond~0 256) 0)), Black: 135#(and (<= ~n2~0 0) (<= (div thread1Thread1of1ForFork3_~cond~0 256) 0) (= thread4Thread1of1ForFork2_~cond~3 0)), Black: 133#(and (or (= ~n2~0 ~n1~0) (< 0 ~n1~0)) (<= ~n2~0 0) (<= (div thread1Thread1of1ForFork3_~cond~0 256) 0) (= thread4Thread1of1ForFork2_~cond~3 0)), Black: 129#(and (or (= ~n2~0 ~n1~0) (< 0 ~n1~0)) (<= ~n2~0 0) (<= (div thread1Thread1of1ForFork3_~cond~0 256) 0)), 155#true, Black: 127#(and (or (= ~n2~0 ~n1~0) (< 0 ~n1~0)) (or (< ~n2~0 1) (< 0 thread1Thread1of1ForFork3_~cond~0)) (<= (div thread1Thread1of1ForFork3_~cond~0 256) 0)), Black: 77#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork3_~cond~0 1)) (and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0))) (or (= ~n2~0 ~n1~0) (< 0 ~n2~0))), Black: 78#(< 0 ~n2~0), Black: 79#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)), 39#L132-1true, Black: 80#(and (<= (div thread3Thread1of1ForFork0_~cond~2 256) 0) (<= 1 thread3Thread1of1ForFork0_~cond~2)), Black: 145#(or (and (<= ~n1~0 0) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork1_~cond~1 1))), Black: 149#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork1_~cond~1 0)), 7#L72true, Black: 76#(or (= ~n2~0 ~n1~0) (< 0 ~n2~0)), Black: 151#(and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0) (= thread2Thread1of1ForFork1_~cond~1 0)), Black: 84#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork3_~cond~0 1)) (and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0))) (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)), Black: 82#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork3_~cond~0 1)) (and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0))) (<= 1 ~n2~0)), 120#true, 3#L91true, 62#true, 97#(or (< ~n1~0 1) (and (<= (div thread3Thread1of1ForFork0_~cond~2 256) 0) (<= 1 thread3Thread1of1ForFork0_~cond~2))), Black: 101#(and (= ~n2~0 ~n1~0) (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0)))), Black: 99#(and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0)), Black: 107#(and (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (<= ~n1~0 0)), Black: 96#(and (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (or (< 0 ~n2~0) (< ~n1~0 1))), 34#L104true, Black: 103#(and (= ~n2~0 ~n1~0) (<= ~n1~0 0) (= thread3Thread1of1ForFork0_~cond~2 0)), Black: 98#(<= ~n1~0 0), 74#true, Black: 109#(and (= thread1Thread1of1ForFork3_~cond~0 0) (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (<= ~n1~0 0)), 143#true, Black: 105#(and (= thread1Thread1of1ForFork3_~cond~0 0) (= ~n2~0 ~n1~0) (<= ~n1~0 0) (= thread3Thread1of1ForFork0_~cond~2 0)), Black: 94#(= ~n2~0 ~n1~0), Black: 60#(= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))]) [2025-02-06 13:13:42,391 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2025-02-06 13:13:42,391 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2025-02-06 13:13:42,391 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2025-02-06 13:13:42,391 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2025-02-06 13:13:42,421 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([321] L66-->L72: Formula: (or (and (<= v_~n1~0_97 1) (= v_~p1~0_76 v_~p1~0_75) (= v_~n1~0_97 v_~n1~0_96)) (and (< 1 v_~n1~0_97) (= (+ (* v_~m~0_53 2) v_~p1~0_76) v_~p1~0_75) (= (+ v_~n1~0_96 2) v_~n1~0_97))) InVars {~p1~0=v_~p1~0_76, ~n1~0=v_~n1~0_97, ~m~0=v_~m~0_53} OutVars{~p1~0=v_~p1~0_75, ~n1~0=v_~n1~0_96, ~m~0=v_~m~0_53} AuxVars[] AssignedVars[~p1~0, ~n1~0][82], [24#L47true, Black: 65#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork3_~cond~0 1)) (and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0))) (or (and (<= ~n1~0 0) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork1_~cond~1 1)))), Black: 64#(or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork3_~cond~0 1)) (and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0))), Black: 66#(and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0)), Black: 122#(or (= ~n2~0 ~n1~0) (< 0 ~n1~0)), Black: 68#(and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0) (= thread2Thread1of1ForFork1_~cond~1 0)), Black: 131#(and (<= ~n2~0 0) (<= (div thread1Thread1of1ForFork3_~cond~0 256) 0)), Black: 135#(and (<= ~n2~0 0) (<= (div thread1Thread1of1ForFork3_~cond~0 256) 0) (= thread4Thread1of1ForFork2_~cond~3 0)), Black: 133#(and (or (= ~n2~0 ~n1~0) (< 0 ~n1~0)) (<= ~n2~0 0) (<= (div thread1Thread1of1ForFork3_~cond~0 256) 0) (= thread4Thread1of1ForFork2_~cond~3 0)), Black: 129#(and (or (= ~n2~0 ~n1~0) (< 0 ~n1~0)) (<= ~n2~0 0) (<= (div thread1Thread1of1ForFork3_~cond~0 256) 0)), 155#true, Black: 127#(and (or (= ~n2~0 ~n1~0) (< 0 ~n1~0)) (or (< ~n2~0 1) (< 0 thread1Thread1of1ForFork3_~cond~0)) (<= (div thread1Thread1of1ForFork3_~cond~0 256) 0)), Black: 77#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork3_~cond~0 1)) (and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0))) (or (= ~n2~0 ~n1~0) (< 0 ~n2~0))), Black: 78#(< 0 ~n2~0), Black: 79#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)), 39#L132-1true, Black: 145#(or (and (<= ~n1~0 0) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork1_~cond~1 1))), Black: 80#(and (<= (div thread3Thread1of1ForFork0_~cond~2 256) 0) (<= 1 thread3Thread1of1ForFork0_~cond~2)), Black: 76#(or (= ~n2~0 ~n1~0) (< 0 ~n2~0)), Black: 149#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork1_~cond~1 0)), 7#L72true, Black: 151#(and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0) (= thread2Thread1of1ForFork1_~cond~1 0)), Black: 84#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork3_~cond~0 1)) (and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0))) (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)), Black: 82#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork3_~cond~0 1)) (and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0))) (<= 1 ~n2~0)), 92#true, 3#L91true, 62#true, Black: 101#(and (= ~n2~0 ~n1~0) (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0)))), Black: 99#(and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0)), Black: 107#(and (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (<= ~n1~0 0)), Black: 96#(and (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (or (< 0 ~n2~0) (< ~n1~0 1))), 34#L104true, Black: 103#(and (= ~n2~0 ~n1~0) (<= ~n1~0 0) (= thread3Thread1of1ForFork0_~cond~2 0)), Black: 98#(<= ~n1~0 0), Black: 109#(and (= thread1Thread1of1ForFork3_~cond~0 0) (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (<= ~n1~0 0)), 74#true, Black: 105#(and (= thread1Thread1of1ForFork3_~cond~0 0) (= ~n2~0 ~n1~0) (<= ~n1~0 0) (= thread3Thread1of1ForFork0_~cond~2 0)), 143#true, Black: 97#(or (< ~n1~0 1) (and (<= (div thread3Thread1of1ForFork0_~cond~2 256) 0) (<= 1 thread3Thread1of1ForFork0_~cond~2))), Black: 94#(= ~n2~0 ~n1~0), 123#(and (or (< ~n2~0 1) (< 0 thread1Thread1of1ForFork3_~cond~0)) (<= (div thread1Thread1of1ForFork3_~cond~0 256) 0)), Black: 60#(= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))]) [2025-02-06 13:13:42,421 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2025-02-06 13:13:42,421 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-02-06 13:13:42,421 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2025-02-06 13:13:42,421 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2025-02-06 13:13:42,538 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([321] L66-->L72: Formula: (or (and (<= v_~n1~0_97 1) (= v_~p1~0_76 v_~p1~0_75) (= v_~n1~0_97 v_~n1~0_96)) (and (< 1 v_~n1~0_97) (= (+ (* v_~m~0_53 2) v_~p1~0_76) v_~p1~0_75) (= (+ v_~n1~0_96 2) v_~n1~0_97))) InVars {~p1~0=v_~p1~0_76, ~n1~0=v_~n1~0_97, ~m~0=v_~m~0_53} OutVars{~p1~0=v_~p1~0_75, ~n1~0=v_~n1~0_96, ~m~0=v_~m~0_53} AuxVars[] AssignedVars[~p1~0, ~n1~0][82], [24#L47true, Black: 65#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork3_~cond~0 1)) (and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0))) (or (and (<= ~n1~0 0) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork1_~cond~1 1)))), Black: 64#(or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork3_~cond~0 1)) (and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0))), Black: 66#(and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0)), Black: 122#(or (= ~n2~0 ~n1~0) (< 0 ~n1~0)), Black: 68#(and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0) (= thread2Thread1of1ForFork1_~cond~1 0)), Black: 123#(and (or (< ~n2~0 1) (< 0 thread1Thread1of1ForFork3_~cond~0)) (<= (div thread1Thread1of1ForFork3_~cond~0 256) 0)), Black: 131#(and (<= ~n2~0 0) (<= (div thread1Thread1of1ForFork3_~cond~0 256) 0)), Black: 135#(and (<= ~n2~0 0) (<= (div thread1Thread1of1ForFork3_~cond~0 256) 0) (= thread4Thread1of1ForFork2_~cond~3 0)), Black: 133#(and (or (= ~n2~0 ~n1~0) (< 0 ~n1~0)) (<= ~n2~0 0) (<= (div thread1Thread1of1ForFork3_~cond~0 256) 0) (= thread4Thread1of1ForFork2_~cond~3 0)), Black: 129#(and (or (= ~n2~0 ~n1~0) (< 0 ~n1~0)) (<= ~n2~0 0) (<= (div thread1Thread1of1ForFork3_~cond~0 256) 0)), 155#true, Black: 127#(and (or (= ~n2~0 ~n1~0) (< 0 ~n1~0)) (or (< ~n2~0 1) (< 0 thread1Thread1of1ForFork3_~cond~0)) (<= (div thread1Thread1of1ForFork3_~cond~0 256) 0)), Black: 77#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork3_~cond~0 1)) (and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0))) (or (= ~n2~0 ~n1~0) (< 0 ~n2~0))), Black: 78#(< 0 ~n2~0), Black: 79#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)), Black: 145#(or (and (<= ~n1~0 0) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork1_~cond~1 1))), Black: 76#(or (= ~n2~0 ~n1~0) (< 0 ~n2~0)), 7#L72true, Black: 149#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork1_~cond~1 0)), Black: 151#(and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0) (= thread2Thread1of1ForFork1_~cond~1 0)), Black: 84#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork3_~cond~0 1)) (and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0))) (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)), Black: 82#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork3_~cond~0 1)) (and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0))) (<= 1 ~n2~0)), 92#true, 120#true, 80#(and (<= (div thread3Thread1of1ForFork0_~cond~2 256) 0) (<= 1 thread3Thread1of1ForFork0_~cond~2)), 3#L91true, 62#true, Black: 101#(and (= ~n2~0 ~n1~0) (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0)))), Black: 99#(and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0)), Black: 107#(and (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (<= ~n1~0 0)), 34#L104true, Black: 96#(and (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (or (< 0 ~n2~0) (< ~n1~0 1))), Black: 103#(and (= ~n2~0 ~n1~0) (<= ~n1~0 0) (= thread3Thread1of1ForFork0_~cond~2 0)), Black: 98#(<= ~n1~0 0), Black: 109#(and (= thread1Thread1of1ForFork3_~cond~0 0) (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (<= ~n1~0 0)), Black: 105#(and (= thread1Thread1of1ForFork3_~cond~0 0) (= ~n2~0 ~n1~0) (<= ~n1~0 0) (= thread3Thread1of1ForFork0_~cond~2 0)), 143#true, Black: 97#(or (< ~n1~0 1) (and (<= (div thread3Thread1of1ForFork0_~cond~2 256) 0) (<= 1 thread3Thread1of1ForFork0_~cond~2))), Black: 94#(= ~n2~0 ~n1~0), 13#L133true, Black: 60#(= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))]) [2025-02-06 13:13:42,538 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2025-02-06 13:13:42,538 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2025-02-06 13:13:42,538 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2025-02-06 13:13:42,538 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2025-02-06 13:13:42,567 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([321] L66-->L72: Formula: (or (and (<= v_~n1~0_97 1) (= v_~p1~0_76 v_~p1~0_75) (= v_~n1~0_97 v_~n1~0_96)) (and (< 1 v_~n1~0_97) (= (+ (* v_~m~0_53 2) v_~p1~0_76) v_~p1~0_75) (= (+ v_~n1~0_96 2) v_~n1~0_97))) InVars {~p1~0=v_~p1~0_76, ~n1~0=v_~n1~0_97, ~m~0=v_~m~0_53} OutVars{~p1~0=v_~p1~0_75, ~n1~0=v_~n1~0_96, ~m~0=v_~m~0_53} AuxVars[] AssignedVars[~p1~0, ~n1~0][82], [24#L47true, Black: 65#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork3_~cond~0 1)) (and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0))) (or (and (<= ~n1~0 0) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork1_~cond~1 1)))), Black: 64#(or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork3_~cond~0 1)) (and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0))), Black: 66#(and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0)), Black: 122#(or (= ~n2~0 ~n1~0) (< 0 ~n1~0)), Black: 123#(and (or (< ~n2~0 1) (< 0 thread1Thread1of1ForFork3_~cond~0)) (<= (div thread1Thread1of1ForFork3_~cond~0 256) 0)), Black: 68#(and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0) (= thread2Thread1of1ForFork1_~cond~1 0)), Black: 131#(and (<= ~n2~0 0) (<= (div thread1Thread1of1ForFork3_~cond~0 256) 0)), Black: 135#(and (<= ~n2~0 0) (<= (div thread1Thread1of1ForFork3_~cond~0 256) 0) (= thread4Thread1of1ForFork2_~cond~3 0)), Black: 133#(and (or (= ~n2~0 ~n1~0) (< 0 ~n1~0)) (<= ~n2~0 0) (<= (div thread1Thread1of1ForFork3_~cond~0 256) 0) (= thread4Thread1of1ForFork2_~cond~3 0)), Black: 129#(and (or (= ~n2~0 ~n1~0) (< 0 ~n1~0)) (<= ~n2~0 0) (<= (div thread1Thread1of1ForFork3_~cond~0 256) 0)), 155#true, Black: 127#(and (or (= ~n2~0 ~n1~0) (< 0 ~n1~0)) (or (< ~n2~0 1) (< 0 thread1Thread1of1ForFork3_~cond~0)) (<= (div thread1Thread1of1ForFork3_~cond~0 256) 0)), Black: 77#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork3_~cond~0 1)) (and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0))) (or (= ~n2~0 ~n1~0) (< 0 ~n2~0))), Black: 78#(< 0 ~n2~0), Black: 79#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)), Black: 80#(and (<= (div thread3Thread1of1ForFork0_~cond~2 256) 0) (<= 1 thread3Thread1of1ForFork0_~cond~2)), Black: 145#(or (and (<= ~n1~0 0) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork1_~cond~1 1))), Black: 149#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork1_~cond~1 0)), Black: 76#(or (= ~n2~0 ~n1~0) (< 0 ~n2~0)), 7#L72true, Black: 151#(and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0) (= thread2Thread1of1ForFork1_~cond~1 0)), Black: 84#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork3_~cond~0 1)) (and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0))) (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)), Black: 82#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork3_~cond~0 1)) (and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0))) (<= 1 ~n2~0)), 120#true, 3#L91true, 62#true, 97#(or (< ~n1~0 1) (and (<= (div thread3Thread1of1ForFork0_~cond~2 256) 0) (<= 1 thread3Thread1of1ForFork0_~cond~2))), Black: 101#(and (= ~n2~0 ~n1~0) (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0)))), Black: 99#(and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0)), Black: 107#(and (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (<= ~n1~0 0)), 34#L104true, Black: 96#(and (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (or (< 0 ~n2~0) (< ~n1~0 1))), Black: 103#(and (= ~n2~0 ~n1~0) (<= ~n1~0 0) (= thread3Thread1of1ForFork0_~cond~2 0)), Black: 98#(<= ~n1~0 0), Black: 109#(and (= thread1Thread1of1ForFork3_~cond~0 0) (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (<= ~n1~0 0)), 74#true, Black: 105#(and (= thread1Thread1of1ForFork3_~cond~0 0) (= ~n2~0 ~n1~0) (<= ~n1~0 0) (= thread3Thread1of1ForFork0_~cond~2 0)), 143#true, Black: 94#(= ~n2~0 ~n1~0), 13#L133true, Black: 60#(= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))]) [2025-02-06 13:13:42,567 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2025-02-06 13:13:42,567 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2025-02-06 13:13:42,567 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2025-02-06 13:13:42,567 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2025-02-06 13:13:42,585 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([321] L66-->L72: Formula: (or (and (<= v_~n1~0_97 1) (= v_~p1~0_76 v_~p1~0_75) (= v_~n1~0_97 v_~n1~0_96)) (and (< 1 v_~n1~0_97) (= (+ (* v_~m~0_53 2) v_~p1~0_76) v_~p1~0_75) (= (+ v_~n1~0_96 2) v_~n1~0_97))) InVars {~p1~0=v_~p1~0_76, ~n1~0=v_~n1~0_97, ~m~0=v_~m~0_53} OutVars{~p1~0=v_~p1~0_75, ~n1~0=v_~n1~0_96, ~m~0=v_~m~0_53} AuxVars[] AssignedVars[~p1~0, ~n1~0][82], [24#L47true, Black: 65#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork3_~cond~0 1)) (and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0))) (or (and (<= ~n1~0 0) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork1_~cond~1 1)))), Black: 64#(or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork3_~cond~0 1)) (and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0))), Black: 122#(or (= ~n2~0 ~n1~0) (< 0 ~n1~0)), Black: 66#(and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0)), Black: 68#(and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0) (= thread2Thread1of1ForFork1_~cond~1 0)), Black: 131#(and (<= ~n2~0 0) (<= (div thread1Thread1of1ForFork3_~cond~0 256) 0)), Black: 135#(and (<= ~n2~0 0) (<= (div thread1Thread1of1ForFork3_~cond~0 256) 0) (= thread4Thread1of1ForFork2_~cond~3 0)), Black: 133#(and (or (= ~n2~0 ~n1~0) (< 0 ~n1~0)) (<= ~n2~0 0) (<= (div thread1Thread1of1ForFork3_~cond~0 256) 0) (= thread4Thread1of1ForFork2_~cond~3 0)), Black: 129#(and (or (= ~n2~0 ~n1~0) (< 0 ~n1~0)) (<= ~n2~0 0) (<= (div thread1Thread1of1ForFork3_~cond~0 256) 0)), 155#true, Black: 127#(and (or (= ~n2~0 ~n1~0) (< 0 ~n1~0)) (or (< ~n2~0 1) (< 0 thread1Thread1of1ForFork3_~cond~0)) (<= (div thread1Thread1of1ForFork3_~cond~0 256) 0)), Black: 77#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork3_~cond~0 1)) (and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0))) (or (= ~n2~0 ~n1~0) (< 0 ~n2~0))), Black: 78#(< 0 ~n2~0), Black: 79#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)), Black: 80#(and (<= (div thread3Thread1of1ForFork0_~cond~2 256) 0) (<= 1 thread3Thread1of1ForFork0_~cond~2)), Black: 145#(or (and (<= ~n1~0 0) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork1_~cond~1 1))), Black: 76#(or (= ~n2~0 ~n1~0) (< 0 ~n2~0)), Black: 149#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork1_~cond~1 0)), 7#L72true, Black: 84#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork3_~cond~0 1)) (and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0))) (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)), Black: 151#(and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0) (= thread2Thread1of1ForFork1_~cond~1 0)), Black: 82#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork3_~cond~0 1)) (and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0))) (<= 1 ~n2~0)), 92#true, 3#L91true, 62#true, Black: 101#(and (= ~n2~0 ~n1~0) (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0)))), Black: 99#(and (= thread1Thread1of1ForFork3_~cond~0 0) (<= ~n1~0 0)), Black: 107#(and (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (<= ~n1~0 0)), Black: 96#(and (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (or (< 0 ~n2~0) (< ~n1~0 1))), 34#L104true, Black: 103#(and (= ~n2~0 ~n1~0) (<= ~n1~0 0) (= thread3Thread1of1ForFork0_~cond~2 0)), Black: 98#(<= ~n1~0 0), 74#true, Black: 109#(and (= thread1Thread1of1ForFork3_~cond~0 0) (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (<= ~n1~0 0)), 143#true, Black: 105#(and (= thread1Thread1of1ForFork3_~cond~0 0) (= ~n2~0 ~n1~0) (<= ~n1~0 0) (= thread3Thread1of1ForFork0_~cond~2 0)), Black: 97#(or (< ~n1~0 1) (and (<= (div thread3Thread1of1ForFork0_~cond~2 256) 0) (<= 1 thread3Thread1of1ForFork0_~cond~2))), Black: 94#(= ~n2~0 ~n1~0), 123#(and (or (< ~n2~0 1) (< 0 thread1Thread1of1ForFork3_~cond~0)) (<= (div thread1Thread1of1ForFork3_~cond~0 256) 0)), 13#L133true, Black: 60#(= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))]) [2025-02-06 13:13:42,585 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2025-02-06 13:13:42,585 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2025-02-06 13:13:42,585 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2025-02-06 13:13:42,585 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-02-06 13:13:42,766 INFO L124 PetriNetUnfolderBase]: 80158/112530 cut-off events. [2025-02-06 13:13:42,767 INFO L125 PetriNetUnfolderBase]: For 815193/815984 co-relation queries the response was YES. [2025-02-06 13:13:43,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 563348 conditions, 112530 events. 80158/112530 cut-off events. For 815193/815984 co-relation queries the response was YES. Maximal size of possible extension queue 5054. Compared 830325 event pairs, 20699 based on Foata normal form. 1407/112514 useless extension candidates. Maximal degree in co-relation 508795. Up to 46634 conditions per place. [2025-02-06 13:13:43,983 INFO L140 encePairwiseOnDemand]: 38/46 looper letters, 293 selfloop transitions, 146 changer transitions 0/448 dead transitions. [2025-02-06 13:13:43,983 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 448 transitions, 6075 flow [2025-02-06 13:13:43,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 13:13:43,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 13:13:43,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 163 transitions. [2025-02-06 13:13:43,985 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7086956521739131 [2025-02-06 13:13:43,985 INFO L175 Difference]: Start difference. First operand has 110 places, 270 transitions, 3761 flow. Second operand 5 states and 163 transitions. [2025-02-06 13:13:43,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 448 transitions, 6075 flow [2025-02-06 13:13:50,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 448 transitions, 6006 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 13:13:50,025 INFO L231 Difference]: Finished difference. Result has 116 places, 273 transitions, 4181 flow [2025-02-06 13:13:50,026 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=3694, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=143, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=4181, PETRI_PLACES=116, PETRI_TRANSITIONS=273} [2025-02-06 13:13:50,027 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 66 predicate places. [2025-02-06 13:13:50,029 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 273 transitions, 4181 flow [2025-02-06 13:13:50,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 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-02-06 13:13:50,029 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:13:50,029 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] [2025-02-06 13:13:50,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 13:13:50,029 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 13:13:50,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:13:50,030 INFO L85 PathProgramCache]: Analyzing trace with hash 321972576, now seen corresponding path program 2 times [2025-02-06 13:13:50,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:13:50,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663114762] [2025-02-06 13:13:50,030 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:13:50,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:13:50,037 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 1 equivalence classes. [2025-02-06 13:13:50,044 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 13:13:50,044 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 13:13:50,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:13:50,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:13:50,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:13:50,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663114762] [2025-02-06 13:13:50,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663114762] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:13:50,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:13:50,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 13:13:50,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763078270] [2025-02-06 13:13:50,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:13:50,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 13:13:50,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:13:50,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 13:13:50,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 13:13:50,186 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2025-02-06 13:13:50,187 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 273 transitions, 4181 flow. Second operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 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-02-06 13:13:50,187 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:13:50,187 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2025-02-06 13:13:50,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand