./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-atomic/read_write_lock-1.i --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/pthread-atomic/read_write_lock-1.i -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 8fab2e995569cc819974baee7d52d8d4bdabd2a2896c83fb3b8d07b44f394c5b --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 19:24:20,337 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 19:24:20,435 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-14 19:24:20,440 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 19:24:20,442 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 19:24:20,467 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 19:24:20,468 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 19:24:20,468 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 19:24:20,469 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 19:24:20,470 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 19:24:20,471 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 19:24:20,471 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 19:24:20,472 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 19:24:20,472 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 19:24:20,475 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 19:24:20,475 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 19:24:20,476 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 19:24:20,476 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 19:24:20,476 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 19:24:20,477 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 19:24:20,477 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-14 19:24:20,477 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-14 19:24:20,477 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-14 19:24:20,478 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 19:24:20,478 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 19:24:20,478 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 19:24:20,478 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 19:24:20,479 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 19:24:20,479 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 19:24:20,479 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 19:24:20,479 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 19:24:20,479 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 19:24:20,480 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 19:24:20,480 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 19:24:20,480 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 19:24:20,480 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 19:24:20,481 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 19:24:20,481 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 19:24:20,481 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 19:24:20,483 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 19:24:20,483 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 19:24:20,484 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 19:24:20,484 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 -> 8fab2e995569cc819974baee7d52d8d4bdabd2a2896c83fb3b8d07b44f394c5b [2024-10-14 19:24:20,738 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 19:24:20,762 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 19:24:20,766 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 19:24:20,767 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 19:24:20,767 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 19:24:20,769 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-atomic/read_write_lock-1.i [2024-10-14 19:24:22,161 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 19:24:22,418 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 19:24:22,419 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-atomic/read_write_lock-1.i [2024-10-14 19:24:22,433 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00072b44a/38a0902e957545b18dff54ba09b3c34a/FLAGb3e892cb0 [2024-10-14 19:24:22,447 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00072b44a/38a0902e957545b18dff54ba09b3c34a [2024-10-14 19:24:22,449 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 19:24:22,450 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 19:24:22,455 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 19:24:22,455 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 19:24:22,460 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 19:24:22,461 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:24:22" (1/1) ... [2024-10-14 19:24:22,462 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3096c9f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:24:22, skipping insertion in model container [2024-10-14 19:24:22,462 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:24:22" (1/1) ... [2024-10-14 19:24:22,498 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 19:24:22,886 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 19:24:22,895 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 19:24:22,943 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 19:24:22,984 INFO L204 MainTranslator]: Completed translation [2024-10-14 19:24:22,985 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:24:22 WrapperNode [2024-10-14 19:24:22,985 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 19:24:22,986 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 19:24:22,986 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 19:24:22,986 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 19:24:22,997 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:24:22" (1/1) ... [2024-10-14 19:24:23,010 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:24:22" (1/1) ... [2024-10-14 19:24:23,029 INFO L138 Inliner]: procedures = 173, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 91 [2024-10-14 19:24:23,030 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 19:24:23,031 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 19:24:23,031 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 19:24:23,031 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 19:24:23,041 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:24:22" (1/1) ... [2024-10-14 19:24:23,041 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:24:22" (1/1) ... [2024-10-14 19:24:23,044 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:24:22" (1/1) ... [2024-10-14 19:24:23,059 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:24:23,060 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:24:22" (1/1) ... [2024-10-14 19:24:23,060 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:24:22" (1/1) ... [2024-10-14 19:24:23,064 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:24:22" (1/1) ... [2024-10-14 19:24:23,066 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:24:22" (1/1) ... [2024-10-14 19:24:23,067 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:24:22" (1/1) ... [2024-10-14 19:24:23,068 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:24:22" (1/1) ... [2024-10-14 19:24:23,070 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 19:24:23,075 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 19:24:23,075 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 19:24:23,075 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 19:24:23,077 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:24:22" (1/1) ... [2024-10-14 19:24:23,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 19:24:23,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 19:24:23,106 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:24:23,109 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:24:23,152 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-14 19:24:23,153 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 19:24:23,153 INFO L130 BoogieDeclarations]: Found specification of procedure reader [2024-10-14 19:24:23,153 INFO L138 BoogieDeclarations]: Found implementation of procedure reader [2024-10-14 19:24:23,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 19:24:23,154 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-14 19:24:23,154 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 19:24:23,154 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 19:24:23,154 INFO L130 BoogieDeclarations]: Found specification of procedure writer [2024-10-14 19:24:23,154 INFO L138 BoogieDeclarations]: Found implementation of procedure writer [2024-10-14 19:24:23,171 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:24:23,291 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 19:24:23,293 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 19:24:23,413 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-14 19:24:23,413 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 19:24:23,528 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 19:24:23,528 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-14 19:24:23,528 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:24:23 BoogieIcfgContainer [2024-10-14 19:24:23,529 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 19:24:23,530 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 19:24:23,531 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 19:24:23,533 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 19:24:23,534 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 07:24:22" (1/3) ... [2024-10-14 19:24:23,534 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f64a164 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:24:23, skipping insertion in model container [2024-10-14 19:24:23,534 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:24:22" (2/3) ... [2024-10-14 19:24:23,535 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f64a164 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:24:23, skipping insertion in model container [2024-10-14 19:24:23,535 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:24:23" (3/3) ... [2024-10-14 19:24:23,536 INFO L112 eAbstractionObserver]: Analyzing ICFG read_write_lock-1.i [2024-10-14 19:24:23,558 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 19:24:23,558 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-14 19:24:23,558 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-14 19:24:23,626 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-10-14 19:24:23,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 60 transitions, 148 flow [2024-10-14 19:24:23,695 INFO L124 PetriNetUnfolderBase]: 4/56 cut-off events. [2024-10-14 19:24:23,695 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-10-14 19:24:23,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73 conditions, 56 events. 4/56 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 118 event pairs, 0 based on Foata normal form. 0/49 useless extension candidates. Maximal degree in co-relation 53. Up to 2 conditions per place. [2024-10-14 19:24:23,700 INFO L82 GeneralOperation]: Start removeDead. Operand has 69 places, 60 transitions, 148 flow [2024-10-14 19:24:23,703 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 64 places, 55 transitions, 134 flow [2024-10-14 19:24:23,716 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 19:24:23,722 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;@5289444, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 19:24:23,723 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-10-14 19:24:23,738 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-14 19:24:23,738 INFO L124 PetriNetUnfolderBase]: 2/38 cut-off events. [2024-10-14 19:24:23,738 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-14 19:24:23,739 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:24:23,739 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:24:23,740 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-10-14 19:24:23,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:24:23,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1469700157, now seen corresponding path program 1 times [2024-10-14 19:24:23,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:24:23,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441306961] [2024-10-14 19:24:23,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:24:23,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:24:23,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:24:24,065 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:24:24,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:24:24,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441306961] [2024-10-14 19:24:24,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441306961] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:24:24,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:24:24,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 19:24:24,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618038397] [2024-10-14 19:24:24,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:24:24,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 19:24:24,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:24:24,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 19:24:24,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 19:24:24,150 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 60 [2024-10-14 19:24:24,153 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 55 transitions, 134 flow. Second operand has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 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:24:24,153 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:24:24,154 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 60 [2024-10-14 19:24:24,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:24:26,999 INFO L124 PetriNetUnfolderBase]: 17416/27744 cut-off events. [2024-10-14 19:24:26,999 INFO L125 PetriNetUnfolderBase]: For 2582/2582 co-relation queries the response was YES. [2024-10-14 19:24:27,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53453 conditions, 27744 events. 17416/27744 cut-off events. For 2582/2582 co-relation queries the response was YES. Maximal size of possible extension queue 1326. Compared 219018 event pairs, 1959 based on Foata normal form. 2832/30001 useless extension candidates. Maximal degree in co-relation 46845. Up to 7302 conditions per place. [2024-10-14 19:24:27,290 INFO L140 encePairwiseOnDemand]: 46/60 looper letters, 173 selfloop transitions, 29 changer transitions 0/216 dead transitions. [2024-10-14 19:24:27,290 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 216 transitions, 950 flow [2024-10-14 19:24:27,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 19:24:27,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-10-14 19:24:27,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 447 transitions. [2024-10-14 19:24:27,308 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6772727272727272 [2024-10-14 19:24:27,311 INFO L175 Difference]: Start difference. First operand has 64 places, 55 transitions, 134 flow. Second operand 11 states and 447 transitions. [2024-10-14 19:24:27,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 216 transitions, 950 flow [2024-10-14 19:24:27,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 216 transitions, 874 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-10-14 19:24:27,374 INFO L231 Difference]: Finished difference. Result has 72 places, 80 transitions, 308 flow [2024-10-14 19:24:27,376 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=308, PETRI_PLACES=72, PETRI_TRANSITIONS=80} [2024-10-14 19:24:27,379 INFO L277 CegarLoopForPetriNet]: 64 programPoint places, 8 predicate places. [2024-10-14 19:24:27,382 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 80 transitions, 308 flow [2024-10-14 19:24:27,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 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:24:27,382 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:24:27,382 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:24:27,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 19:24:27,384 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-10-14 19:24:27,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:24:27,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1448217602, now seen corresponding path program 1 times [2024-10-14 19:24:27,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:24:27,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886178949] [2024-10-14 19:24:27,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:24:27,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:24:27,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:24:27,496 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:24:27,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:24:27,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886178949] [2024-10-14 19:24:27,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886178949] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:24:27,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:24:27,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 19:24:27,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126367503] [2024-10-14 19:24:27,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:24:27,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 19:24:27,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:24:27,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 19:24:27,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:24:27,505 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 60 [2024-10-14 19:24:27,506 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 80 transitions, 308 flow. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 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:24:27,506 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:24:27,506 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 60 [2024-10-14 19:24:27,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:24:28,889 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [Black: 87#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 81#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), 8#L748-4true, 59#L721true, 16#L16true, 77#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), 50#L740true, 28#L721true, Black: 72#true, 98#true, Black: 74#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), Black: 83#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 85#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 79#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0))]) [2024-10-14 19:24:28,891 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-10-14 19:24:28,891 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-10-14 19:24:28,891 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-10-14 19:24:28,891 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-10-14 19:24:28,944 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [Black: 87#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 81#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), 30#writerEXITtrue, 8#L748-4true, 59#L721true, 77#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), 16#L16true, 50#L740true, Black: 72#true, 98#true, Black: 74#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), Black: 83#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 85#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 79#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0))]) [2024-10-14 19:24:28,944 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-10-14 19:24:28,944 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-10-14 19:24:28,945 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-10-14 19:24:28,945 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-10-14 19:24:28,962 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [Black: 87#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 81#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), 59#L721true, 77#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), 16#L16true, 6#L749true, 50#L740true, 28#L721true, 98#true, Black: 72#true, Black: 74#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), Black: 83#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 85#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 79#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0))]) [2024-10-14 19:24:28,963 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-10-14 19:24:28,963 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-10-14 19:24:28,963 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-10-14 19:24:28,963 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-10-14 19:24:28,965 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [Black: 87#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 81#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), 8#L748-4true, 16#L16true, 77#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), 50#L740true, 15#writerEXITtrue, 28#L721true, 98#true, Black: 72#true, Black: 74#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), Black: 83#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 85#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 79#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0))]) [2024-10-14 19:24:28,965 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-10-14 19:24:28,966 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-10-14 19:24:28,966 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-10-14 19:24:28,966 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-10-14 19:24:28,967 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [Black: 87#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 81#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), 24#L740true, 8#L748-4true, 59#L721true, 77#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), 50#L740true, 28#L721true, Black: 72#true, 98#true, Black: 74#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), Black: 83#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 85#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 79#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0))]) [2024-10-14 19:24:28,967 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-10-14 19:24:28,967 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-10-14 19:24:28,967 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-10-14 19:24:28,967 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-10-14 19:24:29,144 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [Black: 87#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 81#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), 30#writerEXITtrue, 59#L721true, 77#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), 16#L16true, 6#L749true, 50#L740true, 98#true, Black: 72#true, Black: 74#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), Black: 83#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 85#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 79#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0))]) [2024-10-14 19:24:29,144 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-10-14 19:24:29,144 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-10-14 19:24:29,144 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-10-14 19:24:29,144 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-10-14 19:24:29,147 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [Black: 87#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 81#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), 30#writerEXITtrue, 8#L748-4true, 77#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), 16#L16true, 50#L740true, 15#writerEXITtrue, Black: 72#true, 98#true, Black: 74#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), Black: 83#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 85#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 79#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0))]) [2024-10-14 19:24:29,147 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-10-14 19:24:29,148 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-10-14 19:24:29,149 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-10-14 19:24:29,150 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-10-14 19:24:29,150 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [Black: 87#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 81#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), 30#writerEXITtrue, 24#L740true, 8#L748-4true, 59#L721true, 77#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), 50#L740true, 98#true, Black: 72#true, Black: 74#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), Black: 83#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 85#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 79#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0))]) [2024-10-14 19:24:29,151 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-10-14 19:24:29,151 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-10-14 19:24:29,151 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-10-14 19:24:29,151 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-10-14 19:24:29,168 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [Black: 87#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 81#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), 77#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), 16#L16true, 6#L749true, 50#L740true, 15#writerEXITtrue, 28#L721true, Black: 72#true, 98#true, Black: 74#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), Black: 83#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 85#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 79#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0))]) [2024-10-14 19:24:29,169 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-10-14 19:24:29,169 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-10-14 19:24:29,170 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-10-14 19:24:29,170 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-10-14 19:24:29,171 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [Black: 87#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 81#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), 24#L740true, 59#L721true, 77#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), 6#L749true, 50#L740true, 28#L721true, 98#true, Black: 72#true, Black: 74#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), Black: 83#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 85#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 79#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0))]) [2024-10-14 19:24:29,171 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-10-14 19:24:29,171 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-10-14 19:24:29,171 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-10-14 19:24:29,172 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-10-14 19:24:29,173 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [Black: 87#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 81#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), 24#L740true, 8#L748-4true, 77#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), 50#L740true, 15#writerEXITtrue, 28#L721true, Black: 72#true, 98#true, Black: 74#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), Black: 83#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 85#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 79#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0))]) [2024-10-14 19:24:29,174 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-10-14 19:24:29,174 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-10-14 19:24:29,174 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-10-14 19:24:29,174 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-10-14 19:24:29,175 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [Black: 87#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 81#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), 8#L748-4true, 59#L721true, 77#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), 50#L740true, 28#L721true, 98#true, Black: 72#true, 45#readerEXITtrue, Black: 74#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), Black: 83#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 85#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 79#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0))]) [2024-10-14 19:24:29,176 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-10-14 19:24:29,176 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-10-14 19:24:29,176 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-10-14 19:24:29,176 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-10-14 19:24:29,211 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [Black: 87#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 81#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), 30#writerEXITtrue, 77#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), 16#L16true, 6#L749true, 50#L740true, 15#writerEXITtrue, Black: 72#true, 98#true, Black: 74#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), Black: 83#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 85#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 79#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0))]) [2024-10-14 19:24:29,212 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2024-10-14 19:24:29,212 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-10-14 19:24:29,212 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-10-14 19:24:29,212 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-10-14 19:24:29,213 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [Black: 87#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 81#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), 59#L721true, 77#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), 16#L16true, 50#L740true, 54#L749-1true, 98#true, Black: 72#true, Black: 74#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), Black: 83#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 85#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 79#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0))]) [2024-10-14 19:24:29,213 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2024-10-14 19:24:29,214 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-10-14 19:24:29,214 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-10-14 19:24:29,214 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-10-14 19:24:29,214 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [Black: 87#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 81#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), 30#writerEXITtrue, 24#L740true, 59#L721true, 77#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), 6#L749true, 50#L740true, 98#true, Black: 72#true, Black: 74#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), Black: 83#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 85#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 79#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0))]) [2024-10-14 19:24:29,215 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2024-10-14 19:24:29,215 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-10-14 19:24:29,215 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-10-14 19:24:29,215 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-10-14 19:24:29,218 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [Black: 87#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 81#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), 30#writerEXITtrue, 24#L740true, 8#L748-4true, 77#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), 50#L740true, 15#writerEXITtrue, 98#true, Black: 72#true, Black: 74#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), Black: 83#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 85#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 79#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0))]) [2024-10-14 19:24:29,218 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2024-10-14 19:24:29,218 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-10-14 19:24:29,218 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-10-14 19:24:29,218 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-10-14 19:24:29,219 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [Black: 87#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 81#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), 30#writerEXITtrue, 8#L748-4true, 59#L721true, 77#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), 50#L740true, Black: 72#true, 98#true, Black: 74#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), 45#readerEXITtrue, Black: 83#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 85#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 79#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0))]) [2024-10-14 19:24:29,219 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2024-10-14 19:24:29,220 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-10-14 19:24:29,220 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-10-14 19:24:29,220 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-10-14 19:24:29,237 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [Black: 87#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 81#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), 24#L740true, 77#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), 6#L749true, 50#L740true, 15#writerEXITtrue, 28#L721true, Black: 72#true, 98#true, Black: 74#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), Black: 83#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 85#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 79#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0))]) [2024-10-14 19:24:29,237 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2024-10-14 19:24:29,237 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-10-14 19:24:29,238 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-10-14 19:24:29,238 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-10-14 19:24:29,239 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [Black: 87#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 81#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), 59#L721true, 77#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), 6#L749true, 50#L740true, 28#L721true, 98#true, Black: 72#true, 45#readerEXITtrue, Black: 74#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), Black: 83#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 85#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 79#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0))]) [2024-10-14 19:24:29,239 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2024-10-14 19:24:29,239 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-10-14 19:24:29,239 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-10-14 19:24:29,239 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-10-14 19:24:29,242 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [Black: 87#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 81#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), 8#L748-4true, 77#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), 50#L740true, 15#writerEXITtrue, 28#L721true, 98#true, Black: 72#true, 45#readerEXITtrue, Black: 74#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), Black: 83#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 85#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 79#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0))]) [2024-10-14 19:24:29,243 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2024-10-14 19:24:29,243 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-10-14 19:24:29,243 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-10-14 19:24:29,243 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-10-14 19:24:29,266 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [Black: 87#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 81#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), 77#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), 16#L16true, 50#L740true, 54#L749-1true, 15#writerEXITtrue, Black: 72#true, 98#true, Black: 74#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), Black: 83#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 85#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 79#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0))]) [2024-10-14 19:24:29,267 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2024-10-14 19:24:29,267 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-10-14 19:24:29,267 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-10-14 19:24:29,268 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-10-14 19:24:29,268 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [Black: 87#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 81#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), 30#writerEXITtrue, 24#L740true, 77#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), 6#L749true, 50#L740true, 15#writerEXITtrue, 98#true, Black: 72#true, Black: 74#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), Black: 83#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 85#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 79#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0))]) [2024-10-14 19:24:29,268 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2024-10-14 19:24:29,268 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-10-14 19:24:29,269 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-10-14 19:24:29,270 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-10-14 19:24:29,271 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [Black: 87#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 81#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), 24#L740true, 59#L721true, 77#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), 50#L740true, 54#L749-1true, Black: 72#true, 98#true, Black: 74#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), Black: 83#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 85#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 79#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0))]) [2024-10-14 19:24:29,271 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2024-10-14 19:24:29,272 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-10-14 19:24:29,272 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-10-14 19:24:29,272 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-10-14 19:24:29,272 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [Black: 87#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 81#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), 30#writerEXITtrue, 59#L721true, 77#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), 6#L749true, 50#L740true, 98#true, Black: 72#true, 45#readerEXITtrue, Black: 74#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), Black: 83#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 85#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 79#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0))]) [2024-10-14 19:24:29,272 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2024-10-14 19:24:29,272 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-10-14 19:24:29,272 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-10-14 19:24:29,273 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-10-14 19:24:29,275 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [Black: 87#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 81#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), 30#writerEXITtrue, 8#L748-4true, 77#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), 50#L740true, 15#writerEXITtrue, Black: 72#true, 98#true, 45#readerEXITtrue, Black: 74#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), Black: 83#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 85#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 79#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0))]) [2024-10-14 19:24:29,275 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2024-10-14 19:24:29,275 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-10-14 19:24:29,275 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-10-14 19:24:29,276 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-10-14 19:24:29,288 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [Black: 87#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 81#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), 77#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), 6#L749true, 50#L740true, 15#writerEXITtrue, 28#L721true, 98#true, Black: 72#true, 45#readerEXITtrue, Black: 74#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), Black: 83#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 85#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 79#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0))]) [2024-10-14 19:24:29,289 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2024-10-14 19:24:29,289 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-10-14 19:24:29,289 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-10-14 19:24:29,289 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-10-14 19:24:29,301 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [Black: 87#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 81#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), 24#L740true, 77#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), 50#L740true, 54#L749-1true, 15#writerEXITtrue, 98#true, Black: 72#true, Black: 74#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), Black: 83#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 85#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 79#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0))]) [2024-10-14 19:24:29,301 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-10-14 19:24:29,301 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-10-14 19:24:29,301 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-10-14 19:24:29,301 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-10-14 19:24:29,302 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [Black: 87#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 81#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), 30#writerEXITtrue, 77#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), 6#L749true, 50#L740true, 15#writerEXITtrue, 98#true, Black: 72#true, 45#readerEXITtrue, Black: 74#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), Black: 83#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 85#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 79#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0))]) [2024-10-14 19:24:29,302 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-10-14 19:24:29,302 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-10-14 19:24:29,302 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-10-14 19:24:29,302 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-10-14 19:24:29,304 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [Black: 87#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 81#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), 59#L721true, 77#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), 50#L740true, 54#L749-1true, 98#true, Black: 72#true, Black: 74#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), 45#readerEXITtrue, Black: 83#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 85#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 79#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0))]) [2024-10-14 19:24:29,304 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-10-14 19:24:29,304 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-10-14 19:24:29,304 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-10-14 19:24:29,304 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-10-14 19:24:29,319 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [Black: 87#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 81#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), 77#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), 50#L740true, 54#L749-1true, 15#writerEXITtrue, 98#true, Black: 72#true, Black: 74#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), 45#readerEXITtrue, Black: 83#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 85#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 79#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0))]) [2024-10-14 19:24:29,319 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-10-14 19:24:29,319 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-10-14 19:24:29,320 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-10-14 19:24:29,320 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-10-14 19:24:29,336 INFO L124 PetriNetUnfolderBase]: 11121/19209 cut-off events. [2024-10-14 19:24:29,337 INFO L125 PetriNetUnfolderBase]: For 6118/6479 co-relation queries the response was YES. [2024-10-14 19:24:29,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40057 conditions, 19209 events. 11121/19209 cut-off events. For 6118/6479 co-relation queries the response was YES. Maximal size of possible extension queue 1143. Compared 163292 event pairs, 4352 based on Foata normal form. 1102/19533 useless extension candidates. Maximal degree in co-relation 30319. Up to 8376 conditions per place. [2024-10-14 19:24:29,472 INFO L140 encePairwiseOnDemand]: 54/60 looper letters, 44 selfloop transitions, 4 changer transitions 0/99 dead transitions. [2024-10-14 19:24:29,473 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 99 transitions, 453 flow [2024-10-14 19:24:29,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 19:24:29,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 19:24:29,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 130 transitions. [2024-10-14 19:24:29,475 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7222222222222222 [2024-10-14 19:24:29,476 INFO L175 Difference]: Start difference. First operand has 72 places, 80 transitions, 308 flow. Second operand 3 states and 130 transitions. [2024-10-14 19:24:29,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 99 transitions, 453 flow [2024-10-14 19:24:29,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 99 transitions, 453 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-14 19:24:29,582 INFO L231 Difference]: Finished difference. Result has 75 places, 80 transitions, 324 flow [2024-10-14 19:24:29,582 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=308, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=324, PETRI_PLACES=75, PETRI_TRANSITIONS=80} [2024-10-14 19:24:29,583 INFO L277 CegarLoopForPetriNet]: 64 programPoint places, 11 predicate places. [2024-10-14 19:24:29,583 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 80 transitions, 324 flow [2024-10-14 19:24:29,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 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:24:29,584 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:24:29,584 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:24:29,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 19:24:29,584 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-10-14 19:24:29,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:24:29,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1448682112, now seen corresponding path program 2 times [2024-10-14 19:24:29,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:24:29,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456542400] [2024-10-14 19:24:29,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:24:29,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:24:29,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:24:29,699 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:24:29,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:24:29,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456542400] [2024-10-14 19:24:29,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456542400] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:24:29,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:24:29,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 19:24:29,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129124124] [2024-10-14 19:24:29,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:24:29,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:24:29,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:24:29,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:24:29,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:24:29,702 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 60 [2024-10-14 19:24:29,703 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 80 transitions, 324 flow. Second operand has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 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:24:29,703 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:24:29,703 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 60 [2024-10-14 19:24:29,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:24:30,893 INFO L124 PetriNetUnfolderBase]: 6415/12244 cut-off events. [2024-10-14 19:24:30,894 INFO L125 PetriNetUnfolderBase]: For 6169/6306 co-relation queries the response was YES. [2024-10-14 19:24:30,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26891 conditions, 12244 events. 6415/12244 cut-off events. For 6169/6306 co-relation queries the response was YES. Maximal size of possible extension queue 817. Compared 106466 event pairs, 1785 based on Foata normal form. 305/12221 useless extension candidates. Maximal degree in co-relation 21047. Up to 4096 conditions per place. [2024-10-14 19:24:30,984 INFO L140 encePairwiseOnDemand]: 53/60 looper letters, 61 selfloop transitions, 9 changer transitions 0/123 dead transitions. [2024-10-14 19:24:30,985 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 123 transitions, 587 flow [2024-10-14 19:24:30,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 19:24:30,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-14 19:24:30,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 184 transitions. [2024-10-14 19:24:30,987 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7666666666666667 [2024-10-14 19:24:30,987 INFO L175 Difference]: Start difference. First operand has 75 places, 80 transitions, 324 flow. Second operand 4 states and 184 transitions. [2024-10-14 19:24:30,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 123 transitions, 587 flow [2024-10-14 19:24:31,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 123 transitions, 575 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 19:24:31,101 INFO L231 Difference]: Finished difference. Result has 79 places, 88 transitions, 390 flow [2024-10-14 19:24:31,101 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=390, PETRI_PLACES=79, PETRI_TRANSITIONS=88} [2024-10-14 19:24:31,102 INFO L277 CegarLoopForPetriNet]: 64 programPoint places, 15 predicate places. [2024-10-14 19:24:31,102 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 88 transitions, 390 flow [2024-10-14 19:24:31,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 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:24:31,102 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:24:31,103 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:24:31,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 19:24:31,103 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-10-14 19:24:31,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:24:31,104 INFO L85 PathProgramCache]: Analyzing trace with hash 694497925, now seen corresponding path program 1 times [2024-10-14 19:24:31,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:24:31,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061779031] [2024-10-14 19:24:31,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:24:31,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:24:31,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:24:31,197 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:24:31,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:24:31,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061779031] [2024-10-14 19:24:31,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061779031] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:24:31,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:24:31,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 19:24:31,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908212133] [2024-10-14 19:24:31,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:24:31,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 19:24:31,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:24:31,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 19:24:31,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 19:24:31,233 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 60 [2024-10-14 19:24:31,234 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 88 transitions, 390 flow. Second operand has 6 states, 6 states have (on average 22.5) internal successors, (135), 6 states have internal predecessors, (135), 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:24:31,235 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:24:31,235 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 60 [2024-10-14 19:24:31,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:24:33,028 INFO L124 PetriNetUnfolderBase]: 14821/23959 cut-off events. [2024-10-14 19:24:33,029 INFO L125 PetriNetUnfolderBase]: For 21829/22268 co-relation queries the response was YES. [2024-10-14 19:24:33,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61630 conditions, 23959 events. 14821/23959 cut-off events. For 21829/22268 co-relation queries the response was YES. Maximal size of possible extension queue 1212. Compared 180380 event pairs, 2430 based on Foata normal form. 378/24039 useless extension candidates. Maximal degree in co-relation 52329. Up to 5430 conditions per place. [2024-10-14 19:24:33,178 INFO L140 encePairwiseOnDemand]: 50/60 looper letters, 203 selfloop transitions, 63 changer transitions 0/286 dead transitions. [2024-10-14 19:24:33,178 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 286 transitions, 1786 flow [2024-10-14 19:24:33,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 19:24:33,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-10-14 19:24:33,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 410 transitions. [2024-10-14 19:24:33,181 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6212121212121212 [2024-10-14 19:24:33,181 INFO L175 Difference]: Start difference. First operand has 79 places, 88 transitions, 390 flow. Second operand 11 states and 410 transitions. [2024-10-14 19:24:33,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 286 transitions, 1786 flow [2024-10-14 19:24:33,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 286 transitions, 1786 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-14 19:24:33,490 INFO L231 Difference]: Finished difference. Result has 97 places, 141 transitions, 950 flow [2024-10-14 19:24:33,491 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=390, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=950, PETRI_PLACES=97, PETRI_TRANSITIONS=141} [2024-10-14 19:24:33,491 INFO L277 CegarLoopForPetriNet]: 64 programPoint places, 33 predicate places. [2024-10-14 19:24:33,491 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 141 transitions, 950 flow [2024-10-14 19:24:33,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 6 states have internal predecessors, (135), 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:24:33,492 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:24:33,492 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:24:33,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 19:24:33,493 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-10-14 19:24:33,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:24:33,493 INFO L85 PathProgramCache]: Analyzing trace with hash -179792158, now seen corresponding path program 1 times [2024-10-14 19:24:33,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:24:33,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561532066] [2024-10-14 19:24:33,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:24:33,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:24:33,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:24:33,588 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:24:33,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:24:33,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561532066] [2024-10-14 19:24:33,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561532066] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:24:33,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:24:33,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 19:24:33,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091022099] [2024-10-14 19:24:33,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:24:33,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 19:24:33,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:24:33,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 19:24:33,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 19:24:33,625 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 60 [2024-10-14 19:24:33,626 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 141 transitions, 950 flow. Second operand has 6 states, 6 states have (on average 23.0) internal successors, (138), 6 states have internal predecessors, (138), 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:24:33,626 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:24:33,626 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 60 [2024-10-14 19:24:33,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:24:35,729 INFO L124 PetriNetUnfolderBase]: 14830/23804 cut-off events. [2024-10-14 19:24:35,730 INFO L125 PetriNetUnfolderBase]: For 37865/38088 co-relation queries the response was YES. [2024-10-14 19:24:35,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71421 conditions, 23804 events. 14830/23804 cut-off events. For 37865/38088 co-relation queries the response was YES. Maximal size of possible extension queue 1163. Compared 177318 event pairs, 2456 based on Foata normal form. 322/24019 useless extension candidates. Maximal degree in co-relation 62631. Up to 6361 conditions per place. [2024-10-14 19:24:36,046 INFO L140 encePairwiseOnDemand]: 50/60 looper letters, 182 selfloop transitions, 76 changer transitions 0/278 dead transitions. [2024-10-14 19:24:36,048 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 278 transitions, 2129 flow [2024-10-14 19:24:36,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 19:24:36,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-10-14 19:24:36,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 365 transitions. [2024-10-14 19:24:36,051 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6083333333333333 [2024-10-14 19:24:36,051 INFO L175 Difference]: Start difference. First operand has 97 places, 141 transitions, 950 flow. Second operand 10 states and 365 transitions. [2024-10-14 19:24:36,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 278 transitions, 2129 flow [2024-10-14 19:24:36,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 278 transitions, 2127 flow, removed 1 selfloop flow, removed 0 redundant places. [2024-10-14 19:24:36,528 INFO L231 Difference]: Finished difference. Result has 111 places, 158 transitions, 1347 flow [2024-10-14 19:24:36,528 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=948, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1347, PETRI_PLACES=111, PETRI_TRANSITIONS=158} [2024-10-14 19:24:36,529 INFO L277 CegarLoopForPetriNet]: 64 programPoint places, 47 predicate places. [2024-10-14 19:24:36,529 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 158 transitions, 1347 flow [2024-10-14 19:24:36,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.0) internal successors, (138), 6 states have internal predecessors, (138), 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:24:36,529 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:24:36,529 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:24:36,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 19:24:36,530 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-10-14 19:24:36,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:24:36,531 INFO L85 PathProgramCache]: Analyzing trace with hash -906541507, now seen corresponding path program 1 times [2024-10-14 19:24:36,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:24:36,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933108866] [2024-10-14 19:24:36,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:24:36,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:24:36,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:24:36,592 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:24:36,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:24:36,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933108866] [2024-10-14 19:24:36,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933108866] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:24:36,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:24:36,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 19:24:36,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426948411] [2024-10-14 19:24:36,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:24:36,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 19:24:36,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:24:36,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 19:24:36,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 19:24:36,622 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 60 [2024-10-14 19:24:36,622 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 158 transitions, 1347 flow. Second operand has 6 states, 6 states have (on average 23.0) internal successors, (138), 6 states have internal predecessors, (138), 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:24:36,622 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:24:36,623 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 60 [2024-10-14 19:24:36,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:24:38,705 INFO L124 PetriNetUnfolderBase]: 14937/23884 cut-off events. [2024-10-14 19:24:38,705 INFO L125 PetriNetUnfolderBase]: For 56713/57082 co-relation queries the response was YES. [2024-10-14 19:24:38,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75545 conditions, 23884 events. 14937/23884 cut-off events. For 56713/57082 co-relation queries the response was YES. Maximal size of possible extension queue 1142. Compared 175227 event pairs, 2302 based on Foata normal form. 464/24238 useless extension candidates. Maximal degree in co-relation 67993. Up to 6137 conditions per place. [2024-10-14 19:24:38,874 INFO L140 encePairwiseOnDemand]: 50/60 looper letters, 195 selfloop transitions, 86 changer transitions 0/307 dead transitions. [2024-10-14 19:24:38,874 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 307 transitions, 2643 flow [2024-10-14 19:24:38,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 19:24:38,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-10-14 19:24:38,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 375 transitions. [2024-10-14 19:24:38,876 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.625 [2024-10-14 19:24:38,876 INFO L175 Difference]: Start difference. First operand has 111 places, 158 transitions, 1347 flow. Second operand 10 states and 375 transitions. [2024-10-14 19:24:38,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 307 transitions, 2643 flow [2024-10-14 19:24:39,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 307 transitions, 2634 flow, removed 2 selfloop flow, removed 1 redundant places. [2024-10-14 19:24:39,725 INFO L231 Difference]: Finished difference. Result has 124 places, 176 transitions, 1816 flow [2024-10-14 19:24:39,725 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1338, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1816, PETRI_PLACES=124, PETRI_TRANSITIONS=176} [2024-10-14 19:24:39,726 INFO L277 CegarLoopForPetriNet]: 64 programPoint places, 60 predicate places. [2024-10-14 19:24:39,726 INFO L471 AbstractCegarLoop]: Abstraction has has 124 places, 176 transitions, 1816 flow [2024-10-14 19:24:39,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.0) internal successors, (138), 6 states have internal predecessors, (138), 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:24:39,727 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:24:39,727 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:24:39,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 19:24:39,727 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-10-14 19:24:39,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:24:39,728 INFO L85 PathProgramCache]: Analyzing trace with hash 393231477, now seen corresponding path program 1 times [2024-10-14 19:24:39,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:24:39,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457281436] [2024-10-14 19:24:39,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:24:39,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:24:39,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:24:39,837 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:24:39,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:24:39,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457281436] [2024-10-14 19:24:39,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457281436] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:24:39,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:24:39,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 19:24:39,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082814634] [2024-10-14 19:24:39,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:24:39,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 19:24:39,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:24:39,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 19:24:39,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 19:24:39,841 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 60 [2024-10-14 19:24:39,841 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 176 transitions, 1816 flow. Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 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:24:39,841 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:24:39,841 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 60 [2024-10-14 19:24:39,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:24:41,333 INFO L124 PetriNetUnfolderBase]: 6885/13955 cut-off events. [2024-10-14 19:24:41,333 INFO L125 PetriNetUnfolderBase]: For 37349/38058 co-relation queries the response was YES. [2024-10-14 19:24:41,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43596 conditions, 13955 events. 6885/13955 cut-off events. For 37349/38058 co-relation queries the response was YES. Maximal size of possible extension queue 820. Compared 128742 event pairs, 2013 based on Foata normal form. 694/14383 useless extension candidates. Maximal degree in co-relation 41861. Up to 3918 conditions per place. [2024-10-14 19:24:41,417 INFO L140 encePairwiseOnDemand]: 53/60 looper letters, 59 selfloop transitions, 15 changer transitions 0/185 dead transitions. [2024-10-14 19:24:41,417 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 185 transitions, 1594 flow [2024-10-14 19:24:41,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 19:24:41,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-14 19:24:41,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 214 transitions. [2024-10-14 19:24:41,418 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7133333333333334 [2024-10-14 19:24:41,418 INFO L175 Difference]: Start difference. First operand has 124 places, 176 transitions, 1816 flow. Second operand 5 states and 214 transitions. [2024-10-14 19:24:41,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 185 transitions, 1594 flow [2024-10-14 19:24:41,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 185 transitions, 1483 flow, removed 6 selfloop flow, removed 7 redundant places. [2024-10-14 19:24:41,832 INFO L231 Difference]: Finished difference. Result has 122 places, 152 transitions, 1305 flow [2024-10-14 19:24:41,832 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1225, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1305, PETRI_PLACES=122, PETRI_TRANSITIONS=152} [2024-10-14 19:24:41,833 INFO L277 CegarLoopForPetriNet]: 64 programPoint places, 58 predicate places. [2024-10-14 19:24:41,833 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 152 transitions, 1305 flow [2024-10-14 19:24:41,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 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:24:41,833 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:24:41,833 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:24:41,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 19:24:41,833 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-10-14 19:24:41,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:24:41,834 INFO L85 PathProgramCache]: Analyzing trace with hash -941850979, now seen corresponding path program 2 times [2024-10-14 19:24:41,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:24:41,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763321665] [2024-10-14 19:24:41,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:24:41,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:24:41,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:24:41,908 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:24:41,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:24:41,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763321665] [2024-10-14 19:24:41,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763321665] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:24:41,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:24:41,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 19:24:41,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121994913] [2024-10-14 19:24:41,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:24:41,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 19:24:41,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:24:41,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 19:24:41,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 19:24:41,910 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 60 [2024-10-14 19:24:41,910 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 152 transitions, 1305 flow. Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 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:24:41,910 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:24:41,911 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 60 [2024-10-14 19:24:41,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:24:42,816 INFO L124 PetriNetUnfolderBase]: 4904/10164 cut-off events. [2024-10-14 19:24:42,816 INFO L125 PetriNetUnfolderBase]: For 23182/23874 co-relation queries the response was YES. [2024-10-14 19:24:42,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32684 conditions, 10164 events. 4904/10164 cut-off events. For 23182/23874 co-relation queries the response was YES. Maximal size of possible extension queue 459. Compared 88215 event pairs, 1234 based on Foata normal form. 483/10511 useless extension candidates. Maximal degree in co-relation 31964. Up to 2756 conditions per place. [2024-10-14 19:24:42,878 INFO L140 encePairwiseOnDemand]: 53/60 looper letters, 60 selfloop transitions, 17 changer transitions 0/148 dead transitions. [2024-10-14 19:24:42,878 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 148 transitions, 1120 flow [2024-10-14 19:24:42,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 19:24:42,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-14 19:24:42,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 215 transitions. [2024-10-14 19:24:42,879 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7166666666666667 [2024-10-14 19:24:42,880 INFO L175 Difference]: Start difference. First operand has 122 places, 152 transitions, 1305 flow. Second operand 5 states and 215 transitions. [2024-10-14 19:24:42,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 148 transitions, 1120 flow [2024-10-14 19:24:42,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 148 transitions, 976 flow, removed 12 selfloop flow, removed 19 redundant places. [2024-10-14 19:24:42,990 INFO L231 Difference]: Finished difference. Result has 101 places, 110 transitions, 765 flow [2024-10-14 19:24:42,990 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=715, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=765, PETRI_PLACES=101, PETRI_TRANSITIONS=110} [2024-10-14 19:24:42,991 INFO L277 CegarLoopForPetriNet]: 64 programPoint places, 37 predicate places. [2024-10-14 19:24:42,991 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 110 transitions, 765 flow [2024-10-14 19:24:42,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 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:24:42,992 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:24:42,992 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:24:42,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 19:24:42,992 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-10-14 19:24:42,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:24:42,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1167592489, now seen corresponding path program 1 times [2024-10-14 19:24:42,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:24:42,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86452619] [2024-10-14 19:24:42,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:24:42,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:24:43,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:24:43,066 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:24:43,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:24:43,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86452619] [2024-10-14 19:24:43,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86452619] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:24:43,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:24:43,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-14 19:24:43,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768136766] [2024-10-14 19:24:43,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:24:43,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 19:24:43,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:24:43,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 19:24:43,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:24:43,070 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 60 [2024-10-14 19:24:43,071 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 110 transitions, 765 flow. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 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:24:43,071 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:24:43,071 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 60 [2024-10-14 19:24:43,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:24:43,793 INFO L124 PetriNetUnfolderBase]: 4988/9509 cut-off events. [2024-10-14 19:24:43,793 INFO L125 PetriNetUnfolderBase]: For 23022/23711 co-relation queries the response was YES. [2024-10-14 19:24:43,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29371 conditions, 9509 events. 4988/9509 cut-off events. For 23022/23711 co-relation queries the response was YES. Maximal size of possible extension queue 427. Compared 76412 event pairs, 4259 based on Foata normal form. 81/9252 useless extension candidates. Maximal degree in co-relation 7284. Up to 7282 conditions per place. [2024-10-14 19:24:43,832 INFO L140 encePairwiseOnDemand]: 58/60 looper letters, 0 selfloop transitions, 0 changer transitions 109/109 dead transitions. [2024-10-14 19:24:43,832 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 109 transitions, 841 flow [2024-10-14 19:24:43,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 19:24:43,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 19:24:43,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 107 transitions. [2024-10-14 19:24:43,833 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5944444444444444 [2024-10-14 19:24:43,834 INFO L175 Difference]: Start difference. First operand has 101 places, 110 transitions, 765 flow. Second operand 3 states and 107 transitions. [2024-10-14 19:24:43,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 109 transitions, 841 flow [2024-10-14 19:24:43,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 109 transitions, 819 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-10-14 19:24:43,865 INFO L231 Difference]: Finished difference. Result has 100 places, 0 transitions, 0 flow [2024-10-14 19:24:43,865 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=741, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=100, PETRI_TRANSITIONS=0} [2024-10-14 19:24:43,866 INFO L277 CegarLoopForPetriNet]: 64 programPoint places, 36 predicate places. [2024-10-14 19:24:43,866 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 0 transitions, 0 flow [2024-10-14 19:24:43,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 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:24:43,869 INFO L782 garLoopResultBuilder]: Registering result SAFE for location readerErr0ASSERT_VIOLATIONMEMORY_LEAK (7 of 8 remaining) [2024-10-14 19:24:43,869 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 8 remaining) [2024-10-14 19:24:43,869 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 8 remaining) [2024-10-14 19:24:43,870 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 8 remaining) [2024-10-14 19:24:43,870 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 8 remaining) [2024-10-14 19:24:43,870 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 8 remaining) [2024-10-14 19:24:43,870 INFO L782 garLoopResultBuilder]: Registering result SAFE for location readerErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 8 remaining) [2024-10-14 19:24:43,870 INFO L782 garLoopResultBuilder]: Registering result SAFE for location readerErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 8 remaining) [2024-10-14 19:24:43,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 19:24:43,871 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1] [2024-10-14 19:24:43,876 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-14 19:24:43,876 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 19:24:43,880 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 07:24:43 BasicIcfg [2024-10-14 19:24:43,880 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 19:24:43,881 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 19:24:43,881 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 19:24:43,881 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 19:24:43,882 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:24:23" (3/4) ... [2024-10-14 19:24:43,884 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-14 19:24:43,886 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure reader [2024-10-14 19:24:43,887 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure writer [2024-10-14 19:24:43,890 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 42 nodes and edges [2024-10-14 19:24:43,891 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-10-14 19:24:43,892 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-14 19:24:43,892 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-14 19:24:43,972 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 19:24:43,972 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-14 19:24:43,972 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 19:24:43,973 INFO L158 Benchmark]: Toolchain (without parser) took 21522.93ms. Allocated memory was 138.4MB in the beginning and 10.0GB in the end (delta: 9.9GB). Free memory was 85.1MB in the beginning and 8.8GB in the end (delta: -8.7GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2024-10-14 19:24:43,973 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 138.4MB. Free memory is still 101.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 19:24:43,974 INFO L158 Benchmark]: CACSL2BoogieTranslator took 530.55ms. Allocated memory is still 138.4MB. Free memory was 84.7MB in the beginning and 63.7MB in the end (delta: 21.1MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-14 19:24:43,974 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.23ms. Allocated memory is still 138.4MB. Free memory was 63.7MB in the beginning and 61.3MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 19:24:43,974 INFO L158 Benchmark]: Boogie Preprocessor took 39.91ms. Allocated memory is still 138.4MB. Free memory was 61.3MB in the beginning and 59.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 19:24:43,975 INFO L158 Benchmark]: RCFGBuilder took 453.50ms. Allocated memory was 138.4MB in the beginning and 199.2MB in the end (delta: 60.8MB). Free memory was 59.2MB in the beginning and 154.5MB in the end (delta: -95.3MB). Peak memory consumption was 14.5MB. Max. memory is 16.1GB. [2024-10-14 19:24:43,975 INFO L158 Benchmark]: TraceAbstraction took 20349.88ms. Allocated memory was 199.2MB in the beginning and 10.0GB in the end (delta: 9.8GB). Free memory was 154.5MB in the beginning and 8.8GB in the end (delta: -8.6GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2024-10-14 19:24:43,975 INFO L158 Benchmark]: Witness Printer took 91.75ms. Allocated memory is still 10.0GB. Free memory was 8.8GB in the beginning and 8.8GB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 19:24:43,977 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24ms. Allocated memory is still 138.4MB. Free memory is still 101.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 530.55ms. Allocated memory is still 138.4MB. Free memory was 84.7MB in the beginning and 63.7MB in the end (delta: 21.1MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.23ms. Allocated memory is still 138.4MB. Free memory was 63.7MB in the beginning and 61.3MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.91ms. Allocated memory is still 138.4MB. Free memory was 61.3MB in the beginning and 59.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 453.50ms. Allocated memory was 138.4MB in the beginning and 199.2MB in the end (delta: 60.8MB). Free memory was 59.2MB in the beginning and 154.5MB in the end (delta: -95.3MB). Peak memory consumption was 14.5MB. Max. memory is 16.1GB. * TraceAbstraction took 20349.88ms. Allocated memory was 199.2MB in the beginning and 10.0GB in the end (delta: 9.8GB). Free memory was 154.5MB in the beginning and 8.8GB in the end (delta: -8.6GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. * Witness Printer took 91.75ms. Allocated memory is still 10.0GB. Free memory was 8.8GB in the beginning and 8.8GB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 16]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 743]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 81 locations, 8 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 20.2s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 19.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 782 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 744 mSDsluCounter, 166 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 105 mSDsCounter, 41 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2105 IncrementalHoareTripleChecker+Invalid, 2146 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 41 mSolverCounterUnsat, 61 mSDtfsCounter, 2105 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 65 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1816occurred in iteration=6, InterpolantAutomatonStates: 62, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 203 NumberOfCodeBlocks, 203 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 194 ConstructedInterpolants, 0 QuantifiedInterpolants, 412 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-10-14 19:24:44,006 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE