./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 61a67961 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-wip.fs.cvc5-61a6796-m [2024-10-14 19:58:47,749 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 19:58:47,806 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-14 19:58:47,813 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 19:58:47,814 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 19:58:47,838 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 19:58:47,838 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 19:58:47,839 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 19:58:47,839 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 19:58:47,840 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 19:58:47,840 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 19:58:47,840 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 19:58:47,841 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 19:58:47,841 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 19:58:47,842 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 19:58:47,842 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 19:58:47,842 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 19:58:47,846 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 19:58:47,847 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 19:58:47,847 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 19:58:47,847 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-14 19:58:47,848 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-14 19:58:47,848 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-14 19:58:47,848 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 19:58:47,848 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 19:58:47,849 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 19:58:47,849 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 19:58:47,849 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 19:58:47,849 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 19:58:47,850 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 19:58:47,850 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 19:58:47,850 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 19:58:47,850 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 19:58:47,850 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 19:58:47,851 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 19:58:47,851 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 19:58:47,852 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 19:58:47,852 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 19:58:47,852 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 19:58:47,852 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 19:58:47,853 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 19:58:47,854 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 19:58:47,855 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-14 19:58:48,079 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 19:58:48,104 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 19:58:48,107 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 19:58:48,108 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 19:58:48,109 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 19:58:48,110 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-14 19:58:49,500 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 19:58:49,688 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 19:58:49,689 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-threaded-sum-3.wvr.c [2024-10-14 19:58:49,696 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10e0ca1f3/0b84969c46e6449eab6c2559aac60357/FLAG12f1aa5aa [2024-10-14 19:58:49,707 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10e0ca1f3/0b84969c46e6449eab6c2559aac60357 [2024-10-14 19:58:49,711 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 19:58:49,712 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 19:58:49,714 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 19:58:49,715 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 19:58:49,721 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 19:58:49,722 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:58:49" (1/1) ... [2024-10-14 19:58:49,723 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41920ab2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:58:49, skipping insertion in model container [2024-10-14 19:58:49,723 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:58:49" (1/1) ... [2024-10-14 19:58:49,745 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 19:58:49,994 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 19:58:50,006 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 19:58:50,043 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 19:58:50,069 INFO L204 MainTranslator]: Completed translation [2024-10-14 19:58:50,069 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:58:50 WrapperNode [2024-10-14 19:58:50,069 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 19:58:50,070 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 19:58:50,071 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 19:58:50,071 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 19:58:50,078 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:58:50" (1/1) ... [2024-10-14 19:58:50,087 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:58:50" (1/1) ... [2024-10-14 19:58:50,113 INFO L138 Inliner]: procedures = 21, calls = 32, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 67 [2024-10-14 19:58:50,113 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 19:58:50,115 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 19:58:50,115 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 19:58:50,115 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 19:58:50,125 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:58:50" (1/1) ... [2024-10-14 19:58:50,125 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:58:50" (1/1) ... [2024-10-14 19:58:50,128 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:58:50" (1/1) ... [2024-10-14 19:58:50,157 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-14 19:58:50,157 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:58:50" (1/1) ... [2024-10-14 19:58:50,157 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:58:50" (1/1) ... [2024-10-14 19:58:50,163 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:58:50" (1/1) ... [2024-10-14 19:58:50,170 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:58:50" (1/1) ... [2024-10-14 19:58:50,175 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:58:50" (1/1) ... [2024-10-14 19:58:50,176 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:58:50" (1/1) ... [2024-10-14 19:58:50,178 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 19:58:50,182 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 19:58:50,183 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 19:58:50,183 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 19:58:50,184 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:58:50" (1/1) ... [2024-10-14 19:58:50,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 19:58:50,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 19:58:50,212 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-14 19:58:50,214 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-14 19:58:50,252 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 19:58:50,252 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-14 19:58:50,252 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-14 19:58:50,252 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-14 19:58:50,252 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-14 19:58:50,252 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-10-14 19:58:50,252 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-10-14 19:58:50,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 19:58:50,252 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-14 19:58:50,253 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-14 19:58:50,253 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 19:58:50,253 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 19:58:50,254 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-14 19:58:50,343 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 19:58:50,345 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 19:58:50,571 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-14 19:58:50,571 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 19:58:50,723 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 19:58:50,724 INFO L314 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-14 19:58:50,724 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:58:50 BoogieIcfgContainer [2024-10-14 19:58:50,724 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 19:58:50,726 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 19:58:50,726 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 19:58:50,730 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 19:58:50,730 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 07:58:49" (1/3) ... [2024-10-14 19:58:50,731 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50742d4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:58:50, skipping insertion in model container [2024-10-14 19:58:50,731 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:58:50" (2/3) ... [2024-10-14 19:58:50,732 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50742d4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:58:50, skipping insertion in model container [2024-10-14 19:58:50,732 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:58:50" (3/3) ... [2024-10-14 19:58:50,733 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-threaded-sum-3.wvr.c [2024-10-14 19:58:50,747 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 19:58:50,747 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-14 19:58:50,747 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-14 19:58:50,807 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-10-14 19:58:50,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 37 transitions, 95 flow [2024-10-14 19:58:50,882 INFO L124 PetriNetUnfolderBase]: 3/34 cut-off events. [2024-10-14 19:58:50,882 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-14 19:58:50,885 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-14 19:58:50,885 INFO L82 GeneralOperation]: Start removeDead. Operand has 44 places, 37 transitions, 95 flow [2024-10-14 19:58:50,892 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 33 transitions, 84 flow [2024-10-14 19:58:50,900 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 19:58:50,905 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;@2f2cbf64, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 19:58:50,906 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-10-14 19:58:50,918 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-14 19:58:50,918 INFO L124 PetriNetUnfolderBase]: 3/30 cut-off events. [2024-10-14 19:58:50,918 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-14 19:58:50,918 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:58:50,919 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-14 19:58:50,919 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-14 19:58:50,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:58:50,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1376780756, now seen corresponding path program 1 times [2024-10-14 19:58:50,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:58:50,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370520144] [2024-10-14 19:58:50,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:58:50,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:58:51,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:58:51,845 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-14 19:58:51,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:58:51,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370520144] [2024-10-14 19:58:51,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370520144] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:58:51,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:58:51,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 19:58:51,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073410242] [2024-10-14 19:58:51,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:58:51,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:58:51,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:58:51,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:58:51,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:58:51,916 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 37 [2024-10-14 19:58:51,919 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-14 19:58:51,919 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:58:51,919 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 37 [2024-10-14 19:58:51,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:58:52,150 INFO L124 PetriNetUnfolderBase]: 367/655 cut-off events. [2024-10-14 19:58:52,150 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2024-10-14 19:58:52,155 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-14 19:58:52,160 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 33 selfloop transitions, 5 changer transitions 0/49 dead transitions. [2024-10-14 19:58:52,160 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 49 transitions, 204 flow [2024-10-14 19:58:52,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 19:58:52,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-14 19:58:52,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 100 transitions. [2024-10-14 19:58:52,172 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6756756756756757 [2024-10-14 19:58:52,174 INFO L175 Difference]: Start difference. First operand has 40 places, 33 transitions, 84 flow. Second operand 4 states and 100 transitions. [2024-10-14 19:58:52,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 49 transitions, 204 flow [2024-10-14 19:58:52,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 49 transitions, 184 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-10-14 19:58:52,180 INFO L231 Difference]: Finished difference. Result has 37 places, 35 transitions, 100 flow [2024-10-14 19:58:52,182 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-14 19:58:52,185 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, -3 predicate places. [2024-10-14 19:58:52,185 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 35 transitions, 100 flow [2024-10-14 19:58:52,185 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-14 19:58:52,185 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:58:52,186 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-14 19:58:52,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 19:58:52,186 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-14 19:58:52,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:58:52,187 INFO L85 PathProgramCache]: Analyzing trace with hash -73418991, now seen corresponding path program 1 times [2024-10-14 19:58:52,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:58:52,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284874846] [2024-10-14 19:58:52,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:58:52,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:58:52,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:58:52,647 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-14 19:58:52,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:58:52,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284874846] [2024-10-14 19:58:52,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284874846] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:58:52,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:58:52,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 19:58:52,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877679717] [2024-10-14 19:58:52,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:58:52,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:58:52,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:58:52,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:58:52,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:58:52,675 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 37 [2024-10-14 19:58:52,676 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-14 19:58:52,676 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:58:52,676 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 37 [2024-10-14 19:58:52,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:58:52,895 INFO L124 PetriNetUnfolderBase]: 498/815 cut-off events. [2024-10-14 19:58:52,896 INFO L125 PetriNetUnfolderBase]: For 258/314 co-relation queries the response was YES. [2024-10-14 19:58:52,899 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-14 19:58:52,904 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 44 selfloop transitions, 7 changer transitions 0/63 dead transitions. [2024-10-14 19:58:52,904 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 63 transitions, 292 flow [2024-10-14 19:58:52,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 19:58:52,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-14 19:58:52,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2024-10-14 19:58:52,906 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6959459459459459 [2024-10-14 19:58:52,907 INFO L175 Difference]: Start difference. First operand has 37 places, 35 transitions, 100 flow. Second operand 4 states and 103 transitions. [2024-10-14 19:58:52,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 63 transitions, 292 flow [2024-10-14 19:58:52,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 63 transitions, 292 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-14 19:58:52,909 INFO L231 Difference]: Finished difference. Result has 42 places, 41 transitions, 154 flow [2024-10-14 19:58:52,910 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-14 19:58:52,910 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 2 predicate places. [2024-10-14 19:58:52,911 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 41 transitions, 154 flow [2024-10-14 19:58:52,911 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-14 19:58:52,911 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:58:52,911 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-14 19:58:52,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 19:58:52,912 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-14 19:58:52,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:58:52,913 INFO L85 PathProgramCache]: Analyzing trace with hash 791968913, now seen corresponding path program 2 times [2024-10-14 19:58:52,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:58:52,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429859653] [2024-10-14 19:58:52,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:58:52,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:58:52,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:58:53,429 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-14 19:58:53,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:58:53,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429859653] [2024-10-14 19:58:53,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429859653] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 19:58:53,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1220946343] [2024-10-14 19:58:53,430 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 19:58:53,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 19:58:53,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 19:58:53,432 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-14 19:58:53,434 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-14 19:58:53,520 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 19:58:53,521 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 19:58:53,524 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-14 19:58:53,530 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:58:53,706 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-14 19:58:53,707 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 19:58:53,901 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-14 19:58:53,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1220946343] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 19:58:53,902 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 19:58:53,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4, 5] total 14 [2024-10-14 19:58:53,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557242545] [2024-10-14 19:58:53,903 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 19:58:53,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-14 19:58:53,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:58:53,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-14 19:58:53,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2024-10-14 19:58:53,966 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2024-10-14 19:58:53,967 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-14 19:58:53,967 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:58:53,967 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2024-10-14 19:58:53,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:58:55,781 INFO L124 PetriNetUnfolderBase]: 3863/5522 cut-off events. [2024-10-14 19:58:55,782 INFO L125 PetriNetUnfolderBase]: For 2691/2691 co-relation queries the response was YES. [2024-10-14 19:58:55,789 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-14 19:58:55,816 INFO L140 encePairwiseOnDemand]: 22/37 looper letters, 217 selfloop transitions, 128 changer transitions 0/349 dead transitions. [2024-10-14 19:58:55,816 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 349 transitions, 1818 flow [2024-10-14 19:58:55,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-10-14 19:58:55,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2024-10-14 19:58:55,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 578 transitions. [2024-10-14 19:58:55,824 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.48817567567567566 [2024-10-14 19:58:55,826 INFO L175 Difference]: Start difference. First operand has 42 places, 41 transitions, 154 flow. Second operand 32 states and 578 transitions. [2024-10-14 19:58:55,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 349 transitions, 1818 flow [2024-10-14 19:58:55,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 349 transitions, 1818 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-14 19:58:55,840 INFO L231 Difference]: Finished difference. Result has 92 places, 185 transitions, 1306 flow [2024-10-14 19:58:55,840 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-14 19:58:55,842 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 52 predicate places. [2024-10-14 19:58:55,843 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 185 transitions, 1306 flow [2024-10-14 19:58:55,843 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-14 19:58:55,843 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:58:55,843 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-14 19:58:55,861 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-14 19:58:56,047 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-14 19:58:56,048 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-14 19:58:56,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:58:56,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1873685957, now seen corresponding path program 3 times [2024-10-14 19:58:56,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:58:56,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769019488] [2024-10-14 19:58:56,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:58:56,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:58:56,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:58:56,284 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-14 19:58:56,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:58:56,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769019488] [2024-10-14 19:58:56,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769019488] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:58:56,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:58:56,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 19:58:56,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386801698] [2024-10-14 19:58:56,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:58:56,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 19:58:56,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:58:56,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 19:58:56,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 19:58:56,321 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 37 [2024-10-14 19:58:56,321 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-14 19:58:56,322 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:58:56,322 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 37 [2024-10-14 19:58:56,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:58:56,832 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 (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (<= 1 (mod thread1Thread1of1ForFork1_~cond~0 256)) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 240#(and (or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (<= ~t~0 (* (div ~t~0 4294967296) 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= 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 (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= thread2Thread1of1ForFork2_~cond~1 1) (or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (= thread3Thread1of1ForFork0_~cond~2 0)) (and (<= (+ (* (div ~u~0 4294967296) 4294967296) 1) ~u~0) (= thread3Thread1of1ForFork0_~cond~2 1)))), 47#true, Black: 246#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (<= ~t~0 (* (div ~t~0 4294967296) 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= thread2Thread1of1ForFork2_~cond~1 1))) (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~s~0 4294967296) 4294967296) ~s~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (= thread3Thread1of1ForFork0_~cond~2 0)) (and (<= (+ (* (div ~u~0 4294967296) 4294967296) 1) ~u~0) (= thread3Thread1of1ForFork0_~cond~2 1)))), Black: 219#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0))), Black: 65#(or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (<= ~t~0 (* (div ~t~0 4294967296) 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= thread2Thread1of1ForFork2_~cond~1 1))), Black: 115#(= thread1Thread1of1ForFork1_~cond~0 1), Black: 236#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (<= ~t~0 (* (div ~t~0 4294967296) 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= thread2Thread1of1ForFork2_~cond~1 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 (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (<= ~t~0 (* (div ~t~0 4294967296) 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= thread2Thread1of1ForFork2_~cond~1 1))) (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~s~0 4294967296) 4294967296) ~s~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0))), Black: 242#(and (<= 1 (mod thread1Thread1of1ForFork1_~cond~0 256)) (or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (<= ~t~0 (* (div ~t~0 4294967296) 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 244#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= thread2Thread1of1ForFork2_~cond~1 1) (or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (= thread3Thread1of1ForFork0_~cond~2 0)) (and (<= (+ (* (div ~u~0 4294967296) 4294967296) 1) ~u~0) (= thread3Thread1of1ForFork0_~cond~2 1)))), Black: 238#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (= thread3Thread1of1ForFork0_~cond~2 0)) (and (<= (+ (* (div ~u~0 4294967296) 4294967296) 1) ~u~0) (= thread3Thread1of1ForFork0_~cond~2 1)))), Black: 228#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 232#(and (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= 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 (<= (+ (* (div ~T~0 4294967296) 4294967296) 1) ~T~0) (= ~t~0 ~T~0)), Black: 52#(and (<= (+ (* (div ~T~0 4294967296) 4294967296) 1) ~T~0) (= ~t~0 ~T~0) (= thread2Thread1of1ForFork2_~cond~1 1)), 35#L112-4true, Black: 57#(and (= ~s~0 ~S~0) (<= (+ (* (div ~S~0 4294967296) 4294967296) 1) ~S~0)), Black: 60#(and (= thread1Thread1of1ForFork1_~cond~0 1) (= ~s~0 ~S~0) (<= (+ (* (div ~S~0 4294967296) 4294967296) 1) ~S~0)), 55#true]) [2024-10-14 19:58:56,833 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is not cut-off event [2024-10-14 19:58:56,833 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2024-10-14 19:58:56,834 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2024-10-14 19:58:56,834 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2024-10-14 19:58:56,956 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 (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (<= 1 (mod thread1Thread1of1ForFork1_~cond~0 256)) (= thread2Thread1of1ForFork2_~cond~1 1)), 18#L64true, Black: 240#(and (or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (<= ~t~0 (* (div ~t~0 4294967296) 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= 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 (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= thread2Thread1of1ForFork2_~cond~1 1) (or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (= thread3Thread1of1ForFork0_~cond~2 0)) (and (<= (+ (* (div ~u~0 4294967296) 4294967296) 1) ~u~0) (= thread3Thread1of1ForFork0_~cond~2 1)))), Black: 246#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (<= ~t~0 (* (div ~t~0 4294967296) 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= thread2Thread1of1ForFork2_~cond~1 1))) (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~s~0 4294967296) 4294967296) ~s~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (= thread3Thread1of1ForFork0_~cond~2 0)) (and (<= (+ (* (div ~u~0 4294967296) 4294967296) 1) ~u~0) (= thread3Thread1of1ForFork0_~cond~2 1)))), 47#true, Black: 219#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0))), Black: 65#(or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (<= ~t~0 (* (div ~t~0 4294967296) 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= thread2Thread1of1ForFork2_~cond~1 1))), Black: 115#(= thread1Thread1of1ForFork1_~cond~0 1), Black: 236#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (<= ~t~0 (* (div ~t~0 4294967296) 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= thread2Thread1of1ForFork2_~cond~1 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 (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (<= ~t~0 (* (div ~t~0 4294967296) 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= thread2Thread1of1ForFork2_~cond~1 1))) (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~s~0 4294967296) 4294967296) ~s~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0))), Black: 242#(and (<= 1 (mod thread1Thread1of1ForFork1_~cond~0 256)) (or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (<= ~t~0 (* (div ~t~0 4294967296) 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 244#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= thread2Thread1of1ForFork2_~cond~1 1) (or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (= thread3Thread1of1ForFork0_~cond~2 0)) (and (<= (+ (* (div ~u~0 4294967296) 4294967296) 1) ~u~0) (= thread3Thread1of1ForFork0_~cond~2 1)))), Black: 238#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (= thread3Thread1of1ForFork0_~cond~2 0)) (and (<= (+ (* (div ~u~0 4294967296) 4294967296) 1) ~u~0) (= thread3Thread1of1ForFork0_~cond~2 1)))), Black: 228#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 232#(and (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= 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 (<= (+ (* (div ~T~0 4294967296) 4294967296) 1) ~T~0) (= ~t~0 ~T~0)), Black: 52#(and (<= (+ (* (div ~T~0 4294967296) 4294967296) 1) ~T~0) (= ~t~0 ~T~0) (= thread2Thread1of1ForFork2_~cond~1 1)), 12#L113true, Black: 57#(and (= ~s~0 ~S~0) (<= (+ (* (div ~S~0 4294967296) 4294967296) 1) ~S~0)), Black: 60#(and (= thread1Thread1of1ForFork1_~cond~0 1) (= ~s~0 ~S~0) (<= (+ (* (div ~S~0 4294967296) 4294967296) 1) ~S~0)), 55#true]) [2024-10-14 19:58:56,956 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is not cut-off event [2024-10-14 19:58:56,956 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2024-10-14 19:58:56,960 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2024-10-14 19:58:56,960 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2024-10-14 19:58:57,146 INFO L124 PetriNetUnfolderBase]: 3385/5241 cut-off events. [2024-10-14 19:58:57,146 INFO L125 PetriNetUnfolderBase]: For 22508/22812 co-relation queries the response was YES. [2024-10-14 19:58:57,166 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-14 19:58:57,204 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 231 selfloop transitions, 44 changer transitions 0/326 dead transitions. [2024-10-14 19:58:57,205 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 326 transitions, 2835 flow [2024-10-14 19:58:57,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 19:58:57,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-14 19:58:57,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 124 transitions. [2024-10-14 19:58:57,206 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6702702702702703 [2024-10-14 19:58:57,207 INFO L175 Difference]: Start difference. First operand has 92 places, 185 transitions, 1306 flow. Second operand 5 states and 124 transitions. [2024-10-14 19:58:57,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 326 transitions, 2835 flow [2024-10-14 19:58:57,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 326 transitions, 2631 flow, removed 92 selfloop flow, removed 2 redundant places. [2024-10-14 19:58:57,405 INFO L231 Difference]: Finished difference. Result has 97 places, 215 transitions, 1608 flow [2024-10-14 19:58:57,407 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-14 19:58:57,409 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 57 predicate places. [2024-10-14 19:58:57,409 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 215 transitions, 1608 flow [2024-10-14 19:58:57,410 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-14 19:58:57,410 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:58:57,410 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-14 19:58:57,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 19:58:57,411 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-14 19:58:57,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:58:57,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1819292320, now seen corresponding path program 1 times [2024-10-14 19:58:57,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:58:57,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624013312] [2024-10-14 19:58:57,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:58:57,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:58:57,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:58:57,667 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-14 19:58:57,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:58:57,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624013312] [2024-10-14 19:58:57,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624013312] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:58:57,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:58:57,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 19:58:57,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73217687] [2024-10-14 19:58:57,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:58:57,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 19:58:57,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:58:57,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 19:58:57,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 19:58:57,710 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 37 [2024-10-14 19:58:57,711 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-14 19:58:57,712 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:58:57,712 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 37 [2024-10-14 19:58:57,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:58:58,553 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 (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (<= 1 (mod thread1Thread1of1ForFork1_~cond~0 256)) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 240#(and (or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (<= ~t~0 (* (div ~t~0 4294967296) 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= 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 (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= thread2Thread1of1ForFork2_~cond~1 1) (or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (= thread3Thread1of1ForFork0_~cond~2 0)) (and (<= (+ (* (div ~u~0 4294967296) 4294967296) 1) ~u~0) (= thread3Thread1of1ForFork0_~cond~2 1)))), 63#true, Black: 246#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (<= ~t~0 (* (div ~t~0 4294967296) 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= thread2Thread1of1ForFork2_~cond~1 1))) (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~s~0 4294967296) 4294967296) ~s~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (= thread3Thread1of1ForFork0_~cond~2 0)) (and (<= (+ (* (div ~u~0 4294967296) 4294967296) 1) ~u~0) (= thread3Thread1of1ForFork0_~cond~2 1)))), 47#true, Black: 219#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0))), Black: 65#(or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (<= ~t~0 (* (div ~t~0 4294967296) 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= thread2Thread1of1ForFork2_~cond~1 1))), Black: 115#(= thread1Thread1of1ForFork1_~cond~0 1), Black: 236#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (<= ~t~0 (* (div ~t~0 4294967296) 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= thread2Thread1of1ForFork2_~cond~1 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 (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (<= ~t~0 (* (div ~t~0 4294967296) 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= thread2Thread1of1ForFork2_~cond~1 1))) (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~s~0 4294967296) 4294967296) ~s~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0))), Black: 242#(and (<= 1 (mod thread1Thread1of1ForFork1_~cond~0 256)) (or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (<= ~t~0 (* (div ~t~0 4294967296) 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 244#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= thread2Thread1of1ForFork2_~cond~1 1) (or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (= thread3Thread1of1ForFork0_~cond~2 0)) (and (<= (+ (* (div ~u~0 4294967296) 4294967296) 1) ~u~0) (= thread3Thread1of1ForFork0_~cond~2 1)))), Black: 238#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (= thread3Thread1of1ForFork0_~cond~2 0)) (and (<= (+ (* (div ~u~0 4294967296) 4294967296) 1) ~u~0) (= thread3Thread1of1ForFork0_~cond~2 1)))), Black: 228#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 232#(and (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= 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 (+ (* (div ~U~0 4294967296) 4294967296) 4294967295)) (<= (+ (* (div ~U~0 4294967296) 4294967296) 1) ~u~0)), Black: 284#(and (<= ~u~0 (+ (* (div ~U~0 4294967296) 4294967296) 4294967295)) (<= (+ (* (div ~U~0 4294967296) 4294967296) 1) ~u~0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 16#thread1EXITtrue, 14#thread3EXITtrue, Black: 52#(and (<= (+ (* (div ~T~0 4294967296) 4294967296) 1) ~T~0) (= ~t~0 ~T~0) (= thread2Thread1of1ForFork2_~cond~1 1)), 35#L112-4true, Black: 57#(and (= ~s~0 ~S~0) (<= (+ (* (div ~S~0 4294967296) 4294967296) 1) ~S~0)), Black: 60#(and (= thread1Thread1of1ForFork1_~cond~0 1) (= ~s~0 ~S~0) (<= (+ (* (div ~S~0 4294967296) 4294967296) 1) ~S~0)), 55#true]) [2024-10-14 19:58:58,553 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2024-10-14 19:58:58,553 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-10-14 19:58:58,554 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-10-14 19:58:58,554 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-10-14 19:58:58,554 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 (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (<= 1 (mod thread1Thread1of1ForFork1_~cond~0 256)) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 240#(and (or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (<= ~t~0 (* (div ~t~0 4294967296) 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= 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 (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= thread2Thread1of1ForFork2_~cond~1 1) (or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (= thread3Thread1of1ForFork0_~cond~2 0)) (and (<= (+ (* (div ~u~0 4294967296) 4294967296) 1) ~u~0) (= thread3Thread1of1ForFork0_~cond~2 1)))), Black: 246#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (<= ~t~0 (* (div ~t~0 4294967296) 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= thread2Thread1of1ForFork2_~cond~1 1))) (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~s~0 4294967296) 4294967296) ~s~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (= thread3Thread1of1ForFork0_~cond~2 0)) (and (<= (+ (* (div ~u~0 4294967296) 4294967296) 1) ~u~0) (= thread3Thread1of1ForFork0_~cond~2 1)))), 47#true, Black: 219#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0))), Black: 65#(or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (<= ~t~0 (* (div ~t~0 4294967296) 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= thread2Thread1of1ForFork2_~cond~1 1))), Black: 115#(= thread1Thread1of1ForFork1_~cond~0 1), Black: 236#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (<= ~t~0 (* (div ~t~0 4294967296) 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= thread2Thread1of1ForFork2_~cond~1 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 (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (<= ~t~0 (* (div ~t~0 4294967296) 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= thread2Thread1of1ForFork2_~cond~1 1))) (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~s~0 4294967296) 4294967296) ~s~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0))), Black: 242#(and (<= 1 (mod thread1Thread1of1ForFork1_~cond~0 256)) (or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (<= ~t~0 (* (div ~t~0 4294967296) 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 244#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= thread2Thread1of1ForFork2_~cond~1 1) (or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (= thread3Thread1of1ForFork0_~cond~2 0)) (and (<= (+ (* (div ~u~0 4294967296) 4294967296) 1) ~u~0) (= thread3Thread1of1ForFork0_~cond~2 1)))), Black: 238#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (= thread3Thread1of1ForFork0_~cond~2 0)) (and (<= (+ (* (div ~u~0 4294967296) 4294967296) 1) ~u~0) (= thread3Thread1of1ForFork0_~cond~2 1)))), Black: 228#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 232#(and (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= 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 (+ (* (div ~U~0 4294967296) 4294967296) 4294967295)) (<= (+ (* (div ~U~0 4294967296) 4294967296) 1) ~u~0)), Black: 284#(and (<= ~u~0 (+ (* (div ~U~0 4294967296) 4294967296) 4294967295)) (<= (+ (* (div ~U~0 4294967296) 4294967296) 1) ~u~0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 14#thread3EXITtrue, 6#L45true, Black: 52#(and (<= (+ (* (div ~T~0 4294967296) 4294967296) 1) ~T~0) (= ~t~0 ~T~0) (= thread2Thread1of1ForFork2_~cond~1 1)), 35#L112-4true, Black: 57#(and (= ~s~0 ~S~0) (<= (+ (* (div ~S~0 4294967296) 4294967296) 1) ~S~0)), Black: 60#(and (= thread1Thread1of1ForFork1_~cond~0 1) (= ~s~0 ~S~0) (<= (+ (* (div ~S~0 4294967296) 4294967296) 1) ~S~0)), 55#true]) [2024-10-14 19:58:58,554 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2024-10-14 19:58:58,555 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-10-14 19:58:58,555 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-10-14 19:58:58,555 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-10-14 19:58:58,582 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 (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (<= 1 (mod thread1Thread1of1ForFork1_~cond~0 256)) (= thread2Thread1of1ForFork2_~cond~1 1)), 18#L64true, Black: 240#(and (or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (<= ~t~0 (* (div ~t~0 4294967296) 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= 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 (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= thread2Thread1of1ForFork2_~cond~1 1) (or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (= thread3Thread1of1ForFork0_~cond~2 0)) (and (<= (+ (* (div ~u~0 4294967296) 4294967296) 1) ~u~0) (= thread3Thread1of1ForFork0_~cond~2 1)))), Black: 246#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (<= ~t~0 (* (div ~t~0 4294967296) 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= thread2Thread1of1ForFork2_~cond~1 1))) (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~s~0 4294967296) 4294967296) ~s~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (= thread3Thread1of1ForFork0_~cond~2 0)) (and (<= (+ (* (div ~u~0 4294967296) 4294967296) 1) ~u~0) (= thread3Thread1of1ForFork0_~cond~2 1)))), 47#true, Black: 219#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0))), Black: 65#(or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (<= ~t~0 (* (div ~t~0 4294967296) 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= thread2Thread1of1ForFork2_~cond~1 1))), Black: 115#(= thread1Thread1of1ForFork1_~cond~0 1), Black: 236#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (<= ~t~0 (* (div ~t~0 4294967296) 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= thread2Thread1of1ForFork2_~cond~1 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 (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (<= ~t~0 (* (div ~t~0 4294967296) 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= thread2Thread1of1ForFork2_~cond~1 1))) (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~s~0 4294967296) 4294967296) ~s~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0))), Black: 242#(and (<= 1 (mod thread1Thread1of1ForFork1_~cond~0 256)) (or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (<= ~t~0 (* (div ~t~0 4294967296) 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 244#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= thread2Thread1of1ForFork2_~cond~1 1) (or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (= thread3Thread1of1ForFork0_~cond~2 0)) (and (<= (+ (* (div ~u~0 4294967296) 4294967296) 1) ~u~0) (= thread3Thread1of1ForFork0_~cond~2 1)))), Black: 238#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (= thread3Thread1of1ForFork0_~cond~2 0)) (and (<= (+ (* (div ~u~0 4294967296) 4294967296) 1) ~u~0) (= thread3Thread1of1ForFork0_~cond~2 1)))), Black: 228#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 232#(and (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= 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 (+ (* (div ~U~0 4294967296) 4294967296) 4294967295)) (<= (+ (* (div ~U~0 4294967296) 4294967296) 1) ~u~0)), Black: 284#(and (<= ~u~0 (+ (* (div ~U~0 4294967296) 4294967296) 4294967295)) (<= (+ (* (div ~U~0 4294967296) 4294967296) 1) ~u~0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 14#thread3EXITtrue, 16#thread1EXITtrue, Black: 52#(and (<= (+ (* (div ~T~0 4294967296) 4294967296) 1) ~T~0) (= ~t~0 ~T~0) (= thread2Thread1of1ForFork2_~cond~1 1)), 12#L113true, Black: 57#(and (= ~s~0 ~S~0) (<= (+ (* (div ~S~0 4294967296) 4294967296) 1) ~S~0)), Black: 60#(and (= thread1Thread1of1ForFork1_~cond~0 1) (= ~s~0 ~S~0) (<= (+ (* (div ~S~0 4294967296) 4294967296) 1) ~S~0)), 55#true]) [2024-10-14 19:58:58,583 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2024-10-14 19:58:58,583 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-10-14 19:58:58,583 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-10-14 19:58:58,583 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-10-14 19:58:58,584 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 (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (<= 1 (mod thread1Thread1of1ForFork1_~cond~0 256)) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 240#(and (or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (<= ~t~0 (* (div ~t~0 4294967296) 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= 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 (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= thread2Thread1of1ForFork2_~cond~1 1) (or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (= thread3Thread1of1ForFork0_~cond~2 0)) (and (<= (+ (* (div ~u~0 4294967296) 4294967296) 1) ~u~0) (= thread3Thread1of1ForFork0_~cond~2 1)))), Black: 246#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (<= ~t~0 (* (div ~t~0 4294967296) 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= thread2Thread1of1ForFork2_~cond~1 1))) (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~s~0 4294967296) 4294967296) ~s~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (= thread3Thread1of1ForFork0_~cond~2 0)) (and (<= (+ (* (div ~u~0 4294967296) 4294967296) 1) ~u~0) (= thread3Thread1of1ForFork0_~cond~2 1)))), 47#true, Black: 219#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0))), Black: 65#(or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (<= ~t~0 (* (div ~t~0 4294967296) 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= thread2Thread1of1ForFork2_~cond~1 1))), Black: 115#(= thread1Thread1of1ForFork1_~cond~0 1), Black: 236#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (<= ~t~0 (* (div ~t~0 4294967296) 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= thread2Thread1of1ForFork2_~cond~1 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 (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (<= ~t~0 (* (div ~t~0 4294967296) 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= thread2Thread1of1ForFork2_~cond~1 1))) (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~s~0 4294967296) 4294967296) ~s~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0))), Black: 242#(and (<= 1 (mod thread1Thread1of1ForFork1_~cond~0 256)) (or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (<= ~t~0 (* (div ~t~0 4294967296) 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 244#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= thread2Thread1of1ForFork2_~cond~1 1) (or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (= thread3Thread1of1ForFork0_~cond~2 0)) (and (<= (+ (* (div ~u~0 4294967296) 4294967296) 1) ~u~0) (= thread3Thread1of1ForFork0_~cond~2 1)))), Black: 238#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (= thread3Thread1of1ForFork0_~cond~2 0)) (and (<= (+ (* (div ~u~0 4294967296) 4294967296) 1) ~u~0) (= thread3Thread1of1ForFork0_~cond~2 1)))), Black: 228#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 232#(and (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= 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 (+ (* (div ~U~0 4294967296) 4294967296) 4294967295)) (<= (+ (* (div ~U~0 4294967296) 4294967296) 1) ~u~0)), Black: 284#(and (<= ~u~0 (+ (* (div ~U~0 4294967296) 4294967296) 4294967295)) (<= (+ (* (div ~U~0 4294967296) 4294967296) 1) ~u~0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 14#thread3EXITtrue, 6#L45true, Black: 52#(and (<= (+ (* (div ~T~0 4294967296) 4294967296) 1) ~T~0) (= ~t~0 ~T~0) (= thread2Thread1of1ForFork2_~cond~1 1)), 12#L113true, Black: 57#(and (= ~s~0 ~S~0) (<= (+ (* (div ~S~0 4294967296) 4294967296) 1) ~S~0)), Black: 60#(and (= thread1Thread1of1ForFork1_~cond~0 1) (= ~s~0 ~S~0) (<= (+ (* (div ~S~0 4294967296) 4294967296) 1) ~S~0)), 55#true]) [2024-10-14 19:58:58,584 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2024-10-14 19:58:58,584 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-10-14 19:58:58,584 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-10-14 19:58:58,584 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-10-14 19:58:58,595 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 (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (<= 1 (mod thread1Thread1of1ForFork1_~cond~0 256)) (= thread2Thread1of1ForFork2_~cond~1 1)), 18#L64true, Black: 240#(and (or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (<= ~t~0 (* (div ~t~0 4294967296) 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= 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 (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= thread2Thread1of1ForFork2_~cond~1 1) (or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (= thread3Thread1of1ForFork0_~cond~2 0)) (and (<= (+ (* (div ~u~0 4294967296) 4294967296) 1) ~u~0) (= thread3Thread1of1ForFork0_~cond~2 1)))), 63#true, 47#true, Black: 246#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (<= ~t~0 (* (div ~t~0 4294967296) 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= thread2Thread1of1ForFork2_~cond~1 1))) (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~s~0 4294967296) 4294967296) ~s~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (= thread3Thread1of1ForFork0_~cond~2 0)) (and (<= (+ (* (div ~u~0 4294967296) 4294967296) 1) ~u~0) (= thread3Thread1of1ForFork0_~cond~2 1)))), Black: 219#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0))), Black: 65#(or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (<= ~t~0 (* (div ~t~0 4294967296) 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= thread2Thread1of1ForFork2_~cond~1 1))), Black: 115#(= thread1Thread1of1ForFork1_~cond~0 1), Black: 236#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (<= ~t~0 (* (div ~t~0 4294967296) 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= thread2Thread1of1ForFork2_~cond~1 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 (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (<= ~t~0 (* (div ~t~0 4294967296) 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= thread2Thread1of1ForFork2_~cond~1 1))) (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~s~0 4294967296) 4294967296) ~s~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0))), Black: 242#(and (<= 1 (mod thread1Thread1of1ForFork1_~cond~0 256)) (or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (<= ~t~0 (* (div ~t~0 4294967296) 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 244#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= thread2Thread1of1ForFork2_~cond~1 1) (or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (= thread3Thread1of1ForFork0_~cond~2 0)) (and (<= (+ (* (div ~u~0 4294967296) 4294967296) 1) ~u~0) (= thread3Thread1of1ForFork0_~cond~2 1)))), Black: 238#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (= thread3Thread1of1ForFork0_~cond~2 0)) (and (<= (+ (* (div ~u~0 4294967296) 4294967296) 1) ~u~0) (= thread3Thread1of1ForFork0_~cond~2 1)))), Black: 228#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 232#(and (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= 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 (+ (* (div ~U~0 4294967296) 4294967296) 4294967295)) (<= (+ (* (div ~U~0 4294967296) 4294967296) 1) ~u~0)), Black: 284#(and (<= ~u~0 (+ (* (div ~U~0 4294967296) 4294967296) 4294967295)) (<= (+ (* (div ~U~0 4294967296) 4294967296) 1) ~u~0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 16#thread1EXITtrue, 5#L91true, Black: 52#(and (<= (+ (* (div ~T~0 4294967296) 4294967296) 1) ~T~0) (= ~t~0 ~T~0) (= thread2Thread1of1ForFork2_~cond~1 1)), 35#L112-4true, Black: 57#(and (= ~s~0 ~S~0) (<= (+ (* (div ~S~0 4294967296) 4294967296) 1) ~S~0)), Black: 60#(and (= thread1Thread1of1ForFork1_~cond~0 1) (= ~s~0 ~S~0) (<= (+ (* (div ~S~0 4294967296) 4294967296) 1) ~S~0)), 55#true]) [2024-10-14 19:58:58,596 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2024-10-14 19:58:58,596 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-10-14 19:58:58,596 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-10-14 19:58:58,596 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-10-14 19:58:58,597 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 (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (<= 1 (mod thread1Thread1of1ForFork1_~cond~0 256)) (= thread2Thread1of1ForFork2_~cond~1 1)), 18#L64true, Black: 240#(and (or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (<= ~t~0 (* (div ~t~0 4294967296) 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= 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 (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= thread2Thread1of1ForFork2_~cond~1 1) (or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (= thread3Thread1of1ForFork0_~cond~2 0)) (and (<= (+ (* (div ~u~0 4294967296) 4294967296) 1) ~u~0) (= thread3Thread1of1ForFork0_~cond~2 1)))), 63#true, 47#true, Black: 246#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (<= ~t~0 (* (div ~t~0 4294967296) 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= thread2Thread1of1ForFork2_~cond~1 1))) (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~s~0 4294967296) 4294967296) ~s~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (= thread3Thread1of1ForFork0_~cond~2 0)) (and (<= (+ (* (div ~u~0 4294967296) 4294967296) 1) ~u~0) (= thread3Thread1of1ForFork0_~cond~2 1)))), Black: 219#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0))), Black: 65#(or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (<= ~t~0 (* (div ~t~0 4294967296) 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= thread2Thread1of1ForFork2_~cond~1 1))), Black: 115#(= thread1Thread1of1ForFork1_~cond~0 1), Black: 236#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (<= ~t~0 (* (div ~t~0 4294967296) 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= thread2Thread1of1ForFork2_~cond~1 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 (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (<= ~t~0 (* (div ~t~0 4294967296) 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= thread2Thread1of1ForFork2_~cond~1 1))) (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~s~0 4294967296) 4294967296) ~s~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0))), Black: 242#(and (<= 1 (mod thread1Thread1of1ForFork1_~cond~0 256)) (or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (<= ~t~0 (* (div ~t~0 4294967296) 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 244#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= thread2Thread1of1ForFork2_~cond~1 1) (or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (= thread3Thread1of1ForFork0_~cond~2 0)) (and (<= (+ (* (div ~u~0 4294967296) 4294967296) 1) ~u~0) (= thread3Thread1of1ForFork0_~cond~2 1)))), Black: 238#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (= thread3Thread1of1ForFork0_~cond~2 0)) (and (<= (+ (* (div ~u~0 4294967296) 4294967296) 1) ~u~0) (= thread3Thread1of1ForFork0_~cond~2 1)))), Black: 228#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 232#(and (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= 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 (+ (* (div ~U~0 4294967296) 4294967296) 4294967295)) (<= (+ (* (div ~U~0 4294967296) 4294967296) 1) ~u~0)), Black: 284#(and (<= ~u~0 (+ (* (div ~U~0 4294967296) 4294967296) 4294967295)) (<= (+ (* (div ~U~0 4294967296) 4294967296) 1) ~u~0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 16#thread1EXITtrue, 14#thread3EXITtrue, Black: 52#(and (<= (+ (* (div ~T~0 4294967296) 4294967296) 1) ~T~0) (= ~t~0 ~T~0) (= thread2Thread1of1ForFork2_~cond~1 1)), 35#L112-4true, Black: 57#(and (= ~s~0 ~S~0) (<= (+ (* (div ~S~0 4294967296) 4294967296) 1) ~S~0)), Black: 60#(and (= thread1Thread1of1ForFork1_~cond~0 1) (= ~s~0 ~S~0) (<= (+ (* (div ~S~0 4294967296) 4294967296) 1) ~S~0)), 55#true]) [2024-10-14 19:58:58,597 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2024-10-14 19:58:58,597 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-10-14 19:58:58,597 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-10-14 19:58:58,598 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-10-14 19:58:58,598 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-10-14 19:58:58,598 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 (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (<= 1 (mod thread1Thread1of1ForFork1_~cond~0 256)) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 240#(and (or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (<= ~t~0 (* (div ~t~0 4294967296) 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= 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 (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= thread2Thread1of1ForFork2_~cond~1 1) (or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (= thread3Thread1of1ForFork0_~cond~2 0)) (and (<= (+ (* (div ~u~0 4294967296) 4294967296) 1) ~u~0) (= thread3Thread1of1ForFork0_~cond~2 1)))), 47#true, Black: 246#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (<= ~t~0 (* (div ~t~0 4294967296) 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= thread2Thread1of1ForFork2_~cond~1 1))) (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~s~0 4294967296) 4294967296) ~s~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (= thread3Thread1of1ForFork0_~cond~2 0)) (and (<= (+ (* (div ~u~0 4294967296) 4294967296) 1) ~u~0) (= thread3Thread1of1ForFork0_~cond~2 1)))), Black: 219#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0))), Black: 65#(or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (<= ~t~0 (* (div ~t~0 4294967296) 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= thread2Thread1of1ForFork2_~cond~1 1))), Black: 115#(= thread1Thread1of1ForFork1_~cond~0 1), Black: 236#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (<= ~t~0 (* (div ~t~0 4294967296) 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= thread2Thread1of1ForFork2_~cond~1 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 (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (<= ~t~0 (* (div ~t~0 4294967296) 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= thread2Thread1of1ForFork2_~cond~1 1))) (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~s~0 4294967296) 4294967296) ~s~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0))), Black: 242#(and (<= 1 (mod thread1Thread1of1ForFork1_~cond~0 256)) (or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (<= ~t~0 (* (div ~t~0 4294967296) 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 244#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= thread2Thread1of1ForFork2_~cond~1 1) (or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (= thread3Thread1of1ForFork0_~cond~2 0)) (and (<= (+ (* (div ~u~0 4294967296) 4294967296) 1) ~u~0) (= thread3Thread1of1ForFork0_~cond~2 1)))), Black: 238#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (= thread3Thread1of1ForFork0_~cond~2 0)) (and (<= (+ (* (div ~u~0 4294967296) 4294967296) 1) ~u~0) (= thread3Thread1of1ForFork0_~cond~2 1)))), Black: 228#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 232#(and (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= 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 (+ (* (div ~U~0 4294967296) 4294967296) 4294967295)) (<= (+ (* (div ~U~0 4294967296) 4294967296) 1) ~u~0)), Black: 284#(and (<= ~u~0 (+ (* (div ~U~0 4294967296) 4294967296) 4294967295)) (<= (+ (* (div ~U~0 4294967296) 4294967296) 1) ~u~0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 14#thread3EXITtrue, 36#L53true, Black: 52#(and (<= (+ (* (div ~T~0 4294967296) 4294967296) 1) ~T~0) (= ~t~0 ~T~0) (= thread2Thread1of1ForFork2_~cond~1 1)), 35#L112-4true, Black: 57#(and (= ~s~0 ~S~0) (<= (+ (* (div ~S~0 4294967296) 4294967296) 1) ~S~0)), Black: 60#(and (= thread1Thread1of1ForFork1_~cond~0 1) (= ~s~0 ~S~0) (<= (+ (* (div ~S~0 4294967296) 4294967296) 1) ~S~0)), 55#true]) [2024-10-14 19:58:58,598 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2024-10-14 19:58:58,598 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-10-14 19:58:58,599 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-10-14 19:58:58,599 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-10-14 19:58:58,616 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 (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (<= 1 (mod thread1Thread1of1ForFork1_~cond~0 256)) (= thread2Thread1of1ForFork2_~cond~1 1)), 18#L64true, Black: 240#(and (or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (<= ~t~0 (* (div ~t~0 4294967296) 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= 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 (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= thread2Thread1of1ForFork2_~cond~1 1) (or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (= thread3Thread1of1ForFork0_~cond~2 0)) (and (<= (+ (* (div ~u~0 4294967296) 4294967296) 1) ~u~0) (= thread3Thread1of1ForFork0_~cond~2 1)))), 63#true, 47#true, Black: 246#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (<= ~t~0 (* (div ~t~0 4294967296) 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= thread2Thread1of1ForFork2_~cond~1 1))) (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~s~0 4294967296) 4294967296) ~s~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (= thread3Thread1of1ForFork0_~cond~2 0)) (and (<= (+ (* (div ~u~0 4294967296) 4294967296) 1) ~u~0) (= thread3Thread1of1ForFork0_~cond~2 1)))), Black: 219#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0))), Black: 65#(or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (<= ~t~0 (* (div ~t~0 4294967296) 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= thread2Thread1of1ForFork2_~cond~1 1))), Black: 115#(= thread1Thread1of1ForFork1_~cond~0 1), Black: 236#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (<= ~t~0 (* (div ~t~0 4294967296) 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= thread2Thread1of1ForFork2_~cond~1 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 (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (<= ~t~0 (* (div ~t~0 4294967296) 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= thread2Thread1of1ForFork2_~cond~1 1))) (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~s~0 4294967296) 4294967296) ~s~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0))), Black: 242#(and (<= 1 (mod thread1Thread1of1ForFork1_~cond~0 256)) (or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (<= ~t~0 (* (div ~t~0 4294967296) 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 244#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= thread2Thread1of1ForFork2_~cond~1 1) (or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (= thread3Thread1of1ForFork0_~cond~2 0)) (and (<= (+ (* (div ~u~0 4294967296) 4294967296) 1) ~u~0) (= thread3Thread1of1ForFork0_~cond~2 1)))), Black: 238#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (= thread3Thread1of1ForFork0_~cond~2 0)) (and (<= (+ (* (div ~u~0 4294967296) 4294967296) 1) ~u~0) (= thread3Thread1of1ForFork0_~cond~2 1)))), Black: 228#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 232#(and (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= 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 (+ (* (div ~U~0 4294967296) 4294967296) 4294967295)) (<= (+ (* (div ~U~0 4294967296) 4294967296) 1) ~u~0)), Black: 284#(and (<= ~u~0 (+ (* (div ~U~0 4294967296) 4294967296) 4294967295)) (<= (+ (* (div ~U~0 4294967296) 4294967296) 1) ~u~0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 16#thread1EXITtrue, 5#L91true, Black: 52#(and (<= (+ (* (div ~T~0 4294967296) 4294967296) 1) ~T~0) (= ~t~0 ~T~0) (= thread2Thread1of1ForFork2_~cond~1 1)), 12#L113true, Black: 57#(and (= ~s~0 ~S~0) (<= (+ (* (div ~S~0 4294967296) 4294967296) 1) ~S~0)), Black: 60#(and (= thread1Thread1of1ForFork1_~cond~0 1) (= ~s~0 ~S~0) (<= (+ (* (div ~S~0 4294967296) 4294967296) 1) ~S~0)), 55#true]) [2024-10-14 19:58:58,616 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2024-10-14 19:58:58,616 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-10-14 19:58:58,616 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-10-14 19:58:58,616 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-10-14 19:58:58,617 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 (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (<= 1 (mod thread1Thread1of1ForFork1_~cond~0 256)) (= thread2Thread1of1ForFork2_~cond~1 1)), 18#L64true, Black: 240#(and (or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (<= ~t~0 (* (div ~t~0 4294967296) 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= 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 (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= thread2Thread1of1ForFork2_~cond~1 1) (or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (= thread3Thread1of1ForFork0_~cond~2 0)) (and (<= (+ (* (div ~u~0 4294967296) 4294967296) 1) ~u~0) (= thread3Thread1of1ForFork0_~cond~2 1)))), 63#true, 47#true, Black: 246#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (<= ~t~0 (* (div ~t~0 4294967296) 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= thread2Thread1of1ForFork2_~cond~1 1))) (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~s~0 4294967296) 4294967296) ~s~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (= thread3Thread1of1ForFork0_~cond~2 0)) (and (<= (+ (* (div ~u~0 4294967296) 4294967296) 1) ~u~0) (= thread3Thread1of1ForFork0_~cond~2 1)))), Black: 219#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0))), Black: 65#(or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (<= ~t~0 (* (div ~t~0 4294967296) 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= thread2Thread1of1ForFork2_~cond~1 1))), Black: 115#(= thread1Thread1of1ForFork1_~cond~0 1), Black: 236#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (<= ~t~0 (* (div ~t~0 4294967296) 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= thread2Thread1of1ForFork2_~cond~1 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 (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (<= ~t~0 (* (div ~t~0 4294967296) 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= thread2Thread1of1ForFork2_~cond~1 1))) (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~s~0 4294967296) 4294967296) ~s~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0))), Black: 242#(and (<= 1 (mod thread1Thread1of1ForFork1_~cond~0 256)) (or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (<= ~t~0 (* (div ~t~0 4294967296) 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 244#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= thread2Thread1of1ForFork2_~cond~1 1) (or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (= thread3Thread1of1ForFork0_~cond~2 0)) (and (<= (+ (* (div ~u~0 4294967296) 4294967296) 1) ~u~0) (= thread3Thread1of1ForFork0_~cond~2 1)))), Black: 238#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (= thread3Thread1of1ForFork0_~cond~2 0)) (and (<= (+ (* (div ~u~0 4294967296) 4294967296) 1) ~u~0) (= thread3Thread1of1ForFork0_~cond~2 1)))), Black: 228#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 232#(and (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= 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 (+ (* (div ~U~0 4294967296) 4294967296) 4294967295)) (<= (+ (* (div ~U~0 4294967296) 4294967296) 1) ~u~0)), Black: 284#(and (<= ~u~0 (+ (* (div ~U~0 4294967296) 4294967296) 4294967295)) (<= (+ (* (div ~U~0 4294967296) 4294967296) 1) ~u~0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 14#thread3EXITtrue, 16#thread1EXITtrue, Black: 52#(and (<= (+ (* (div ~T~0 4294967296) 4294967296) 1) ~T~0) (= ~t~0 ~T~0) (= thread2Thread1of1ForFork2_~cond~1 1)), 12#L113true, Black: 57#(and (= ~s~0 ~S~0) (<= (+ (* (div ~S~0 4294967296) 4294967296) 1) ~S~0)), Black: 60#(and (= thread1Thread1of1ForFork1_~cond~0 1) (= ~s~0 ~S~0) (<= (+ (* (div ~S~0 4294967296) 4294967296) 1) ~S~0)), 55#true]) [2024-10-14 19:58:58,617 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2024-10-14 19:58:58,617 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-10-14 19:58:58,617 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-10-14 19:58:58,618 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-10-14 19:58:58,618 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-10-14 19:58:58,618 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 (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (<= 1 (mod thread1Thread1of1ForFork1_~cond~0 256)) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 240#(and (or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (<= ~t~0 (* (div ~t~0 4294967296) 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= 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 (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= thread2Thread1of1ForFork2_~cond~1 1) (or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (= thread3Thread1of1ForFork0_~cond~2 0)) (and (<= (+ (* (div ~u~0 4294967296) 4294967296) 1) ~u~0) (= thread3Thread1of1ForFork0_~cond~2 1)))), 63#true, 47#true, Black: 246#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (<= ~t~0 (* (div ~t~0 4294967296) 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= thread2Thread1of1ForFork2_~cond~1 1))) (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~s~0 4294967296) 4294967296) ~s~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (= thread3Thread1of1ForFork0_~cond~2 0)) (and (<= (+ (* (div ~u~0 4294967296) 4294967296) 1) ~u~0) (= thread3Thread1of1ForFork0_~cond~2 1)))), Black: 219#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0))), Black: 65#(or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (<= ~t~0 (* (div ~t~0 4294967296) 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= thread2Thread1of1ForFork2_~cond~1 1))), Black: 115#(= thread1Thread1of1ForFork1_~cond~0 1), Black: 236#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (<= ~t~0 (* (div ~t~0 4294967296) 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= thread2Thread1of1ForFork2_~cond~1 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 (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (<= ~t~0 (* (div ~t~0 4294967296) 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= thread2Thread1of1ForFork2_~cond~1 1))) (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~s~0 4294967296) 4294967296) ~s~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0))), Black: 242#(and (<= 1 (mod thread1Thread1of1ForFork1_~cond~0 256)) (or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (<= ~t~0 (* (div ~t~0 4294967296) 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 244#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= thread2Thread1of1ForFork2_~cond~1 1) (or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (= thread3Thread1of1ForFork0_~cond~2 0)) (and (<= (+ (* (div ~u~0 4294967296) 4294967296) 1) ~u~0) (= thread3Thread1of1ForFork0_~cond~2 1)))), Black: 238#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (= thread3Thread1of1ForFork0_~cond~2 0)) (and (<= (+ (* (div ~u~0 4294967296) 4294967296) 1) ~u~0) (= thread3Thread1of1ForFork0_~cond~2 1)))), Black: 228#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 232#(and (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= 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 (+ (* (div ~U~0 4294967296) 4294967296) 4294967295)) (<= (+ (* (div ~U~0 4294967296) 4294967296) 1) ~u~0)), Black: 284#(and (<= ~u~0 (+ (* (div ~U~0 4294967296) 4294967296) 4294967295)) (<= (+ (* (div ~U~0 4294967296) 4294967296) 1) ~u~0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 14#thread3EXITtrue, 36#L53true, Black: 52#(and (<= (+ (* (div ~T~0 4294967296) 4294967296) 1) ~T~0) (= ~t~0 ~T~0) (= thread2Thread1of1ForFork2_~cond~1 1)), 12#L113true, Black: 57#(and (= ~s~0 ~S~0) (<= (+ (* (div ~S~0 4294967296) 4294967296) 1) ~S~0)), Black: 60#(and (= thread1Thread1of1ForFork1_~cond~0 1) (= ~s~0 ~S~0) (<= (+ (* (div ~S~0 4294967296) 4294967296) 1) ~S~0)), 55#true]) [2024-10-14 19:58:58,618 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2024-10-14 19:58:58,618 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-10-14 19:58:58,618 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-10-14 19:58:58,619 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-10-14 19:58:58,620 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 (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (<= 1 (mod thread1Thread1of1ForFork1_~cond~0 256)) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 240#(and (or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (<= ~t~0 (* (div ~t~0 4294967296) 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= 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 (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= thread2Thread1of1ForFork2_~cond~1 1) (or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (= thread3Thread1of1ForFork0_~cond~2 0)) (and (<= (+ (* (div ~u~0 4294967296) 4294967296) 1) ~u~0) (= thread3Thread1of1ForFork0_~cond~2 1)))), 47#true, Black: 246#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (<= ~t~0 (* (div ~t~0 4294967296) 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= thread2Thread1of1ForFork2_~cond~1 1))) (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~s~0 4294967296) 4294967296) ~s~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (= thread3Thread1of1ForFork0_~cond~2 0)) (and (<= (+ (* (div ~u~0 4294967296) 4294967296) 1) ~u~0) (= thread3Thread1of1ForFork0_~cond~2 1)))), Black: 219#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0))), Black: 65#(or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (<= ~t~0 (* (div ~t~0 4294967296) 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= thread2Thread1of1ForFork2_~cond~1 1))), Black: 115#(= thread1Thread1of1ForFork1_~cond~0 1), Black: 236#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (<= ~t~0 (* (div ~t~0 4294967296) 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= thread2Thread1of1ForFork2_~cond~1 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 (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (<= ~t~0 (* (div ~t~0 4294967296) 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= thread2Thread1of1ForFork2_~cond~1 1))) (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~s~0 4294967296) 4294967296) ~s~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0))), Black: 242#(and (<= 1 (mod thread1Thread1of1ForFork1_~cond~0 256)) (or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (<= ~t~0 (* (div ~t~0 4294967296) 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 244#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= thread2Thread1of1ForFork2_~cond~1 1) (or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (= thread3Thread1of1ForFork0_~cond~2 0)) (and (<= (+ (* (div ~u~0 4294967296) 4294967296) 1) ~u~0) (= thread3Thread1of1ForFork0_~cond~2 1)))), Black: 238#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (= thread3Thread1of1ForFork0_~cond~2 0)) (and (<= (+ (* (div ~u~0 4294967296) 4294967296) 1) ~u~0) (= thread3Thread1of1ForFork0_~cond~2 1)))), Black: 228#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 232#(and (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= 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 (+ (* (div ~U~0 4294967296) 4294967296) 4294967295)) (<= (+ (* (div ~U~0 4294967296) 4294967296) 1) ~u~0)), Black: 284#(and (<= ~u~0 (+ (* (div ~U~0 4294967296) 4294967296) 4294967295)) (<= (+ (* (div ~U~0 4294967296) 4294967296) 1) ~u~0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 14#thread3EXITtrue, 6#L45true, Black: 52#(and (<= (+ (* (div ~T~0 4294967296) 4294967296) 1) ~T~0) (= ~t~0 ~T~0) (= thread2Thread1of1ForFork2_~cond~1 1)), 35#L112-4true, Black: 57#(and (= ~s~0 ~S~0) (<= (+ (* (div ~S~0 4294967296) 4294967296) 1) ~S~0)), Black: 60#(and (= thread1Thread1of1ForFork1_~cond~0 1) (= ~s~0 ~S~0) (<= (+ (* (div ~S~0 4294967296) 4294967296) 1) ~S~0)), 55#true]) [2024-10-14 19:58:58,620 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2024-10-14 19:58:58,620 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-10-14 19:58:58,621 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-10-14 19:58:58,621 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-10-14 19:58:58,621 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-10-14 19:58:58,632 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 (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (<= 1 (mod thread1Thread1of1ForFork1_~cond~0 256)) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 240#(and (or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (<= ~t~0 (* (div ~t~0 4294967296) 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= 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 (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= thread2Thread1of1ForFork2_~cond~1 1) (or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (= thread3Thread1of1ForFork0_~cond~2 0)) (and (<= (+ (* (div ~u~0 4294967296) 4294967296) 1) ~u~0) (= thread3Thread1of1ForFork0_~cond~2 1)))), 47#true, Black: 246#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (<= ~t~0 (* (div ~t~0 4294967296) 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= thread2Thread1of1ForFork2_~cond~1 1))) (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~s~0 4294967296) 4294967296) ~s~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (= thread3Thread1of1ForFork0_~cond~2 0)) (and (<= (+ (* (div ~u~0 4294967296) 4294967296) 1) ~u~0) (= thread3Thread1of1ForFork0_~cond~2 1)))), Black: 219#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0))), Black: 65#(or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (<= ~t~0 (* (div ~t~0 4294967296) 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= thread2Thread1of1ForFork2_~cond~1 1))), Black: 115#(= thread1Thread1of1ForFork1_~cond~0 1), Black: 236#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (<= ~t~0 (* (div ~t~0 4294967296) 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= thread2Thread1of1ForFork2_~cond~1 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 (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (<= ~t~0 (* (div ~t~0 4294967296) 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= thread2Thread1of1ForFork2_~cond~1 1))) (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~s~0 4294967296) 4294967296) ~s~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0))), Black: 242#(and (<= 1 (mod thread1Thread1of1ForFork1_~cond~0 256)) (or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (<= ~t~0 (* (div ~t~0 4294967296) 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 244#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= thread2Thread1of1ForFork2_~cond~1 1) (or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (= thread3Thread1of1ForFork0_~cond~2 0)) (and (<= (+ (* (div ~u~0 4294967296) 4294967296) 1) ~u~0) (= thread3Thread1of1ForFork0_~cond~2 1)))), Black: 238#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (or (and (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (= thread3Thread1of1ForFork0_~cond~2 0)) (and (<= (+ (* (div ~u~0 4294967296) 4294967296) 1) ~u~0) (= thread3Thread1of1ForFork0_~cond~2 1)))), Black: 228#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 232#(and (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (= 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 (+ (* (div ~U~0 4294967296) 4294967296) 4294967295)) (<= (+ (* (div ~U~0 4294967296) 4294967296) 1) ~u~0)), Black: 284#(and (<= ~u~0 (+ (* (div ~U~0 4294967296) 4294967296) 4294967295)) (<= (+ (* (div ~U~0 4294967296) 4294967296) 1) ~u~0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 14#thread3EXITtrue, 6#L45true, Black: 52#(and (<= (+ (* (div ~T~0 4294967296) 4294967296) 1) ~T~0) (= ~t~0 ~T~0) (= thread2Thread1of1ForFork2_~cond~1 1)), 12#L113true, Black: 57#(and (= ~s~0 ~S~0) (<= (+ (* (div ~S~0 4294967296) 4294967296) 1) ~S~0)), Black: 60#(and (= thread1Thread1of1ForFork1_~cond~0 1) (= ~s~0 ~S~0) (<= (+ (* (div ~S~0 4294967296) 4294967296) 1) ~S~0)), 55#true]) [2024-10-14 19:58:58,633 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2024-10-14 19:58:58,633 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-10-14 19:58:58,633 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-10-14 19:58:58,633 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-10-14 19:58:58,633 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-10-14 19:58:58,642 INFO L124 PetriNetUnfolderBase]: 3974/6160 cut-off events. [2024-10-14 19:58:58,642 INFO L125 PetriNetUnfolderBase]: For 24249/24588 co-relation queries the response was YES. [2024-10-14 19:58:58,667 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-14 19:58:58,701 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 161 selfloop transitions, 22 changer transitions 0/259 dead transitions. [2024-10-14 19:58:58,701 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 259 transitions, 2233 flow [2024-10-14 19:58:58,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 19:58:58,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-14 19:58:58,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 121 transitions. [2024-10-14 19:58:58,702 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.654054054054054 [2024-10-14 19:58:58,702 INFO L175 Difference]: Start difference. First operand has 97 places, 215 transitions, 1608 flow. Second operand 5 states and 121 transitions. [2024-10-14 19:58:58,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 259 transitions, 2233 flow [2024-10-14 19:58:58,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 259 transitions, 2193 flow, removed 7 selfloop flow, removed 3 redundant places. [2024-10-14 19:58:58,805 INFO L231 Difference]: Finished difference. Result has 99 places, 218 transitions, 1662 flow [2024-10-14 19:58:58,805 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-14 19:58:58,806 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 59 predicate places. [2024-10-14 19:58:58,806 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 218 transitions, 1662 flow [2024-10-14 19:58:58,806 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-14 19:58:58,807 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:58:58,807 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-14 19:58:58,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 19:58:58,807 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-14 19:58:58,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:58:58,808 INFO L85 PathProgramCache]: Analyzing trace with hash -252051740, now seen corresponding path program 2 times [2024-10-14 19:58:58,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:58:58,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662453583] [2024-10-14 19:58:58,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:58:58,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:58:58,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:59:01,520 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-14 19:59:01,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:59:01,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662453583] [2024-10-14 19:59:01,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662453583] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 19:59:01,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [659662481] [2024-10-14 19:59:01,521 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 19:59:01,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 19:59:01,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 19:59:01,523 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-14 19:59:01,524 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-14 19:59:01,630 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 19:59:01,630 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 19:59:01,635 INFO L255 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-14 19:59:01,637 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:59:02,856 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-14 19:59:02,857 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 19:59:10,468 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-14 19:59:10,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [659662481] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 19:59:10,469 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 19:59:10,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 27 [2024-10-14 19:59:10,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60265331] [2024-10-14 19:59:10,469 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 19:59:10,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-10-14 19:59:10,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:59:10,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-10-14 19:59:10,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=613, Unknown=1, NotChecked=0, Total=756 [2024-10-14 19:59:16,068 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-14 19:59:16,097 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-10-14 19:59:16,097 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 218 transitions, 1662 flow. Second operand has 28 states, 28 states have (on average 11.285714285714286) internal successors, (316), 28 states have internal predecessors, (316), 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-14 19:59:16,097 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:59:16,097 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-10-14 19:59:16,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:59:35,320 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-14 19:59:44,992 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-14 19:59:49,010 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-14 19:59:51,389 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.37s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 20:00:08,300 INFO L124 PetriNetUnfolderBase]: 39834/58669 cut-off events. [2024-10-14 20:00:08,300 INFO L125 PetriNetUnfolderBase]: For 237378/237382 co-relation queries the response was YES. [2024-10-14 20:00:08,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 254797 conditions, 58669 events. 39834/58669 cut-off events. For 237378/237382 co-relation queries the response was YES. Maximal size of possible extension queue 2674. Compared 422933 event pairs, 1541 based on Foata normal form. 58/58725 useless extension candidates. Maximal degree in co-relation 167607. Up to 7927 conditions per place. [2024-10-14 20:00:08,916 INFO L140 encePairwiseOnDemand]: 23/37 looper letters, 1265 selfloop transitions, 1689 changer transitions 361/3320 dead transitions. [2024-10-14 20:00:08,916 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 3320 transitions, 30505 flow [2024-10-14 20:00:08,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2024-10-14 20:00:08,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2024-10-14 20:00:08,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 2490 transitions. [2024-10-14 20:00:08,928 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.513719826696926 [2024-10-14 20:00:08,928 INFO L175 Difference]: Start difference. First operand has 99 places, 218 transitions, 1662 flow. Second operand 131 states and 2490 transitions. [2024-10-14 20:00:08,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 3320 transitions, 30505 flow [2024-10-14 20:00:11,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 3320 transitions, 30307 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-14 20:00:11,387 INFO L231 Difference]: Finished difference. Result has 309 places, 2064 transitions, 22821 flow [2024-10-14 20:00:11,387 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-14 20:00:11,388 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 269 predicate places. [2024-10-14 20:00:11,388 INFO L471 AbstractCegarLoop]: Abstraction has has 309 places, 2064 transitions, 22821 flow [2024-10-14 20:00:11,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 11.285714285714286) internal successors, (316), 28 states have internal predecessors, (316), 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-14 20:00:11,389 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 20:00:11,389 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-14 20:00:11,404 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-14 20:00:11,589 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-14 20:00:11,590 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-14 20:00:11,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:00:11,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1202758860, now seen corresponding path program 3 times [2024-10-14 20:00:11,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:00:11,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403033818] [2024-10-14 20:00:11,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:00:11,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:00:11,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:00:12,701 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-14 20:00:12,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:00:12,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403033818] [2024-10-14 20:00:12,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403033818] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:00:12,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1922302219] [2024-10-14 20:00:12,702 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-14 20:00:12,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:00:12,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:00:12,704 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-14 20:00:12,705 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-14 20:00:12,784 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-10-14 20:00:12,784 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 20:00:12,785 INFO L255 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-14 20:00:12,786 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:00:13,404 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-14 20:00:13,404 INFO L311 TraceCheckSpWp]: Computing backward predicates...