./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-atomic/read_write_lock-1.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --validate ./goblint.2024-05-21_14-57-05.files/mutex-meet/read_write_lock-1.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version bcb38a6f 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-1.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/read_write_lock-1.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 --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-bcb38a6-m [2024-06-04 16:00:16,111 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-04 16:00:16,183 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-04 16:00:16,188 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-04 16:00:16,188 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-04 16:00:16,211 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-04 16:00:16,213 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-04 16:00:16,213 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-04 16:00:16,214 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-04 16:00:16,217 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-04 16:00:16,217 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-04 16:00:16,217 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-04 16:00:16,218 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-04 16:00:16,219 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-04 16:00:16,219 INFO L153 SettingsManager]: * Use SBE=true [2024-06-04 16:00:16,220 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-04 16:00:16,220 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-04 16:00:16,220 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-04 16:00:16,220 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-04 16:00:16,220 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-04 16:00:16,221 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-04 16:00:16,222 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-04 16:00:16,222 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-04 16:00:16,222 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-04 16:00:16,222 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-04 16:00:16,222 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-04 16:00:16,223 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-04 16:00:16,223 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-04 16:00:16,223 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-04 16:00:16,224 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-04 16:00:16,224 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-04 16:00:16,224 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-04 16:00:16,225 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-04 16:00:16,225 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-04 16:00:16,225 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-04 16:00:16,225 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-04 16:00:16,225 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-04 16:00:16,225 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-04 16:00:16,226 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-04 16:00:16,226 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-04 16:00:16,226 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-04 16:00:16,226 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-04 16:00:16,226 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-04 16:00:16,226 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2024-06-04 16:00:16,429 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-04 16:00:16,463 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-04 16:00:16,465 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-04 16:00:16,466 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-04 16:00:16,471 INFO L274 PluginConnector]: CDTParser initialized [2024-06-04 16:00:16,472 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-atomic/read_write_lock-1.i [2024-06-04 16:00:17,426 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-04 16:00:17,639 INFO L384 CDTParser]: Found 1 translation units. [2024-06-04 16:00:17,639 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/read_write_lock-1.i [2024-06-04 16:00:17,649 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4099c505/6c2468e2f50f401197550f27ab8b4ecf/FLAG545c96feb [2024-06-04 16:00:17,658 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4099c505/6c2468e2f50f401197550f27ab8b4ecf [2024-06-04 16:00:17,660 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-04 16:00:17,661 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-04 16:00:17,661 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-05-21_14-57-05.files/mutex-meet/read_write_lock-1.yml/witness.yml [2024-06-04 16:00:17,738 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-04 16:00:17,739 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-04 16:00:17,740 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-04 16:00:17,740 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-04 16:00:17,743 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-04 16:00:17,744 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 04:00:17" (1/2) ... [2024-06-04 16:00:17,744 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40c4b24f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 04:00:17, skipping insertion in model container [2024-06-04 16:00:17,745 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 04:00:17" (1/2) ... [2024-06-04 16:00:17,746 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@5f351a03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 04:00:17, skipping insertion in model container [2024-06-04 16:00:17,746 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 04:00:17" (2/2) ... [2024-06-04 16:00:17,746 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40c4b24f and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:00:17, skipping insertion in model container [2024-06-04 16:00:17,746 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 04:00:17" (2/2) ... [2024-06-04 16:00:17,746 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-04 16:00:17,776 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-04 16:00:17,776 INFO L97 edCorrectnessWitness]: Location invariant before [L749-L749] (((! 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)))) && (! multithreaded || ((((((0 <= w && 0 <= y) && w <= 1) && y <= 127) && y % 3 == 0) && (w == 0 || w == 1)) && (y == 0 || y == 3)))) && (! multithreaded || ((0 <= w && w <= 1) && (w == 0 || w == 1))) [2024-06-04 16:00:17,777 INFO L97 edCorrectnessWitness]: Location invariant before [L746-L746] (((! 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)))) && (! multithreaded || ((((((0 <= w && 0 <= y) && w <= 1) && y <= 127) && y % 3 == 0) && (w == 0 || w == 1)) && (y == 0 || y == 3)))) && (! multithreaded || ((0 <= w && w <= 1) && (w == 0 || w == 1))) [2024-06-04 16:00:17,777 INFO L97 edCorrectnessWitness]: Location invariant before [L748-L748] (((! 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)))) && (! multithreaded || ((((((0 <= w && 0 <= y) && w <= 1) && y <= 127) && y % 3 == 0) && (w == 0 || w == 1)) && (y == 0 || y == 3)))) && (! multithreaded || ((0 <= w && w <= 1) && (w == 0 || w == 1))) [2024-06-04 16:00:17,777 INFO L97 edCorrectnessWitness]: Location invariant before [L747-L747] (((! 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)))) && (! multithreaded || ((((((0 <= w && 0 <= y) && w <= 1) && y <= 127) && y % 3 == 0) && (w == 0 || w == 1)) && (y == 0 || y == 3)))) && (! multithreaded || ((0 <= w && w <= 1) && (w == 0 || w == 1))) [2024-06-04 16:00:17,777 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-04 16:00:17,777 INFO L106 edCorrectnessWitness]: ghost_update [L745-L745] multithreaded = 1; [2024-06-04 16:00:17,797 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-04 16:00:18,055 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-04 16:00:18,066 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-04 16:00:18,161 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-04 16:00:18,186 INFO L206 MainTranslator]: Completed translation [2024-06-04 16:00:18,187 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:00:18 WrapperNode [2024-06-04 16:00:18,187 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-04 16:00:18,188 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-04 16:00:18,188 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-04 16:00:18,188 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-04 16:00:18,193 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 04.06 04:00:18" (1/1) ... [2024-06-04 16:00:18,201 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 04.06 04:00:18" (1/1) ... [2024-06-04 16:00:18,222 INFO L138 Inliner]: procedures = 173, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 98 [2024-06-04 16:00:18,222 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-04 16:00:18,223 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-04 16:00:18,223 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-04 16:00:18,223 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-04 16:00:18,231 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:00:18" (1/1) ... [2024-06-04 16:00:18,231 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:00:18" (1/1) ... [2024-06-04 16:00:18,233 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:00:18" (1/1) ... [2024-06-04 16:00:18,244 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-06-04 16:00:18,244 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:00:18" (1/1) ... [2024-06-04 16:00:18,244 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:00:18" (1/1) ... [2024-06-04 16:00:18,248 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:00:18" (1/1) ... [2024-06-04 16:00:18,250 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:00:18" (1/1) ... [2024-06-04 16:00:18,251 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:00:18" (1/1) ... [2024-06-04 16:00:18,252 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:00:18" (1/1) ... [2024-06-04 16:00:18,253 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-04 16:00:18,254 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-04 16:00:18,254 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-04 16:00:18,254 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-04 16:00:18,255 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:00:18" (1/1) ... [2024-06-04 16:00:18,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-04 16:00:18,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-04 16:00:18,279 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-06-04 16:00:18,297 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-06-04 16:00:18,311 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-04 16:00:18,312 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-04 16:00:18,312 INFO L130 BoogieDeclarations]: Found specification of procedure reader [2024-06-04 16:00:18,312 INFO L138 BoogieDeclarations]: Found implementation of procedure reader [2024-06-04 16:00:18,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-04 16:00:18,312 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-04 16:00:18,312 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-04 16:00:18,312 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-04 16:00:18,312 INFO L130 BoogieDeclarations]: Found specification of procedure writer [2024-06-04 16:00:18,312 INFO L138 BoogieDeclarations]: Found implementation of procedure writer [2024-06-04 16:00:18,324 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-04 16:00:18,417 INFO L244 CfgBuilder]: Building ICFG [2024-06-04 16:00:18,419 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-04 16:00:18,642 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-04 16:00:18,642 INFO L293 CfgBuilder]: Performing block encoding [2024-06-04 16:00:18,714 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-04 16:00:18,714 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-04 16:00:18,715 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 04:00:18 BoogieIcfgContainer [2024-06-04 16:00:18,715 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-04 16:00:18,716 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-04 16:00:18,717 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-04 16:00:18,719 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-04 16:00:18,719 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.06 04:00:17" (1/4) ... [2024-06-04 16:00:18,719 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70b1e341 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.06 04:00:18, skipping insertion in model container [2024-06-04 16:00:18,720 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 04:00:17" (2/4) ... [2024-06-04 16:00:18,720 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70b1e341 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 04.06 04:00:18, skipping insertion in model container [2024-06-04 16:00:18,720 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:00:18" (3/4) ... [2024-06-04 16:00:18,720 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70b1e341 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 04.06 04:00:18, skipping insertion in model container [2024-06-04 16:00:18,720 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 04:00:18" (4/4) ... [2024-06-04 16:00:18,721 INFO L112 eAbstractionObserver]: Analyzing ICFG read_write_lock-1.i [2024-06-04 16:00:18,733 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-04 16:00:18,733 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-06-04 16:00:18,733 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-04 16:00:18,791 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-06-04 16:00:18,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 56 transitions, 140 flow [2024-06-04 16:00:18,847 INFO L124 PetriNetUnfolderBase]: 0/52 cut-off events. [2024-06-04 16:00:18,847 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-06-04 16:00:18,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69 conditions, 52 events. 0/52 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 96 event pairs, 0 based on Foata normal form. 0/48 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2024-06-04 16:00:18,849 INFO L82 GeneralOperation]: Start removeDead. Operand has 69 places, 56 transitions, 140 flow [2024-06-04 16:00:18,868 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 59 places, 46 transitions, 104 flow [2024-06-04 16:00:18,875 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-04 16:00:18,880 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;@74669238, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-04 16:00:18,880 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-06-04 16:00:18,883 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-04 16:00:18,883 INFO L124 PetriNetUnfolderBase]: 0/7 cut-off events. [2024-06-04 16:00:18,883 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-04 16:00:18,883 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:00:18,884 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-04 16:00:18,884 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-04 16:00:18,888 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:00:18,891 INFO L85 PathProgramCache]: Analyzing trace with hash -1248141548, now seen corresponding path program 1 times [2024-06-04 16:00:18,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:00:18,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784274275] [2024-06-04 16:00:18,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:00:18,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:00:19,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:00:19,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:00:19,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:00:19,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784274275] [2024-06-04 16:00:19,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784274275] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:00:19,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:00:19,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-04 16:00:19,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095812662] [2024-06-04 16:00:19,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:00:19,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-04 16:00:19,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:00:19,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-04 16:00:19,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-04 16:00:19,362 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 56 [2024-06-04 16:00:19,364 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 46 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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-06-04 16:00:19,364 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:00:19,365 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 56 [2024-06-04 16:00:19,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:00:20,369 INFO L124 PetriNetUnfolderBase]: 7973/11888 cut-off events. [2024-06-04 16:00:20,370 INFO L125 PetriNetUnfolderBase]: For 138/138 co-relation queries the response was YES. [2024-06-04 16:00:20,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23072 conditions, 11888 events. 7973/11888 cut-off events. For 138/138 co-relation queries the response was YES. Maximal size of possible extension queue 435. Compared 72068 event pairs, 4535 based on Foata normal form. 9/11682 useless extension candidates. Maximal degree in co-relation 23056. Up to 10819 conditions per place. [2024-06-04 16:00:20,451 INFO L140 encePairwiseOnDemand]: 47/56 looper letters, 49 selfloop transitions, 5 changer transitions 0/64 dead transitions. [2024-06-04 16:00:20,452 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 64 transitions, 257 flow [2024-06-04 16:00:20,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-04 16:00:20,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-04 16:00:20,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 103 transitions. [2024-06-04 16:00:20,462 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6130952380952381 [2024-06-04 16:00:20,464 INFO L175 Difference]: Start difference. First operand has 59 places, 46 transitions, 104 flow. Second operand 3 states and 103 transitions. [2024-06-04 16:00:20,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 64 transitions, 257 flow [2024-06-04 16:00:20,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 64 transitions, 250 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-06-04 16:00:20,475 INFO L231 Difference]: Finished difference. Result has 58 places, 50 transitions, 139 flow [2024-06-04 16:00:20,476 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=139, PETRI_PLACES=58, PETRI_TRANSITIONS=50} [2024-06-04 16:00:20,480 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -1 predicate places. [2024-06-04 16:00:20,480 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 50 transitions, 139 flow [2024-06-04 16:00:20,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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-06-04 16:00:20,481 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:00:20,481 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:00:20,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-04 16:00:20,481 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-04 16:00:20,483 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:00:20,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1168112653, now seen corresponding path program 1 times [2024-06-04 16:00:20,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:00:20,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641051339] [2024-06-04 16:00:20,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:00:20,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:00:20,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:00:20,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:00:20,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:00:20,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641051339] [2024-06-04 16:00:20,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641051339] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:00:20,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:00:20,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-04 16:00:20,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311909129] [2024-06-04 16:00:20,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:00:20,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-04 16:00:20,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:00:20,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-04 16:00:20,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-04 16:00:20,767 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 56 [2024-06-04 16:00:20,768 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 50 transitions, 139 flow. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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-06-04 16:00:20,768 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:00:20,768 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 56 [2024-06-04 16:00:20,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:00:22,016 INFO L124 PetriNetUnfolderBase]: 12553/18107 cut-off events. [2024-06-04 16:00:22,016 INFO L125 PetriNetUnfolderBase]: For 2961/2961 co-relation queries the response was YES. [2024-06-04 16:00:22,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39815 conditions, 18107 events. 12553/18107 cut-off events. For 2961/2961 co-relation queries the response was YES. Maximal size of possible extension queue 600. Compared 106899 event pairs, 6762 based on Foata normal form. 115/18139 useless extension candidates. Maximal degree in co-relation 39800. Up to 16792 conditions per place. [2024-06-04 16:00:22,103 INFO L140 encePairwiseOnDemand]: 43/56 looper letters, 63 selfloop transitions, 9 changer transitions 0/80 dead transitions. [2024-06-04 16:00:22,103 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 80 transitions, 359 flow [2024-06-04 16:00:22,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-04 16:00:22,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-04 16:00:22,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 132 transitions. [2024-06-04 16:00:22,105 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5892857142857143 [2024-06-04 16:00:22,105 INFO L175 Difference]: Start difference. First operand has 58 places, 50 transitions, 139 flow. Second operand 4 states and 132 transitions. [2024-06-04 16:00:22,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 80 transitions, 359 flow [2024-06-04 16:00:22,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 80 transitions, 354 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-04 16:00:22,107 INFO L231 Difference]: Finished difference. Result has 61 places, 54 transitions, 194 flow [2024-06-04 16:00:22,108 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=194, PETRI_PLACES=61, PETRI_TRANSITIONS=54} [2024-06-04 16:00:22,108 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 2 predicate places. [2024-06-04 16:00:22,108 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 54 transitions, 194 flow [2024-06-04 16:00:22,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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-06-04 16:00:22,109 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:00:22,109 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:00:22,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-04 16:00:22,109 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-04 16:00:22,110 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:00:22,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1851752583, now seen corresponding path program 1 times [2024-06-04 16:00:22,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:00:22,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498743088] [2024-06-04 16:00:22,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:00:22,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:00:22,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:00:22,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:00:22,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:00:22,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498743088] [2024-06-04 16:00:22,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498743088] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:00:22,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:00:22,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-04 16:00:22,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321441958] [2024-06-04 16:00:22,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:00:22,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-04 16:00:22,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:00:22,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-04 16:00:22,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-04 16:00:22,238 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 56 [2024-06-04 16:00:22,238 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 54 transitions, 194 flow. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 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-06-04 16:00:22,238 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:00:22,239 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 56 [2024-06-04 16:00:22,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:00:23,331 INFO L124 PetriNetUnfolderBase]: 11740/17119 cut-off events. [2024-06-04 16:00:23,332 INFO L125 PetriNetUnfolderBase]: For 9244/9244 co-relation queries the response was YES. [2024-06-04 16:00:23,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43911 conditions, 17119 events. 11740/17119 cut-off events. For 9244/9244 co-relation queries the response was YES. Maximal size of possible extension queue 587. Compared 101916 event pairs, 4126 based on Foata normal form. 339/17316 useless extension candidates. Maximal degree in co-relation 43894. Up to 13739 conditions per place. [2024-06-04 16:00:23,426 INFO L140 encePairwiseOnDemand]: 41/56 looper letters, 83 selfloop transitions, 21 changer transitions 0/112 dead transitions. [2024-06-04 16:00:23,426 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 112 transitions, 594 flow [2024-06-04 16:00:23,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 16:00:23,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 16:00:23,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 171 transitions. [2024-06-04 16:00:23,431 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6107142857142858 [2024-06-04 16:00:23,431 INFO L175 Difference]: Start difference. First operand has 61 places, 54 transitions, 194 flow. Second operand 5 states and 171 transitions. [2024-06-04 16:00:23,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 112 transitions, 594 flow [2024-06-04 16:00:23,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 112 transitions, 578 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-06-04 16:00:23,436 INFO L231 Difference]: Finished difference. Result has 66 places, 66 transitions, 347 flow [2024-06-04 16:00:23,437 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=347, PETRI_PLACES=66, PETRI_TRANSITIONS=66} [2024-06-04 16:00:23,438 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 7 predicate places. [2024-06-04 16:00:23,438 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 66 transitions, 347 flow [2024-06-04 16:00:23,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 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-06-04 16:00:23,438 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:00:23,438 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:00:23,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-04 16:00:23,439 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-04 16:00:23,440 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:00:23,440 INFO L85 PathProgramCache]: Analyzing trace with hash -738555242, now seen corresponding path program 1 times [2024-06-04 16:00:23,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:00:23,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525920056] [2024-06-04 16:00:23,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:00:23,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:00:23,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:00:23,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:00:23,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:00:23,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525920056] [2024-06-04 16:00:23,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525920056] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:00:23,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:00:23,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-04 16:00:23,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410189827] [2024-06-04 16:00:23,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:00:23,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-04 16:00:23,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:00:23,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-04 16:00:23,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-04 16:00:23,622 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 56 [2024-06-04 16:00:23,623 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 66 transitions, 347 flow. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 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-06-04 16:00:23,623 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:00:23,623 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 56 [2024-06-04 16:00:23,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:00:24,841 INFO L124 PetriNetUnfolderBase]: 11526/16756 cut-off events. [2024-06-04 16:00:24,841 INFO L125 PetriNetUnfolderBase]: For 27031/27037 co-relation queries the response was YES. [2024-06-04 16:00:24,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53617 conditions, 16756 events. 11526/16756 cut-off events. For 27031/27037 co-relation queries the response was YES. Maximal size of possible extension queue 584. Compared 99604 event pairs, 3905 based on Foata normal form. 110/16706 useless extension candidates. Maximal degree in co-relation 53597. Up to 13709 conditions per place. [2024-06-04 16:00:24,919 INFO L140 encePairwiseOnDemand]: 43/56 looper letters, 83 selfloop transitions, 17 changer transitions 0/108 dead transitions. [2024-06-04 16:00:24,919 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 108 transitions, 677 flow [2024-06-04 16:00:24,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 16:00:24,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 16:00:24,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 165 transitions. [2024-06-04 16:00:24,920 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5892857142857143 [2024-06-04 16:00:24,920 INFO L175 Difference]: Start difference. First operand has 66 places, 66 transitions, 347 flow. Second operand 5 states and 165 transitions. [2024-06-04 16:00:24,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 108 transitions, 677 flow [2024-06-04 16:00:24,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 108 transitions, 669 flow, removed 4 selfloop flow, removed 0 redundant places. [2024-06-04 16:00:24,929 INFO L231 Difference]: Finished difference. Result has 70 places, 65 transitions, 377 flow [2024-06-04 16:00:24,929 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=331, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=377, PETRI_PLACES=70, PETRI_TRANSITIONS=65} [2024-06-04 16:00:24,930 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 11 predicate places. [2024-06-04 16:00:24,930 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 65 transitions, 377 flow [2024-06-04 16:00:24,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 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-06-04 16:00:24,930 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:00:24,931 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:00:24,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-04 16:00:24,931 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-04 16:00:24,931 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:00:24,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1400516435, now seen corresponding path program 1 times [2024-06-04 16:00:24,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:00:24,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009953399] [2024-06-04 16:00:24,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:00:24,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:00:24,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:00:25,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:00:25,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:00:25,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009953399] [2024-06-04 16:00:25,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009953399] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:00:25,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:00:25,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-04 16:00:25,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393104036] [2024-06-04 16:00:25,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:00:25,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-04 16:00:25,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:00:25,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-04 16:00:25,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-06-04 16:00:25,092 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 56 [2024-06-04 16:00:25,092 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 65 transitions, 377 flow. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 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-06-04 16:00:25,092 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:00:25,092 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 56 [2024-06-04 16:00:25,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:00:26,450 INFO L124 PetriNetUnfolderBase]: 11921/17779 cut-off events. [2024-06-04 16:00:26,451 INFO L125 PetriNetUnfolderBase]: For 37613/37627 co-relation queries the response was YES. [2024-06-04 16:00:26,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58890 conditions, 17779 events. 11921/17779 cut-off events. For 37613/37627 co-relation queries the response was YES. Maximal size of possible extension queue 650. Compared 112235 event pairs, 4615 based on Foata normal form. 50/17426 useless extension candidates. Maximal degree in co-relation 58867. Up to 15428 conditions per place. [2024-06-04 16:00:26,544 INFO L140 encePairwiseOnDemand]: 47/56 looper letters, 94 selfloop transitions, 17 changer transitions 0/122 dead transitions. [2024-06-04 16:00:26,545 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 122 transitions, 846 flow [2024-06-04 16:00:26,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 16:00:26,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 16:00:26,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 181 transitions. [2024-06-04 16:00:26,546 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5386904761904762 [2024-06-04 16:00:26,546 INFO L175 Difference]: Start difference. First operand has 70 places, 65 transitions, 377 flow. Second operand 6 states and 181 transitions. [2024-06-04 16:00:26,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 122 transitions, 846 flow [2024-06-04 16:00:26,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 122 transitions, 804 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-06-04 16:00:26,566 INFO L231 Difference]: Finished difference. Result has 74 places, 78 transitions, 508 flow [2024-06-04 16:00:26,567 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=340, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=508, PETRI_PLACES=74, PETRI_TRANSITIONS=78} [2024-06-04 16:00:26,567 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 15 predicate places. [2024-06-04 16:00:26,568 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 78 transitions, 508 flow [2024-06-04 16:00:26,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 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-06-04 16:00:26,568 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:00:26,568 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:00:26,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-04 16:00:26,569 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-04 16:00:26,569 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:00:26,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1586814578, now seen corresponding path program 1 times [2024-06-04 16:00:26,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:00:26,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875857168] [2024-06-04 16:00:26,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:00:26,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:00:26,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:00:26,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:00:26,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:00:26,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875857168] [2024-06-04 16:00:26,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875857168] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:00:26,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:00:26,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-04 16:00:26,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218253060] [2024-06-04 16:00:26,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:00:26,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-04 16:00:26,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:00:26,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-04 16:00:26,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-04 16:00:26,599 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 56 [2024-06-04 16:00:26,599 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 78 transitions, 508 flow. Second operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:00:26,599 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:00:26,599 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 56 [2024-06-04 16:00:26,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:00:27,424 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([186] L749-->ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT: Formula: (let ((.cse4 (< v_~y~0_10 0))) (let ((.cse0 (not (= |v_#ghost~multithreaded_9| 0))) (.cse1 (< v_~w~0_9 0)) (.cse5 (and (not (= v_~y~0_10 3)) (not (= v_~y~0_10 0)))) (.cse6 (not (= (let ((.cse10 (mod v_~y~0_10 3))) (ite (and (not (= .cse10 0)) .cse4) (+ .cse10 (- 3)) .cse10)) 0))) (.cse2 (< 1 v_~w~0_9)) (.cse3 (and (not (= v_~w~0_9 0)) (not (= v_~w~0_9 1)))) (.cse7 (< 127 v_~y~0_10))) (or (and .cse0 (or .cse1 .cse2 .cse3)) (and .cse0 (or .cse4 .cse5 .cse6 .cse7 (< 3 v_~y~0_10))) (and .cse0 (let ((.cse9 (< v_~x~0_10 0))) (or (< 127 v_~x~0_10) (not (= (let ((.cse8 (mod v_~x~0_10 3))) (ite (and (not (= .cse8 0)) .cse9) (+ .cse8 (- 3)) .cse8)) 0)) (and (not (= v_~x~0_10 3)) (not (= v_~x~0_10 0))) (< 3 v_~x~0_10) .cse9))) (and .cse0 (or .cse1 .cse4 .cse5 .cse6 .cse2 .cse3 .cse7))))) InVars {~w~0=v_~w~0_9, #ghost~multithreaded=|v_#ghost~multithreaded_9|, ~y~0=v_~y~0_10, ~x~0=v_~x~0_10} OutVars{~w~0=v_~w~0_9, #ghost~multithreaded=|v_#ghost~multithreaded_9|, ~y~0=v_~y~0_10, ~x~0=v_~x~0_10} AuxVars[] AssignedVars[][70], [readerThread1of1ForFork3InUse, readerThread1of1ForFork2InUse, writerThread1of1ForFork0InUse, writerThread1of1ForFork1InUse, Black: 101#(and (= ~x~0 0) (= |readerThread1of1ForFork2_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), Black: 98#(and (= ~x~0 0) (= |readerThread1of1ForFork2_~l~0#1| 0) (= ~w~0 0)), Black: 74#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), 95#true, 81#true, Black: 79#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 106#(= ~r~0 0), 61#L721true, 49#L740true, Black: 83#(= ~y~0 0), Black: 85#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), 28#L721true, Black: 84#(and (= ~w~0 1) (= ~y~0 0)), 31#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 46#L732true, Black: 93#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0))]) [2024-06-04 16:00:27,424 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is not cut-off event [2024-06-04 16:00:27,424 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is not cut-off event [2024-06-04 16:00:27,424 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is not cut-off event [2024-06-04 16:00:27,424 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is not cut-off event [2024-06-04 16:00:27,430 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([246] L717-->L717-1: Formula: (and (not (= (ite (and (= v_~r~0_55 0) (= v_~w~0_73 0)) 1 0) 0)) (= v_~w~0_72 1)) InVars {~w~0=v_~w~0_73, ~r~0=v_~r~0_55} OutVars{~w~0=v_~w~0_72, writerThread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_writerThread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, writerThread1of1ForFork1_assume_abort_if_not_~cond#1=|v_writerThread1of1ForFork1_assume_abort_if_not_~cond#1_1|, ~r~0=v_~r~0_55} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork1_assume_abort_if_not_~cond#1, writerThread1of1ForFork1_assume_abort_if_not_#in~cond#1][90], [readerThread1of1ForFork3InUse, readerThread1of1ForFork2InUse, writerThread1of1ForFork0InUse, writerThread1of1ForFork1InUse, Black: 101#(and (= ~x~0 0) (= |readerThread1of1ForFork2_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), Black: 98#(and (= ~x~0 0) (= |readerThread1of1ForFork2_~l~0#1| 0) (= ~w~0 0)), 36#L717-1true, Black: 74#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), 95#true, 81#true, Black: 79#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 106#(= ~r~0 0), 49#L740true, Black: 83#(= ~y~0 0), Black: 85#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), 28#L721true, Black: 84#(and (= ~w~0 1) (= ~y~0 0)), 31#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 19#L740true, Black: 93#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0))]) [2024-06-04 16:00:27,431 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-06-04 16:00:27,431 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-06-04 16:00:27,431 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-06-04 16:00:27,431 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-06-04 16:00:27,459 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([241] L717-->L717-1: Formula: (and (not (= (ite (and (= v_~r~0_55 0) (= v_~w~0_73 0)) 1 0) 0)) (= v_~w~0_72 1)) InVars {~w~0=v_~w~0_73, ~r~0=v_~r~0_55} OutVars{~w~0=v_~w~0_72, writerThread1of1ForFork0_assume_abort_if_not_~cond#1=|v_writerThread1of1ForFork0_assume_abort_if_not_~cond#1_1|, writerThread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_writerThread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~r~0=v_~r~0_55} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork0_assume_abort_if_not_#in~cond#1, writerThread1of1ForFork0_assume_abort_if_not_~cond#1][93], [readerThread1of1ForFork3InUse, readerThread1of1ForFork2InUse, writerThread1of1ForFork0InUse, writerThread1of1ForFork1InUse, Black: 101#(and (= ~x~0 0) (= |readerThread1of1ForFork2_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), Black: 98#(and (= ~x~0 0) (= |readerThread1of1ForFork2_~l~0#1| 0) (= ~w~0 0)), Black: 74#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), 95#true, 81#true, Black: 79#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 106#(= ~r~0 0), 61#L721true, 49#L740true, Black: 83#(= ~y~0 0), Black: 85#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), Black: 84#(and (= ~w~0 1) (= ~y~0 0)), 31#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 21#L717-1true, 19#L740true, Black: 93#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0))]) [2024-06-04 16:00:27,459 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-06-04 16:00:27,459 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-06-04 16:00:27,459 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-06-04 16:00:27,459 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-06-04 16:00:27,471 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([186] L749-->ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT: Formula: (let ((.cse4 (< v_~y~0_10 0))) (let ((.cse0 (not (= |v_#ghost~multithreaded_9| 0))) (.cse1 (< v_~w~0_9 0)) (.cse5 (and (not (= v_~y~0_10 3)) (not (= v_~y~0_10 0)))) (.cse6 (not (= (let ((.cse10 (mod v_~y~0_10 3))) (ite (and (not (= .cse10 0)) .cse4) (+ .cse10 (- 3)) .cse10)) 0))) (.cse2 (< 1 v_~w~0_9)) (.cse3 (and (not (= v_~w~0_9 0)) (not (= v_~w~0_9 1)))) (.cse7 (< 127 v_~y~0_10))) (or (and .cse0 (or .cse1 .cse2 .cse3)) (and .cse0 (or .cse4 .cse5 .cse6 .cse7 (< 3 v_~y~0_10))) (and .cse0 (let ((.cse9 (< v_~x~0_10 0))) (or (< 127 v_~x~0_10) (not (= (let ((.cse8 (mod v_~x~0_10 3))) (ite (and (not (= .cse8 0)) .cse9) (+ .cse8 (- 3)) .cse8)) 0)) (and (not (= v_~x~0_10 3)) (not (= v_~x~0_10 0))) (< 3 v_~x~0_10) .cse9))) (and .cse0 (or .cse1 .cse4 .cse5 .cse6 .cse2 .cse3 .cse7))))) InVars {~w~0=v_~w~0_9, #ghost~multithreaded=|v_#ghost~multithreaded_9|, ~y~0=v_~y~0_10, ~x~0=v_~x~0_10} OutVars{~w~0=v_~w~0_9, #ghost~multithreaded=|v_#ghost~multithreaded_9|, ~y~0=v_~y~0_10, ~x~0=v_~x~0_10} AuxVars[] AssignedVars[][70], [readerThread1of1ForFork3InUse, readerThread1of1ForFork2InUse, writerThread1of1ForFork0InUse, writerThread1of1ForFork1InUse, Black: 101#(and (= ~x~0 0) (= |readerThread1of1ForFork2_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), Black: 98#(and (= ~x~0 0) (= |readerThread1of1ForFork2_~l~0#1| 0) (= ~w~0 0)), Black: 74#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), 95#true, 81#true, Black: 79#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 106#(= ~r~0 0), 15#readerEXITtrue, 61#L721true, Black: 83#(= ~y~0 0), Black: 85#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), 28#L721true, Black: 84#(and (= ~w~0 1) (= ~y~0 0)), 31#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 46#L732true, Black: 93#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0))]) [2024-06-04 16:00:27,471 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is not cut-off event [2024-06-04 16:00:27,471 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is not cut-off event [2024-06-04 16:00:27,471 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is not cut-off event [2024-06-04 16:00:27,471 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is not cut-off event [2024-06-04 16:00:27,472 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([246] L717-->L717-1: Formula: (and (not (= (ite (and (= v_~r~0_55 0) (= v_~w~0_73 0)) 1 0) 0)) (= v_~w~0_72 1)) InVars {~w~0=v_~w~0_73, ~r~0=v_~r~0_55} OutVars{~w~0=v_~w~0_72, writerThread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_writerThread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, writerThread1of1ForFork1_assume_abort_if_not_~cond#1=|v_writerThread1of1ForFork1_assume_abort_if_not_~cond#1_1|, ~r~0=v_~r~0_55} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork1_assume_abort_if_not_~cond#1, writerThread1of1ForFork1_assume_abort_if_not_#in~cond#1][90], [readerThread1of1ForFork3InUse, readerThread1of1ForFork2InUse, writerThread1of1ForFork0InUse, Black: 101#(and (= ~x~0 0) (= |readerThread1of1ForFork2_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), writerThread1of1ForFork1InUse, Black: 98#(and (= ~x~0 0) (= |readerThread1of1ForFork2_~l~0#1| 0) (= ~w~0 0)), 36#L717-1true, Black: 74#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), 95#true, 81#true, Black: 79#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 106#(= ~r~0 0), Black: 83#(= ~y~0 0), 49#L740true, Black: 85#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), 28#L721true, Black: 84#(and (= ~w~0 1) (= ~y~0 0)), 31#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 19#L740true, Black: 93#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0))]) [2024-06-04 16:00:27,472 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-06-04 16:00:27,472 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-06-04 16:00:27,472 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-06-04 16:00:27,473 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-06-04 16:00:27,473 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-06-04 16:00:27,477 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([246] L717-->L717-1: Formula: (and (not (= (ite (and (= v_~r~0_55 0) (= v_~w~0_73 0)) 1 0) 0)) (= v_~w~0_72 1)) InVars {~w~0=v_~w~0_73, ~r~0=v_~r~0_55} OutVars{~w~0=v_~w~0_72, writerThread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_writerThread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, writerThread1of1ForFork1_assume_abort_if_not_~cond#1=|v_writerThread1of1ForFork1_assume_abort_if_not_~cond#1_1|, ~r~0=v_~r~0_55} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork1_assume_abort_if_not_~cond#1, writerThread1of1ForFork1_assume_abort_if_not_#in~cond#1][90], [readerThread1of1ForFork3InUse, readerThread1of1ForFork2InUse, writerThread1of1ForFork0InUse, writerThread1of1ForFork1InUse, Black: 101#(and (= ~x~0 0) (= |readerThread1of1ForFork2_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), Black: 98#(and (= ~x~0 0) (= |readerThread1of1ForFork2_~l~0#1| 0) (= ~w~0 0)), 36#L717-1true, Black: 74#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), 95#true, 81#true, Black: 79#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 106#(= ~r~0 0), 15#readerEXITtrue, Black: 83#(= ~y~0 0), Black: 85#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), 28#L721true, Black: 84#(and (= ~w~0 1) (= ~y~0 0)), 31#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 19#L740true, Black: 93#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0))]) [2024-06-04 16:00:27,477 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-06-04 16:00:27,478 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-06-04 16:00:27,478 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-06-04 16:00:27,478 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-06-04 16:00:27,478 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([246] L717-->L717-1: Formula: (and (not (= (ite (and (= v_~r~0_55 0) (= v_~w~0_73 0)) 1 0) 0)) (= v_~w~0_72 1)) InVars {~w~0=v_~w~0_73, ~r~0=v_~r~0_55} OutVars{~w~0=v_~w~0_72, writerThread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_writerThread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, writerThread1of1ForFork1_assume_abort_if_not_~cond#1=|v_writerThread1of1ForFork1_assume_abort_if_not_~cond#1_1|, ~r~0=v_~r~0_55} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork1_assume_abort_if_not_~cond#1, writerThread1of1ForFork1_assume_abort_if_not_#in~cond#1][90], [readerThread1of1ForFork3InUse, readerThread1of1ForFork2InUse, writerThread1of1ForFork0InUse, writerThread1of1ForFork1InUse, Black: 101#(and (= ~x~0 0) (= |readerThread1of1ForFork2_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), Black: 98#(and (= ~x~0 0) (= |readerThread1of1ForFork2_~l~0#1| 0) (= ~w~0 0)), 36#L717-1true, Black: 74#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), 95#true, 81#true, Black: 79#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 106#(= ~r~0 0), 27#readerEXITtrue, Black: 83#(= ~y~0 0), 49#L740true, Black: 85#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), 28#L721true, Black: 84#(and (= ~w~0 1) (= ~y~0 0)), 31#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, Black: 93#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0))]) [2024-06-04 16:00:27,478 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-06-04 16:00:27,478 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-06-04 16:00:27,478 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-06-04 16:00:27,479 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-06-04 16:00:27,483 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([241] L717-->L717-1: Formula: (and (not (= (ite (and (= v_~r~0_55 0) (= v_~w~0_73 0)) 1 0) 0)) (= v_~w~0_72 1)) InVars {~w~0=v_~w~0_73, ~r~0=v_~r~0_55} OutVars{~w~0=v_~w~0_72, writerThread1of1ForFork0_assume_abort_if_not_~cond#1=|v_writerThread1of1ForFork0_assume_abort_if_not_~cond#1_1|, writerThread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_writerThread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~r~0=v_~r~0_55} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork0_assume_abort_if_not_#in~cond#1, writerThread1of1ForFork0_assume_abort_if_not_~cond#1][93], [readerThread1of1ForFork3InUse, readerThread1of1ForFork2InUse, writerThread1of1ForFork0InUse, writerThread1of1ForFork1InUse, Black: 101#(and (= ~x~0 0) (= |readerThread1of1ForFork2_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), Black: 98#(and (= ~x~0 0) (= |readerThread1of1ForFork2_~l~0#1| 0) (= ~w~0 0)), Black: 74#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), 95#true, 81#true, Black: 79#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 106#(= ~r~0 0), 61#L721true, 49#L740true, Black: 83#(= ~y~0 0), Black: 85#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), Black: 84#(and (= ~w~0 1) (= ~y~0 0)), 31#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 21#L717-1true, 19#L740true, Black: 93#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0))]) [2024-06-04 16:00:27,483 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-06-04 16:00:27,483 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-06-04 16:00:27,483 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-06-04 16:00:27,483 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-06-04 16:00:27,483 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-06-04 16:00:27,495 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([241] L717-->L717-1: Formula: (and (not (= (ite (and (= v_~r~0_55 0) (= v_~w~0_73 0)) 1 0) 0)) (= v_~w~0_72 1)) InVars {~w~0=v_~w~0_73, ~r~0=v_~r~0_55} OutVars{~w~0=v_~w~0_72, writerThread1of1ForFork0_assume_abort_if_not_~cond#1=|v_writerThread1of1ForFork0_assume_abort_if_not_~cond#1_1|, writerThread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_writerThread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~r~0=v_~r~0_55} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork0_assume_abort_if_not_#in~cond#1, writerThread1of1ForFork0_assume_abort_if_not_~cond#1][93], [readerThread1of1ForFork3InUse, readerThread1of1ForFork2InUse, writerThread1of1ForFork0InUse, Black: 101#(and (= ~x~0 0) (= |readerThread1of1ForFork2_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), writerThread1of1ForFork1InUse, Black: 98#(and (= ~x~0 0) (= |readerThread1of1ForFork2_~l~0#1| 0) (= ~w~0 0)), Black: 74#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), 95#true, 81#true, Black: 79#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 106#(= ~r~0 0), 15#readerEXITtrue, 61#L721true, Black: 83#(= ~y~0 0), Black: 85#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), Black: 84#(and (= ~w~0 1) (= ~y~0 0)), 31#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 21#L717-1true, 19#L740true, Black: 93#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0))]) [2024-06-04 16:00:27,495 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-06-04 16:00:27,495 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-06-04 16:00:27,496 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-06-04 16:00:27,496 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-06-04 16:00:27,496 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([241] L717-->L717-1: Formula: (and (not (= (ite (and (= v_~r~0_55 0) (= v_~w~0_73 0)) 1 0) 0)) (= v_~w~0_72 1)) InVars {~w~0=v_~w~0_73, ~r~0=v_~r~0_55} OutVars{~w~0=v_~w~0_72, writerThread1of1ForFork0_assume_abort_if_not_~cond#1=|v_writerThread1of1ForFork0_assume_abort_if_not_~cond#1_1|, writerThread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_writerThread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~r~0=v_~r~0_55} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork0_assume_abort_if_not_#in~cond#1, writerThread1of1ForFork0_assume_abort_if_not_~cond#1][93], [readerThread1of1ForFork3InUse, readerThread1of1ForFork2InUse, writerThread1of1ForFork0InUse, writerThread1of1ForFork1InUse, Black: 101#(and (= ~x~0 0) (= |readerThread1of1ForFork2_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), Black: 98#(and (= ~x~0 0) (= |readerThread1of1ForFork2_~l~0#1| 0) (= ~w~0 0)), Black: 74#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), 95#true, 81#true, Black: 79#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 106#(= ~r~0 0), 27#readerEXITtrue, 61#L721true, 49#L740true, Black: 83#(= ~y~0 0), Black: 85#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), Black: 84#(and (= ~w~0 1) (= ~y~0 0)), 31#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 21#L717-1true, Black: 93#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0))]) [2024-06-04 16:00:27,496 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-06-04 16:00:27,496 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-06-04 16:00:27,496 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-06-04 16:00:27,497 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-06-04 16:00:27,507 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([246] L717-->L717-1: Formula: (and (not (= (ite (and (= v_~r~0_55 0) (= v_~w~0_73 0)) 1 0) 0)) (= v_~w~0_72 1)) InVars {~w~0=v_~w~0_73, ~r~0=v_~r~0_55} OutVars{~w~0=v_~w~0_72, writerThread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_writerThread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, writerThread1of1ForFork1_assume_abort_if_not_~cond#1=|v_writerThread1of1ForFork1_assume_abort_if_not_~cond#1_1|, ~r~0=v_~r~0_55} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork1_assume_abort_if_not_~cond#1, writerThread1of1ForFork1_assume_abort_if_not_#in~cond#1][90], [readerThread1of1ForFork3InUse, readerThread1of1ForFork2InUse, writerThread1of1ForFork0InUse, Black: 101#(and (= ~x~0 0) (= |readerThread1of1ForFork2_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), writerThread1of1ForFork1InUse, Black: 98#(and (= ~x~0 0) (= |readerThread1of1ForFork2_~l~0#1| 0) (= ~w~0 0)), 36#L717-1true, Black: 74#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), 95#true, 81#true, Black: 79#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 106#(= ~r~0 0), 15#readerEXITtrue, Black: 83#(= ~y~0 0), Black: 85#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), 28#L721true, Black: 84#(and (= ~w~0 1) (= ~y~0 0)), 31#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 19#L740true, Black: 93#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0))]) [2024-06-04 16:00:27,507 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-06-04 16:00:27,507 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-06-04 16:00:27,507 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-06-04 16:00:27,507 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-06-04 16:00:27,507 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-06-04 16:00:27,508 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([246] L717-->L717-1: Formula: (and (not (= (ite (and (= v_~r~0_55 0) (= v_~w~0_73 0)) 1 0) 0)) (= v_~w~0_72 1)) InVars {~w~0=v_~w~0_73, ~r~0=v_~r~0_55} OutVars{~w~0=v_~w~0_72, writerThread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_writerThread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, writerThread1of1ForFork1_assume_abort_if_not_~cond#1=|v_writerThread1of1ForFork1_assume_abort_if_not_~cond#1_1|, ~r~0=v_~r~0_55} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork1_assume_abort_if_not_~cond#1, writerThread1of1ForFork1_assume_abort_if_not_#in~cond#1][90], [readerThread1of1ForFork3InUse, readerThread1of1ForFork2InUse, writerThread1of1ForFork0InUse, Black: 101#(and (= ~x~0 0) (= |readerThread1of1ForFork2_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), writerThread1of1ForFork1InUse, Black: 98#(and (= ~x~0 0) (= |readerThread1of1ForFork2_~l~0#1| 0) (= ~w~0 0)), 36#L717-1true, Black: 74#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), 95#true, 81#true, Black: 79#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 27#readerEXITtrue, 106#(= ~r~0 0), Black: 83#(= ~y~0 0), 49#L740true, Black: 85#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), 28#L721true, Black: 84#(and (= ~w~0 1) (= ~y~0 0)), 31#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, Black: 93#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0))]) [2024-06-04 16:00:27,508 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-06-04 16:00:27,509 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-06-04 16:00:27,509 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-06-04 16:00:27,509 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-06-04 16:00:27,509 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-06-04 16:00:27,512 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([246] L717-->L717-1: Formula: (and (not (= (ite (and (= v_~r~0_55 0) (= v_~w~0_73 0)) 1 0) 0)) (= v_~w~0_72 1)) InVars {~w~0=v_~w~0_73, ~r~0=v_~r~0_55} OutVars{~w~0=v_~w~0_72, writerThread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_writerThread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, writerThread1of1ForFork1_assume_abort_if_not_~cond#1=|v_writerThread1of1ForFork1_assume_abort_if_not_~cond#1_1|, ~r~0=v_~r~0_55} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork1_assume_abort_if_not_~cond#1, writerThread1of1ForFork1_assume_abort_if_not_#in~cond#1][90], [readerThread1of1ForFork3InUse, readerThread1of1ForFork2InUse, writerThread1of1ForFork0InUse, writerThread1of1ForFork1InUse, Black: 101#(and (= ~x~0 0) (= |readerThread1of1ForFork2_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), Black: 98#(and (= ~x~0 0) (= |readerThread1of1ForFork2_~l~0#1| 0) (= ~w~0 0)), 36#L717-1true, Black: 74#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), 95#true, 81#true, Black: 79#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 106#(= ~r~0 0), 27#readerEXITtrue, 15#readerEXITtrue, Black: 83#(= ~y~0 0), Black: 85#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), 28#L721true, Black: 84#(and (= ~w~0 1) (= ~y~0 0)), 31#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, Black: 93#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0))]) [2024-06-04 16:00:27,512 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-06-04 16:00:27,512 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-06-04 16:00:27,512 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-06-04 16:00:27,512 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-06-04 16:00:27,515 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([241] L717-->L717-1: Formula: (and (not (= (ite (and (= v_~r~0_55 0) (= v_~w~0_73 0)) 1 0) 0)) (= v_~w~0_72 1)) InVars {~w~0=v_~w~0_73, ~r~0=v_~r~0_55} OutVars{~w~0=v_~w~0_72, writerThread1of1ForFork0_assume_abort_if_not_~cond#1=|v_writerThread1of1ForFork0_assume_abort_if_not_~cond#1_1|, writerThread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_writerThread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~r~0=v_~r~0_55} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork0_assume_abort_if_not_#in~cond#1, writerThread1of1ForFork0_assume_abort_if_not_~cond#1][93], [readerThread1of1ForFork3InUse, readerThread1of1ForFork2InUse, writerThread1of1ForFork0InUse, writerThread1of1ForFork1InUse, Black: 101#(and (= ~x~0 0) (= |readerThread1of1ForFork2_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), Black: 98#(and (= ~x~0 0) (= |readerThread1of1ForFork2_~l~0#1| 0) (= ~w~0 0)), Black: 74#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), 95#true, 81#true, Black: 79#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 106#(= ~r~0 0), 15#readerEXITtrue, 61#L721true, Black: 83#(= ~y~0 0), Black: 85#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), Black: 84#(and (= ~w~0 1) (= ~y~0 0)), 21#L717-1true, 31#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 19#L740true, Black: 93#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0))]) [2024-06-04 16:00:27,515 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-06-04 16:00:27,516 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-06-04 16:00:27,516 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-06-04 16:00:27,516 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-06-04 16:00:27,516 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-06-04 16:00:27,517 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([241] L717-->L717-1: Formula: (and (not (= (ite (and (= v_~r~0_55 0) (= v_~w~0_73 0)) 1 0) 0)) (= v_~w~0_72 1)) InVars {~w~0=v_~w~0_73, ~r~0=v_~r~0_55} OutVars{~w~0=v_~w~0_72, writerThread1of1ForFork0_assume_abort_if_not_~cond#1=|v_writerThread1of1ForFork0_assume_abort_if_not_~cond#1_1|, writerThread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_writerThread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~r~0=v_~r~0_55} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork0_assume_abort_if_not_#in~cond#1, writerThread1of1ForFork0_assume_abort_if_not_~cond#1][93], [readerThread1of1ForFork3InUse, readerThread1of1ForFork2InUse, writerThread1of1ForFork0InUse, writerThread1of1ForFork1InUse, Black: 101#(and (= ~x~0 0) (= |readerThread1of1ForFork2_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), Black: 98#(and (= ~x~0 0) (= |readerThread1of1ForFork2_~l~0#1| 0) (= ~w~0 0)), Black: 74#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), 95#true, 81#true, Black: 79#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 106#(= ~r~0 0), 27#readerEXITtrue, 61#L721true, 49#L740true, Black: 83#(= ~y~0 0), Black: 85#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), Black: 84#(and (= ~w~0 1) (= ~y~0 0)), 31#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 21#L717-1true, Black: 93#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0))]) [2024-06-04 16:00:27,517 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-06-04 16:00:27,517 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-06-04 16:00:27,517 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-06-04 16:00:27,517 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-06-04 16:00:27,517 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-06-04 16:00:27,637 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([241] L717-->L717-1: Formula: (and (not (= (ite (and (= v_~r~0_55 0) (= v_~w~0_73 0)) 1 0) 0)) (= v_~w~0_72 1)) InVars {~w~0=v_~w~0_73, ~r~0=v_~r~0_55} OutVars{~w~0=v_~w~0_72, writerThread1of1ForFork0_assume_abort_if_not_~cond#1=|v_writerThread1of1ForFork0_assume_abort_if_not_~cond#1_1|, writerThread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_writerThread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~r~0=v_~r~0_55} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork0_assume_abort_if_not_#in~cond#1, writerThread1of1ForFork0_assume_abort_if_not_~cond#1][93], [readerThread1of1ForFork3InUse, readerThread1of1ForFork2InUse, writerThread1of1ForFork0InUse, Black: 101#(and (= ~x~0 0) (= |readerThread1of1ForFork2_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), writerThread1of1ForFork1InUse, Black: 98#(and (= ~x~0 0) (= |readerThread1of1ForFork2_~l~0#1| 0) (= ~w~0 0)), Black: 74#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), 95#true, 81#true, Black: 79#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 106#(= ~r~0 0), 27#readerEXITtrue, 15#readerEXITtrue, 61#L721true, Black: 83#(= ~y~0 0), Black: 85#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), Black: 84#(and (= ~w~0 1) (= ~y~0 0)), 21#L717-1true, 31#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, Black: 93#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0))]) [2024-06-04 16:00:27,638 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-06-04 16:00:27,638 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-06-04 16:00:27,638 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-06-04 16:00:27,638 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-06-04 16:00:27,648 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([246] L717-->L717-1: Formula: (and (not (= (ite (and (= v_~r~0_55 0) (= v_~w~0_73 0)) 1 0) 0)) (= v_~w~0_72 1)) InVars {~w~0=v_~w~0_73, ~r~0=v_~r~0_55} OutVars{~w~0=v_~w~0_72, writerThread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_writerThread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, writerThread1of1ForFork1_assume_abort_if_not_~cond#1=|v_writerThread1of1ForFork1_assume_abort_if_not_~cond#1_1|, ~r~0=v_~r~0_55} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork1_assume_abort_if_not_~cond#1, writerThread1of1ForFork1_assume_abort_if_not_#in~cond#1][90], [readerThread1of1ForFork3InUse, readerThread1of1ForFork2InUse, writerThread1of1ForFork0InUse, Black: 101#(and (= ~x~0 0) (= |readerThread1of1ForFork2_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), writerThread1of1ForFork1InUse, Black: 98#(and (= ~x~0 0) (= |readerThread1of1ForFork2_~l~0#1| 0) (= ~w~0 0)), 36#L717-1true, Black: 74#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), 95#true, 81#true, Black: 79#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 27#readerEXITtrue, 106#(= ~r~0 0), 15#readerEXITtrue, Black: 83#(= ~y~0 0), Black: 85#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), 28#L721true, Black: 84#(and (= ~w~0 1) (= ~y~0 0)), 31#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, Black: 93#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0))]) [2024-06-04 16:00:27,649 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-06-04 16:00:27,649 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-06-04 16:00:27,649 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-06-04 16:00:27,649 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-06-04 16:00:27,649 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-06-04 16:00:27,654 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([241] L717-->L717-1: Formula: (and (not (= (ite (and (= v_~r~0_55 0) (= v_~w~0_73 0)) 1 0) 0)) (= v_~w~0_72 1)) InVars {~w~0=v_~w~0_73, ~r~0=v_~r~0_55} OutVars{~w~0=v_~w~0_72, writerThread1of1ForFork0_assume_abort_if_not_~cond#1=|v_writerThread1of1ForFork0_assume_abort_if_not_~cond#1_1|, writerThread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_writerThread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~r~0=v_~r~0_55} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork0_assume_abort_if_not_#in~cond#1, writerThread1of1ForFork0_assume_abort_if_not_~cond#1][93], [readerThread1of1ForFork3InUse, readerThread1of1ForFork2InUse, writerThread1of1ForFork0InUse, writerThread1of1ForFork1InUse, Black: 101#(and (= ~x~0 0) (= |readerThread1of1ForFork2_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), Black: 98#(and (= ~x~0 0) (= |readerThread1of1ForFork2_~l~0#1| 0) (= ~w~0 0)), Black: 74#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), 95#true, 81#true, Black: 79#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 27#readerEXITtrue, 106#(= ~r~0 0), 15#readerEXITtrue, 61#L721true, Black: 83#(= ~y~0 0), Black: 85#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), Black: 84#(and (= ~w~0 1) (= ~y~0 0)), 21#L717-1true, 31#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, Black: 93#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0))]) [2024-06-04 16:00:27,654 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-06-04 16:00:27,654 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-06-04 16:00:27,654 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-06-04 16:00:27,654 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-06-04 16:00:27,655 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-06-04 16:00:27,681 INFO L124 PetriNetUnfolderBase]: 7308/12759 cut-off events. [2024-06-04 16:00:27,681 INFO L125 PetriNetUnfolderBase]: For 46221/48021 co-relation queries the response was YES. [2024-06-04 16:00:27,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42008 conditions, 12759 events. 7308/12759 cut-off events. For 46221/48021 co-relation queries the response was YES. Maximal size of possible extension queue 659. Compared 101157 event pairs, 2644 based on Foata normal form. 733/12618 useless extension candidates. Maximal degree in co-relation 41984. Up to 4738 conditions per place. [2024-06-04 16:00:27,750 INFO L140 encePairwiseOnDemand]: 49/56 looper letters, 63 selfloop transitions, 15 changer transitions 0/110 dead transitions. [2024-06-04 16:00:27,750 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 110 transitions, 726 flow [2024-06-04 16:00:27,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-04 16:00:27,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-04 16:00:27,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 162 transitions. [2024-06-04 16:00:27,751 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7232142857142857 [2024-06-04 16:00:27,752 INFO L175 Difference]: Start difference. First operand has 74 places, 78 transitions, 508 flow. Second operand 4 states and 162 transitions. [2024-06-04 16:00:27,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 110 transitions, 726 flow [2024-06-04 16:00:27,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 110 transitions, 710 flow, removed 5 selfloop flow, removed 1 redundant places. [2024-06-04 16:00:27,766 INFO L231 Difference]: Finished difference. Result has 79 places, 78 transitions, 554 flow [2024-06-04 16:00:27,766 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=422, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=554, PETRI_PLACES=79, PETRI_TRANSITIONS=78} [2024-06-04 16:00:27,768 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 20 predicate places. [2024-06-04 16:00:27,768 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 78 transitions, 554 flow [2024-06-04 16:00:27,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:00:27,769 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:00:27,769 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:00:27,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-04 16:00:27,769 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-04 16:00:27,770 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:00:27,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1046716557, now seen corresponding path program 1 times [2024-06-04 16:00:27,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:00:27,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420171646] [2024-06-04 16:00:27,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:00:27,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:00:27,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:00:27,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:00:27,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:00:27,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420171646] [2024-06-04 16:00:27,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420171646] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:00:27,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:00:27,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 16:00:27,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791555874] [2024-06-04 16:00:27,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:00:27,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-04 16:00:27,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:00:27,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-04 16:00:27,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-06-04 16:00:27,992 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 56 [2024-06-04 16:00:27,993 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 78 transitions, 554 flow. Second operand has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 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-06-04 16:00:27,993 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:00:27,993 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 56 [2024-06-04 16:00:27,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:00:30,133 INFO L124 PetriNetUnfolderBase]: 17838/27042 cut-off events. [2024-06-04 16:00:30,133 INFO L125 PetriNetUnfolderBase]: For 85198/85202 co-relation queries the response was YES. [2024-06-04 16:00:30,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93266 conditions, 27042 events. 17838/27042 cut-off events. For 85198/85202 co-relation queries the response was YES. Maximal size of possible extension queue 1059. Compared 185397 event pairs, 2134 based on Foata normal form. 468/27415 useless extension candidates. Maximal degree in co-relation 93237. Up to 10641 conditions per place. [2024-06-04 16:00:30,270 INFO L140 encePairwiseOnDemand]: 42/56 looper letters, 176 selfloop transitions, 28 changer transitions 0/211 dead transitions. [2024-06-04 16:00:30,270 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 211 transitions, 1776 flow [2024-06-04 16:00:30,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 16:00:30,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 16:00:30,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 227 transitions. [2024-06-04 16:00:30,272 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6755952380952381 [2024-06-04 16:00:30,272 INFO L175 Difference]: Start difference. First operand has 79 places, 78 transitions, 554 flow. Second operand 6 states and 227 transitions. [2024-06-04 16:00:30,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 211 transitions, 1776 flow [2024-06-04 16:00:30,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 211 transitions, 1752 flow, removed 12 selfloop flow, removed 0 redundant places. [2024-06-04 16:00:30,344 INFO L231 Difference]: Finished difference. Result has 89 places, 103 transitions, 1006 flow [2024-06-04 16:00:30,344 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=546, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1006, PETRI_PLACES=89, PETRI_TRANSITIONS=103} [2024-06-04 16:00:30,345 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 30 predicate places. [2024-06-04 16:00:30,345 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 103 transitions, 1006 flow [2024-06-04 16:00:30,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 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-06-04 16:00:30,346 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:00:30,346 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:00:30,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-04 16:00:30,346 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-04 16:00:30,346 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:00:30,346 INFO L85 PathProgramCache]: Analyzing trace with hash -2024990247, now seen corresponding path program 1 times [2024-06-04 16:00:30,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:00:30,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305630260] [2024-06-04 16:00:30,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:00:30,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:00:30,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:00:30,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:00:30,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:00:30,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305630260] [2024-06-04 16:00:30,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305630260] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:00:30,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:00:30,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-04 16:00:30,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348705511] [2024-06-04 16:00:30,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:00:30,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-04 16:00:30,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:00:30,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-04 16:00:30,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-04 16:00:30,501 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 56 [2024-06-04 16:00:30,501 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 103 transitions, 1006 flow. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 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-06-04 16:00:30,502 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:00:30,502 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 56 [2024-06-04 16:00:30,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:00:32,664 INFO L124 PetriNetUnfolderBase]: 16474/25524 cut-off events. [2024-06-04 16:00:32,665 INFO L125 PetriNetUnfolderBase]: For 115195/115557 co-relation queries the response was YES. [2024-06-04 16:00:32,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100110 conditions, 25524 events. 16474/25524 cut-off events. For 115195/115557 co-relation queries the response was YES. Maximal size of possible extension queue 1030. Compared 177909 event pairs, 7137 based on Foata normal form. 194/25481 useless extension candidates. Maximal degree in co-relation 100076. Up to 22101 conditions per place. [2024-06-04 16:00:32,825 INFO L140 encePairwiseOnDemand]: 44/56 looper letters, 120 selfloop transitions, 13 changer transitions 0/144 dead transitions. [2024-06-04 16:00:32,825 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 144 transitions, 1464 flow [2024-06-04 16:00:32,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 16:00:32,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 16:00:32,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 168 transitions. [2024-06-04 16:00:32,827 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-06-04 16:00:32,827 INFO L175 Difference]: Start difference. First operand has 89 places, 103 transitions, 1006 flow. Second operand 6 states and 168 transitions. [2024-06-04 16:00:32,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 144 transitions, 1464 flow [2024-06-04 16:00:32,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 144 transitions, 1414 flow, removed 25 selfloop flow, removed 0 redundant places. [2024-06-04 16:00:32,982 INFO L231 Difference]: Finished difference. Result has 95 places, 105 transitions, 1016 flow [2024-06-04 16:00:32,982 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=956, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1016, PETRI_PLACES=95, PETRI_TRANSITIONS=105} [2024-06-04 16:00:32,982 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 36 predicate places. [2024-06-04 16:00:32,983 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 105 transitions, 1016 flow [2024-06-04 16:00:32,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 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-06-04 16:00:32,983 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:00:32,983 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-06-04 16:00:32,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-04 16:00:32,983 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-04 16:00:32,984 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:00:32,984 INFO L85 PathProgramCache]: Analyzing trace with hash -7795348, now seen corresponding path program 1 times [2024-06-04 16:00:32,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:00:32,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225875220] [2024-06-04 16:00:32,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:00:32,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:00:32,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:00:33,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:00:33,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:00:33,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225875220] [2024-06-04 16:00:33,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225875220] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:00:33,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:00:33,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-04 16:00:33,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141929030] [2024-06-04 16:00:33,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:00:33,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-04 16:00:33,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:00:33,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-04 16:00:33,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-04 16:00:33,303 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 56 [2024-06-04 16:00:33,305 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 105 transitions, 1016 flow. Second operand has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 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-06-04 16:00:33,305 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:00:33,305 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 56 [2024-06-04 16:00:33,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:00:35,488 INFO L124 PetriNetUnfolderBase]: 17434/26932 cut-off events. [2024-06-04 16:00:35,488 INFO L125 PetriNetUnfolderBase]: For 116184/116188 co-relation queries the response was YES. [2024-06-04 16:00:35,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104265 conditions, 26932 events. 17434/26932 cut-off events. For 116184/116188 co-relation queries the response was YES. Maximal size of possible extension queue 1069. Compared 187269 event pairs, 6596 based on Foata normal form. 206/26969 useless extension candidates. Maximal degree in co-relation 104227. Up to 22808 conditions per place. [2024-06-04 16:00:35,868 INFO L140 encePairwiseOnDemand]: 44/56 looper letters, 166 selfloop transitions, 28 changer transitions 0/201 dead transitions. [2024-06-04 16:00:35,868 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 201 transitions, 1938 flow [2024-06-04 16:00:35,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 16:00:35,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 16:00:35,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 236 transitions. [2024-06-04 16:00:35,870 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5267857142857143 [2024-06-04 16:00:35,870 INFO L175 Difference]: Start difference. First operand has 95 places, 105 transitions, 1016 flow. Second operand 8 states and 236 transitions. [2024-06-04 16:00:35,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 201 transitions, 1938 flow [2024-06-04 16:00:35,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 201 transitions, 1922 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-04 16:00:35,964 INFO L231 Difference]: Finished difference. Result has 103 places, 118 transitions, 1280 flow [2024-06-04 16:00:35,964 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=1000, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1280, PETRI_PLACES=103, PETRI_TRANSITIONS=118} [2024-06-04 16:00:35,965 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 44 predicate places. [2024-06-04 16:00:35,965 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 118 transitions, 1280 flow [2024-06-04 16:00:35,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 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-06-04 16:00:35,965 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:00:35,965 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-06-04 16:00:35,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-04 16:00:35,966 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-04 16:00:35,966 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:00:35,966 INFO L85 PathProgramCache]: Analyzing trace with hash 746510900, now seen corresponding path program 1 times [2024-06-04 16:00:35,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:00:35,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071956957] [2024-06-04 16:00:35,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:00:35,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:00:35,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:00:36,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:00:36,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:00:36,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071956957] [2024-06-04 16:00:36,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071956957] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:00:36,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:00:36,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-04 16:00:36,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881371555] [2024-06-04 16:00:36,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:00:36,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-04 16:00:36,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:00:36,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-04 16:00:36,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-04 16:00:36,229 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 56 [2024-06-04 16:00:36,229 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 118 transitions, 1280 flow. Second operand has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:00:36,229 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:00:36,229 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 56 [2024-06-04 16:00:36,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:00:38,228 INFO L124 PetriNetUnfolderBase]: 14943/23771 cut-off events. [2024-06-04 16:00:38,228 INFO L125 PetriNetUnfolderBase]: For 127331/127797 co-relation queries the response was YES. [2024-06-04 16:00:38,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96721 conditions, 23771 events. 14943/23771 cut-off events. For 127331/127797 co-relation queries the response was YES. Maximal size of possible extension queue 1033. Compared 173868 event pairs, 6389 based on Foata normal form. 184/23557 useless extension candidates. Maximal degree in co-relation 96679. Up to 20256 conditions per place. [2024-06-04 16:00:38,579 INFO L140 encePairwiseOnDemand]: 48/56 looper letters, 134 selfloop transitions, 18 changer transitions 0/171 dead transitions. [2024-06-04 16:00:38,579 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 171 transitions, 1825 flow [2024-06-04 16:00:38,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 16:00:38,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 16:00:38,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 191 transitions. [2024-06-04 16:00:38,581 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4872448979591837 [2024-06-04 16:00:38,582 INFO L175 Difference]: Start difference. First operand has 103 places, 118 transitions, 1280 flow. Second operand 7 states and 191 transitions. [2024-06-04 16:00:38,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 171 transitions, 1825 flow [2024-06-04 16:00:38,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 171 transitions, 1747 flow, removed 29 selfloop flow, removed 3 redundant places. [2024-06-04 16:00:38,755 INFO L231 Difference]: Finished difference. Result has 107 places, 123 transitions, 1299 flow [2024-06-04 16:00:38,755 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=1202, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1299, PETRI_PLACES=107, PETRI_TRANSITIONS=123} [2024-06-04 16:00:38,755 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 48 predicate places. [2024-06-04 16:00:38,756 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 123 transitions, 1299 flow [2024-06-04 16:00:38,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:00:38,756 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:00:38,756 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-06-04 16:00:38,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-04 16:00:38,756 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-04 16:00:38,757 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:00:38,757 INFO L85 PathProgramCache]: Analyzing trace with hash 596080460, now seen corresponding path program 1 times [2024-06-04 16:00:38,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:00:38,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376129338] [2024-06-04 16:00:38,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:00:38,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:00:38,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:00:38,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:00:38,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:00:38,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376129338] [2024-06-04 16:00:38,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376129338] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:00:38,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:00:38,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 16:00:38,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493266551] [2024-06-04 16:00:38,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:00:38,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 16:00:38,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:00:38,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 16:00:38,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-04 16:00:38,940 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 56 [2024-06-04 16:00:38,941 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 123 transitions, 1299 flow. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 7 states have internal predecessors, (101), 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-06-04 16:00:38,941 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:00:38,941 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 56 [2024-06-04 16:00:38,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:00:42,464 INFO L124 PetriNetUnfolderBase]: 24611/37649 cut-off events. [2024-06-04 16:00:42,464 INFO L125 PetriNetUnfolderBase]: For 205860/205970 co-relation queries the response was YES. [2024-06-04 16:00:42,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 149647 conditions, 37649 events. 24611/37649 cut-off events. For 205860/205970 co-relation queries the response was YES. Maximal size of possible extension queue 1663. Compared 274774 event pairs, 5701 based on Foata normal form. 416/37863 useless extension candidates. Maximal degree in co-relation 149603. Up to 17463 conditions per place. [2024-06-04 16:00:42,784 INFO L140 encePairwiseOnDemand]: 42/56 looper letters, 279 selfloop transitions, 58 changer transitions 0/346 dead transitions. [2024-06-04 16:00:42,785 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 346 transitions, 3249 flow [2024-06-04 16:00:42,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-06-04 16:00:42,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2024-06-04 16:00:42,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 449 transitions. [2024-06-04 16:00:42,786 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5345238095238095 [2024-06-04 16:00:42,786 INFO L175 Difference]: Start difference. First operand has 107 places, 123 transitions, 1299 flow. Second operand 15 states and 449 transitions. [2024-06-04 16:00:42,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 346 transitions, 3249 flow [2024-06-04 16:00:43,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 346 transitions, 3225 flow, removed 11 selfloop flow, removed 1 redundant places. [2024-06-04 16:00:43,295 INFO L231 Difference]: Finished difference. Result has 124 places, 141 transitions, 1717 flow [2024-06-04 16:00:43,295 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=1275, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1717, PETRI_PLACES=124, PETRI_TRANSITIONS=141} [2024-06-04 16:00:43,295 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 65 predicate places. [2024-06-04 16:00:43,295 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 141 transitions, 1717 flow [2024-06-04 16:00:43,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 7 states have internal predecessors, (101), 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-06-04 16:00:43,296 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:00:43,296 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-06-04 16:00:43,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-04 16:00:43,296 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-04 16:00:43,296 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:00:43,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1298626639, now seen corresponding path program 1 times [2024-06-04 16:00:43,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:00:43,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213574273] [2024-06-04 16:00:43,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:00:43,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:00:43,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:00:43,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:00:43,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:00:43,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213574273] [2024-06-04 16:00:43,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213574273] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:00:43,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:00:43,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 16:00:43,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062288346] [2024-06-04 16:00:43,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:00:43,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 16:00:43,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:00:43,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 16:00:43,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-04 16:00:43,476 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 56 [2024-06-04 16:00:43,476 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 141 transitions, 1717 flow. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 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-06-04 16:00:43,476 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:00:43,476 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 56 [2024-06-04 16:00:43,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:00:47,788 INFO L124 PetriNetUnfolderBase]: 27349/42063 cut-off events. [2024-06-04 16:00:47,789 INFO L125 PetriNetUnfolderBase]: For 296750/296866 co-relation queries the response was YES. [2024-06-04 16:00:48,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 179553 conditions, 42063 events. 27349/42063 cut-off events. For 296750/296866 co-relation queries the response was YES. Maximal size of possible extension queue 1947. Compared 315639 event pairs, 5822 based on Foata normal form. 460/42319 useless extension candidates. Maximal degree in co-relation 179504. Up to 17463 conditions per place. [2024-06-04 16:00:48,175 INFO L140 encePairwiseOnDemand]: 43/56 looper letters, 270 selfloop transitions, 48 changer transitions 0/327 dead transitions. [2024-06-04 16:00:48,176 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 327 transitions, 3617 flow [2024-06-04 16:00:48,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-04 16:00:48,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-04 16:00:48,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 367 transitions. [2024-06-04 16:00:48,178 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5461309523809523 [2024-06-04 16:00:48,178 INFO L175 Difference]: Start difference. First operand has 124 places, 141 transitions, 1717 flow. Second operand 12 states and 367 transitions. [2024-06-04 16:00:48,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 327 transitions, 3617 flow [2024-06-04 16:00:49,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 327 transitions, 3476 flow, removed 34 selfloop flow, removed 9 redundant places. [2024-06-04 16:00:49,034 INFO L231 Difference]: Finished difference. Result has 128 places, 154 transitions, 1922 flow [2024-06-04 16:00:49,034 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=1578, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1922, PETRI_PLACES=128, PETRI_TRANSITIONS=154} [2024-06-04 16:00:49,034 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 69 predicate places. [2024-06-04 16:00:49,035 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 154 transitions, 1922 flow [2024-06-04 16:00:49,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 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-06-04 16:00:49,035 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:00:49,035 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, 1, 1] [2024-06-04 16:00:49,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-04 16:00:49,035 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-04 16:00:49,036 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:00:49,036 INFO L85 PathProgramCache]: Analyzing trace with hash -257690284, now seen corresponding path program 1 times [2024-06-04 16:00:49,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:00:49,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655838692] [2024-06-04 16:00:49,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:00:49,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:00:49,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:00:49,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:00:49,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:00:49,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655838692] [2024-06-04 16:00:49,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655838692] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:00:49,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:00:49,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 16:00:49,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063628142] [2024-06-04 16:00:49,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:00:49,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-04 16:00:49,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:00:49,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-04 16:00:49,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-06-04 16:00:49,262 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 56 [2024-06-04 16:00:49,262 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 154 transitions, 1922 flow. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 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-06-04 16:00:49,262 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:00:49,262 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 56 [2024-06-04 16:00:49,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:00:53,569 INFO L124 PetriNetUnfolderBase]: 27162/40922 cut-off events. [2024-06-04 16:00:53,569 INFO L125 PetriNetUnfolderBase]: For 343296/343548 co-relation queries the response was YES. [2024-06-04 16:00:53,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 184508 conditions, 40922 events. 27162/40922 cut-off events. For 343296/343548 co-relation queries the response was YES. Maximal size of possible extension queue 1911. Compared 299716 event pairs, 3926 based on Foata normal form. 566/41110 useless extension candidates. Maximal degree in co-relation 184455. Up to 19890 conditions per place. [2024-06-04 16:00:53,912 INFO L140 encePairwiseOnDemand]: 44/56 looper letters, 183 selfloop transitions, 58 changer transitions 6/258 dead transitions. [2024-06-04 16:00:53,912 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 258 transitions, 3171 flow [2024-06-04 16:00:53,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 16:00:53,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 16:00:53,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 209 transitions. [2024-06-04 16:00:53,913 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6220238095238095 [2024-06-04 16:00:53,913 INFO L175 Difference]: Start difference. First operand has 128 places, 154 transitions, 1922 flow. Second operand 6 states and 209 transitions. [2024-06-04 16:00:53,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 258 transitions, 3171 flow [2024-06-04 16:00:54,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 258 transitions, 3071 flow, removed 20 selfloop flow, removed 8 redundant places. [2024-06-04 16:00:54,815 INFO L231 Difference]: Finished difference. Result has 128 places, 160 transitions, 2144 flow [2024-06-04 16:00:54,815 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=1844, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2144, PETRI_PLACES=128, PETRI_TRANSITIONS=160} [2024-06-04 16:00:54,816 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 69 predicate places. [2024-06-04 16:00:54,816 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 160 transitions, 2144 flow [2024-06-04 16:00:54,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 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-06-04 16:00:54,816 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:00:54,816 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, 1, 1, 1, 1] [2024-06-04 16:00:54,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-04 16:00:54,817 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-04 16:00:54,817 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:00:54,817 INFO L85 PathProgramCache]: Analyzing trace with hash 471427273, now seen corresponding path program 1 times [2024-06-04 16:00:54,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:00:54,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146877585] [2024-06-04 16:00:54,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:00:54,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:00:54,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:00:54,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:00:54,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:00:54,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146877585] [2024-06-04 16:00:54,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146877585] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:00:54,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:00:54,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 16:00:54,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318566156] [2024-06-04 16:00:54,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:00:54,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 16:00:54,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:00:54,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 16:00:54,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-06-04 16:00:55,040 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 56 [2024-06-04 16:00:55,040 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 160 transitions, 2144 flow. Second operand has 7 states, 7 states have (on average 15.142857142857142) internal successors, (106), 7 states have internal predecessors, (106), 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-06-04 16:00:55,040 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:00:55,040 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 56 [2024-06-04 16:00:55,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:00:58,660 INFO L124 PetriNetUnfolderBase]: 22356/34046 cut-off events. [2024-06-04 16:00:58,661 INFO L125 PetriNetUnfolderBase]: For 323114/323400 co-relation queries the response was YES. [2024-06-04 16:00:58,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161115 conditions, 34046 events. 22356/34046 cut-off events. For 323114/323400 co-relation queries the response was YES. Maximal size of possible extension queue 1538. Compared 245520 event pairs, 9058 based on Foata normal form. 302/34036 useless extension candidates. Maximal degree in co-relation 161060. Up to 30762 conditions per place. [2024-06-04 16:00:58,938 INFO L140 encePairwiseOnDemand]: 45/56 looper letters, 192 selfloop transitions, 35 changer transitions 0/238 dead transitions. [2024-06-04 16:00:58,938 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 238 transitions, 2976 flow [2024-06-04 16:00:58,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:00:58,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:00:58,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 238 transitions. [2024-06-04 16:00:58,939 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4722222222222222 [2024-06-04 16:00:58,939 INFO L175 Difference]: Start difference. First operand has 128 places, 160 transitions, 2144 flow. Second operand 9 states and 238 transitions. [2024-06-04 16:00:58,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 238 transitions, 2976 flow [2024-06-04 16:01:00,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 238 transitions, 2816 flow, removed 43 selfloop flow, removed 4 redundant places. [2024-06-04 16:01:00,310 INFO L231 Difference]: Finished difference. Result has 132 places, 165 transitions, 2156 flow [2024-06-04 16:01:00,310 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=2008, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2156, PETRI_PLACES=132, PETRI_TRANSITIONS=165} [2024-06-04 16:01:00,310 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 73 predicate places. [2024-06-04 16:01:00,310 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 165 transitions, 2156 flow [2024-06-04 16:01:00,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.142857142857142) internal successors, (106), 7 states have internal predecessors, (106), 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-06-04 16:01:00,312 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:01:00,312 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, 1, 1, 1, 1, 1] [2024-06-04 16:01:00,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-04 16:01:00,312 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-04 16:01:00,313 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:01:00,313 INFO L85 PathProgramCache]: Analyzing trace with hash 526866637, now seen corresponding path program 1 times [2024-06-04 16:01:00,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:01:00,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306817606] [2024-06-04 16:01:00,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:01:00,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:01:00,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:01:00,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:01:00,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:01:00,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306817606] [2024-06-04 16:01:00,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306817606] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:01:00,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:01:00,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 16:01:00,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398690669] [2024-06-04 16:01:00,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:01:00,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-04 16:01:00,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:01:00,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-04 16:01:00,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-04 16:01:00,509 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 56 [2024-06-04 16:01:00,510 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 165 transitions, 2156 flow. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 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-06-04 16:01:00,510 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:01:00,510 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 56 [2024-06-04 16:01:00,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand