./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-atomic/read_write_lock-2.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-05-07_14-17-48.files/protection/read_write_lock-2.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b44c8288 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/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-atomic/read_write_lock-2.i ./goblint.2024-05-07_14-17-48.files/protection/read_write_lock-2.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-wip.fs.witness-ghost-b44c828-m [2024-05-12 12:58:12,217 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-12 12:58:12,285 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-05-12 12:58:12,289 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-12 12:58:12,289 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-12 12:58:12,305 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-12 12:58:12,306 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-12 12:58:12,307 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-12 12:58:12,308 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-05-12 12:58:12,311 INFO L153 SettingsManager]: * Use memory slicer=true [2024-05-12 12:58:12,312 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-12 12:58:12,312 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-12 12:58:12,313 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-12 12:58:12,314 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-12 12:58:12,315 INFO L153 SettingsManager]: * Use SBE=true [2024-05-12 12:58:12,315 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-12 12:58:12,315 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-12 12:58:12,315 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-12 12:58:12,316 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-12 12:58:12,316 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-12 12:58:12,316 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-12 12:58:12,316 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-12 12:58:12,317 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-12 12:58:12,317 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-12 12:58:12,317 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-05-12 12:58:12,317 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-12 12:58:12,317 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-12 12:58:12,318 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-12 12:58:12,318 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-12 12:58:12,319 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-12 12:58:12,320 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-05-12 12:58:12,320 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-12 12:58:12,320 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-05-12 12:58:12,320 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-12 12:58:12,320 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-12 12:58:12,321 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-12 12:58:12,321 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-12 12:58:12,321 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-12 12:58:12,321 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-12 12:58:12,321 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-05-12 12:58:12,321 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-12 12:58:12,322 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-05-12 12:58:12,322 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-05-12 12:58:12,323 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.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-05-12 12:58:12,583 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-12 12:58:12,610 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-12 12:58:12,612 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-12 12:58:12,613 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-12 12:58:12,614 INFO L274 PluginConnector]: CDTParser initialized [2024-05-12 12:58:12,615 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-atomic/read_write_lock-2.i [2024-05-12 12:58:13,664 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-12 12:58:13,868 INFO L384 CDTParser]: Found 1 translation units. [2024-05-12 12:58:13,868 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/read_write_lock-2.i [2024-05-12 12:58:13,877 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f730737a/6f89e7386b644d828a28a12dbb01ae36/FLAG7898833fe [2024-05-12 12:58:13,887 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f730737a/6f89e7386b644d828a28a12dbb01ae36 [2024-05-12 12:58:13,888 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-05-12 12:58:13,889 INFO L274 PluginConnector]: Witness Parser initialized [2024-05-12 12:58:13,889 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-05-07_14-17-48.files/protection/read_write_lock-2.yml/witness.yml [2024-05-12 12:58:13,987 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-12 12:58:13,988 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-12 12:58:13,989 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-12 12:58:13,989 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-12 12:58:14,002 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-12 12:58:14,003 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.05 12:58:13" (1/2) ... [2024-05-12 12:58:14,004 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@447ed43a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:58:14, skipping insertion in model container [2024-05-12 12:58:14,004 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.05 12:58:13" (1/2) ... [2024-05-12 12:58:14,005 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@6ef0bf27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:58:14, skipping insertion in model container [2024-05-12 12:58:14,005 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 12:58:13" (2/2) ... [2024-05-12 12:58:14,005 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@447ed43a and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 12:58:14, skipping insertion in model container [2024-05-12 12:58:14,005 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 12:58:13" (2/2) ... [2024-05-12 12:58:14,005 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-05-12 12:58:14,035 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-05-12 12:58:14,036 INFO L97 edCorrectnessWitness]: Location invariant before [L753-L753] ((! multithreaded || ((0 <= w && w <= 1) && (w == 0 || w == 1))) && (! multithreaded || ((((0 <= x && x <= 3) && x <= 127) && x % 3 == 0) && (x == 0 || x == 3)))) && (! multithreaded || ((((0 <= y && y <= 3) && y <= 127) && y % 3 == 0) && (y == 0 || y == 3))) [2024-05-12 12:58:14,036 INFO L97 edCorrectnessWitness]: Location invariant before [L751-L751] ((! multithreaded || ((0 <= w && w <= 1) && (w == 0 || w == 1))) && (! multithreaded || ((((0 <= x && x <= 3) && x <= 127) && x % 3 == 0) && (x == 0 || x == 3)))) && (! multithreaded || ((((0 <= y && y <= 3) && y <= 127) && y % 3 == 0) && (y == 0 || y == 3))) [2024-05-12 12:58:14,036 INFO L97 edCorrectnessWitness]: Location invariant before [L752-L752] ((! multithreaded || ((0 <= w && w <= 1) && (w == 0 || w == 1))) && (! multithreaded || ((((0 <= x && x <= 3) && x <= 127) && x % 3 == 0) && (x == 0 || x == 3)))) && (! multithreaded || ((((0 <= y && y <= 3) && y <= 127) && y % 3 == 0) && (y == 0 || y == 3))) [2024-05-12 12:58:14,036 INFO L97 edCorrectnessWitness]: Location invariant before [L750-L750] ((! multithreaded || ((0 <= w && w <= 1) && (w == 0 || w == 1))) && (! multithreaded || ((((0 <= x && x <= 3) && x <= 127) && x % 3 == 0) && (x == 0 || x == 3)))) && (! multithreaded || ((((0 <= y && y <= 3) && y <= 127) && y % 3 == 0) && (y == 0 || y == 3))) [2024-05-12 12:58:14,036 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-05-12 12:58:14,037 INFO L106 edCorrectnessWitness]: ghost_update [L749-L749] multithreaded = 1; [2024-05-12 12:58:14,070 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-12 12:58:14,302 WARN L246 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/read_write_lock-2.i[31244,31257] [2024-05-12 12:58:14,316 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-05-12 12:58:14,329 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-05-12 12:58:14,397 WARN L246 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/read_write_lock-2.i[31244,31257] Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-05-12 12:58:14,414 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-05-12 12:58:14,438 INFO L206 MainTranslator]: Completed translation [2024-05-12 12:58:14,439 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 12:58:14 WrapperNode [2024-05-12 12:58:14,439 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-12 12:58:14,440 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-12 12:58:14,440 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-12 12:58:14,440 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-12 12:58:14,445 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 12:58:14" (1/1) ... [2024-05-12 12:58:14,467 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 12:58:14" (1/1) ... [2024-05-12 12:58:14,544 INFO L138 Inliner]: procedures = 173, calls = 50, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 125 [2024-05-12 12:58:14,556 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-12 12:58:14,556 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-12 12:58:14,557 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-12 12:58:14,557 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-12 12:58:14,565 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 12:58:14" (1/1) ... [2024-05-12 12:58:14,565 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 12:58:14" (1/1) ... [2024-05-12 12:58:14,567 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 12:58:14" (1/1) ... [2024-05-12 12:58:14,577 INFO L175 MemorySlicer]: Split 10 memory accesses to 5 slices as follows [2, 2, 2, 2, 2]. 20 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0]. The 4 writes are split as follows [0, 1, 1, 1, 1]. [2024-05-12 12:58:14,577 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 12:58:14" (1/1) ... [2024-05-12 12:58:14,577 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 12:58:14" (1/1) ... [2024-05-12 12:58:14,582 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 12:58:14" (1/1) ... [2024-05-12 12:58:14,583 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 12:58:14" (1/1) ... [2024-05-12 12:58:14,584 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 12:58:14" (1/1) ... [2024-05-12 12:58:14,585 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 12:58:14" (1/1) ... [2024-05-12 12:58:14,590 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-12 12:58:14,591 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-12 12:58:14,591 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-12 12:58:14,591 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-12 12:58:14,592 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 12:58:14" (1/1) ... [2024-05-12 12:58:14,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-05-12 12:58:14,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-05-12 12:58:14,622 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-05-12 12:58:14,630 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-05-12 12:58:14,649 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-05-12 12:58:14,650 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-05-12 12:58:14,650 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-05-12 12:58:14,650 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-05-12 12:58:14,650 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-05-12 12:58:14,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-05-12 12:58:14,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-05-12 12:58:14,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-05-12 12:58:14,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-05-12 12:58:14,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-05-12 12:58:14,651 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-12 12:58:14,651 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-12 12:58:14,651 INFO L130 BoogieDeclarations]: Found specification of procedure reader [2024-05-12 12:58:14,651 INFO L138 BoogieDeclarations]: Found implementation of procedure reader [2024-05-12 12:58:14,653 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-12 12:58:14,654 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-12 12:58:14,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-05-12 12:58:14,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-05-12 12:58:14,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-05-12 12:58:14,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-05-12 12:58:14,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-05-12 12:58:14,655 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-12 12:58:14,655 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-12 12:58:14,656 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-12 12:58:14,656 INFO L130 BoogieDeclarations]: Found specification of procedure writer [2024-05-12 12:58:14,656 INFO L138 BoogieDeclarations]: Found implementation of procedure writer [2024-05-12 12:58:14,657 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-12 12:58:14,766 INFO L244 CfgBuilder]: Building ICFG [2024-05-12 12:58:14,768 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-12 12:58:14,990 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-05-12 12:58:14,990 INFO L293 CfgBuilder]: Performing block encoding [2024-05-12 12:58:15,091 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-12 12:58:15,092 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-05-12 12:58:15,092 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.05 12:58:15 BoogieIcfgContainer [2024-05-12 12:58:15,092 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-12 12:58:15,095 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-12 12:58:15,096 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-12 12:58:15,098 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-12 12:58:15,098 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.05 12:58:13" (1/4) ... [2024-05-12 12:58:15,099 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3906a1fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.05 12:58:15, skipping insertion in model container [2024-05-12 12:58:15,100 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 12:58:13" (2/4) ... [2024-05-12 12:58:15,100 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3906a1fa and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 12.05 12:58:15, skipping insertion in model container [2024-05-12 12:58:15,100 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 12:58:14" (3/4) ... [2024-05-12 12:58:15,101 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3906a1fa and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 12.05 12:58:15, skipping insertion in model container [2024-05-12 12:58:15,101 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.05 12:58:15" (4/4) ... [2024-05-12 12:58:15,102 INFO L112 eAbstractionObserver]: Analyzing ICFG read_write_lock-2.i [2024-05-12 12:58:15,116 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-12 12:58:15,116 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2024-05-12 12:58:15,116 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-12 12:58:15,180 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-05-12 12:58:15,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 67 transitions, 162 flow [2024-05-12 12:58:15,251 INFO L124 PetriNetUnfolderBase]: 2/63 cut-off events. [2024-05-12 12:58:15,252 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-05-12 12:58:15,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80 conditions, 63 events. 2/63 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 116 event pairs, 0 based on Foata normal form. 0/55 useless extension candidates. Maximal degree in co-relation 57. Up to 2 conditions per place. [2024-05-12 12:58:15,255 INFO L82 GeneralOperation]: Start removeDead. Operand has 78 places, 67 transitions, 162 flow [2024-05-12 12:58:15,258 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 72 places, 61 transitions, 143 flow [2024-05-12 12:58:15,266 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-12 12:58:15,273 INFO L357 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, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6606b6a8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-12 12:58:15,274 INFO L358 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2024-05-12 12:58:15,277 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-05-12 12:58:15,277 INFO L124 PetriNetUnfolderBase]: 0/7 cut-off events. [2024-05-12 12:58:15,277 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-05-12 12:58:15,277 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:58:15,278 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-05-12 12:58:15,278 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-05-12 12:58:15,281 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:58:15,282 INFO L85 PathProgramCache]: Analyzing trace with hash -780391112, now seen corresponding path program 1 times [2024-05-12 12:58:15,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:58:15,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131053611] [2024-05-12 12:58:15,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:58:15,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:58:15,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:58:15,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:58:15,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:58:15,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131053611] [2024-05-12 12:58:15,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131053611] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:58:15,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:58:15,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-05-12 12:58:15,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440151820] [2024-05-12 12:58:15,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:58:15,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-12 12:58:15,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:58:15,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-12 12:58:15,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-12 12:58:15,901 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 67 [2024-05-12 12:58:15,903 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 61 transitions, 143 flow. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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-05-12 12:58:15,903 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:58:15,903 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 67 [2024-05-12 12:58:15,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:58:16,987 INFO L124 PetriNetUnfolderBase]: 5921/11137 cut-off events. [2024-05-12 12:58:16,989 INFO L125 PetriNetUnfolderBase]: For 404/404 co-relation queries the response was YES. [2024-05-12 12:58:17,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19652 conditions, 11137 events. 5921/11137 cut-off events. For 404/404 co-relation queries the response was YES. Maximal size of possible extension queue 536. Compared 90921 event pairs, 2748 based on Foata normal form. 617/10552 useless extension candidates. Maximal degree in co-relation 19308. Up to 8084 conditions per place. [2024-05-12 12:58:17,059 INFO L140 encePairwiseOnDemand]: 56/67 looper letters, 53 selfloop transitions, 5 changer transitions 0/78 dead transitions. [2024-05-12 12:58:17,059 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 78 transitions, 302 flow [2024-05-12 12:58:17,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-12 12:58:17,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-05-12 12:58:17,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 136 transitions. [2024-05-12 12:58:17,070 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6766169154228856 [2024-05-12 12:58:17,072 INFO L175 Difference]: Start difference. First operand has 72 places, 61 transitions, 143 flow. Second operand 3 states and 136 transitions. [2024-05-12 12:58:17,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 78 transitions, 302 flow [2024-05-12 12:58:17,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 78 transitions, 284 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-05-12 12:58:17,087 INFO L231 Difference]: Finished difference. Result has 68 places, 63 transitions, 165 flow [2024-05-12 12:58:17,089 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=165, PETRI_PLACES=68, PETRI_TRANSITIONS=63} [2024-05-12 12:58:17,092 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -4 predicate places. [2024-05-12 12:58:17,092 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 63 transitions, 165 flow [2024-05-12 12:58:17,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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-05-12 12:58:17,092 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:58:17,093 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:58:17,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-12 12:58:17,094 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-05-12 12:58:17,094 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:58:17,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1663498967, now seen corresponding path program 1 times [2024-05-12 12:58:17,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:58:17,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316238814] [2024-05-12 12:58:17,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:58:17,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:58:17,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:58:17,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:58:17,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:58:17,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316238814] [2024-05-12 12:58:17,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316238814] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:58:17,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:58:17,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-12 12:58:17,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570848618] [2024-05-12 12:58:17,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:58:17,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-05-12 12:58:17,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:58:17,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-12 12:58:17,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-05-12 12:58:17,360 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 67 [2024-05-12 12:58:17,361 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 63 transitions, 165 flow. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 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-05-12 12:58:17,361 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:58:17,361 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 67 [2024-05-12 12:58:17,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:58:18,435 INFO L124 PetriNetUnfolderBase]: 9003/16006 cut-off events. [2024-05-12 12:58:18,435 INFO L125 PetriNetUnfolderBase]: For 2029/2029 co-relation queries the response was YES. [2024-05-12 12:58:18,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31803 conditions, 16006 events. 9003/16006 cut-off events. For 2029/2029 co-relation queries the response was YES. Maximal size of possible extension queue 770. Compared 129722 event pairs, 3969 based on Foata normal form. 145/15111 useless extension candidates. Maximal degree in co-relation 16629. Up to 12059 conditions per place. [2024-05-12 12:58:18,530 INFO L140 encePairwiseOnDemand]: 54/67 looper letters, 68 selfloop transitions, 9 changer transitions 0/95 dead transitions. [2024-05-12 12:58:18,530 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 95 transitions, 395 flow [2024-05-12 12:58:18,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-12 12:58:18,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-05-12 12:58:18,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 173 transitions. [2024-05-12 12:58:18,540 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6455223880597015 [2024-05-12 12:58:18,540 INFO L175 Difference]: Start difference. First operand has 68 places, 63 transitions, 165 flow. Second operand 4 states and 173 transitions. [2024-05-12 12:58:18,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 95 transitions, 395 flow [2024-05-12 12:58:18,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 95 transitions, 390 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-05-12 12:58:18,543 INFO L231 Difference]: Finished difference. Result has 71 places, 67 transitions, 220 flow [2024-05-12 12:58:18,543 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=220, PETRI_PLACES=71, PETRI_TRANSITIONS=67} [2024-05-12 12:58:18,544 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -1 predicate places. [2024-05-12 12:58:18,544 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 67 transitions, 220 flow [2024-05-12 12:58:18,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 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-05-12 12:58:18,544 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:58:18,545 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:58:18,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-05-12 12:58:18,545 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-05-12 12:58:18,546 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:58:18,546 INFO L85 PathProgramCache]: Analyzing trace with hash 28863011, now seen corresponding path program 1 times [2024-05-12 12:58:18,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:58:18,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902562793] [2024-05-12 12:58:18,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:58:18,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:58:18,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:58:18,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:58:18,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:58:18,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902562793] [2024-05-12 12:58:18,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902562793] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:58:18,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:58:18,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-12 12:58:18,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020559370] [2024-05-12 12:58:18,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:58:18,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-12 12:58:18,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:58:18,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-12 12:58:18,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-05-12 12:58:18,808 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 67 [2024-05-12 12:58:18,809 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 67 transitions, 220 flow. Second operand has 5 states, 5 states have (on average 23.6) internal successors, (118), 5 states have internal predecessors, (118), 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-05-12 12:58:18,809 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:58:18,809 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 67 [2024-05-12 12:58:18,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:58:19,756 INFO L124 PetriNetUnfolderBase]: 7980/14775 cut-off events. [2024-05-12 12:58:19,757 INFO L125 PetriNetUnfolderBase]: For 5344/5344 co-relation queries the response was YES. [2024-05-12 12:58:19,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33641 conditions, 14775 events. 7980/14775 cut-off events. For 5344/5344 co-relation queries the response was YES. Maximal size of possible extension queue 704. Compared 122477 event pairs, 2306 based on Foata normal form. 441/14100 useless extension candidates. Maximal degree in co-relation 15524. Up to 7959 conditions per place. [2024-05-12 12:58:19,836 INFO L140 encePairwiseOnDemand]: 52/67 looper letters, 95 selfloop transitions, 21 changer transitions 0/134 dead transitions. [2024-05-12 12:58:19,836 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 134 transitions, 660 flow [2024-05-12 12:58:19,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 12:58:19,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 12:58:19,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 228 transitions. [2024-05-12 12:58:19,839 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6805970149253732 [2024-05-12 12:58:19,839 INFO L175 Difference]: Start difference. First operand has 71 places, 67 transitions, 220 flow. Second operand 5 states and 228 transitions. [2024-05-12 12:58:19,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 134 transitions, 660 flow [2024-05-12 12:58:19,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 134 transitions, 644 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-05-12 12:58:19,845 INFO L231 Difference]: Finished difference. Result has 76 places, 79 transitions, 373 flow [2024-05-12 12:58:19,845 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=373, PETRI_PLACES=76, PETRI_TRANSITIONS=79} [2024-05-12 12:58:19,846 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 4 predicate places. [2024-05-12 12:58:19,846 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 79 transitions, 373 flow [2024-05-12 12:58:19,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.6) internal successors, (118), 5 states have internal predecessors, (118), 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-05-12 12:58:19,846 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:58:19,847 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:58:19,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-05-12 12:58:19,847 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-05-12 12:58:19,847 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:58:19,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1624251718, now seen corresponding path program 1 times [2024-05-12 12:58:19,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:58:19,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047098836] [2024-05-12 12:58:19,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:58:19,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:58:19,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:58:20,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:58:20,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:58:20,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047098836] [2024-05-12 12:58:20,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047098836] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:58:20,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:58:20,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-12 12:58:20,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643728982] [2024-05-12 12:58:20,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:58:20,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-12 12:58:20,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:58:20,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-12 12:58:20,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-05-12 12:58:20,078 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 67 [2024-05-12 12:58:20,078 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 79 transitions, 373 flow. Second operand has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 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-05-12 12:58:20,078 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:58:20,078 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 67 [2024-05-12 12:58:20,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:58:21,165 INFO L124 PetriNetUnfolderBase]: 7766/14495 cut-off events. [2024-05-12 12:58:21,166 INFO L125 PetriNetUnfolderBase]: For 15715/15724 co-relation queries the response was YES. [2024-05-12 12:58:21,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40838 conditions, 14495 events. 7766/14495 cut-off events. For 15715/15724 co-relation queries the response was YES. Maximal size of possible extension queue 717. Compared 121426 event pairs, 1647 based on Foata normal form. 110/13526 useless extension candidates. Maximal degree in co-relation 15889. Up to 7929 conditions per place. [2024-05-12 12:58:21,258 INFO L140 encePairwiseOnDemand]: 54/67 looper letters, 93 selfloop transitions, 17 changer transitions 0/128 dead transitions. [2024-05-12 12:58:21,258 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 128 transitions, 734 flow [2024-05-12 12:58:21,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 12:58:21,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 12:58:21,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 220 transitions. [2024-05-12 12:58:21,259 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6567164179104478 [2024-05-12 12:58:21,260 INFO L175 Difference]: Start difference. First operand has 76 places, 79 transitions, 373 flow. Second operand 5 states and 220 transitions. [2024-05-12 12:58:21,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 128 transitions, 734 flow [2024-05-12 12:58:21,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 128 transitions, 726 flow, removed 4 selfloop flow, removed 0 redundant places. [2024-05-12 12:58:21,267 INFO L231 Difference]: Finished difference. Result has 80 places, 78 transitions, 403 flow [2024-05-12 12:58:21,267 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=357, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=403, PETRI_PLACES=80, PETRI_TRANSITIONS=78} [2024-05-12 12:58:21,268 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 8 predicate places. [2024-05-12 12:58:21,268 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 78 transitions, 403 flow [2024-05-12 12:58:21,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 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-05-12 12:58:21,268 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:58:21,268 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:58:21,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-05-12 12:58:21,268 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-05-12 12:58:21,269 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:58:21,269 INFO L85 PathProgramCache]: Analyzing trace with hash 155809672, now seen corresponding path program 1 times [2024-05-12 12:58:21,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:58:21,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809591557] [2024-05-12 12:58:21,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:58:21,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:58:21,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:58:21,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:58:21,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:58:21,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809591557] [2024-05-12 12:58:21,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809591557] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:58:21,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:58:21,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-12 12:58:21,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153416589] [2024-05-12 12:58:21,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:58:21,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-12 12:58:21,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:58:21,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-12 12:58:21,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-05-12 12:58:21,442 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 67 [2024-05-12 12:58:21,443 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 78 transitions, 403 flow. Second operand has 5 states, 5 states have (on average 24.6) internal successors, (123), 5 states have internal predecessors, (123), 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-05-12 12:58:21,443 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:58:21,443 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 67 [2024-05-12 12:58:21,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:58:22,828 INFO L124 PetriNetUnfolderBase]: 10147/18789 cut-off events. [2024-05-12 12:58:22,828 INFO L125 PetriNetUnfolderBase]: For 27391/27408 co-relation queries the response was YES. [2024-05-12 12:58:22,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54447 conditions, 18789 events. 10147/18789 cut-off events. For 27391/27408 co-relation queries the response was YES. Maximal size of possible extension queue 840. Compared 161299 event pairs, 3774 based on Foata normal form. 38/17676 useless extension candidates. Maximal degree in co-relation 34478. Up to 13102 conditions per place. [2024-05-12 12:58:22,959 INFO L140 encePairwiseOnDemand]: 57/67 looper letters, 93 selfloop transitions, 22 changer transitions 0/135 dead transitions. [2024-05-12 12:58:22,959 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 135 transitions, 899 flow [2024-05-12 12:58:22,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 12:58:22,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 12:58:22,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 233 transitions. [2024-05-12 12:58:22,960 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5796019900497512 [2024-05-12 12:58:22,960 INFO L175 Difference]: Start difference. First operand has 80 places, 78 transitions, 403 flow. Second operand 6 states and 233 transitions. [2024-05-12 12:58:22,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 135 transitions, 899 flow [2024-05-12 12:58:22,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 135 transitions, 857 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-05-12 12:58:22,981 INFO L231 Difference]: Finished difference. Result has 85 places, 96 transitions, 595 flow [2024-05-12 12:58:22,982 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=366, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=595, PETRI_PLACES=85, PETRI_TRANSITIONS=96} [2024-05-12 12:58:22,984 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 13 predicate places. [2024-05-12 12:58:22,984 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 96 transitions, 595 flow [2024-05-12 12:58:22,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.6) internal successors, (123), 5 states have internal predecessors, (123), 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-05-12 12:58:22,984 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:58:22,984 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:58:22,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-05-12 12:58:22,985 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-05-12 12:58:22,985 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:58:22,985 INFO L85 PathProgramCache]: Analyzing trace with hash -563085529, now seen corresponding path program 1 times [2024-05-12 12:58:22,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:58:22,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037143109] [2024-05-12 12:58:22,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:58:22,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:58:22,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:58:23,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:58:23,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:58:23,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037143109] [2024-05-12 12:58:23,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037143109] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:58:23,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:58:23,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-12 12:58:23,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358174316] [2024-05-12 12:58:23,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:58:23,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-05-12 12:58:23,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:58:23,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-12 12:58:23,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-05-12 12:58:23,039 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 67 [2024-05-12 12:58:23,039 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 96 transitions, 595 flow. Second operand has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 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-05-12 12:58:23,040 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:58:23,040 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 67 [2024-05-12 12:58:23,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:58:24,137 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([270] L714-->L714-1: Formula: (and (= v_~w~0_74 1) (not (= (ite (and (= v_~r~0_51 0) (= v_~w~0_75 0)) 1 0) 0))) InVars {~w~0=v_~w~0_75, ~r~0=v_~r~0_51} OutVars{~w~0=v_~w~0_74, writerThread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_writerThread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~r~0=v_~r~0_51, writerThread1of1ForFork3_assume_abort_if_not_~cond#1=|v_writerThread1of1ForFork3_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork3_assume_abort_if_not_~cond#1, writerThread1of1ForFork3_assume_abort_if_not_#in~cond#1][106], [Black: 92#(= ~y~0 0), Black: 94#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), 16#L720true, Black: 102#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0)), 104#true, 63#L744true, readerThread1of1ForFork1InUse, Black: 110#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), Black: 107#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 0)), Black: 108#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), 116#(= ~r~0 0), Black: 83#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), 90#true, 28#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 12#L714-1true, Black: 88#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 11#L744true, Black: 93#(and (= ~w~0 1) (= ~y~0 0))]) [2024-05-12 12:58:24,137 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-05-12 12:58:24,137 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-05-12 12:58:24,137 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-05-12 12:58:24,138 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-05-12 12:58:24,167 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([275] L714-->L714-1: Formula: (and (= v_~w~0_74 1) (not (= (ite (and (= v_~r~0_51 0) (= v_~w~0_75 0)) 1 0) 0))) InVars {~w~0=v_~w~0_75, ~r~0=v_~r~0_51} OutVars{~w~0=v_~w~0_74, writerThread1of1ForFork2_assume_abort_if_not_~cond#1=|v_writerThread1of1ForFork2_assume_abort_if_not_~cond#1_1|, writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~r~0=v_~r~0_51} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork2_assume_abort_if_not_~cond#1, writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1][110], [Black: 92#(= ~y~0 0), 30#L714-1true, Black: 94#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), Black: 102#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0)), 104#true, 63#L744true, readerThread1of1ForFork1InUse, Black: 110#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), Black: 107#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 0)), Black: 108#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), 116#(= ~r~0 0), 4#L720true, Black: 83#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), 90#true, 28#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, Black: 88#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 11#L744true, Black: 93#(and (= ~w~0 1) (= ~y~0 0))]) [2024-05-12 12:58:24,167 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-05-12 12:58:24,168 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-05-12 12:58:24,168 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-05-12 12:58:24,168 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-05-12 12:58:24,187 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([270] L714-->L714-1: Formula: (and (= v_~w~0_74 1) (not (= (ite (and (= v_~r~0_51 0) (= v_~w~0_75 0)) 1 0) 0))) InVars {~w~0=v_~w~0_75, ~r~0=v_~r~0_51} OutVars{~w~0=v_~w~0_74, writerThread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_writerThread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~r~0=v_~r~0_51, writerThread1of1ForFork3_assume_abort_if_not_~cond#1=|v_writerThread1of1ForFork3_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork3_assume_abort_if_not_~cond#1, writerThread1of1ForFork3_assume_abort_if_not_#in~cond#1][106], [Black: 92#(= ~y~0 0), Black: 94#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), 16#L720true, Black: 102#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0)), 104#true, 63#L744true, readerThread1of1ForFork1InUse, Black: 110#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), Black: 107#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 0)), Black: 108#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), 116#(= ~r~0 0), Black: 83#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), 90#true, 28#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 12#L714-1true, Black: 88#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 11#L744true, Black: 93#(and (= ~w~0 1) (= ~y~0 0))]) [2024-05-12 12:58:24,187 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-05-12 12:58:24,187 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-05-12 12:58:24,187 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-05-12 12:58:24,188 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-05-12 12:58:24,188 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-05-12 12:58:24,195 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([270] L714-->L714-1: Formula: (and (= v_~w~0_74 1) (not (= (ite (and (= v_~r~0_51 0) (= v_~w~0_75 0)) 1 0) 0))) InVars {~w~0=v_~w~0_75, ~r~0=v_~r~0_51} OutVars{~w~0=v_~w~0_74, writerThread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_writerThread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~r~0=v_~r~0_51, writerThread1of1ForFork3_assume_abort_if_not_~cond#1=|v_writerThread1of1ForFork3_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork3_assume_abort_if_not_~cond#1, writerThread1of1ForFork3_assume_abort_if_not_#in~cond#1][106], [Black: 92#(= ~y~0 0), Black: 94#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), 16#L720true, Black: 102#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0)), 104#true, readerThread1of1ForFork1InUse, Black: 110#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), Black: 107#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 0)), Black: 108#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), 116#(= ~r~0 0), 27#readerEXITtrue, Black: 83#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), 90#true, 28#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 12#L714-1true, Black: 88#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 11#L744true, Black: 93#(and (= ~w~0 1) (= ~y~0 0))]) [2024-05-12 12:58:24,195 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2024-05-12 12:58:24,195 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-05-12 12:58:24,195 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-05-12 12:58:24,195 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-05-12 12:58:24,196 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([270] L714-->L714-1: Formula: (and (= v_~w~0_74 1) (not (= (ite (and (= v_~r~0_51 0) (= v_~w~0_75 0)) 1 0) 0))) InVars {~w~0=v_~w~0_75, ~r~0=v_~r~0_51} OutVars{~w~0=v_~w~0_74, writerThread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_writerThread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~r~0=v_~r~0_51, writerThread1of1ForFork3_assume_abort_if_not_~cond#1=|v_writerThread1of1ForFork3_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork3_assume_abort_if_not_~cond#1, writerThread1of1ForFork3_assume_abort_if_not_#in~cond#1][106], [Black: 92#(= ~y~0 0), Black: 94#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), 16#L720true, Black: 102#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0)), 104#true, 63#L744true, readerThread1of1ForFork1InUse, Black: 110#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), Black: 107#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 0)), Black: 108#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), 116#(= ~r~0 0), Black: 83#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), 90#true, 28#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 12#L714-1true, Black: 88#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 46#readerEXITtrue, Black: 93#(and (= ~w~0 1) (= ~y~0 0))]) [2024-05-12 12:58:24,196 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2024-05-12 12:58:24,196 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-05-12 12:58:24,196 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-05-12 12:58:24,196 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-05-12 12:58:24,205 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([275] L714-->L714-1: Formula: (and (= v_~w~0_74 1) (not (= (ite (and (= v_~r~0_51 0) (= v_~w~0_75 0)) 1 0) 0))) InVars {~w~0=v_~w~0_75, ~r~0=v_~r~0_51} OutVars{~w~0=v_~w~0_74, writerThread1of1ForFork2_assume_abort_if_not_~cond#1=|v_writerThread1of1ForFork2_assume_abort_if_not_~cond#1_1|, writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~r~0=v_~r~0_51} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork2_assume_abort_if_not_~cond#1, writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1][110], [Black: 92#(= ~y~0 0), 30#L714-1true, Black: 94#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), Black: 102#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0)), 104#true, 63#L744true, readerThread1of1ForFork1InUse, Black: 110#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), Black: 107#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 0)), Black: 108#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), 116#(= ~r~0 0), 4#L720true, Black: 83#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), 90#true, 28#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, Black: 88#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 11#L744true, Black: 93#(and (= ~w~0 1) (= ~y~0 0))]) [2024-05-12 12:58:24,206 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-05-12 12:58:24,206 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-05-12 12:58:24,206 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-05-12 12:58:24,206 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-05-12 12:58:24,206 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-05-12 12:58:24,220 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([275] L714-->L714-1: Formula: (and (= v_~w~0_74 1) (not (= (ite (and (= v_~r~0_51 0) (= v_~w~0_75 0)) 1 0) 0))) InVars {~w~0=v_~w~0_75, ~r~0=v_~r~0_51} OutVars{~w~0=v_~w~0_74, writerThread1of1ForFork2_assume_abort_if_not_~cond#1=|v_writerThread1of1ForFork2_assume_abort_if_not_~cond#1_1|, writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~r~0=v_~r~0_51} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork2_assume_abort_if_not_~cond#1, writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1][110], [Black: 92#(= ~y~0 0), 30#L714-1true, Black: 94#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), Black: 102#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0)), 104#true, readerThread1of1ForFork1InUse, Black: 110#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), Black: 107#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 0)), Black: 108#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), 116#(= ~r~0 0), 27#readerEXITtrue, 4#L720true, Black: 83#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), 90#true, 28#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, Black: 88#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 11#L744true, Black: 93#(and (= ~w~0 1) (= ~y~0 0))]) [2024-05-12 12:58:24,220 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2024-05-12 12:58:24,220 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-05-12 12:58:24,220 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-05-12 12:58:24,221 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-05-12 12:58:24,221 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([275] L714-->L714-1: Formula: (and (= v_~w~0_74 1) (not (= (ite (and (= v_~r~0_51 0) (= v_~w~0_75 0)) 1 0) 0))) InVars {~w~0=v_~w~0_75, ~r~0=v_~r~0_51} OutVars{~w~0=v_~w~0_74, writerThread1of1ForFork2_assume_abort_if_not_~cond#1=|v_writerThread1of1ForFork2_assume_abort_if_not_~cond#1_1|, writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~r~0=v_~r~0_51} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork2_assume_abort_if_not_~cond#1, writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1][110], [Black: 92#(= ~y~0 0), 30#L714-1true, Black: 94#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), Black: 102#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0)), 104#true, 63#L744true, readerThread1of1ForFork1InUse, Black: 110#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), Black: 107#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 0)), Black: 108#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), 116#(= ~r~0 0), 4#L720true, Black: 83#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), 90#true, 28#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, Black: 88#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 46#readerEXITtrue, Black: 93#(and (= ~w~0 1) (= ~y~0 0))]) [2024-05-12 12:58:24,221 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2024-05-12 12:58:24,221 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-05-12 12:58:24,221 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-05-12 12:58:24,221 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-05-12 12:58:24,241 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([270] L714-->L714-1: Formula: (and (= v_~w~0_74 1) (not (= (ite (and (= v_~r~0_51 0) (= v_~w~0_75 0)) 1 0) 0))) InVars {~w~0=v_~w~0_75, ~r~0=v_~r~0_51} OutVars{~w~0=v_~w~0_74, writerThread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_writerThread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~r~0=v_~r~0_51, writerThread1of1ForFork3_assume_abort_if_not_~cond#1=|v_writerThread1of1ForFork3_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork3_assume_abort_if_not_~cond#1, writerThread1of1ForFork3_assume_abort_if_not_#in~cond#1][106], [Black: 92#(= ~y~0 0), Black: 94#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), 16#L720true, 104#true, Black: 102#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0)), readerThread1of1ForFork1InUse, Black: 110#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), Black: 107#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 0)), Black: 108#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), 116#(= ~r~0 0), 27#readerEXITtrue, Black: 83#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), 90#true, 12#L714-1true, 28#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, Black: 88#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 11#L744true, Black: 93#(and (= ~w~0 1) (= ~y~0 0))]) [2024-05-12 12:58:24,241 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2024-05-12 12:58:24,241 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-05-12 12:58:24,242 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-05-12 12:58:24,242 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-05-12 12:58:24,242 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-05-12 12:58:24,243 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([270] L714-->L714-1: Formula: (and (= v_~w~0_74 1) (not (= (ite (and (= v_~r~0_51 0) (= v_~w~0_75 0)) 1 0) 0))) InVars {~w~0=v_~w~0_75, ~r~0=v_~r~0_51} OutVars{~w~0=v_~w~0_74, writerThread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_writerThread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~r~0=v_~r~0_51, writerThread1of1ForFork3_assume_abort_if_not_~cond#1=|v_writerThread1of1ForFork3_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork3_assume_abort_if_not_~cond#1, writerThread1of1ForFork3_assume_abort_if_not_#in~cond#1][106], [Black: 92#(= ~y~0 0), Black: 94#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), 16#L720true, Black: 102#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0)), 104#true, 63#L744true, readerThread1of1ForFork1InUse, Black: 110#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), Black: 107#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 0)), Black: 108#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), 116#(= ~r~0 0), Black: 83#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), 90#true, 28#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 12#L714-1true, Black: 88#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 46#readerEXITtrue, Black: 93#(and (= ~w~0 1) (= ~y~0 0))]) [2024-05-12 12:58:24,243 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2024-05-12 12:58:24,244 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-05-12 12:58:24,244 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-05-12 12:58:24,244 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-05-12 12:58:24,244 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-05-12 12:58:24,247 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([270] L714-->L714-1: Formula: (and (= v_~w~0_74 1) (not (= (ite (and (= v_~r~0_51 0) (= v_~w~0_75 0)) 1 0) 0))) InVars {~w~0=v_~w~0_75, ~r~0=v_~r~0_51} OutVars{~w~0=v_~w~0_74, writerThread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_writerThread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~r~0=v_~r~0_51, writerThread1of1ForFork3_assume_abort_if_not_~cond#1=|v_writerThread1of1ForFork3_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork3_assume_abort_if_not_~cond#1, writerThread1of1ForFork3_assume_abort_if_not_#in~cond#1][106], [Black: 92#(= ~y~0 0), Black: 94#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), 16#L720true, 104#true, Black: 102#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0)), readerThread1of1ForFork1InUse, Black: 110#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), Black: 107#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 0)), 116#(= ~r~0 0), Black: 108#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), 27#readerEXITtrue, Black: 83#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), 90#true, 12#L714-1true, 28#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, Black: 88#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 46#readerEXITtrue, Black: 93#(and (= ~w~0 1) (= ~y~0 0))]) [2024-05-12 12:58:24,247 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2024-05-12 12:58:24,247 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-05-12 12:58:24,247 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-05-12 12:58:24,248 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-05-12 12:58:24,407 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([275] L714-->L714-1: Formula: (and (= v_~w~0_74 1) (not (= (ite (and (= v_~r~0_51 0) (= v_~w~0_75 0)) 1 0) 0))) InVars {~w~0=v_~w~0_75, ~r~0=v_~r~0_51} OutVars{~w~0=v_~w~0_74, writerThread1of1ForFork2_assume_abort_if_not_~cond#1=|v_writerThread1of1ForFork2_assume_abort_if_not_~cond#1_1|, writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~r~0=v_~r~0_51} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork2_assume_abort_if_not_~cond#1, writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1][110], [Black: 92#(= ~y~0 0), 30#L714-1true, Black: 94#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), 104#true, Black: 102#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0)), readerThread1of1ForFork1InUse, Black: 110#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), Black: 107#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 0)), 116#(= ~r~0 0), Black: 108#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), 27#readerEXITtrue, 4#L720true, Black: 83#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), 90#true, 28#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, Black: 88#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 11#L744true, Black: 93#(and (= ~w~0 1) (= ~y~0 0))]) [2024-05-12 12:58:24,408 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2024-05-12 12:58:24,408 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-05-12 12:58:24,408 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-05-12 12:58:24,408 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-05-12 12:58:24,408 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-05-12 12:58:24,410 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([275] L714-->L714-1: Formula: (and (= v_~w~0_74 1) (not (= (ite (and (= v_~r~0_51 0) (= v_~w~0_75 0)) 1 0) 0))) InVars {~w~0=v_~w~0_75, ~r~0=v_~r~0_51} OutVars{~w~0=v_~w~0_74, writerThread1of1ForFork2_assume_abort_if_not_~cond#1=|v_writerThread1of1ForFork2_assume_abort_if_not_~cond#1_1|, writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~r~0=v_~r~0_51} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork2_assume_abort_if_not_~cond#1, writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1][110], [Black: 92#(= ~y~0 0), 30#L714-1true, Black: 94#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), Black: 102#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0)), 104#true, 63#L744true, readerThread1of1ForFork1InUse, Black: 110#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), Black: 107#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 0)), Black: 108#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), 116#(= ~r~0 0), 4#L720true, Black: 83#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), 90#true, 28#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, Black: 88#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 46#readerEXITtrue, Black: 93#(and (= ~w~0 1) (= ~y~0 0))]) [2024-05-12 12:58:24,410 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2024-05-12 12:58:24,410 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-05-12 12:58:24,410 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-05-12 12:58:24,410 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-05-12 12:58:24,410 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-05-12 12:58:24,417 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([275] L714-->L714-1: Formula: (and (= v_~w~0_74 1) (not (= (ite (and (= v_~r~0_51 0) (= v_~w~0_75 0)) 1 0) 0))) InVars {~w~0=v_~w~0_75, ~r~0=v_~r~0_51} OutVars{~w~0=v_~w~0_74, writerThread1of1ForFork2_assume_abort_if_not_~cond#1=|v_writerThread1of1ForFork2_assume_abort_if_not_~cond#1_1|, writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~r~0=v_~r~0_51} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork2_assume_abort_if_not_~cond#1, writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1][110], [Black: 92#(= ~y~0 0), 30#L714-1true, Black: 94#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), Black: 102#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0)), 104#true, readerThread1of1ForFork1InUse, Black: 110#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), Black: 107#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 0)), Black: 108#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), 116#(= ~r~0 0), 27#readerEXITtrue, 4#L720true, Black: 83#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), 90#true, 28#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, Black: 88#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 46#readerEXITtrue, Black: 93#(and (= ~w~0 1) (= ~y~0 0))]) [2024-05-12 12:58:24,418 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2024-05-12 12:58:24,418 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-05-12 12:58:24,418 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-05-12 12:58:24,418 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-05-12 12:58:24,437 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([270] L714-->L714-1: Formula: (and (= v_~w~0_74 1) (not (= (ite (and (= v_~r~0_51 0) (= v_~w~0_75 0)) 1 0) 0))) InVars {~w~0=v_~w~0_75, ~r~0=v_~r~0_51} OutVars{~w~0=v_~w~0_74, writerThread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_writerThread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~r~0=v_~r~0_51, writerThread1of1ForFork3_assume_abort_if_not_~cond#1=|v_writerThread1of1ForFork3_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork3_assume_abort_if_not_~cond#1, writerThread1of1ForFork3_assume_abort_if_not_#in~cond#1][106], [Black: 92#(= ~y~0 0), Black: 94#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), 16#L720true, Black: 102#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0)), 104#true, readerThread1of1ForFork1InUse, Black: 110#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), Black: 107#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 0)), Black: 108#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), 116#(= ~r~0 0), 27#readerEXITtrue, Black: 83#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), 90#true, 28#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 12#L714-1true, Black: 88#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 46#readerEXITtrue, Black: 93#(and (= ~w~0 1) (= ~y~0 0))]) [2024-05-12 12:58:24,438 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2024-05-12 12:58:24,438 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-05-12 12:58:24,438 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-05-12 12:58:24,438 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-05-12 12:58:24,438 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-05-12 12:58:24,448 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([275] L714-->L714-1: Formula: (and (= v_~w~0_74 1) (not (= (ite (and (= v_~r~0_51 0) (= v_~w~0_75 0)) 1 0) 0))) InVars {~w~0=v_~w~0_75, ~r~0=v_~r~0_51} OutVars{~w~0=v_~w~0_74, writerThread1of1ForFork2_assume_abort_if_not_~cond#1=|v_writerThread1of1ForFork2_assume_abort_if_not_~cond#1_1|, writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~r~0=v_~r~0_51} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork2_assume_abort_if_not_~cond#1, writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1][110], [Black: 92#(= ~y~0 0), 30#L714-1true, Black: 94#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), Black: 102#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0)), 104#true, readerThread1of1ForFork1InUse, Black: 110#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), Black: 107#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 0)), Black: 108#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), 116#(= ~r~0 0), 27#readerEXITtrue, 4#L720true, Black: 83#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), 90#true, 28#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, Black: 88#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 46#readerEXITtrue, Black: 93#(and (= ~w~0 1) (= ~y~0 0))]) [2024-05-12 12:58:24,448 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2024-05-12 12:58:24,448 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-05-12 12:58:24,448 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-05-12 12:58:24,448 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-05-12 12:58:24,448 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-05-12 12:58:24,518 INFO L124 PetriNetUnfolderBase]: 9315/18984 cut-off events. [2024-05-12 12:58:24,518 INFO L125 PetriNetUnfolderBase]: For 54786/56637 co-relation queries the response was YES. [2024-05-12 12:58:24,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56104 conditions, 18984 events. 9315/18984 cut-off events. For 54786/56637 co-relation queries the response was YES. Maximal size of possible extension queue 958. Compared 181848 event pairs, 3410 based on Foata normal form. 851/18155 useless extension candidates. Maximal degree in co-relation 48996. Up to 5855 conditions per place. [2024-05-12 12:58:24,650 INFO L140 encePairwiseOnDemand]: 60/67 looper letters, 78 selfloop transitions, 17 changer transitions 0/138 dead transitions. [2024-05-12 12:58:24,650 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 138 transitions, 871 flow [2024-05-12 12:58:24,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-12 12:58:24,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-05-12 12:58:24,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 205 transitions. [2024-05-12 12:58:24,652 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7649253731343284 [2024-05-12 12:58:24,652 INFO L175 Difference]: Start difference. First operand has 85 places, 96 transitions, 595 flow. Second operand 4 states and 205 transitions. [2024-05-12 12:58:24,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 138 transitions, 871 flow [2024-05-12 12:58:24,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 138 transitions, 855 flow, removed 5 selfloop flow, removed 1 redundant places. [2024-05-12 12:58:24,698 INFO L231 Difference]: Finished difference. Result has 90 places, 96 transitions, 649 flow [2024-05-12 12:58:24,698 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=509, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=649, PETRI_PLACES=90, PETRI_TRANSITIONS=96} [2024-05-12 12:58:24,701 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 18 predicate places. [2024-05-12 12:58:24,701 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 96 transitions, 649 flow [2024-05-12 12:58:24,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 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-05-12 12:58:24,702 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:58:24,702 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:58:24,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-05-12 12:58:24,702 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-05-12 12:58:24,702 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:58:24,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1213861252, now seen corresponding path program 1 times [2024-05-12 12:58:24,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:58:24,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492938497] [2024-05-12 12:58:24,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:58:24,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:58:24,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:58:24,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:58:24,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:58:24,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492938497] [2024-05-12 12:58:24,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492938497] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:58:24,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:58:24,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 12:58:24,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836224889] [2024-05-12 12:58:24,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:58:24,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 12:58:24,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:58:24,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 12:58:24,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-05-12 12:58:24,823 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 67 [2024-05-12 12:58:24,824 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 96 transitions, 649 flow. Second operand has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 6 states have internal predecessors, (146), 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-05-12 12:58:24,824 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:58:24,824 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 67 [2024-05-12 12:58:24,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:58:28,627 INFO L124 PetriNetUnfolderBase]: 27424/45719 cut-off events. [2024-05-12 12:58:28,627 INFO L125 PetriNetUnfolderBase]: For 135137/137963 co-relation queries the response was YES. [2024-05-12 12:58:28,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145474 conditions, 45719 events. 27424/45719 cut-off events. For 135137/137963 co-relation queries the response was YES. Maximal size of possible extension queue 2371. Compared 399305 event pairs, 5514 based on Foata normal form. 148/43319 useless extension candidates. Maximal degree in co-relation 86513. Up to 12513 conditions per place. [2024-05-12 12:58:29,182 INFO L140 encePairwiseOnDemand]: 56/67 looper letters, 267 selfloop transitions, 48 changer transitions 0/338 dead transitions. [2024-05-12 12:58:29,182 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 338 transitions, 2796 flow [2024-05-12 12:58:29,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-05-12 12:58:29,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-05-12 12:58:29,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 540 transitions. [2024-05-12 12:58:29,184 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6199770378874856 [2024-05-12 12:58:29,185 INFO L175 Difference]: Start difference. First operand has 90 places, 96 transitions, 649 flow. Second operand 13 states and 540 transitions. [2024-05-12 12:58:29,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 338 transitions, 2796 flow [2024-05-12 12:58:29,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 338 transitions, 2736 flow, removed 30 selfloop flow, removed 0 redundant places. [2024-05-12 12:58:29,318 INFO L231 Difference]: Finished difference. Result has 110 places, 132 transitions, 1058 flow [2024-05-12 12:58:29,319 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=637, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1058, PETRI_PLACES=110, PETRI_TRANSITIONS=132} [2024-05-12 12:58:29,319 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 38 predicate places. [2024-05-12 12:58:29,319 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 132 transitions, 1058 flow [2024-05-12 12:58:29,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 6 states have internal predecessors, (146), 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-05-12 12:58:29,319 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:58:29,320 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:58:29,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-05-12 12:58:29,320 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-05-12 12:58:29,320 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:58:29,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1930793576, now seen corresponding path program 1 times [2024-05-12 12:58:29,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:58:29,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324103466] [2024-05-12 12:58:29,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:58:29,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:58:29,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:58:29,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:58:29,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:58:29,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324103466] [2024-05-12 12:58:29,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324103466] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:58:29,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:58:29,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 12:58:29,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066690934] [2024-05-12 12:58:29,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:58:29,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 12:58:29,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:58:29,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 12:58:29,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-05-12 12:58:29,596 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 67 [2024-05-12 12:58:29,597 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 132 transitions, 1058 flow. Second operand has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 6 states have internal predecessors, (136), 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-05-12 12:58:29,597 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:58:29,597 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 67 [2024-05-12 12:58:29,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:58:34,905 INFO L124 PetriNetUnfolderBase]: 34062/56090 cut-off events. [2024-05-12 12:58:34,905 INFO L125 PetriNetUnfolderBase]: For 193040/194823 co-relation queries the response was YES. [2024-05-12 12:58:35,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 199295 conditions, 56090 events. 34062/56090 cut-off events. For 193040/194823 co-relation queries the response was YES. Maximal size of possible extension queue 2600. Compared 492052 event pairs, 4060 based on Foata normal form. 591/55185 useless extension candidates. Maximal degree in co-relation 191523. Up to 21286 conditions per place. [2024-05-12 12:58:35,634 INFO L140 encePairwiseOnDemand]: 52/67 looper letters, 243 selfloop transitions, 60 changer transitions 0/328 dead transitions. [2024-05-12 12:58:35,635 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 328 transitions, 3033 flow [2024-05-12 12:58:35,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 12:58:35,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 12:58:35,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 327 transitions. [2024-05-12 12:58:35,636 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.697228144989339 [2024-05-12 12:58:35,636 INFO L175 Difference]: Start difference. First operand has 110 places, 132 transitions, 1058 flow. Second operand 7 states and 327 transitions. [2024-05-12 12:58:35,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 328 transitions, 3033 flow [2024-05-12 12:58:37,108 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 328 transitions, 2975 flow, removed 29 selfloop flow, removed 0 redundant places. [2024-05-12 12:58:37,112 INFO L231 Difference]: Finished difference. Result has 122 places, 186 transitions, 1957 flow [2024-05-12 12:58:37,112 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=1028, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1957, PETRI_PLACES=122, PETRI_TRANSITIONS=186} [2024-05-12 12:58:37,113 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 50 predicate places. [2024-05-12 12:58:37,113 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 186 transitions, 1957 flow [2024-05-12 12:58:37,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 6 states have internal predecessors, (136), 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-05-12 12:58:37,113 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:58:37,113 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:58:37,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-05-12 12:58:37,114 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-05-12 12:58:37,114 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:58:37,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1232677182, now seen corresponding path program 1 times [2024-05-12 12:58:37,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:58:37,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286469918] [2024-05-12 12:58:37,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:58:37,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:58:37,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:58:37,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:58:37,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:58:37,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286469918] [2024-05-12 12:58:37,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286469918] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:58:37,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:58:37,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 12:58:37,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501514140] [2024-05-12 12:58:37,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:58:37,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 12:58:37,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:58:37,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 12:58:37,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-05-12 12:58:37,394 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 67 [2024-05-12 12:58:37,394 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 186 transitions, 1957 flow. Second operand has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 6 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:58:37,394 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:58:37,394 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 67 [2024-05-12 12:58:37,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:58:43,047 INFO L124 PetriNetUnfolderBase]: 29777/53699 cut-off events. [2024-05-12 12:58:43,047 INFO L125 PetriNetUnfolderBase]: For 279595/282045 co-relation queries the response was YES. [2024-05-12 12:58:43,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 214083 conditions, 53699 events. 29777/53699 cut-off events. For 279595/282045 co-relation queries the response was YES. Maximal size of possible extension queue 2715. Compared 519996 event pairs, 10977 based on Foata normal form. 508/52761 useless extension candidates. Maximal degree in co-relation 206497. Up to 38042 conditions per place. [2024-05-12 12:58:43,852 INFO L140 encePairwiseOnDemand]: 55/67 looper letters, 181 selfloop transitions, 13 changer transitions 0/234 dead transitions. [2024-05-12 12:58:43,853 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 234 transitions, 2550 flow [2024-05-12 12:58:43,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 12:58:43,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 12:58:43,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 232 transitions. [2024-05-12 12:58:43,860 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5771144278606966 [2024-05-12 12:58:43,860 INFO L175 Difference]: Start difference. First operand has 122 places, 186 transitions, 1957 flow. Second operand 6 states and 232 transitions. [2024-05-12 12:58:43,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 234 transitions, 2550 flow [2024-05-12 12:58:45,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 234 transitions, 2468 flow, removed 41 selfloop flow, removed 0 redundant places. [2024-05-12 12:58:45,957 INFO L231 Difference]: Finished difference. Result has 128 places, 188 transitions, 1935 flow [2024-05-12 12:58:45,958 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=1875, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1935, PETRI_PLACES=128, PETRI_TRANSITIONS=188} [2024-05-12 12:58:45,958 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 56 predicate places. [2024-05-12 12:58:45,958 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 188 transitions, 1935 flow [2024-05-12 12:58:45,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 6 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:58:45,959 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:58:45,959 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:58:45,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-05-12 12:58:45,959 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-05-12 12:58:45,959 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:58:45,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1164094896, now seen corresponding path program 1 times [2024-05-12 12:58:45,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:58:45,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874088472] [2024-05-12 12:58:45,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:58:45,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:58:45,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:58:46,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:58:46,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:58:46,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874088472] [2024-05-12 12:58:46,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874088472] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:58:46,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:58:46,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 12:58:46,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147299741] [2024-05-12 12:58:46,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:58:46,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 12:58:46,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:58:46,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 12:58:46,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-05-12 12:58:46,189 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 67 [2024-05-12 12:58:46,189 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 188 transitions, 1935 flow. Second operand has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 6 states have internal predecessors, (151), 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-05-12 12:58:46,189 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:58:46,189 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 67 [2024-05-12 12:58:46,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:58:51,940 INFO L124 PetriNetUnfolderBase]: 29189/51702 cut-off events. [2024-05-12 12:58:51,940 INFO L125 PetriNetUnfolderBase]: For 300395/302901 co-relation queries the response was YES. [2024-05-12 12:58:52,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 208684 conditions, 51702 events. 29189/51702 cut-off events. For 300395/302901 co-relation queries the response was YES. Maximal size of possible extension queue 2650. Compared 495050 event pairs, 11144 based on Foata normal form. 772/50624 useless extension candidates. Maximal degree in co-relation 201487. Up to 37530 conditions per place. [2024-05-12 12:58:52,562 INFO L140 encePairwiseOnDemand]: 58/67 looper letters, 163 selfloop transitions, 28 changer transitions 0/237 dead transitions. [2024-05-12 12:58:52,562 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 237 transitions, 2546 flow [2024-05-12 12:58:52,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 12:58:52,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 12:58:52,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 249 transitions. [2024-05-12 12:58:52,564 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5309168443496801 [2024-05-12 12:58:52,564 INFO L175 Difference]: Start difference. First operand has 128 places, 188 transitions, 1935 flow. Second operand 7 states and 249 transitions. [2024-05-12 12:58:52,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 237 transitions, 2546 flow [2024-05-12 12:58:54,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 237 transitions, 2501 flow, removed 14 selfloop flow, removed 3 redundant places. [2024-05-12 12:58:54,408 INFO L231 Difference]: Finished difference. Result has 133 places, 198 transitions, 2063 flow [2024-05-12 12:58:54,409 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=1899, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2063, PETRI_PLACES=133, PETRI_TRANSITIONS=198} [2024-05-12 12:58:54,409 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 61 predicate places. [2024-05-12 12:58:54,409 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 198 transitions, 2063 flow [2024-05-12 12:58:54,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 6 states have internal predecessors, (151), 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-05-12 12:58:54,410 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:58:54,410 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:58:54,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-05-12 12:58:54,410 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-05-12 12:58:54,410 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:58:54,410 INFO L85 PathProgramCache]: Analyzing trace with hash 859340315, now seen corresponding path program 1 times [2024-05-12 12:58:54,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:58:54,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414934311] [2024-05-12 12:58:54,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:58:54,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:58:54,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:58:54,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:58:54,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:58:54,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414934311] [2024-05-12 12:58:54,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414934311] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:58:54,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:58:54,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 12:58:54,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631375745] [2024-05-12 12:58:54,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:58:54,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 12:58:54,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:58:54,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 12:58:54,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-05-12 12:58:54,570 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 67 [2024-05-12 12:58:54,571 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 198 transitions, 2063 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-05-12 12:58:54,571 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:58:54,571 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 67 [2024-05-12 12:58:54,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:59:00,880 INFO L124 PetriNetUnfolderBase]: 34189/57662 cut-off events. [2024-05-12 12:59:00,881 INFO L125 PetriNetUnfolderBase]: For 345550/347210 co-relation queries the response was YES. [2024-05-12 12:59:01,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 236465 conditions, 57662 events. 34189/57662 cut-off events. For 345550/347210 co-relation queries the response was YES. Maximal size of possible extension queue 2780. Compared 519381 event pairs, 12359 based on Foata normal form. 315/56384 useless extension candidates. Maximal degree in co-relation 227749. Up to 43947 conditions per place. [2024-05-12 12:59:01,495 INFO L140 encePairwiseOnDemand]: 54/67 looper letters, 187 selfloop transitions, 67 changer transitions 0/283 dead transitions. [2024-05-12 12:59:01,495 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 283 transitions, 3186 flow [2024-05-12 12:59:01,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 12:59:01,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 12:59:01,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 300 transitions. [2024-05-12 12:59:01,497 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5597014925373134 [2024-05-12 12:59:01,497 INFO L175 Difference]: Start difference. First operand has 133 places, 198 transitions, 2063 flow. Second operand 8 states and 300 transitions. [2024-05-12 12:59:01,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 283 transitions, 3186 flow [2024-05-12 12:59:03,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 283 transitions, 3146 flow, removed 19 selfloop flow, removed 1 redundant places. [2024-05-12 12:59:03,810 INFO L231 Difference]: Finished difference. Result has 145 places, 219 transitions, 2592 flow [2024-05-12 12:59:03,810 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=2023, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2592, PETRI_PLACES=145, PETRI_TRANSITIONS=219} [2024-05-12 12:59:03,810 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 73 predicate places. [2024-05-12 12:59:03,810 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 219 transitions, 2592 flow [2024-05-12 12:59:03,811 INFO L496 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-05-12 12:59:03,811 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:59:03,811 INFO L208 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-05-12 12:59:03,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-05-12 12:59:03,811 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-05-12 12:59:03,811 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:59:03,812 INFO L85 PathProgramCache]: Analyzing trace with hash 887622455, now seen corresponding path program 1 times [2024-05-12 12:59:03,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:59:03,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611969532] [2024-05-12 12:59:03,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:59:03,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:59:03,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:59:03,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:59:03,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:59:03,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611969532] [2024-05-12 12:59:03,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611969532] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:59:03,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:59:03,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 12:59:03,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972275254] [2024-05-12 12:59:03,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:59:03,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 12:59:03,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:59:03,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 12:59:03,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-05-12 12:59:04,001 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 67 [2024-05-12 12:59:04,002 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 219 transitions, 2592 flow. Second operand has 7 states, 7 states have (on average 22.285714285714285) internal successors, (156), 7 states have internal predecessors, (156), 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-05-12 12:59:04,002 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:59:04,002 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 67 [2024-05-12 12:59:04,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand