./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-threaded-sum-3.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-threaded-sum-3.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G 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 3ff96f1177b851e0082faef897c2fcf87c2462cab57ba2153c754c5e198aaf06 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 12:46:45,593 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 12:46:45,642 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-13 12:46:45,646 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 12:46:45,647 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 12:46:45,678 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 12:46:45,679 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 12:46:45,679 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 12:46:45,680 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 12:46:45,682 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 12:46:45,685 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 12:46:45,686 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 12:46:45,686 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 12:46:45,686 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 12:46:45,687 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 12:46:45,687 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 12:46:45,687 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 12:46:45,687 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 12:46:45,687 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 12:46:45,688 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 12:46:45,688 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 12:46:45,689 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 12:46:45,689 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-13 12:46:45,689 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 12:46:45,689 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 12:46:45,690 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 12:46:45,691 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 12:46:45,691 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 12:46:45,691 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 12:46:45,692 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 12:46:45,692 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 12:46:45,693 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 12:46:45,693 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 12:46:45,693 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 12:46:45,693 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 12:46:45,693 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 12:46:45,694 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 12:46:45,694 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 12:46:45,694 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 12:46:45,694 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 12:46:45,694 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 12:46:45,694 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 12:46:45,695 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G 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 -> 3ff96f1177b851e0082faef897c2fcf87c2462cab57ba2153c754c5e198aaf06 [2024-10-13 12:46:45,946 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 12:46:45,974 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 12:46:45,976 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 12:46:45,977 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 12:46:45,978 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 12:46:45,979 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-threaded-sum-3.wvr.c [2024-10-13 12:46:47,412 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 12:46:47,628 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 12:46:47,629 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-threaded-sum-3.wvr.c [2024-10-13 12:46:47,644 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44740c11c/e5a8f3b3f9844a048f28efc383aa1f3d/FLAGdeefe4a2f [2024-10-13 12:46:47,662 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44740c11c/e5a8f3b3f9844a048f28efc383aa1f3d [2024-10-13 12:46:47,664 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 12:46:47,665 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 12:46:47,666 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 12:46:47,666 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 12:46:47,671 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 12:46:47,672 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:46:47" (1/1) ... [2024-10-13 12:46:47,673 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1806fee9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:46:47, skipping insertion in model container [2024-10-13 12:46:47,673 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:46:47" (1/1) ... [2024-10-13 12:46:47,700 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 12:46:47,906 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 12:46:47,920 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 12:46:47,950 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 12:46:47,969 INFO L204 MainTranslator]: Completed translation [2024-10-13 12:46:47,969 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:46:47 WrapperNode [2024-10-13 12:46:47,970 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 12:46:47,971 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 12:46:47,971 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 12:46:47,971 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 12:46:47,978 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:46:47" (1/1) ... [2024-10-13 12:46:47,985 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:46:47" (1/1) ... [2024-10-13 12:46:48,004 INFO L138 Inliner]: procedures = 21, calls = 32, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 67 [2024-10-13 12:46:48,004 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 12:46:48,005 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 12:46:48,005 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 12:46:48,005 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 12:46:48,015 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:46:47" (1/1) ... [2024-10-13 12:46:48,015 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:46:47" (1/1) ... [2024-10-13 12:46:48,019 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:46:47" (1/1) ... [2024-10-13 12:46:48,032 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]. [2024-10-13 12:46:48,032 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:46:47" (1/1) ... [2024-10-13 12:46:48,032 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:46:47" (1/1) ... [2024-10-13 12:46:48,043 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:46:47" (1/1) ... [2024-10-13 12:46:48,046 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:46:47" (1/1) ... [2024-10-13 12:46:48,048 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:46:47" (1/1) ... [2024-10-13 12:46:48,048 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:46:47" (1/1) ... [2024-10-13 12:46:48,051 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 12:46:48,052 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 12:46:48,052 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 12:46:48,052 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 12:46:48,053 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:46:47" (1/1) ... [2024-10-13 12:46:48,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 12:46:48,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:46:48,095 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 12:46:48,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 12:46:48,149 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 12:46:48,149 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-13 12:46:48,149 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-13 12:46:48,150 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-13 12:46:48,150 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-13 12:46:48,150 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-10-13 12:46:48,150 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-10-13 12:46:48,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 12:46:48,150 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-13 12:46:48,151 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-13 12:46:48,151 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 12:46:48,151 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 12:46:48,152 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-13 12:46:48,234 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 12:46:48,236 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 12:46:48,416 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-13 12:46:48,416 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 12:46:48,565 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 12:46:48,565 INFO L314 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-13 12:46:48,565 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:46:48 BoogieIcfgContainer [2024-10-13 12:46:48,565 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 12:46:48,567 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 12:46:48,568 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 12:46:48,573 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 12:46:48,573 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 12:46:47" (1/3) ... [2024-10-13 12:46:48,574 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@159e4c1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:46:48, skipping insertion in model container [2024-10-13 12:46:48,574 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:46:47" (2/3) ... [2024-10-13 12:46:48,575 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@159e4c1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:46:48, skipping insertion in model container [2024-10-13 12:46:48,575 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:46:48" (3/3) ... [2024-10-13 12:46:48,576 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-threaded-sum-3.wvr.c [2024-10-13 12:46:48,594 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 12:46:48,595 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-13 12:46:48,595 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-13 12:46:48,647 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-10-13 12:46:48,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 37 transitions, 95 flow [2024-10-13 12:46:48,710 INFO L124 PetriNetUnfolderBase]: 3/34 cut-off events. [2024-10-13 12:46:48,711 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-13 12:46:48,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 34 events. 3/34 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 54 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 28. Up to 2 conditions per place. [2024-10-13 12:46:48,716 INFO L82 GeneralOperation]: Start removeDead. Operand has 44 places, 37 transitions, 95 flow [2024-10-13 12:46:48,719 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 33 transitions, 84 flow [2024-10-13 12:46:48,735 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 12:46:48,745 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;@77fbd717, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 12:46:48,745 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-10-13 12:46:48,769 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-13 12:46:48,769 INFO L124 PetriNetUnfolderBase]: 3/30 cut-off events. [2024-10-13 12:46:48,770 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-13 12:46:48,770 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:46:48,770 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:46:48,771 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-13 12:46:48,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:46:48,777 INFO L85 PathProgramCache]: Analyzing trace with hash -1376780756, now seen corresponding path program 1 times [2024-10-13 12:46:48,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:46:48,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220508439] [2024-10-13 12:46:48,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:46:48,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:46:49,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:46:49,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:46:49,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:46:49,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220508439] [2024-10-13 12:46:49,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220508439] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:46:49,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:46:49,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:46:49,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143369964] [2024-10-13 12:46:49,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:46:49,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:46:49,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:46:49,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:46:49,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:46:49,728 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 37 [2024-10-13 12:46:49,731 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 33 transitions, 84 flow. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:46:49,731 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:46:49,731 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 37 [2024-10-13 12:46:49,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:46:50,036 INFO L124 PetriNetUnfolderBase]: 367/655 cut-off events. [2024-10-13 12:46:50,036 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2024-10-13 12:46:50,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1264 conditions, 655 events. 367/655 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 3364 event pairs, 26 based on Foata normal form. 21/660 useless extension candidates. Maximal degree in co-relation 1074. Up to 445 conditions per place. [2024-10-13 12:46:50,049 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 33 selfloop transitions, 5 changer transitions 0/49 dead transitions. [2024-10-13 12:46:50,049 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 49 transitions, 204 flow [2024-10-13 12:46:50,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:46:50,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-13 12:46:50,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 100 transitions. [2024-10-13 12:46:50,062 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6756756756756757 [2024-10-13 12:46:50,063 INFO L175 Difference]: Start difference. First operand has 40 places, 33 transitions, 84 flow. Second operand 4 states and 100 transitions. [2024-10-13 12:46:50,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 49 transitions, 204 flow [2024-10-13 12:46:50,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 49 transitions, 184 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-10-13 12:46:50,071 INFO L231 Difference]: Finished difference. Result has 37 places, 35 transitions, 100 flow [2024-10-13 12:46:50,073 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=100, PETRI_PLACES=37, PETRI_TRANSITIONS=35} [2024-10-13 12:46:50,076 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, -3 predicate places. [2024-10-13 12:46:50,077 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 35 transitions, 100 flow [2024-10-13 12:46:50,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:46:50,077 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:46:50,077 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:46:50,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 12:46:50,078 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-13 12:46:50,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:46:50,078 INFO L85 PathProgramCache]: Analyzing trace with hash -73418991, now seen corresponding path program 1 times [2024-10-13 12:46:50,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:46:50,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41671890] [2024-10-13 12:46:50,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:46:50,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:46:50,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:46:50,456 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 12:46:50,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:46:50,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41671890] [2024-10-13 12:46:50,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41671890] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:46:50,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:46:50,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:46:50,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567521332] [2024-10-13 12:46:50,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:46:50,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:46:50,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:46:50,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:46:50,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:46:50,480 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 37 [2024-10-13 12:46:50,480 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 35 transitions, 100 flow. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:46:50,480 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:46:50,481 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 37 [2024-10-13 12:46:50,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:46:50,669 INFO L124 PetriNetUnfolderBase]: 498/815 cut-off events. [2024-10-13 12:46:50,669 INFO L125 PetriNetUnfolderBase]: For 258/314 co-relation queries the response was YES. [2024-10-13 12:46:50,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1869 conditions, 815 events. 498/815 cut-off events. For 258/314 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 3762 event pairs, 52 based on Foata normal form. 82/872 useless extension candidates. Maximal degree in co-relation 1568. Up to 589 conditions per place. [2024-10-13 12:46:50,679 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 44 selfloop transitions, 7 changer transitions 0/63 dead transitions. [2024-10-13 12:46:50,679 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 63 transitions, 292 flow [2024-10-13 12:46:50,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:46:50,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-13 12:46:50,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2024-10-13 12:46:50,682 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6959459459459459 [2024-10-13 12:46:50,682 INFO L175 Difference]: Start difference. First operand has 37 places, 35 transitions, 100 flow. Second operand 4 states and 103 transitions. [2024-10-13 12:46:50,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 63 transitions, 292 flow [2024-10-13 12:46:50,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 63 transitions, 292 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 12:46:50,685 INFO L231 Difference]: Finished difference. Result has 42 places, 41 transitions, 154 flow [2024-10-13 12:46:50,685 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=154, PETRI_PLACES=42, PETRI_TRANSITIONS=41} [2024-10-13 12:46:50,685 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 2 predicate places. [2024-10-13 12:46:50,686 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 41 transitions, 154 flow [2024-10-13 12:46:50,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:46:50,686 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:46:50,686 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:46:50,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 12:46:50,687 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-13 12:46:50,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:46:50,688 INFO L85 PathProgramCache]: Analyzing trace with hash 791968913, now seen corresponding path program 2 times [2024-10-13 12:46:50,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:46:50,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827678724] [2024-10-13 12:46:50,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:46:50,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:46:50,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:46:51,185 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:46:51,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:46:51,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827678724] [2024-10-13 12:46:51,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827678724] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 12:46:51,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1516068206] [2024-10-13 12:46:51,186 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 12:46:51,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 12:46:51,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:46:51,189 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 12:46:51,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 12:46:51,273 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 12:46:51,273 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 12:46:51,277 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-13 12:46:51,282 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:46:51,457 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:46:51,457 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 12:46:51,644 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:46:51,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1516068206] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 12:46:51,644 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 12:46:51,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4, 5] total 14 [2024-10-13 12:46:51,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060264863] [2024-10-13 12:46:51,645 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 12:46:51,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-13 12:46:51,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:46:51,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-13 12:46:51,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2024-10-13 12:46:51,694 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2024-10-13 12:46:51,694 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 41 transitions, 154 flow. Second operand has 14 states, 14 states have (on average 11.428571428571429) internal successors, (160), 14 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:46:51,694 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:46:51,694 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2024-10-13 12:46:51,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:46:53,280 INFO L124 PetriNetUnfolderBase]: 3863/5522 cut-off events. [2024-10-13 12:46:53,280 INFO L125 PetriNetUnfolderBase]: For 2691/2691 co-relation queries the response was YES. [2024-10-13 12:46:53,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14370 conditions, 5522 events. 3863/5522 cut-off events. For 2691/2691 co-relation queries the response was YES. Maximal size of possible extension queue 306. Compared 27456 event pairs, 96 based on Foata normal form. 146/5370 useless extension candidates. Maximal degree in co-relation 5782. Up to 1010 conditions per place. [2024-10-13 12:46:53,345 INFO L140 encePairwiseOnDemand]: 22/37 looper letters, 217 selfloop transitions, 128 changer transitions 0/349 dead transitions. [2024-10-13 12:46:53,345 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 349 transitions, 1818 flow [2024-10-13 12:46:53,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-10-13 12:46:53,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2024-10-13 12:46:53,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 578 transitions. [2024-10-13 12:46:53,350 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.48817567567567566 [2024-10-13 12:46:53,351 INFO L175 Difference]: Start difference. First operand has 42 places, 41 transitions, 154 flow. Second operand 32 states and 578 transitions. [2024-10-13 12:46:53,351 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 349 transitions, 1818 flow [2024-10-13 12:46:53,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 349 transitions, 1818 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 12:46:53,365 INFO L231 Difference]: Finished difference. Result has 92 places, 185 transitions, 1306 flow [2024-10-13 12:46:53,366 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=1306, PETRI_PLACES=92, PETRI_TRANSITIONS=185} [2024-10-13 12:46:53,366 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 52 predicate places. [2024-10-13 12:46:53,366 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 185 transitions, 1306 flow [2024-10-13 12:46:53,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 11.428571428571429) internal successors, (160), 14 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:46:53,367 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:46:53,367 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:46:53,386 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 12:46:53,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 12:46:53,568 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-13 12:46:53,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:46:53,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1873685957, now seen corresponding path program 3 times [2024-10-13 12:46:53,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:46:53,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764705569] [2024-10-13 12:46:53,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:46:53,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:46:53,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:46:53,812 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:46:53,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:46:53,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764705569] [2024-10-13 12:46:53,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764705569] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:46:53,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:46:53,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 12:46:53,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911428445] [2024-10-13 12:46:53,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:46:53,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 12:46:53,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:46:53,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 12:46:53,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 12:46:53,844 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 37 [2024-10-13 12:46:53,844 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 185 transitions, 1306 flow. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:46:53,845 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:46:53,845 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 37 [2024-10-13 12:46:53,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:46:54,349 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([315] L53-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res.base_1| 0) (= (mod v_thread1Thread1of1ForFork1_~cond~0_5 256) 0) (= |v_thread1Thread1of1ForFork1_#res.offset_1| 0)) InVars {thread1Thread1of1ForFork1_~cond~0=v_thread1Thread1of1ForFork1_~cond~0_5} OutVars{thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_1|, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_1|, thread1Thread1of1ForFork1_~cond~0=v_thread1Thread1of1ForFork1_~cond~0_5} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#res.offset][181], [278#true, 18#L64true, Black: 248#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (<= 1 (mod thread1Thread1of1ForFork1_~cond~0 256)) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 240#(and (or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)))), Black: 161#(< 0 (mod thread1Thread1of1ForFork1_~cond~0 256)), Black: 254#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))), 63#true, Black: 252#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (= thread2Thread1of1ForFork2_~cond~1 1)), 47#true, Black: 246#(and (or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))) (or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (= thread1Thread1of1ForFork1_~cond~0 1) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)))), Black: 219#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 65#(or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))), Black: 115#(= thread1Thread1of1ForFork1_~cond~0 1), Black: 236#(and (or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 199#(or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (= (mod thread2Thread1of1ForFork2_~cond~1 256) 0)), Black: 250#(and (or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))) (= thread1Thread1of1ForFork1_~cond~0 1) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)))), Black: 242#(and (or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))) (<= 1 (mod thread1Thread1of1ForFork1_~cond~0 256))), Black: 244#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (= thread1Thread1of1ForFork1_~cond~0 1) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 238#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 228#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread1Thread1of1ForFork1_~cond~0 1) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 232#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 258#(and (<= 1 (mod thread1Thread1of1ForFork1_~cond~0 256)) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))), 16#thread1EXITtrue, 5#L91true, Black: 49#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0)), Black: 52#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0) (= thread2Thread1of1ForFork2_~cond~1 1)), 35#L112-4true, Black: 57#(and (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), Black: 60#(and (= thread1Thread1of1ForFork1_~cond~0 1) (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), 55#true]) [2024-10-13 12:46:54,349 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is not cut-off event [2024-10-13 12:46:54,349 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2024-10-13 12:46:54,349 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2024-10-13 12:46:54,349 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2024-10-13 12:46:54,470 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([315] L53-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res.base_1| 0) (= (mod v_thread1Thread1of1ForFork1_~cond~0_5 256) 0) (= |v_thread1Thread1of1ForFork1_#res.offset_1| 0)) InVars {thread1Thread1of1ForFork1_~cond~0=v_thread1Thread1of1ForFork1_~cond~0_5} OutVars{thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_1|, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_1|, thread1Thread1of1ForFork1_~cond~0=v_thread1Thread1of1ForFork1_~cond~0_5} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#res.offset][181], [278#true, Black: 248#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (<= 1 (mod thread1Thread1of1ForFork1_~cond~0 256)) (= thread2Thread1of1ForFork2_~cond~1 1)), 18#L64true, Black: 240#(and (or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)))), Black: 161#(< 0 (mod thread1Thread1of1ForFork1_~cond~0 256)), Black: 254#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))), 63#true, Black: 252#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 246#(and (or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))) (or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (= thread1Thread1of1ForFork1_~cond~0 1) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)))), 47#true, Black: 219#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 65#(or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))), Black: 115#(= thread1Thread1of1ForFork1_~cond~0 1), Black: 236#(and (or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 199#(or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (= (mod thread2Thread1of1ForFork2_~cond~1 256) 0)), Black: 250#(and (or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))) (= thread1Thread1of1ForFork1_~cond~0 1) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)))), Black: 242#(and (or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))) (<= 1 (mod thread1Thread1of1ForFork1_~cond~0 256))), Black: 244#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (= thread1Thread1of1ForFork1_~cond~0 1) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 238#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 228#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread1Thread1of1ForFork1_~cond~0 1) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 232#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 258#(and (<= 1 (mod thread1Thread1of1ForFork1_~cond~0 256)) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))), 16#thread1EXITtrue, 5#L91true, Black: 49#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0)), Black: 52#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0) (= thread2Thread1of1ForFork2_~cond~1 1)), 12#L113true, Black: 57#(and (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), Black: 60#(and (= thread1Thread1of1ForFork1_~cond~0 1) (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), 55#true]) [2024-10-13 12:46:54,471 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is not cut-off event [2024-10-13 12:46:54,471 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2024-10-13 12:46:54,471 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2024-10-13 12:46:54,471 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2024-10-13 12:46:54,599 INFO L124 PetriNetUnfolderBase]: 3385/5241 cut-off events. [2024-10-13 12:46:54,601 INFO L125 PetriNetUnfolderBase]: For 22508/22812 co-relation queries the response was YES. [2024-10-13 12:46:54,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21568 conditions, 5241 events. 3385/5241 cut-off events. For 22508/22812 co-relation queries the response was YES. Maximal size of possible extension queue 367. Compared 31279 event pairs, 340 based on Foata normal form. 243/5180 useless extension candidates. Maximal degree in co-relation 17245. Up to 2076 conditions per place. [2024-10-13 12:46:54,661 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 231 selfloop transitions, 44 changer transitions 0/326 dead transitions. [2024-10-13 12:46:54,662 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 326 transitions, 2835 flow [2024-10-13 12:46:54,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 12:46:54,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-13 12:46:54,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 124 transitions. [2024-10-13 12:46:54,664 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6702702702702703 [2024-10-13 12:46:54,664 INFO L175 Difference]: Start difference. First operand has 92 places, 185 transitions, 1306 flow. Second operand 5 states and 124 transitions. [2024-10-13 12:46:54,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 326 transitions, 2835 flow [2024-10-13 12:46:54,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 326 transitions, 2631 flow, removed 92 selfloop flow, removed 2 redundant places. [2024-10-13 12:46:54,890 INFO L231 Difference]: Finished difference. Result has 97 places, 215 transitions, 1608 flow [2024-10-13 12:46:54,891 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1208, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1608, PETRI_PLACES=97, PETRI_TRANSITIONS=215} [2024-10-13 12:46:54,892 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 57 predicate places. [2024-10-13 12:46:54,893 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 215 transitions, 1608 flow [2024-10-13 12:46:54,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:46:54,893 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:46:54,893 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:46:54,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 12:46:54,894 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-13 12:46:54,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:46:54,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1819292320, now seen corresponding path program 1 times [2024-10-13 12:46:54,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:46:54,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360908042] [2024-10-13 12:46:54,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:46:54,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:46:54,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:46:55,187 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:46:55,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:46:55,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360908042] [2024-10-13 12:46:55,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360908042] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:46:55,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:46:55,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 12:46:55,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958708011] [2024-10-13 12:46:55,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:46:55,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 12:46:55,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:46:55,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 12:46:55,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 12:46:55,226 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 37 [2024-10-13 12:46:55,227 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 215 transitions, 1608 flow. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:46:55,227 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:46:55,227 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 37 [2024-10-13 12:46:55,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:46:56,001 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([315] L53-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res.base_1| 0) (= (mod v_thread1Thread1of1ForFork1_~cond~0_5 256) 0) (= |v_thread1Thread1of1ForFork1_#res.offset_1| 0)) InVars {thread1Thread1of1ForFork1_~cond~0=v_thread1Thread1of1ForFork1_~cond~0_5} OutVars{thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_1|, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_1|, thread1Thread1of1ForFork1_~cond~0=v_thread1Thread1of1ForFork1_~cond~0_5} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#res.offset][185], [278#true, 18#L64true, Black: 248#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (<= 1 (mod thread1Thread1of1ForFork1_~cond~0 256)) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 240#(and (or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)))), 288#true, Black: 161#(< 0 (mod thread1Thread1of1ForFork1_~cond~0 256)), Black: 254#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))), Black: 252#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (= thread2Thread1of1ForFork2_~cond~1 1)), 63#true, Black: 246#(and (or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))) (or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (= thread1Thread1of1ForFork1_~cond~0 1) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)))), 47#true, Black: 219#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 65#(or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))), Black: 115#(= thread1Thread1of1ForFork1_~cond~0 1), Black: 236#(and (or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 199#(or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (= (mod thread2Thread1of1ForFork2_~cond~1 256) 0)), Black: 250#(and (or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))) (= thread1Thread1of1ForFork1_~cond~0 1) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)))), Black: 242#(and (or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))) (<= 1 (mod thread1Thread1of1ForFork1_~cond~0 256))), Black: 244#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (= thread1Thread1of1ForFork1_~cond~0 1) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 238#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 228#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread1Thread1of1ForFork1_~cond~0 1) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 232#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 258#(and (<= 1 (mod thread1Thread1of1ForFork1_~cond~0 256)) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))), Black: 282#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 280#(and (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= (div ~u~0 4294967296) (div ~U~0 4294967296))), Black: 284#(and (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= (div ~u~0 4294967296) (div ~U~0 4294967296)) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 16#thread1EXITtrue, 14#thread3EXITtrue, Black: 52#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0) (= thread2Thread1of1ForFork2_~cond~1 1)), 35#L112-4true, Black: 57#(and (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), Black: 60#(and (= thread1Thread1of1ForFork1_~cond~0 1) (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), 55#true]) [2024-10-13 12:46:56,001 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2024-10-13 12:46:56,001 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-10-13 12:46:56,002 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-10-13 12:46:56,002 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-10-13 12:46:56,002 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([322] L64-->L69: Formula: (let ((.cse0 (mod v_~t~0_76 4294967296))) (or (and (= v_~t~0_76 v_~t~0_75) (= |v_thread2Thread1of1ForFork2_#t~post4_2| |v_thread2Thread1of1ForFork2_#t~post4_1|) (<= .cse0 0) (= |v_thread2Thread1of1ForFork2_#t~post3_2| |v_thread2Thread1of1ForFork2_#t~post3_1|) (= v_~s~0_77 v_~s~0_78)) (and (= v_~s~0_77 (+ v_~s~0_78 1)) (< 0 .cse0) (= v_~t~0_76 (+ v_~t~0_75 1))))) InVars {thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_1|, thread2Thread1of1ForFork2_#t~post4=|v_thread2Thread1of1ForFork2_#t~post4_1|, ~t~0=v_~t~0_76, ~s~0=v_~s~0_78} OutVars{thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_2|, thread2Thread1of1ForFork2_#t~post4=|v_thread2Thread1of1ForFork2_#t~post4_2|, ~t~0=v_~t~0_75, ~s~0=v_~s~0_77} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3, thread2Thread1of1ForFork2_#t~post4, ~t~0, ~s~0][215], [278#true, Black: 248#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (<= 1 (mod thread1Thread1of1ForFork1_~cond~0 256)) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 240#(and (or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)))), 161#(< 0 (mod thread1Thread1of1ForFork1_~cond~0 256)), 288#true, Black: 63#true, Black: 254#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))), Black: 252#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 246#(and (or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))) (or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (= thread1Thread1of1ForFork1_~cond~0 1) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)))), 47#true, Black: 219#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 65#(or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))), Black: 115#(= thread1Thread1of1ForFork1_~cond~0 1), Black: 236#(and (or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 199#(or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (= (mod thread2Thread1of1ForFork2_~cond~1 256) 0)), Black: 250#(and (or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))) (= thread1Thread1of1ForFork1_~cond~0 1) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)))), Black: 242#(and (or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))) (<= 1 (mod thread1Thread1of1ForFork1_~cond~0 256))), Black: 244#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (= thread1Thread1of1ForFork1_~cond~0 1) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 238#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 228#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread1Thread1of1ForFork1_~cond~0 1) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 232#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 258#(and (<= 1 (mod thread1Thread1of1ForFork1_~cond~0 256)) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))), 22#L69true, Black: 282#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 280#(and (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= (div ~u~0 4294967296) (div ~U~0 4294967296))), Black: 284#(and (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= (div ~u~0 4294967296) (div ~U~0 4294967296)) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 14#thread3EXITtrue, 6#L45true, Black: 52#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0) (= thread2Thread1of1ForFork2_~cond~1 1)), 35#L112-4true, Black: 57#(and (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), Black: 60#(and (= thread1Thread1of1ForFork1_~cond~0 1) (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), 55#true]) [2024-10-13 12:46:56,002 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2024-10-13 12:46:56,002 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-10-13 12:46:56,003 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-10-13 12:46:56,003 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-10-13 12:46:56,029 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([315] L53-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res.base_1| 0) (= (mod v_thread1Thread1of1ForFork1_~cond~0_5 256) 0) (= |v_thread1Thread1of1ForFork1_#res.offset_1| 0)) InVars {thread1Thread1of1ForFork1_~cond~0=v_thread1Thread1of1ForFork1_~cond~0_5} OutVars{thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_1|, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_1|, thread1Thread1of1ForFork1_~cond~0=v_thread1Thread1of1ForFork1_~cond~0_5} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#res.offset][185], [278#true, Black: 248#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (<= 1 (mod thread1Thread1of1ForFork1_~cond~0 256)) (= thread2Thread1of1ForFork2_~cond~1 1)), 18#L64true, Black: 240#(and (or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)))), 288#true, Black: 161#(< 0 (mod thread1Thread1of1ForFork1_~cond~0 256)), Black: 254#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))), 63#true, Black: 252#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 246#(and (or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))) (or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (= thread1Thread1of1ForFork1_~cond~0 1) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)))), 47#true, Black: 219#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 65#(or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))), Black: 115#(= thread1Thread1of1ForFork1_~cond~0 1), Black: 236#(and (or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 199#(or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (= (mod thread2Thread1of1ForFork2_~cond~1 256) 0)), Black: 250#(and (or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))) (= thread1Thread1of1ForFork1_~cond~0 1) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)))), Black: 242#(and (or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))) (<= 1 (mod thread1Thread1of1ForFork1_~cond~0 256))), Black: 244#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (= thread1Thread1of1ForFork1_~cond~0 1) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 238#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 228#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread1Thread1of1ForFork1_~cond~0 1) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 232#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 258#(and (<= 1 (mod thread1Thread1of1ForFork1_~cond~0 256)) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))), Black: 282#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 280#(and (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= (div ~u~0 4294967296) (div ~U~0 4294967296))), Black: 284#(and (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= (div ~u~0 4294967296) (div ~U~0 4294967296)) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 14#thread3EXITtrue, 16#thread1EXITtrue, Black: 52#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0) (= thread2Thread1of1ForFork2_~cond~1 1)), 12#L113true, Black: 57#(and (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), Black: 60#(and (= thread1Thread1of1ForFork1_~cond~0 1) (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), 55#true]) [2024-10-13 12:46:56,030 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2024-10-13 12:46:56,030 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-10-13 12:46:56,030 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-10-13 12:46:56,030 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-10-13 12:46:56,030 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([322] L64-->L69: Formula: (let ((.cse0 (mod v_~t~0_76 4294967296))) (or (and (= v_~t~0_76 v_~t~0_75) (= |v_thread2Thread1of1ForFork2_#t~post4_2| |v_thread2Thread1of1ForFork2_#t~post4_1|) (<= .cse0 0) (= |v_thread2Thread1of1ForFork2_#t~post3_2| |v_thread2Thread1of1ForFork2_#t~post3_1|) (= v_~s~0_77 v_~s~0_78)) (and (= v_~s~0_77 (+ v_~s~0_78 1)) (< 0 .cse0) (= v_~t~0_76 (+ v_~t~0_75 1))))) InVars {thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_1|, thread2Thread1of1ForFork2_#t~post4=|v_thread2Thread1of1ForFork2_#t~post4_1|, ~t~0=v_~t~0_76, ~s~0=v_~s~0_78} OutVars{thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_2|, thread2Thread1of1ForFork2_#t~post4=|v_thread2Thread1of1ForFork2_#t~post4_2|, ~t~0=v_~t~0_75, ~s~0=v_~s~0_77} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3, thread2Thread1of1ForFork2_#t~post4, ~t~0, ~s~0][215], [278#true, Black: 248#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (<= 1 (mod thread1Thread1of1ForFork1_~cond~0 256)) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 240#(and (or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)))), 161#(< 0 (mod thread1Thread1of1ForFork1_~cond~0 256)), 288#true, Black: 63#true, Black: 254#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))), Black: 252#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 246#(and (or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))) (or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (= thread1Thread1of1ForFork1_~cond~0 1) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)))), 47#true, Black: 219#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 65#(or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))), Black: 115#(= thread1Thread1of1ForFork1_~cond~0 1), Black: 236#(and (or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 199#(or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (= (mod thread2Thread1of1ForFork2_~cond~1 256) 0)), Black: 250#(and (or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))) (= thread1Thread1of1ForFork1_~cond~0 1) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)))), Black: 242#(and (or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))) (<= 1 (mod thread1Thread1of1ForFork1_~cond~0 256))), Black: 244#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (= thread1Thread1of1ForFork1_~cond~0 1) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 238#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 228#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread1Thread1of1ForFork1_~cond~0 1) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 232#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 258#(and (<= 1 (mod thread1Thread1of1ForFork1_~cond~0 256)) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))), 22#L69true, Black: 282#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 280#(and (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= (div ~u~0 4294967296) (div ~U~0 4294967296))), Black: 284#(and (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= (div ~u~0 4294967296) (div ~U~0 4294967296)) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 14#thread3EXITtrue, 6#L45true, Black: 52#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0) (= thread2Thread1of1ForFork2_~cond~1 1)), 12#L113true, Black: 57#(and (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), Black: 60#(and (= thread1Thread1of1ForFork1_~cond~0 1) (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), 55#true]) [2024-10-13 12:46:56,030 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2024-10-13 12:46:56,031 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-10-13 12:46:56,031 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-10-13 12:46:56,031 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-10-13 12:46:56,041 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([315] L53-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res.base_1| 0) (= (mod v_thread1Thread1of1ForFork1_~cond~0_5 256) 0) (= |v_thread1Thread1of1ForFork1_#res.offset_1| 0)) InVars {thread1Thread1of1ForFork1_~cond~0=v_thread1Thread1of1ForFork1_~cond~0_5} OutVars{thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_1|, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_1|, thread1Thread1of1ForFork1_~cond~0=v_thread1Thread1of1ForFork1_~cond~0_5} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#res.offset][185], [278#true, Black: 248#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (<= 1 (mod thread1Thread1of1ForFork1_~cond~0 256)) (= thread2Thread1of1ForFork2_~cond~1 1)), 18#L64true, Black: 240#(and (or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)))), 288#true, Black: 161#(< 0 (mod thread1Thread1of1ForFork1_~cond~0 256)), Black: 254#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))), Black: 252#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (= thread2Thread1of1ForFork2_~cond~1 1)), 63#true, 47#true, Black: 246#(and (or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))) (or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (= thread1Thread1of1ForFork1_~cond~0 1) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)))), Black: 219#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 65#(or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))), Black: 115#(= thread1Thread1of1ForFork1_~cond~0 1), Black: 236#(and (or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 199#(or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (= (mod thread2Thread1of1ForFork2_~cond~1 256) 0)), Black: 250#(and (or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))) (= thread1Thread1of1ForFork1_~cond~0 1) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)))), Black: 242#(and (or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))) (<= 1 (mod thread1Thread1of1ForFork1_~cond~0 256))), Black: 244#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (= thread1Thread1of1ForFork1_~cond~0 1) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 238#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 228#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread1Thread1of1ForFork1_~cond~0 1) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 232#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 258#(and (<= 1 (mod thread1Thread1of1ForFork1_~cond~0 256)) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))), Black: 282#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 280#(and (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= (div ~u~0 4294967296) (div ~U~0 4294967296))), Black: 284#(and (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= (div ~u~0 4294967296) (div ~U~0 4294967296)) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 16#thread1EXITtrue, 5#L91true, Black: 52#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0) (= thread2Thread1of1ForFork2_~cond~1 1)), 35#L112-4true, Black: 57#(and (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), Black: 60#(and (= thread1Thread1of1ForFork1_~cond~0 1) (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), 55#true]) [2024-10-13 12:46:56,041 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2024-10-13 12:46:56,041 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-10-13 12:46:56,041 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-10-13 12:46:56,042 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-10-13 12:46:56,042 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([315] L53-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res.base_1| 0) (= (mod v_thread1Thread1of1ForFork1_~cond~0_5 256) 0) (= |v_thread1Thread1of1ForFork1_#res.offset_1| 0)) InVars {thread1Thread1of1ForFork1_~cond~0=v_thread1Thread1of1ForFork1_~cond~0_5} OutVars{thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_1|, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_1|, thread1Thread1of1ForFork1_~cond~0=v_thread1Thread1of1ForFork1_~cond~0_5} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#res.offset][185], [278#true, Black: 248#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (<= 1 (mod thread1Thread1of1ForFork1_~cond~0 256)) (= thread2Thread1of1ForFork2_~cond~1 1)), 18#L64true, Black: 240#(and (or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)))), 288#true, Black: 161#(< 0 (mod thread1Thread1of1ForFork1_~cond~0 256)), Black: 254#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))), Black: 252#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (= thread2Thread1of1ForFork2_~cond~1 1)), 63#true, 47#true, Black: 246#(and (or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))) (or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (= thread1Thread1of1ForFork1_~cond~0 1) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)))), Black: 219#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 65#(or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))), Black: 115#(= thread1Thread1of1ForFork1_~cond~0 1), Black: 236#(and (or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 199#(or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (= (mod thread2Thread1of1ForFork2_~cond~1 256) 0)), Black: 250#(and (or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))) (= thread1Thread1of1ForFork1_~cond~0 1) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)))), Black: 242#(and (or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))) (<= 1 (mod thread1Thread1of1ForFork1_~cond~0 256))), Black: 244#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (= thread1Thread1of1ForFork1_~cond~0 1) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 238#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 228#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread1Thread1of1ForFork1_~cond~0 1) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 232#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 258#(and (<= 1 (mod thread1Thread1of1ForFork1_~cond~0 256)) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))), Black: 282#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 280#(and (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= (div ~u~0 4294967296) (div ~U~0 4294967296))), Black: 284#(and (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= (div ~u~0 4294967296) (div ~U~0 4294967296)) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 16#thread1EXITtrue, 14#thread3EXITtrue, Black: 52#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0) (= thread2Thread1of1ForFork2_~cond~1 1)), 35#L112-4true, Black: 57#(and (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), Black: 60#(and (= thread1Thread1of1ForFork1_~cond~0 1) (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), 55#true]) [2024-10-13 12:46:56,042 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2024-10-13 12:46:56,043 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-10-13 12:46:56,043 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-10-13 12:46:56,043 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-10-13 12:46:56,043 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-10-13 12:46:56,043 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([322] L64-->L69: Formula: (let ((.cse0 (mod v_~t~0_76 4294967296))) (or (and (= v_~t~0_76 v_~t~0_75) (= |v_thread2Thread1of1ForFork2_#t~post4_2| |v_thread2Thread1of1ForFork2_#t~post4_1|) (<= .cse0 0) (= |v_thread2Thread1of1ForFork2_#t~post3_2| |v_thread2Thread1of1ForFork2_#t~post3_1|) (= v_~s~0_77 v_~s~0_78)) (and (= v_~s~0_77 (+ v_~s~0_78 1)) (< 0 .cse0) (= v_~t~0_76 (+ v_~t~0_75 1))))) InVars {thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_1|, thread2Thread1of1ForFork2_#t~post4=|v_thread2Thread1of1ForFork2_#t~post4_1|, ~t~0=v_~t~0_76, ~s~0=v_~s~0_78} OutVars{thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_2|, thread2Thread1of1ForFork2_#t~post4=|v_thread2Thread1of1ForFork2_#t~post4_2|, ~t~0=v_~t~0_75, ~s~0=v_~s~0_77} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3, thread2Thread1of1ForFork2_#t~post4, ~t~0, ~s~0][196], [278#true, Black: 248#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (<= 1 (mod thread1Thread1of1ForFork1_~cond~0 256)) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 240#(and (or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)))), 288#true, Black: 161#(< 0 (mod thread1Thread1of1ForFork1_~cond~0 256)), Black: 254#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))), 63#true, Black: 252#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (= thread2Thread1of1ForFork2_~cond~1 1)), 47#true, Black: 246#(and (or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))) (or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (= thread1Thread1of1ForFork1_~cond~0 1) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)))), Black: 219#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 65#(or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))), Black: 115#(= thread1Thread1of1ForFork1_~cond~0 1), Black: 236#(and (or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 199#(or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (= (mod thread2Thread1of1ForFork2_~cond~1 256) 0)), Black: 250#(and (or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))) (= thread1Thread1of1ForFork1_~cond~0 1) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)))), Black: 242#(and (or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))) (<= 1 (mod thread1Thread1of1ForFork1_~cond~0 256))), Black: 244#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (= thread1Thread1of1ForFork1_~cond~0 1) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 238#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 228#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread1Thread1of1ForFork1_~cond~0 1) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 232#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 258#(and (<= 1 (mod thread1Thread1of1ForFork1_~cond~0 256)) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))), 22#L69true, Black: 282#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 280#(and (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= (div ~u~0 4294967296) (div ~U~0 4294967296))), Black: 284#(and (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= (div ~u~0 4294967296) (div ~U~0 4294967296)) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 14#thread3EXITtrue, 36#L53true, Black: 52#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0) (= thread2Thread1of1ForFork2_~cond~1 1)), 35#L112-4true, Black: 57#(and (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), Black: 60#(and (= thread1Thread1of1ForFork1_~cond~0 1) (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), 55#true]) [2024-10-13 12:46:56,043 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2024-10-13 12:46:56,044 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-10-13 12:46:56,044 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-10-13 12:46:56,044 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-10-13 12:46:56,059 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([315] L53-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res.base_1| 0) (= (mod v_thread1Thread1of1ForFork1_~cond~0_5 256) 0) (= |v_thread1Thread1of1ForFork1_#res.offset_1| 0)) InVars {thread1Thread1of1ForFork1_~cond~0=v_thread1Thread1of1ForFork1_~cond~0_5} OutVars{thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_1|, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_1|, thread1Thread1of1ForFork1_~cond~0=v_thread1Thread1of1ForFork1_~cond~0_5} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#res.offset][185], [278#true, Black: 248#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (<= 1 (mod thread1Thread1of1ForFork1_~cond~0 256)) (= thread2Thread1of1ForFork2_~cond~1 1)), 18#L64true, Black: 240#(and (or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)))), 288#true, Black: 161#(< 0 (mod thread1Thread1of1ForFork1_~cond~0 256)), Black: 254#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))), Black: 252#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (= thread2Thread1of1ForFork2_~cond~1 1)), 63#true, 47#true, Black: 246#(and (or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))) (or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (= thread1Thread1of1ForFork1_~cond~0 1) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)))), Black: 219#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 65#(or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))), Black: 115#(= thread1Thread1of1ForFork1_~cond~0 1), Black: 236#(and (or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 199#(or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (= (mod thread2Thread1of1ForFork2_~cond~1 256) 0)), Black: 250#(and (or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))) (= thread1Thread1of1ForFork1_~cond~0 1) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)))), Black: 242#(and (or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))) (<= 1 (mod thread1Thread1of1ForFork1_~cond~0 256))), Black: 244#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (= thread1Thread1of1ForFork1_~cond~0 1) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 238#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 228#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread1Thread1of1ForFork1_~cond~0 1) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 232#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 258#(and (<= 1 (mod thread1Thread1of1ForFork1_~cond~0 256)) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))), Black: 282#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 280#(and (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= (div ~u~0 4294967296) (div ~U~0 4294967296))), Black: 284#(and (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= (div ~u~0 4294967296) (div ~U~0 4294967296)) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 16#thread1EXITtrue, 5#L91true, Black: 52#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0) (= thread2Thread1of1ForFork2_~cond~1 1)), 12#L113true, Black: 57#(and (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), Black: 60#(and (= thread1Thread1of1ForFork1_~cond~0 1) (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), 55#true]) [2024-10-13 12:46:56,059 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2024-10-13 12:46:56,060 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-10-13 12:46:56,060 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-10-13 12:46:56,060 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-10-13 12:46:56,060 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([315] L53-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res.base_1| 0) (= (mod v_thread1Thread1of1ForFork1_~cond~0_5 256) 0) (= |v_thread1Thread1of1ForFork1_#res.offset_1| 0)) InVars {thread1Thread1of1ForFork1_~cond~0=v_thread1Thread1of1ForFork1_~cond~0_5} OutVars{thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_1|, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_1|, thread1Thread1of1ForFork1_~cond~0=v_thread1Thread1of1ForFork1_~cond~0_5} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#res.offset][185], [278#true, Black: 248#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (<= 1 (mod thread1Thread1of1ForFork1_~cond~0 256)) (= thread2Thread1of1ForFork2_~cond~1 1)), 18#L64true, Black: 240#(and (or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)))), 288#true, Black: 161#(< 0 (mod thread1Thread1of1ForFork1_~cond~0 256)), Black: 254#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))), Black: 252#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (= thread2Thread1of1ForFork2_~cond~1 1)), 63#true, 47#true, Black: 246#(and (or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))) (or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (= thread1Thread1of1ForFork1_~cond~0 1) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)))), Black: 219#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 65#(or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))), Black: 115#(= thread1Thread1of1ForFork1_~cond~0 1), Black: 236#(and (or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 199#(or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (= (mod thread2Thread1of1ForFork2_~cond~1 256) 0)), Black: 250#(and (or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))) (= thread1Thread1of1ForFork1_~cond~0 1) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)))), Black: 242#(and (or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))) (<= 1 (mod thread1Thread1of1ForFork1_~cond~0 256))), Black: 244#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (= thread1Thread1of1ForFork1_~cond~0 1) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 238#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 228#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread1Thread1of1ForFork1_~cond~0 1) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 232#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 258#(and (<= 1 (mod thread1Thread1of1ForFork1_~cond~0 256)) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))), Black: 282#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 280#(and (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= (div ~u~0 4294967296) (div ~U~0 4294967296))), Black: 284#(and (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= (div ~u~0 4294967296) (div ~U~0 4294967296)) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 14#thread3EXITtrue, 16#thread1EXITtrue, Black: 52#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0) (= thread2Thread1of1ForFork2_~cond~1 1)), 12#L113true, Black: 57#(and (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), Black: 60#(and (= thread1Thread1of1ForFork1_~cond~0 1) (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), 55#true]) [2024-10-13 12:46:56,061 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2024-10-13 12:46:56,061 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-10-13 12:46:56,061 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-10-13 12:46:56,061 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-10-13 12:46:56,061 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-10-13 12:46:56,061 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([322] L64-->L69: Formula: (let ((.cse0 (mod v_~t~0_76 4294967296))) (or (and (= v_~t~0_76 v_~t~0_75) (= |v_thread2Thread1of1ForFork2_#t~post4_2| |v_thread2Thread1of1ForFork2_#t~post4_1|) (<= .cse0 0) (= |v_thread2Thread1of1ForFork2_#t~post3_2| |v_thread2Thread1of1ForFork2_#t~post3_1|) (= v_~s~0_77 v_~s~0_78)) (and (= v_~s~0_77 (+ v_~s~0_78 1)) (< 0 .cse0) (= v_~t~0_76 (+ v_~t~0_75 1))))) InVars {thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_1|, thread2Thread1of1ForFork2_#t~post4=|v_thread2Thread1of1ForFork2_#t~post4_1|, ~t~0=v_~t~0_76, ~s~0=v_~s~0_78} OutVars{thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_2|, thread2Thread1of1ForFork2_#t~post4=|v_thread2Thread1of1ForFork2_#t~post4_2|, ~t~0=v_~t~0_75, ~s~0=v_~s~0_77} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3, thread2Thread1of1ForFork2_#t~post4, ~t~0, ~s~0][196], [278#true, Black: 248#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (<= 1 (mod thread1Thread1of1ForFork1_~cond~0 256)) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 240#(and (or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)))), 288#true, Black: 161#(< 0 (mod thread1Thread1of1ForFork1_~cond~0 256)), Black: 254#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))), Black: 252#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (= thread2Thread1of1ForFork2_~cond~1 1)), 63#true, 47#true, Black: 246#(and (or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))) (or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (= thread1Thread1of1ForFork1_~cond~0 1) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)))), Black: 219#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 65#(or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))), Black: 115#(= thread1Thread1of1ForFork1_~cond~0 1), Black: 236#(and (or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 199#(or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (= (mod thread2Thread1of1ForFork2_~cond~1 256) 0)), Black: 250#(and (or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))) (= thread1Thread1of1ForFork1_~cond~0 1) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)))), Black: 242#(and (or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))) (<= 1 (mod thread1Thread1of1ForFork1_~cond~0 256))), Black: 244#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (= thread1Thread1of1ForFork1_~cond~0 1) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 238#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 228#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread1Thread1of1ForFork1_~cond~0 1) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 232#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 258#(and (<= 1 (mod thread1Thread1of1ForFork1_~cond~0 256)) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))), 22#L69true, Black: 282#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 280#(and (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= (div ~u~0 4294967296) (div ~U~0 4294967296))), Black: 284#(and (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= (div ~u~0 4294967296) (div ~U~0 4294967296)) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 14#thread3EXITtrue, 36#L53true, Black: 52#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0) (= thread2Thread1of1ForFork2_~cond~1 1)), 12#L113true, Black: 57#(and (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), Black: 60#(and (= thread1Thread1of1ForFork1_~cond~0 1) (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), 55#true]) [2024-10-13 12:46:56,061 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2024-10-13 12:46:56,062 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-10-13 12:46:56,062 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-10-13 12:46:56,062 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-10-13 12:46:56,063 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([322] L64-->L69: Formula: (let ((.cse0 (mod v_~t~0_76 4294967296))) (or (and (= v_~t~0_76 v_~t~0_75) (= |v_thread2Thread1of1ForFork2_#t~post4_2| |v_thread2Thread1of1ForFork2_#t~post4_1|) (<= .cse0 0) (= |v_thread2Thread1of1ForFork2_#t~post3_2| |v_thread2Thread1of1ForFork2_#t~post3_1|) (= v_~s~0_77 v_~s~0_78)) (and (= v_~s~0_77 (+ v_~s~0_78 1)) (< 0 .cse0) (= v_~t~0_76 (+ v_~t~0_75 1))))) InVars {thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_1|, thread2Thread1of1ForFork2_#t~post4=|v_thread2Thread1of1ForFork2_#t~post4_1|, ~t~0=v_~t~0_76, ~s~0=v_~s~0_78} OutVars{thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_2|, thread2Thread1of1ForFork2_#t~post4=|v_thread2Thread1of1ForFork2_#t~post4_2|, ~t~0=v_~t~0_75, ~s~0=v_~s~0_77} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3, thread2Thread1of1ForFork2_#t~post4, ~t~0, ~s~0][215], [278#true, Black: 248#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (<= 1 (mod thread1Thread1of1ForFork1_~cond~0 256)) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 240#(and (or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)))), 161#(< 0 (mod thread1Thread1of1ForFork1_~cond~0 256)), 288#true, Black: 63#true, Black: 254#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))), Black: 252#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (= thread2Thread1of1ForFork2_~cond~1 1)), 47#true, Black: 246#(and (or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))) (or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (= thread1Thread1of1ForFork1_~cond~0 1) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)))), Black: 219#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 65#(or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))), Black: 115#(= thread1Thread1of1ForFork1_~cond~0 1), Black: 236#(and (or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 199#(or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (= (mod thread2Thread1of1ForFork2_~cond~1 256) 0)), Black: 250#(and (or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))) (= thread1Thread1of1ForFork1_~cond~0 1) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)))), Black: 242#(and (or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))) (<= 1 (mod thread1Thread1of1ForFork1_~cond~0 256))), Black: 244#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (= thread1Thread1of1ForFork1_~cond~0 1) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 238#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 228#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread1Thread1of1ForFork1_~cond~0 1) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 232#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 258#(and (<= 1 (mod thread1Thread1of1ForFork1_~cond~0 256)) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))), 22#L69true, Black: 282#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 280#(and (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= (div ~u~0 4294967296) (div ~U~0 4294967296))), Black: 284#(and (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= (div ~u~0 4294967296) (div ~U~0 4294967296)) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 14#thread3EXITtrue, 6#L45true, Black: 52#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0) (= thread2Thread1of1ForFork2_~cond~1 1)), 35#L112-4true, Black: 57#(and (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), Black: 60#(and (= thread1Thread1of1ForFork1_~cond~0 1) (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), 55#true]) [2024-10-13 12:46:56,064 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2024-10-13 12:46:56,064 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-10-13 12:46:56,064 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-10-13 12:46:56,064 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-10-13 12:46:56,064 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-10-13 12:46:56,075 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([322] L64-->L69: Formula: (let ((.cse0 (mod v_~t~0_76 4294967296))) (or (and (= v_~t~0_76 v_~t~0_75) (= |v_thread2Thread1of1ForFork2_#t~post4_2| |v_thread2Thread1of1ForFork2_#t~post4_1|) (<= .cse0 0) (= |v_thread2Thread1of1ForFork2_#t~post3_2| |v_thread2Thread1of1ForFork2_#t~post3_1|) (= v_~s~0_77 v_~s~0_78)) (and (= v_~s~0_77 (+ v_~s~0_78 1)) (< 0 .cse0) (= v_~t~0_76 (+ v_~t~0_75 1))))) InVars {thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_1|, thread2Thread1of1ForFork2_#t~post4=|v_thread2Thread1of1ForFork2_#t~post4_1|, ~t~0=v_~t~0_76, ~s~0=v_~s~0_78} OutVars{thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_2|, thread2Thread1of1ForFork2_#t~post4=|v_thread2Thread1of1ForFork2_#t~post4_2|, ~t~0=v_~t~0_75, ~s~0=v_~s~0_77} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3, thread2Thread1of1ForFork2_#t~post4, ~t~0, ~s~0][215], [278#true, Black: 248#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (<= 1 (mod thread1Thread1of1ForFork1_~cond~0 256)) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 240#(and (or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)))), 161#(< 0 (mod thread1Thread1of1ForFork1_~cond~0 256)), 288#true, Black: 63#true, Black: 254#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))), Black: 252#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (= thread2Thread1of1ForFork2_~cond~1 1)), 47#true, Black: 246#(and (or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))) (or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (= thread1Thread1of1ForFork1_~cond~0 1) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)))), Black: 219#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 65#(or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))), Black: 115#(= thread1Thread1of1ForFork1_~cond~0 1), Black: 236#(and (or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 199#(or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (= (mod thread2Thread1of1ForFork2_~cond~1 256) 0)), Black: 250#(and (or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))) (= thread1Thread1of1ForFork1_~cond~0 1) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)))), Black: 242#(and (or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))) (<= 1 (mod thread1Thread1of1ForFork1_~cond~0 256))), Black: 244#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (= thread1Thread1of1ForFork1_~cond~0 1) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 238#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 228#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread1Thread1of1ForFork1_~cond~0 1) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 232#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 258#(and (<= 1 (mod thread1Thread1of1ForFork1_~cond~0 256)) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))), 22#L69true, Black: 282#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 280#(and (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= (div ~u~0 4294967296) (div ~U~0 4294967296))), Black: 284#(and (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= (div ~u~0 4294967296) (div ~U~0 4294967296)) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 14#thread3EXITtrue, 6#L45true, Black: 52#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0) (= thread2Thread1of1ForFork2_~cond~1 1)), 12#L113true, Black: 57#(and (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), Black: 60#(and (= thread1Thread1of1ForFork1_~cond~0 1) (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), 55#true]) [2024-10-13 12:46:56,075 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2024-10-13 12:46:56,075 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-10-13 12:46:56,075 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-10-13 12:46:56,075 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-10-13 12:46:56,075 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-10-13 12:46:56,083 INFO L124 PetriNetUnfolderBase]: 3974/6160 cut-off events. [2024-10-13 12:46:56,084 INFO L125 PetriNetUnfolderBase]: For 24249/24588 co-relation queries the response was YES. [2024-10-13 12:46:56,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25506 conditions, 6160 events. 3974/6160 cut-off events. For 24249/24588 co-relation queries the response was YES. Maximal size of possible extension queue 458. Compared 38269 event pairs, 474 based on Foata normal form. 202/6010 useless extension candidates. Maximal degree in co-relation 19948. Up to 3757 conditions per place. [2024-10-13 12:46:56,139 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 161 selfloop transitions, 22 changer transitions 0/259 dead transitions. [2024-10-13 12:46:56,140 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 259 transitions, 2233 flow [2024-10-13 12:46:56,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 12:46:56,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-13 12:46:56,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 121 transitions. [2024-10-13 12:46:56,141 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.654054054054054 [2024-10-13 12:46:56,141 INFO L175 Difference]: Start difference. First operand has 97 places, 215 transitions, 1608 flow. Second operand 5 states and 121 transitions. [2024-10-13 12:46:56,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 259 transitions, 2233 flow [2024-10-13 12:46:56,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 259 transitions, 2193 flow, removed 7 selfloop flow, removed 3 redundant places. [2024-10-13 12:46:56,223 INFO L231 Difference]: Finished difference. Result has 99 places, 218 transitions, 1662 flow [2024-10-13 12:46:56,223 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1574, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1662, PETRI_PLACES=99, PETRI_TRANSITIONS=218} [2024-10-13 12:46:56,224 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 59 predicate places. [2024-10-13 12:46:56,224 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 218 transitions, 1662 flow [2024-10-13 12:46:56,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:46:56,224 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:46:56,224 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:46:56,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 12:46:56,225 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-13 12:46:56,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:46:56,225 INFO L85 PathProgramCache]: Analyzing trace with hash -252051740, now seen corresponding path program 2 times [2024-10-13 12:46:56,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:46:56,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854588948] [2024-10-13 12:46:56,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:46:56,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:46:56,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:46:58,826 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:46:58,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:46:58,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854588948] [2024-10-13 12:46:58,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854588948] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 12:46:58,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [406718304] [2024-10-13 12:46:58,827 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 12:46:58,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 12:46:58,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:46:58,829 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 12:46:58,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-13 12:46:58,945 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 12:46:58,946 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 12:46:58,952 INFO L255 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-13 12:46:58,955 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:47:00,277 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:47:00,278 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 12:47:03,002 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:47:03,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [406718304] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 12:47:03,002 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 12:47:03,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 27 [2024-10-13 12:47:03,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072393997] [2024-10-13 12:47:03,003 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 12:47:03,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-10-13 12:47:03,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:47:03,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-10-13 12:47:03,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=613, Unknown=0, NotChecked=0, Total=756 [2024-10-13 12:47:03,707 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-10-13 12:47:03,708 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 218 transitions, 1662 flow. Second operand has 28 states, 28 states have (on average 13.107142857142858) internal successors, (367), 28 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:47:03,708 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:47:03,708 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-10-13 12:47:03,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:47:41,544 INFO L124 PetriNetUnfolderBase]: 34158/51711 cut-off events. [2024-10-13 12:47:41,545 INFO L125 PetriNetUnfolderBase]: For 200709/202082 co-relation queries the response was YES. [2024-10-13 12:47:41,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 220538 conditions, 51711 events. 34158/51711 cut-off events. For 200709/202082 co-relation queries the response was YES. Maximal size of possible extension queue 2876. Compared 396498 event pairs, 1298 based on Foata normal form. 450/51313 useless extension candidates. Maximal degree in co-relation 143294. Up to 6828 conditions per place. [2024-10-13 12:47:41,994 INFO L140 encePairwiseOnDemand]: 23/37 looper letters, 1042 selfloop transitions, 1689 changer transitions 335/3089 dead transitions. [2024-10-13 12:47:41,995 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 3089 transitions, 28607 flow [2024-10-13 12:47:41,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2024-10-13 12:47:41,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2024-10-13 12:47:42,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 2650 transitions. [2024-10-13 12:47:42,006 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5467299360429131 [2024-10-13 12:47:42,006 INFO L175 Difference]: Start difference. First operand has 99 places, 218 transitions, 1662 flow. Second operand 131 states and 2650 transitions. [2024-10-13 12:47:42,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 3089 transitions, 28607 flow [2024-10-13 12:47:43,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 3089 transitions, 28409 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-13 12:47:43,846 INFO L231 Difference]: Finished difference. Result has 309 places, 2064 transitions, 22821 flow [2024-10-13 12:47:43,847 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1630, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=146, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=131, PETRI_FLOW=22821, PETRI_PLACES=309, PETRI_TRANSITIONS=2064} [2024-10-13 12:47:43,847 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 269 predicate places. [2024-10-13 12:47:43,848 INFO L471 AbstractCegarLoop]: Abstraction has has 309 places, 2064 transitions, 22821 flow [2024-10-13 12:47:43,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 13.107142857142858) internal successors, (367), 28 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:47:43,848 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:47:43,848 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:47:43,861 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-13 12:47:44,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-13 12:47:44,051 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-13 12:47:44,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:47:44,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1691221464, now seen corresponding path program 3 times [2024-10-13 12:47:44,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:47:44,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272836582] [2024-10-13 12:47:44,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:47:44,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:47:44,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:47:45,295 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:47:45,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:47:45,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272836582] [2024-10-13 12:47:45,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272836582] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 12:47:45,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [44078038] [2024-10-13 12:47:45,296 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-13 12:47:45,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 12:47:45,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:47:45,298 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 12:47:45,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-13 12:47:45,384 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-10-13 12:47:45,385 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 12:47:45,385 INFO L255 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-13 12:47:45,387 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:47:45,970 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:47:45,970 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 12:47:59,485 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:47:59,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [44078038] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 12:47:59,485 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 12:47:59,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 23 [2024-10-13 12:47:59,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903274924] [2024-10-13 12:47:59,486 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 12:47:59,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-13 12:47:59,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:47:59,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-13 12:47:59,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=429, Unknown=2, NotChecked=0, Total=552 [2024-10-13 12:48:03,555 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 12:48:07,609 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 12:48:11,669 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers []