./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-atomic/read_write_lock-2.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-06-19_11-23-25.files/mutex-meet-nonrel/read_write_lock-2.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7724a2de Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-atomic/read_write_lock-2.i ./goblint.2024-06-19_11-23-25.files/mutex-meet-nonrel/read_write_lock-2.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-28 01:15:09,542 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-28 01:15:09,608 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-28 01:15:09,615 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-28 01:15:09,616 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-28 01:15:09,639 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-28 01:15:09,639 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-28 01:15:09,640 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-28 01:15:09,640 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-28 01:15:09,644 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-28 01:15:09,644 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-28 01:15:09,644 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-28 01:15:09,645 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-28 01:15:09,646 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-28 01:15:09,646 INFO L153 SettingsManager]: * Use SBE=true [2024-06-28 01:15:09,646 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-28 01:15:09,647 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-28 01:15:09,647 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-28 01:15:09,647 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-28 01:15:09,647 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-28 01:15:09,648 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-28 01:15:09,649 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-28 01:15:09,649 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-28 01:15:09,649 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-28 01:15:09,649 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-28 01:15:09,649 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-28 01:15:09,650 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-28 01:15:09,650 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-28 01:15:09,650 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-28 01:15:09,651 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-28 01:15:09,651 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-28 01:15:09,652 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-28 01:15:09,652 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-28 01:15:09,652 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-28 01:15:09,652 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-28 01:15:09,652 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-28 01:15:09,653 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-28 01:15:09,653 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-28 01:15:09,653 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-28 01:15:09,653 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-28 01:15:09,653 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-28 01:15:09,654 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-28 01:15:09,654 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-28 01:15:09,654 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-06-28 01:15:09,862 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-28 01:15:09,880 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-28 01:15:09,882 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-28 01:15:09,882 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-28 01:15:09,883 INFO L274 PluginConnector]: CDTParser initialized [2024-06-28 01:15:09,884 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-atomic/read_write_lock-2.i [2024-06-28 01:15:11,021 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-28 01:15:11,213 INFO L384 CDTParser]: Found 1 translation units. [2024-06-28 01:15:11,214 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/read_write_lock-2.i [2024-06-28 01:15:11,225 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b0b1f77b/9b0bb11b1f1e4da29666f59cb94d7a4a/FLAG1459da880 [2024-06-28 01:15:11,235 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b0b1f77b/9b0bb11b1f1e4da29666f59cb94d7a4a [2024-06-28 01:15:11,237 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-28 01:15:11,238 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-28 01:15:11,238 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-06-19_11-23-25.files/mutex-meet-nonrel/read_write_lock-2.yml/witness.yml [2024-06-28 01:15:11,346 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-28 01:15:11,347 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-28 01:15:11,348 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-28 01:15:11,348 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-28 01:15:11,352 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-28 01:15:11,352 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.06 01:15:11" (1/2) ... [2024-06-28 01:15:11,353 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bff4d34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:15:11, skipping insertion in model container [2024-06-28 01:15:11,353 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.06 01:15:11" (1/2) ... [2024-06-28 01:15:11,355 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@67a40e2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:15:11, skipping insertion in model container [2024-06-28 01:15:11,355 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 01:15:11" (2/2) ... [2024-06-28 01:15:11,355 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bff4d34 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:15:11, skipping insertion in model container [2024-06-28 01:15:11,355 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 01:15:11" (2/2) ... [2024-06-28 01:15:11,356 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-28 01:15:11,387 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-28 01:15:11,388 INFO L97 edCorrectnessWitness]: Location invariant before [L751-L751] (((! multithreaded || (x == 0 || x == 3)) && (! multithreaded || (y == 0 || y == 3))) && (! multithreaded || (((w == 0 || w == 1) && (x == 0 || x == 3)) && (y == 0 || y == 3)))) && (! multithreaded || (w == 0 || w == 1)) [2024-06-28 01:15:11,388 INFO L97 edCorrectnessWitness]: Location invariant before [L752-L752] (((! multithreaded || (x == 0 || x == 3)) && (! multithreaded || (y == 0 || y == 3))) && (! multithreaded || (((w == 0 || w == 1) && (x == 0 || x == 3)) && (y == 0 || y == 3)))) && (! multithreaded || (w == 0 || w == 1)) [2024-06-28 01:15:11,388 INFO L97 edCorrectnessWitness]: Location invariant before [L750-L750] (((! multithreaded || (x == 0 || x == 3)) && (! multithreaded || (y == 0 || y == 3))) && (! multithreaded || (((w == 0 || w == 1) && (x == 0 || x == 3)) && (y == 0 || y == 3)))) && (! multithreaded || (w == 0 || w == 1)) [2024-06-28 01:15:11,388 INFO L97 edCorrectnessWitness]: Location invariant before [L753-L753] (((! multithreaded || (x == 0 || x == 3)) && (! multithreaded || (y == 0 || y == 3))) && (! multithreaded || (((w == 0 || w == 1) && (x == 0 || x == 3)) && (y == 0 || y == 3)))) && (! multithreaded || (w == 0 || w == 1)) [2024-06-28 01:15:11,388 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-28 01:15:11,388 INFO L106 edCorrectnessWitness]: ghost_update [L749-L749] multithreaded = 1; [2024-06-28 01:15:11,420 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-28 01:15:11,752 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/read_write_lock-2.i[31244,31257] [2024-06-28 01:15:11,767 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-28 01:15:11,774 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-06-28 01:15:11,838 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/read_write_lock-2.i[31244,31257] Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-28 01:15:11,865 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-28 01:15:11,903 INFO L206 MainTranslator]: Completed translation [2024-06-28 01:15:11,904 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:15:11 WrapperNode [2024-06-28 01:15:11,904 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-28 01:15:11,905 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-28 01:15:11,905 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-28 01:15:11,905 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-28 01:15:11,911 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 28.06 01:15:11" (1/1) ... [2024-06-28 01:15:11,936 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 28.06 01:15:11" (1/1) ... [2024-06-28 01:15:11,970 INFO L138 Inliner]: procedures = 172, calls = 30, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 101 [2024-06-28 01:15:11,972 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-28 01:15:11,973 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-28 01:15:11,973 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-28 01:15:11,973 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-28 01:15:11,983 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:15:11" (1/1) ... [2024-06-28 01:15:11,984 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:15:11" (1/1) ... [2024-06-28 01:15:11,988 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:15:11" (1/1) ... [2024-06-28 01:15:12,000 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-28 01:15:12,000 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:15:11" (1/1) ... [2024-06-28 01:15:12,000 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:15:11" (1/1) ... [2024-06-28 01:15:12,004 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:15:11" (1/1) ... [2024-06-28 01:15:12,015 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:15:11" (1/1) ... [2024-06-28 01:15:12,016 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:15:11" (1/1) ... [2024-06-28 01:15:12,017 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:15:11" (1/1) ... [2024-06-28 01:15:12,020 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-28 01:15:12,020 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-28 01:15:12,020 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-28 01:15:12,021 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-28 01:15:12,021 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:15:11" (1/1) ... [2024-06-28 01:15:12,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-28 01:15:12,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-28 01:15:12,057 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-28 01:15:12,062 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-28 01:15:12,098 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-28 01:15:12,098 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-28 01:15:12,098 INFO L130 BoogieDeclarations]: Found specification of procedure reader [2024-06-28 01:15:12,098 INFO L138 BoogieDeclarations]: Found implementation of procedure reader [2024-06-28 01:15:12,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-28 01:15:12,099 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-28 01:15:12,099 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-28 01:15:12,099 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-28 01:15:12,099 INFO L130 BoogieDeclarations]: Found specification of procedure writer [2024-06-28 01:15:12,100 INFO L138 BoogieDeclarations]: Found implementation of procedure writer [2024-06-28 01:15:12,101 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-28 01:15:12,225 INFO L244 CfgBuilder]: Building ICFG [2024-06-28 01:15:12,227 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-28 01:15:12,366 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-28 01:15:12,366 INFO L293 CfgBuilder]: Performing block encoding [2024-06-28 01:15:12,426 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-28 01:15:12,431 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-28 01:15:12,431 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.06 01:15:12 BoogieIcfgContainer [2024-06-28 01:15:12,432 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-28 01:15:12,433 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-28 01:15:12,434 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-28 01:15:12,436 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-28 01:15:12,437 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.06 01:15:11" (1/4) ... [2024-06-28 01:15:12,437 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f87e20e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.06 01:15:12, skipping insertion in model container [2024-06-28 01:15:12,438 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 01:15:11" (2/4) ... [2024-06-28 01:15:12,439 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f87e20e and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 28.06 01:15:12, skipping insertion in model container [2024-06-28 01:15:12,439 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:15:11" (3/4) ... [2024-06-28 01:15:12,439 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f87e20e and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 28.06 01:15:12, skipping insertion in model container [2024-06-28 01:15:12,439 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.06 01:15:12" (4/4) ... [2024-06-28 01:15:12,440 INFO L112 eAbstractionObserver]: Analyzing ICFG read_write_lock-2.i [2024-06-28 01:15:12,453 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-28 01:15:12,454 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2024-06-28 01:15:12,454 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-28 01:15:12,518 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-06-28 01:15:12,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 74 places, 63 transitions, 154 flow [2024-06-28 01:15:12,587 INFO L124 PetriNetUnfolderBase]: 2/59 cut-off events. [2024-06-28 01:15:12,588 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-06-28 01:15:12,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76 conditions, 59 events. 2/59 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 120 event pairs, 0 based on Foata normal form. 0/51 useless extension candidates. Maximal degree in co-relation 57. Up to 2 conditions per place. [2024-06-28 01:15:12,591 INFO L82 GeneralOperation]: Start removeDead. Operand has 74 places, 63 transitions, 154 flow [2024-06-28 01:15:12,595 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 68 places, 57 transitions, 135 flow [2024-06-28 01:15:12,606 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-28 01:15:12,613 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;@3ba61884, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-28 01:15:12,613 INFO L358 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2024-06-28 01:15:12,618 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-28 01:15:12,618 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-06-28 01:15:12,619 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-28 01:15:12,619 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:15:12,619 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-28 01:15:12,620 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 01:15:12,625 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:15:12,625 INFO L85 PathProgramCache]: Analyzing trace with hash 223471917, now seen corresponding path program 1 times [2024-06-28 01:15:12,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:15:12,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898320730] [2024-06-28 01:15:12,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:15:12,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:15:12,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:15:12,860 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-28 01:15:12,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:15:12,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898320730] [2024-06-28 01:15:12,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898320730] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:15:12,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:15:12,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-28 01:15:12,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630978054] [2024-06-28 01:15:12,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:15:12,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-28 01:15:12,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:15:12,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-28 01:15:12,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-28 01:15:12,925 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 63 [2024-06-28 01:15:12,928 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 57 transitions, 135 flow. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 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-28 01:15:12,928 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:15:12,928 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 63 [2024-06-28 01:15:12,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:15:13,598 INFO L124 PetriNetUnfolderBase]: 4411/8388 cut-off events. [2024-06-28 01:15:13,598 INFO L125 PetriNetUnfolderBase]: For 405/405 co-relation queries the response was YES. [2024-06-28 01:15:13,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14866 conditions, 8388 events. 4411/8388 cut-off events. For 405/405 co-relation queries the response was YES. Maximal size of possible extension queue 400. Compared 66031 event pairs, 2141 based on Foata normal form. 471/8225 useless extension candidates. Maximal degree in co-relation 14645. Up to 6070 conditions per place. [2024-06-28 01:15:13,655 INFO L140 encePairwiseOnDemand]: 52/63 looper letters, 46 selfloop transitions, 5 changer transitions 0/73 dead transitions. [2024-06-28 01:15:13,655 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 73 transitions, 278 flow [2024-06-28 01:15:13,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-28 01:15:13,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-28 01:15:13,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 135 transitions. [2024-06-28 01:15:13,666 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7142857142857143 [2024-06-28 01:15:13,667 INFO L175 Difference]: Start difference. First operand has 68 places, 57 transitions, 135 flow. Second operand 3 states and 135 transitions. [2024-06-28 01:15:13,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 73 transitions, 278 flow [2024-06-28 01:15:13,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 73 transitions, 260 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-06-28 01:15:13,675 INFO L231 Difference]: Finished difference. Result has 64 places, 59 transitions, 157 flow [2024-06-28 01:15:13,677 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=157, PETRI_PLACES=64, PETRI_TRANSITIONS=59} [2024-06-28 01:15:13,683 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, -4 predicate places. [2024-06-28 01:15:13,684 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 59 transitions, 157 flow [2024-06-28 01:15:13,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 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-28 01:15:13,684 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:15:13,684 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:15:13,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-28 01:15:13,685 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 01:15:13,685 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:15:13,685 INFO L85 PathProgramCache]: Analyzing trace with hash 9982002, now seen corresponding path program 1 times [2024-06-28 01:15:13,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:15:13,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352883105] [2024-06-28 01:15:13,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:15:13,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:15:13,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:15:13,821 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-28 01:15:13,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:15:13,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352883105] [2024-06-28 01:15:13,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352883105] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:15:13,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:15:13,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-28 01:15:13,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749463231] [2024-06-28 01:15:13,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:15:13,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-28 01:15:13,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:15:13,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-28 01:15:13,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-28 01:15:13,862 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 63 [2024-06-28 01:15:13,863 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 59 transitions, 157 flow. Second operand has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 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-28 01:15:13,863 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:15:13,863 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 63 [2024-06-28 01:15:13,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:15:14,710 INFO L124 PetriNetUnfolderBase]: 6725/12060 cut-off events. [2024-06-28 01:15:14,710 INFO L125 PetriNetUnfolderBase]: For 1615/1615 co-relation queries the response was YES. [2024-06-28 01:15:14,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24220 conditions, 12060 events. 6725/12060 cut-off events. For 1615/1615 co-relation queries the response was YES. Maximal size of possible extension queue 591. Compared 94267 event pairs, 3114 based on Foata normal form. 115/11396 useless extension candidates. Maximal degree in co-relation 11969. Up to 9079 conditions per place. [2024-06-28 01:15:14,789 INFO L140 encePairwiseOnDemand]: 50/63 looper letters, 60 selfloop transitions, 9 changer transitions 0/89 dead transitions. [2024-06-28 01:15:14,790 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 89 transitions, 367 flow [2024-06-28 01:15:14,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-28 01:15:14,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-28 01:15:14,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 173 transitions. [2024-06-28 01:15:14,792 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6865079365079365 [2024-06-28 01:15:14,792 INFO L175 Difference]: Start difference. First operand has 64 places, 59 transitions, 157 flow. Second operand 4 states and 173 transitions. [2024-06-28 01:15:14,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 89 transitions, 367 flow [2024-06-28 01:15:14,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 89 transitions, 362 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-28 01:15:14,794 INFO L231 Difference]: Finished difference. Result has 67 places, 63 transitions, 212 flow [2024-06-28 01:15:14,794 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=212, PETRI_PLACES=67, PETRI_TRANSITIONS=63} [2024-06-28 01:15:14,795 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, -1 predicate places. [2024-06-28 01:15:14,795 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 63 transitions, 212 flow [2024-06-28 01:15:14,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 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-28 01:15:14,796 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:15:14,796 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:15:14,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-28 01:15:14,796 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 01:15:14,797 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:15:14,797 INFO L85 PathProgramCache]: Analyzing trace with hash 309444496, now seen corresponding path program 1 times [2024-06-28 01:15:14,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:15:14,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947493606] [2024-06-28 01:15:14,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:15:14,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:15:14,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:15:14,896 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-28 01:15:14,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:15:14,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947493606] [2024-06-28 01:15:14,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947493606] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:15:14,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:15:14,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-28 01:15:14,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142974313] [2024-06-28 01:15:14,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:15:14,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-28 01:15:14,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:15:14,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-28 01:15:14,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-28 01:15:14,924 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 63 [2024-06-28 01:15:14,924 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 63 transitions, 212 flow. Second operand has 5 states, 5 states have (on average 25.2) internal successors, (126), 5 states have internal predecessors, (126), 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-28 01:15:14,924 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:15:14,925 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 63 [2024-06-28 01:15:14,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:15:15,748 INFO L124 PetriNetUnfolderBase]: 5900/11032 cut-off events. [2024-06-28 01:15:15,748 INFO L125 PetriNetUnfolderBase]: For 4049/4049 co-relation queries the response was YES. [2024-06-28 01:15:15,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25548 conditions, 11032 events. 5900/11032 cut-off events. For 4049/4049 co-relation queries the response was YES. Maximal size of possible extension queue 531. Compared 88230 event pairs, 1778 based on Foata normal form. 351/10564 useless extension candidates. Maximal degree in co-relation 11472. Up to 5885 conditions per place. [2024-06-28 01:15:15,808 INFO L140 encePairwiseOnDemand]: 48/63 looper letters, 83 selfloop transitions, 21 changer transitions 0/124 dead transitions. [2024-06-28 01:15:15,808 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 124 transitions, 616 flow [2024-06-28 01:15:15,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 01:15:15,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 01:15:15,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 226 transitions. [2024-06-28 01:15:15,810 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7174603174603175 [2024-06-28 01:15:15,810 INFO L175 Difference]: Start difference. First operand has 67 places, 63 transitions, 212 flow. Second operand 5 states and 226 transitions. [2024-06-28 01:15:15,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 124 transitions, 616 flow [2024-06-28 01:15:15,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 124 transitions, 600 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-06-28 01:15:15,814 INFO L231 Difference]: Finished difference. Result has 72 places, 75 transitions, 365 flow [2024-06-28 01:15:15,814 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=365, PETRI_PLACES=72, PETRI_TRANSITIONS=75} [2024-06-28 01:15:15,815 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 4 predicate places. [2024-06-28 01:15:15,815 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 75 transitions, 365 flow [2024-06-28 01:15:15,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.2) internal successors, (126), 5 states have internal predecessors, (126), 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-28 01:15:15,815 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:15:15,815 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:15:15,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-28 01:15:15,816 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 01:15:15,816 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:15:15,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1060134319, now seen corresponding path program 1 times [2024-06-28 01:15:15,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:15:15,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514408751] [2024-06-28 01:15:15,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:15:15,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:15:15,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:15:15,897 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-28 01:15:15,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:15:15,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514408751] [2024-06-28 01:15:15,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514408751] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:15:15,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:15:15,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-28 01:15:15,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467318285] [2024-06-28 01:15:15,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:15:15,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-28 01:15:15,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:15:15,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-28 01:15:15,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-28 01:15:15,934 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 63 [2024-06-28 01:15:15,934 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 75 transitions, 365 flow. Second operand has 5 states, 5 states have (on average 25.4) internal successors, (127), 5 states have internal predecessors, (127), 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-28 01:15:15,935 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:15:15,935 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 63 [2024-06-28 01:15:15,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:15:16,733 INFO L124 PetriNetUnfolderBase]: 5686/10605 cut-off events. [2024-06-28 01:15:16,734 INFO L125 PetriNetUnfolderBase]: For 11752/11758 co-relation queries the response was YES. [2024-06-28 01:15:16,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30710 conditions, 10605 events. 5686/10605 cut-off events. For 11752/11758 co-relation queries the response was YES. Maximal size of possible extension queue 528. Compared 84665 event pairs, 1311 based on Foata normal form. 110/9909 useless extension candidates. Maximal degree in co-relation 11515. Up to 5855 conditions per place. [2024-06-28 01:15:16,796 INFO L140 encePairwiseOnDemand]: 50/63 looper letters, 82 selfloop transitions, 17 changer transitions 0/119 dead transitions. [2024-06-28 01:15:16,796 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 119 transitions, 694 flow [2024-06-28 01:15:16,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 01:15:16,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 01:15:16,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 219 transitions. [2024-06-28 01:15:16,798 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6952380952380952 [2024-06-28 01:15:16,799 INFO L175 Difference]: Start difference. First operand has 72 places, 75 transitions, 365 flow. Second operand 5 states and 219 transitions. [2024-06-28 01:15:16,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 119 transitions, 694 flow [2024-06-28 01:15:16,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 119 transitions, 686 flow, removed 4 selfloop flow, removed 0 redundant places. [2024-06-28 01:15:16,807 INFO L231 Difference]: Finished difference. Result has 76 places, 74 transitions, 395 flow [2024-06-28 01:15:16,807 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=349, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=395, PETRI_PLACES=76, PETRI_TRANSITIONS=74} [2024-06-28 01:15:16,809 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 8 predicate places. [2024-06-28 01:15:16,809 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 74 transitions, 395 flow [2024-06-28 01:15:16,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.4) internal successors, (127), 5 states have internal predecessors, (127), 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-28 01:15:16,809 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:15:16,809 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:15:16,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-28 01:15:16,810 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 01:15:16,810 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:15:16,810 INFO L85 PathProgramCache]: Analyzing trace with hash -723068457, now seen corresponding path program 1 times [2024-06-28 01:15:16,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:15:16,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535809928] [2024-06-28 01:15:16,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:15:16,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:15:16,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:15:16,922 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-28 01:15:16,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:15:16,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535809928] [2024-06-28 01:15:16,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535809928] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:15:16,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:15:16,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-28 01:15:16,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960346754] [2024-06-28 01:15:16,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:15:16,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-28 01:15:16,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:15:16,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-28 01:15:16,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-06-28 01:15:16,957 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 63 [2024-06-28 01:15:16,957 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 74 transitions, 395 flow. Second operand has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:15:16,957 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:15:16,957 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 63 [2024-06-28 01:15:16,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:15:18,135 INFO L124 PetriNetUnfolderBase]: 7470/13916 cut-off events. [2024-06-28 01:15:18,135 INFO L125 PetriNetUnfolderBase]: For 21503/21517 co-relation queries the response was YES. [2024-06-28 01:15:18,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41473 conditions, 13916 events. 7470/13916 cut-off events. For 21503/21517 co-relation queries the response was YES. Maximal size of possible extension queue 615. Compared 114631 event pairs, 2759 based on Foata normal form. 35/13077 useless extension candidates. Maximal degree in co-relation 25258. Up to 9724 conditions per place. [2024-06-28 01:15:18,225 INFO L140 encePairwiseOnDemand]: 53/63 looper letters, 83 selfloop transitions, 22 changer transitions 0/127 dead transitions. [2024-06-28 01:15:18,225 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 127 transitions, 863 flow [2024-06-28 01:15:18,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 01:15:18,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 01:15:18,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 235 transitions. [2024-06-28 01:15:18,230 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6216931216931217 [2024-06-28 01:15:18,230 INFO L175 Difference]: Start difference. First operand has 76 places, 74 transitions, 395 flow. Second operand 6 states and 235 transitions. [2024-06-28 01:15:18,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 127 transitions, 863 flow [2024-06-28 01:15:18,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 127 transitions, 821 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-06-28 01:15:18,248 INFO L231 Difference]: Finished difference. Result has 81 places, 92 transitions, 587 flow [2024-06-28 01:15:18,249 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=358, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=587, PETRI_PLACES=81, PETRI_TRANSITIONS=92} [2024-06-28 01:15:18,251 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 13 predicate places. [2024-06-28 01:15:18,251 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 92 transitions, 587 flow [2024-06-28 01:15:18,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:15:18,255 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:15:18,255 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:15:18,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-28 01:15:18,255 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 01:15:18,256 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:15:18,256 INFO L85 PathProgramCache]: Analyzing trace with hash 2019678622, now seen corresponding path program 1 times [2024-06-28 01:15:18,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:15:18,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885907655] [2024-06-28 01:15:18,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:15:18,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:15:18,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:15:18,347 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-28 01:15:18,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:15:18,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885907655] [2024-06-28 01:15:18,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885907655] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:15:18,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:15:18,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 01:15:18,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266259371] [2024-06-28 01:15:18,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:15:18,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 01:15:18,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:15:18,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 01:15:18,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-06-28 01:15:18,383 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 63 [2024-06-28 01:15:18,383 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 92 transitions, 587 flow. Second operand has 6 states, 6 states have (on average 24.0) internal successors, (144), 6 states have internal predecessors, (144), 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-28 01:15:18,383 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:15:18,383 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 63 [2024-06-28 01:15:18,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:15:19,572 INFO L124 PetriNetUnfolderBase]: 8109/14699 cut-off events. [2024-06-28 01:15:19,576 INFO L125 PetriNetUnfolderBase]: For 31055/31241 co-relation queries the response was YES. [2024-06-28 01:15:19,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45981 conditions, 14699 events. 8109/14699 cut-off events. For 31055/31241 co-relation queries the response was YES. Maximal size of possible extension queue 648. Compared 118427 event pairs, 2798 based on Foata normal form. 360/14256 useless extension candidates. Maximal degree in co-relation 43898. Up to 10181 conditions per place. [2024-06-28 01:15:19,707 INFO L140 encePairwiseOnDemand]: 49/63 looper letters, 126 selfloop transitions, 32 changer transitions 0/176 dead transitions. [2024-06-28 01:15:19,708 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 176 transitions, 1264 flow [2024-06-28 01:15:19,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 01:15:19,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 01:15:19,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 295 transitions. [2024-06-28 01:15:19,709 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6689342403628118 [2024-06-28 01:15:19,709 INFO L175 Difference]: Start difference. First operand has 81 places, 92 transitions, 587 flow. Second operand 7 states and 295 transitions. [2024-06-28 01:15:19,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 176 transitions, 1264 flow [2024-06-28 01:15:19,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 176 transitions, 1254 flow, removed 5 selfloop flow, removed 0 redundant places. [2024-06-28 01:15:19,747 INFO L231 Difference]: Finished difference. Result has 91 places, 109 transitions, 848 flow [2024-06-28 01:15:19,747 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=577, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=848, PETRI_PLACES=91, PETRI_TRANSITIONS=109} [2024-06-28 01:15:19,749 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 23 predicate places. [2024-06-28 01:15:19,749 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 109 transitions, 848 flow [2024-06-28 01:15:19,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 6 states have internal predecessors, (144), 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-28 01:15:19,750 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:15:19,750 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:15:19,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-28 01:15:19,750 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 01:15:19,750 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:15:19,750 INFO L85 PathProgramCache]: Analyzing trace with hash 916801880, now seen corresponding path program 2 times [2024-06-28 01:15:19,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:15:19,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877633830] [2024-06-28 01:15:19,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:15:19,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:15:19,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:15:19,858 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-28 01:15:19,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:15:19,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877633830] [2024-06-28 01:15:19,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877633830] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:15:19,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:15:19,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 01:15:19,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533075608] [2024-06-28 01:15:19,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:15:19,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 01:15:19,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:15:19,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 01:15:19,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-28 01:15:19,917 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 63 [2024-06-28 01:15:19,917 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 109 transitions, 848 flow. Second operand has 6 states, 6 states have (on average 24.0) internal successors, (144), 6 states have internal predecessors, (144), 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-28 01:15:19,918 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:15:19,918 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 63 [2024-06-28 01:15:19,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:15:21,227 INFO L124 PetriNetUnfolderBase]: 8274/15061 cut-off events. [2024-06-28 01:15:21,227 INFO L125 PetriNetUnfolderBase]: For 61494/62360 co-relation queries the response was YES. [2024-06-28 01:15:21,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55549 conditions, 15061 events. 8274/15061 cut-off events. For 61494/62360 co-relation queries the response was YES. Maximal size of possible extension queue 664. Compared 122874 event pairs, 2926 based on Foata normal form. 92/14346 useless extension candidates. Maximal degree in co-relation 52756. Up to 10280 conditions per place. [2024-06-28 01:15:21,328 INFO L140 encePairwiseOnDemand]: 51/63 looper letters, 129 selfloop transitions, 40 changer transitions 0/187 dead transitions. [2024-06-28 01:15:21,329 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 187 transitions, 1644 flow [2024-06-28 01:15:21,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 01:15:21,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 01:15:21,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 282 transitions. [2024-06-28 01:15:21,330 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6394557823129252 [2024-06-28 01:15:21,330 INFO L175 Difference]: Start difference. First operand has 91 places, 109 transitions, 848 flow. Second operand 7 states and 282 transitions. [2024-06-28 01:15:21,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 187 transitions, 1644 flow [2024-06-28 01:15:21,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 187 transitions, 1593 flow, removed 19 selfloop flow, removed 1 redundant places. [2024-06-28 01:15:21,380 INFO L231 Difference]: Finished difference. Result has 99 places, 122 transitions, 1055 flow [2024-06-28 01:15:21,380 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=797, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1055, PETRI_PLACES=99, PETRI_TRANSITIONS=122} [2024-06-28 01:15:21,381 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 31 predicate places. [2024-06-28 01:15:21,381 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 122 transitions, 1055 flow [2024-06-28 01:15:21,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 6 states have internal predecessors, (144), 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-28 01:15:21,381 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:15:21,382 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:15:21,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-28 01:15:21,382 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 01:15:21,382 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:15:21,382 INFO L85 PathProgramCache]: Analyzing trace with hash 915967670, now seen corresponding path program 3 times [2024-06-28 01:15:21,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:15:21,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233857265] [2024-06-28 01:15:21,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:15:21,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:15:21,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:15:21,451 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-28 01:15:21,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:15:21,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233857265] [2024-06-28 01:15:21,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233857265] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:15:21,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:15:21,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 01:15:21,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004002576] [2024-06-28 01:15:21,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:15:21,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 01:15:21,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:15:21,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 01:15:21,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-28 01:15:21,484 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 63 [2024-06-28 01:15:21,484 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 122 transitions, 1055 flow. Second operand has 6 states, 6 states have (on average 24.0) internal successors, (144), 6 states have internal predecessors, (144), 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-28 01:15:21,484 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:15:21,485 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 63 [2024-06-28 01:15:21,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:15:22,959 INFO L124 PetriNetUnfolderBase]: 8271/15279 cut-off events. [2024-06-28 01:15:22,960 INFO L125 PetriNetUnfolderBase]: For 74521/75381 co-relation queries the response was YES. [2024-06-28 01:15:23,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58755 conditions, 15279 events. 8271/15279 cut-off events. For 74521/75381 co-relation queries the response was YES. Maximal size of possible extension queue 686. Compared 126646 event pairs, 2725 based on Foata normal form. 137/14572 useless extension candidates. Maximal degree in co-relation 55691. Up to 10289 conditions per place. [2024-06-28 01:15:23,072 INFO L140 encePairwiseOnDemand]: 51/63 looper letters, 112 selfloop transitions, 69 changer transitions 0/199 dead transitions. [2024-06-28 01:15:23,074 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 199 transitions, 1833 flow [2024-06-28 01:15:23,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:15:23,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:15:23,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 309 transitions. [2024-06-28 01:15:23,078 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6130952380952381 [2024-06-28 01:15:23,078 INFO L175 Difference]: Start difference. First operand has 99 places, 122 transitions, 1055 flow. Second operand 8 states and 309 transitions. [2024-06-28 01:15:23,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 199 transitions, 1833 flow [2024-06-28 01:15:23,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 199 transitions, 1732 flow, removed 39 selfloop flow, removed 1 redundant places. [2024-06-28 01:15:23,256 INFO L231 Difference]: Finished difference. Result has 107 places, 141 transitions, 1354 flow [2024-06-28 01:15:23,257 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=982, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1354, PETRI_PLACES=107, PETRI_TRANSITIONS=141} [2024-06-28 01:15:23,257 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 39 predicate places. [2024-06-28 01:15:23,257 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 141 transitions, 1354 flow [2024-06-28 01:15:23,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 6 states have internal predecessors, (144), 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-28 01:15:23,258 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:15:23,258 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:15:23,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-28 01:15:23,258 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 01:15:23,259 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:15:23,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1574435569, now seen corresponding path program 1 times [2024-06-28 01:15:23,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:15:23,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987942232] [2024-06-28 01:15:23,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:15:23,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:15:23,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:15:23,284 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-28 01:15:23,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:15:23,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987942232] [2024-06-28 01:15:23,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987942232] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:15:23,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:15:23,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 01:15:23,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401164552] [2024-06-28 01:15:23,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:15:23,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 01:15:23,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:15:23,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 01:15:23,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-06-28 01:15:23,351 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 63 [2024-06-28 01:15:23,351 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 141 transitions, 1354 flow. Second operand has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:15:23,352 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:15:23,352 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 63 [2024-06-28 01:15:23,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:15:27,409 INFO L124 PetriNetUnfolderBase]: 21289/38419 cut-off events. [2024-06-28 01:15:27,409 INFO L125 PetriNetUnfolderBase]: For 251954/255931 co-relation queries the response was YES. [2024-06-28 01:15:27,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153102 conditions, 38419 events. 21289/38419 cut-off events. For 251954/255931 co-relation queries the response was YES. Maximal size of possible extension queue 1870. Compared 364076 event pairs, 3518 based on Foata normal form. 90/35377 useless extension candidates. Maximal degree in co-relation 137667. Up to 10857 conditions per place. [2024-06-28 01:15:27,760 INFO L140 encePairwiseOnDemand]: 52/63 looper letters, 227 selfloop transitions, 141 changer transitions 0/389 dead transitions. [2024-06-28 01:15:27,761 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 389 transitions, 4034 flow [2024-06-28 01:15:27,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-28 01:15:27,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-28 01:15:27,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 535 transitions. [2024-06-28 01:15:27,763 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6532356532356532 [2024-06-28 01:15:27,763 INFO L175 Difference]: Start difference. First operand has 107 places, 141 transitions, 1354 flow. Second operand 13 states and 535 transitions. [2024-06-28 01:15:27,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 389 transitions, 4034 flow [2024-06-28 01:15:28,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 389 transitions, 3962 flow, removed 36 selfloop flow, removed 0 redundant places. [2024-06-28 01:15:28,139 INFO L231 Difference]: Finished difference. Result has 128 places, 225 transitions, 2732 flow [2024-06-28 01:15:28,140 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=1322, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2732, PETRI_PLACES=128, PETRI_TRANSITIONS=225} [2024-06-28 01:15:28,140 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 60 predicate places. [2024-06-28 01:15:28,140 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 225 transitions, 2732 flow [2024-06-28 01:15:28,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:15:28,141 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:15:28,141 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:15:28,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-28 01:15:28,141 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 01:15:28,142 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:15:28,142 INFO L85 PathProgramCache]: Analyzing trace with hash -812714278, now seen corresponding path program 1 times [2024-06-28 01:15:28,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:15:28,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030947816] [2024-06-28 01:15:28,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:15:28,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:15:28,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:15:28,170 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-28 01:15:28,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:15:28,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030947816] [2024-06-28 01:15:28,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030947816] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:15:28,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:15:28,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-28 01:15:28,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724470424] [2024-06-28 01:15:28,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:15:28,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-28 01:15:28,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:15:28,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-28 01:15:28,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-28 01:15:28,178 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 63 [2024-06-28 01:15:28,179 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 225 transitions, 2732 flow. Second operand has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 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-28 01:15:28,179 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:15:28,179 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 63 [2024-06-28 01:15:28,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:15:30,372 INFO L124 PetriNetUnfolderBase]: 10350/21231 cut-off events. [2024-06-28 01:15:30,373 INFO L125 PetriNetUnfolderBase]: For 203715/206873 co-relation queries the response was YES. [2024-06-28 01:15:30,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93629 conditions, 21231 events. 10350/21231 cut-off events. For 203715/206873 co-relation queries the response was YES. Maximal size of possible extension queue 1260. Compared 212052 event pairs, 3680 based on Foata normal form. 713/20526 useless extension candidates. Maximal degree in co-relation 89351. Up to 6512 conditions per place. [2024-06-28 01:15:30,589 INFO L140 encePairwiseOnDemand]: 56/63 looper letters, 64 selfloop transitions, 17 changer transitions 0/209 dead transitions. [2024-06-28 01:15:30,589 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 209 transitions, 2257 flow [2024-06-28 01:15:30,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-28 01:15:30,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-28 01:15:30,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 199 transitions. [2024-06-28 01:15:30,591 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7896825396825397 [2024-06-28 01:15:30,591 INFO L175 Difference]: Start difference. First operand has 128 places, 225 transitions, 2732 flow. Second operand 4 states and 199 transitions. [2024-06-28 01:15:30,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 209 transitions, 2257 flow [2024-06-28 01:15:31,897 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 209 transitions, 2102 flow, removed 44 selfloop flow, removed 4 redundant places. [2024-06-28 01:15:31,900 INFO L231 Difference]: Finished difference. Result has 130 places, 175 transitions, 1932 flow [2024-06-28 01:15:31,900 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=1768, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1932, PETRI_PLACES=130, PETRI_TRANSITIONS=175} [2024-06-28 01:15:31,901 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 62 predicate places. [2024-06-28 01:15:31,901 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 175 transitions, 1932 flow [2024-06-28 01:15:31,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 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-28 01:15:31,901 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:15:31,901 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:15:31,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-28 01:15:31,902 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 01:15:31,902 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:15:31,902 INFO L85 PathProgramCache]: Analyzing trace with hash -368792969, now seen corresponding path program 1 times [2024-06-28 01:15:31,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:15:31,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724274631] [2024-06-28 01:15:31,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:15:31,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:15:31,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:15:31,966 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-28 01:15:31,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:15:31,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724274631] [2024-06-28 01:15:31,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724274631] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:15:31,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:15:31,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 01:15:31,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347221052] [2024-06-28 01:15:31,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:15:31,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 01:15:31,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:15:31,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 01:15:31,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-06-28 01:15:32,008 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 63 [2024-06-28 01:15:32,009 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 175 transitions, 1932 flow. Second operand has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 6 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:15:32,009 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:15:32,009 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 63 [2024-06-28 01:15:32,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:15:35,917 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([236] L744-->readerEXIT: Formula: (and (= |v_readerThread1of1ForFork1_#res#1.offset_1| 0) (= |v_readerThread1of1ForFork1_#res#1.base_1| 0)) InVars {} OutVars{readerThread1of1ForFork1_#res#1.offset=|v_readerThread1of1ForFork1_#res#1.offset_1|, readerThread1of1ForFork1_#res#1.base=|v_readerThread1of1ForFork1_#res#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork1_#res#1.offset, readerThread1of1ForFork1_#res#1.base][183], [Black: 129#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1) (= ~y~0 0)), Black: 127#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 18#L753-2true, Black: 126#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1)), 86#true, 133#true, 186#(and (= 3 ~x~0) (= ~w~0 0)), readerThread1of1ForFork1InUse, Black: 138#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), Black: 142#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1) (= ~y~0 0)), Black: 79#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), Black: 84#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 48#readerEXITtrue, Black: 90#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), Black: 88#(= ~y~0 0), Black: 89#(and (= ~w~0 1) (= ~y~0 0)), Black: 98#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0)), 110#true, Black: 154#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), 122#true, Black: 147#(= |readerThread1of1ForFork0_~l~0#1| ~x~0), Black: 156#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), Black: 162#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), 100#true, Black: 106#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), Black: 145#true, Black: 104#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), Black: 164#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), Black: 160#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 103#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 0)), Black: 152#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), 150#(= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|), 5#L720true, Black: 179#(<= 1 ~r~0), Black: 178#(= ~r~0 0), Black: 113#(and (= ~x~0 0) (= ~w~0 1)), Black: 115#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 28#readerEXITtrue, Black: 114#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1)), Black: 117#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1) (= ~y~0 0)), 176#true]) [2024-06-28 01:15:35,918 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is cut-off event [2024-06-28 01:15:35,918 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2024-06-28 01:15:35,918 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2024-06-28 01:15:35,918 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2024-06-28 01:15:35,928 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([236] L744-->readerEXIT: Formula: (and (= |v_readerThread1of1ForFork1_#res#1.offset_1| 0) (= |v_readerThread1of1ForFork1_#res#1.base_1| 0)) InVars {} OutVars{readerThread1of1ForFork1_#res#1.offset=|v_readerThread1of1ForFork1_#res#1.offset_1|, readerThread1of1ForFork1_#res#1.base=|v_readerThread1of1ForFork1_#res#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork1_#res#1.offset, readerThread1of1ForFork1_#res#1.base][183], [Black: 129#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1) (= ~y~0 0)), Black: 127#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 18#L753-2true, Black: 126#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1)), 86#true, 133#true, 186#(and (= 3 ~x~0) (= ~w~0 0)), readerThread1of1ForFork1InUse, Black: 138#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), Black: 142#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1) (= ~y~0 0)), Black: 79#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), Black: 84#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 48#readerEXITtrue, Black: 90#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), Black: 88#(= ~y~0 0), Black: 89#(and (= ~w~0 1) (= ~y~0 0)), Black: 98#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0)), 110#true, Black: 154#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), 14#writerEXITtrue, 122#true, Black: 147#(= |readerThread1of1ForFork0_~l~0#1| ~x~0), Black: 156#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), Black: 162#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), 100#true, Black: 106#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), Black: 145#true, Black: 104#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), Black: 164#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), Black: 160#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 103#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 0)), Black: 152#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), 150#(= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|), Black: 179#(<= 1 ~r~0), Black: 178#(= ~r~0 0), Black: 113#(and (= ~x~0 0) (= ~w~0 1)), Black: 115#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 28#readerEXITtrue, Black: 114#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1)), Black: 117#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1) (= ~y~0 0)), 176#true]) [2024-06-28 01:15:35,928 INFO L294 olderBase$Statistics]: this new event has 45 ancestors and is cut-off event [2024-06-28 01:15:35,928 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2024-06-28 01:15:35,928 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2024-06-28 01:15:35,928 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2024-06-28 01:15:35,929 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([236] L744-->readerEXIT: Formula: (and (= |v_readerThread1of1ForFork1_#res#1.offset_1| 0) (= |v_readerThread1of1ForFork1_#res#1.base_1| 0)) InVars {} OutVars{readerThread1of1ForFork1_#res#1.offset=|v_readerThread1of1ForFork1_#res#1.offset_1|, readerThread1of1ForFork1_#res#1.base=|v_readerThread1of1ForFork1_#res#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork1_#res#1.offset, readerThread1of1ForFork1_#res#1.base][183], [Black: 129#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1) (= ~y~0 0)), Black: 127#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), Black: 126#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1)), 86#true, 133#true, 186#(and (= 3 ~x~0) (= ~w~0 0)), readerThread1of1ForFork1InUse, Black: 138#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), Black: 142#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1) (= ~y~0 0)), Black: 79#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), Black: 84#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 48#readerEXITtrue, Black: 90#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), Black: 88#(= ~y~0 0), Black: 89#(and (= ~w~0 1) (= ~y~0 0)), Black: 98#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0)), 110#true, Black: 154#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), 122#true, Black: 147#(= |readerThread1of1ForFork0_~l~0#1| ~x~0), Black: 156#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), Black: 162#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), 100#true, Black: 106#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), Black: 145#true, Black: 104#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), Black: 164#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), Black: 160#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 103#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 0)), Black: 152#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), 150#(= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|), 5#L720true, 4#L754true, Black: 179#(<= 1 ~r~0), Black: 178#(= ~r~0 0), Black: 113#(and (= ~x~0 0) (= ~w~0 1)), Black: 115#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), Black: 114#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1)), Black: 117#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1) (= ~y~0 0)), 176#true]) [2024-06-28 01:15:35,929 INFO L294 olderBase$Statistics]: this new event has 45 ancestors and is cut-off event [2024-06-28 01:15:35,929 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2024-06-28 01:15:35,929 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2024-06-28 01:15:35,930 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2024-06-28 01:15:35,933 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([236] L744-->readerEXIT: Formula: (and (= |v_readerThread1of1ForFork1_#res#1.offset_1| 0) (= |v_readerThread1of1ForFork1_#res#1.base_1| 0)) InVars {} OutVars{readerThread1of1ForFork1_#res#1.offset=|v_readerThread1of1ForFork1_#res#1.offset_1|, readerThread1of1ForFork1_#res#1.base=|v_readerThread1of1ForFork1_#res#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork1_#res#1.offset, readerThread1of1ForFork1_#res#1.base][183], [Black: 129#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1) (= ~y~0 0)), Black: 127#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), Black: 126#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1)), 86#true, 133#true, 186#(and (= 3 ~x~0) (= ~w~0 0)), readerThread1of1ForFork1InUse, Black: 138#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), Black: 142#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1) (= ~y~0 0)), Black: 79#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), Black: 84#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), Black: 90#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), 48#readerEXITtrue, Black: 88#(= ~y~0 0), Black: 89#(and (= ~w~0 1) (= ~y~0 0)), Black: 98#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0)), 110#true, Black: 154#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), 14#writerEXITtrue, 122#true, Black: 147#(= |readerThread1of1ForFork0_~l~0#1| ~x~0), Black: 156#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), Black: 162#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), 100#true, Black: 106#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), Black: 145#true, Black: 104#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), Black: 164#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), Black: 160#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 103#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 0)), Black: 152#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), 150#(= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|), 4#L754true, Black: 179#(<= 1 ~r~0), Black: 178#(= ~r~0 0), Black: 113#(and (= ~x~0 0) (= ~w~0 1)), Black: 115#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), Black: 114#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1)), Black: 117#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1) (= ~y~0 0)), 176#true]) [2024-06-28 01:15:35,933 INFO L294 olderBase$Statistics]: this new event has 46 ancestors and is cut-off event [2024-06-28 01:15:35,933 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2024-06-28 01:15:35,933 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2024-06-28 01:15:35,933 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2024-06-28 01:15:35,935 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([236] L744-->readerEXIT: Formula: (and (= |v_readerThread1of1ForFork1_#res#1.offset_1| 0) (= |v_readerThread1of1ForFork1_#res#1.base_1| 0)) InVars {} OutVars{readerThread1of1ForFork1_#res#1.offset=|v_readerThread1of1ForFork1_#res#1.offset_1|, readerThread1of1ForFork1_#res#1.base=|v_readerThread1of1ForFork1_#res#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork1_#res#1.offset, readerThread1of1ForFork1_#res#1.base][183], [Black: 129#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1) (= ~y~0 0)), Black: 127#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), Black: 126#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1)), 86#true, 186#(and (= 3 ~x~0) (= ~w~0 0)), 133#true, readerThread1of1ForFork1InUse, Black: 138#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), Black: 142#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1) (= ~y~0 0)), Black: 79#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), Black: 84#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 48#readerEXITtrue, Black: 90#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), Black: 88#(= ~y~0 0), Black: 89#(and (= ~w~0 1) (= ~y~0 0)), Black: 98#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0)), 110#true, Black: 154#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), 122#true, Black: 147#(= |readerThread1of1ForFork0_~l~0#1| ~x~0), Black: 156#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), Black: 162#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), 100#true, Black: 106#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), Black: 145#true, Black: 104#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), Black: 164#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), Black: 160#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 103#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 0)), Black: 152#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), 150#(= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|), 25#L755true, Black: 179#(<= 1 ~r~0), Black: 178#(= ~r~0 0), Black: 113#(and (= ~x~0 0) (= ~w~0 1)), Black: 115#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), Black: 114#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1)), Black: 117#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1) (= ~y~0 0)), 176#true]) [2024-06-28 01:15:35,935 INFO L294 olderBase$Statistics]: this new event has 47 ancestors and is cut-off event [2024-06-28 01:15:35,935 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2024-06-28 01:15:35,935 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2024-06-28 01:15:35,936 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2024-06-28 01:15:35,936 INFO L124 PetriNetUnfolderBase]: 20329/34815 cut-off events. [2024-06-28 01:15:35,936 INFO L125 PetriNetUnfolderBase]: For 352878/354906 co-relation queries the response was YES. [2024-06-28 01:15:36,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158211 conditions, 34815 events. 20329/34815 cut-off events. For 352878/354906 co-relation queries the response was YES. Maximal size of possible extension queue 1671. Compared 301750 event pairs, 2632 based on Foata normal form. 552/34388 useless extension candidates. Maximal degree in co-relation 151055. Up to 12068 conditions per place. [2024-06-28 01:15:36,565 INFO L140 encePairwiseOnDemand]: 48/63 looper letters, 222 selfloop transitions, 76 changer transitions 0/325 dead transitions. [2024-06-28 01:15:36,566 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 325 transitions, 3887 flow [2024-06-28 01:15:36,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 01:15:36,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 01:15:36,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 321 transitions. [2024-06-28 01:15:36,567 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7278911564625851 [2024-06-28 01:15:36,567 INFO L175 Difference]: Start difference. First operand has 130 places, 175 transitions, 1932 flow. Second operand 7 states and 321 transitions. [2024-06-28 01:15:36,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 325 transitions, 3887 flow [2024-06-28 01:15:38,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 325 transitions, 3857 flow, removed 15 selfloop flow, removed 0 redundant places. [2024-06-28 01:15:38,423 INFO L231 Difference]: Finished difference. Result has 141 places, 203 transitions, 2751 flow [2024-06-28 01:15:38,423 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=1918, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2751, PETRI_PLACES=141, PETRI_TRANSITIONS=203} [2024-06-28 01:15:38,424 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 73 predicate places. [2024-06-28 01:15:38,424 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 203 transitions, 2751 flow [2024-06-28 01:15:38,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 6 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:15:38,424 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:15:38,424 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:15:38,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-28 01:15:38,425 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 01:15:38,425 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:15:38,425 INFO L85 PathProgramCache]: Analyzing trace with hash -952565181, now seen corresponding path program 1 times [2024-06-28 01:15:38,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:15:38,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74174763] [2024-06-28 01:15:38,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:15:38,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:15:38,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:15:38,468 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-28 01:15:38,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:15:38,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74174763] [2024-06-28 01:15:38,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74174763] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:15:38,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:15:38,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-28 01:15:38,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336549526] [2024-06-28 01:15:38,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:15:38,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-28 01:15:38,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:15:38,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-28 01:15:38,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-28 01:15:38,490 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 63 [2024-06-28 01:15:38,490 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 203 transitions, 2751 flow. Second operand has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 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-28 01:15:38,490 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:15:38,490 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 63 [2024-06-28 01:15:38,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:15:42,370 INFO L124 PetriNetUnfolderBase]: 17798/32882 cut-off events. [2024-06-28 01:15:42,370 INFO L125 PetriNetUnfolderBase]: For 388087/390848 co-relation queries the response was YES. [2024-06-28 01:15:42,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161108 conditions, 32882 events. 17798/32882 cut-off events. For 388087/390848 co-relation queries the response was YES. Maximal size of possible extension queue 1690. Compared 306849 event pairs, 7027 based on Foata normal form. 202/32073 useless extension candidates. Maximal degree in co-relation 154469. Up to 22936 conditions per place. [2024-06-28 01:15:43,022 INFO L140 encePairwiseOnDemand]: 52/63 looper letters, 186 selfloop transitions, 12 changer transitions 0/246 dead transitions. [2024-06-28 01:15:43,022 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 246 transitions, 3374 flow [2024-06-28 01:15:43,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 01:15:43,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 01:15:43,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 209 transitions. [2024-06-28 01:15:43,023 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6634920634920635 [2024-06-28 01:15:43,023 INFO L175 Difference]: Start difference. First operand has 141 places, 203 transitions, 2751 flow. Second operand 5 states and 209 transitions. [2024-06-28 01:15:43,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 246 transitions, 3374 flow [2024-06-28 01:15:45,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 246 transitions, 3176 flow, removed 79 selfloop flow, removed 1 redundant places. [2024-06-28 01:15:45,570 INFO L231 Difference]: Finished difference. Result has 145 places, 205 transitions, 2611 flow [2024-06-28 01:15:45,570 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=2553, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2611, PETRI_PLACES=145, PETRI_TRANSITIONS=205} [2024-06-28 01:15:45,570 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 77 predicate places. [2024-06-28 01:15:45,571 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 205 transitions, 2611 flow [2024-06-28 01:15:45,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 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-28 01:15:45,571 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:15:45,571 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-28 01:15:45,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-28 01:15:45,571 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 01:15:45,572 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:15:45,572 INFO L85 PathProgramCache]: Analyzing trace with hash -705589988, now seen corresponding path program 1 times [2024-06-28 01:15:45,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:15:45,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621076014] [2024-06-28 01:15:45,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:15:45,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:15:45,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:15:45,629 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-28 01:15:45,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:15:45,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621076014] [2024-06-28 01:15:45,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621076014] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:15:45,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:15:45,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-28 01:15:45,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872335612] [2024-06-28 01:15:45,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:15:45,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-28 01:15:45,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:15:45,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-28 01:15:45,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-06-28 01:15:45,667 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 63 [2024-06-28 01:15:45,667 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 205 transitions, 2611 flow. Second operand has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 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-28 01:15:45,668 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:15:45,668 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 63 [2024-06-28 01:15:45,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:15:48,841 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([238] L714-->L714-1: Formula: (and (= v_~w~0_78 1) (not (= (ite (and (= v_~r~0_57 0) (= v_~w~0_79 0)) 1 0) 0))) InVars {~w~0=v_~w~0_79, ~r~0=v_~r~0_57} OutVars{~w~0=v_~w~0_78, writerThread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_writerThread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~r~0=v_~r~0_57, writerThread1of1ForFork3_assume_abort_if_not_~cond#1=|v_writerThread1of1ForFork3_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork3_assume_abort_if_not_~cond#1, writerThread1of1ForFork3_assume_abort_if_not_#in~cond#1][147], [Black: 129#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1) (= ~y~0 0)), Black: 127#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), Black: 126#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1)), 86#true, 133#true, Black: 138#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), Black: 142#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1) (= ~y~0 0)), 185#(= 3 ~x~0), Black: 154#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 147#(= |readerThread1of1ForFork0_~l~0#1| ~x~0), Black: 156#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), Black: 162#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), 100#true, Black: 145#true, Black: 164#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), Black: 160#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 152#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), 150#(= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|), Black: 179#(<= 1 ~r~0), Black: 176#true, 28#readerEXITtrue, 12#L714-1true, 11#L744true, Black: 190#(and (= |readerThread1of1ForFork0_~l~0#1| 3) (= 3 ~x~0) (= ~w~0 0) (= 3 ~y~0)), Black: 186#(and (= 3 ~x~0) (= ~w~0 0)), Black: 187#(and (= |readerThread1of1ForFork0_~l~0#1| 3) (= 3 ~x~0) (= ~w~0 0)), Black: 188#(and (= 3 ~x~0) (= ~w~0 0) (= 3 ~y~0)), Black: 201#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), readerThread1of1ForFork1InUse, Black: 79#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), Black: 84#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), Black: 90#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), Black: 88#(= ~y~0 0), Black: 89#(and (= ~w~0 1) (= ~y~0 0)), Black: 98#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0)), 29#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 110#true, 122#true, Black: 106#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), Black: 104#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), Black: 103#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 0)), 197#true, 203#true, 17#L720true, Black: 113#(and (= ~x~0 0) (= ~w~0 1)), Black: 115#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), Black: 114#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1)), Black: 117#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1) (= ~y~0 0)), 178#(= ~r~0 0)]) [2024-06-28 01:15:48,841 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-06-28 01:15:48,842 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-06-28 01:15:48,842 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-06-28 01:15:48,842 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-06-28 01:15:49,610 INFO L124 PetriNetUnfolderBase]: 18040/32725 cut-off events. [2024-06-28 01:15:49,610 INFO L125 PetriNetUnfolderBase]: For 427396/428697 co-relation queries the response was YES. [2024-06-28 01:15:49,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161181 conditions, 32725 events. 18040/32725 cut-off events. For 427396/428697 co-relation queries the response was YES. Maximal size of possible extension queue 1690. Compared 302818 event pairs, 7855 based on Foata normal form. 328/31883 useless extension candidates. Maximal degree in co-relation 154842. Up to 23565 conditions per place. [2024-06-28 01:15:49,969 INFO L140 encePairwiseOnDemand]: 55/63 looper letters, 169 selfloop transitions, 27 changer transitions 0/250 dead transitions. [2024-06-28 01:15:49,969 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 250 transitions, 3261 flow [2024-06-28 01:15:49,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 01:15:49,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 01:15:49,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 229 transitions. [2024-06-28 01:15:49,970 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6058201058201058 [2024-06-28 01:15:49,970 INFO L175 Difference]: Start difference. First operand has 145 places, 205 transitions, 2611 flow. Second operand 6 states and 229 transitions. [2024-06-28 01:15:49,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 250 transitions, 3261 flow [2024-06-28 01:15:52,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 250 transitions, 3199 flow, removed 20 selfloop flow, removed 3 redundant places. [2024-06-28 01:15:52,811 INFO L231 Difference]: Finished difference. Result has 149 places, 215 transitions, 2733 flow [2024-06-28 01:15:52,812 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=2559, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2733, PETRI_PLACES=149, PETRI_TRANSITIONS=215} [2024-06-28 01:15:52,812 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 81 predicate places. [2024-06-28 01:15:52,812 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 215 transitions, 2733 flow [2024-06-28 01:15:52,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 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-28 01:15:52,813 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:15:52,813 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-28 01:15:52,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-28 01:15:52,813 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 01:15:52,813 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:15:52,813 INFO L85 PathProgramCache]: Analyzing trace with hash -475716642, now seen corresponding path program 1 times [2024-06-28 01:15:52,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:15:52,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919853926] [2024-06-28 01:15:52,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:15:52,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:15:52,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:15:52,871 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-28 01:15:52,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:15:52,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919853926] [2024-06-28 01:15:52,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919853926] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:15:52,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:15:52,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 01:15:52,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077810043] [2024-06-28 01:15:52,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:15:52,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 01:15:52,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:15:52,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 01:15:52,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-28 01:15:52,925 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 63 [2024-06-28 01:15:52,925 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 215 transitions, 2733 flow. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 7 states have internal predecessors, (168), 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-28 01:15:52,925 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:15:52,926 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 63 [2024-06-28 01:15:52,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:15:58,273 INFO L124 PetriNetUnfolderBase]: 24205/41407 cut-off events. [2024-06-28 01:15:58,274 INFO L125 PetriNetUnfolderBase]: For 554803/556709 co-relation queries the response was YES. [2024-06-28 01:15:58,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 206420 conditions, 41407 events. 24205/41407 cut-off events. For 554803/556709 co-relation queries the response was YES. Maximal size of possible extension queue 2107. Compared 364885 event pairs, 5588 based on Foata normal form. 469/40864 useless extension candidates. Maximal degree in co-relation 197373. Up to 21250 conditions per place. [2024-06-28 01:15:58,796 INFO L140 encePairwiseOnDemand]: 48/63 looper letters, 260 selfloop transitions, 115 changer transitions 0/406 dead transitions. [2024-06-28 01:15:58,797 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 406 transitions, 5044 flow [2024-06-28 01:15:58,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-06-28 01:15:58,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2024-06-28 01:15:58,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 572 transitions. [2024-06-28 01:15:58,806 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6052910052910053 [2024-06-28 01:15:58,806 INFO L175 Difference]: Start difference. First operand has 149 places, 215 transitions, 2733 flow. Second operand 15 states and 572 transitions. [2024-06-28 01:15:58,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 406 transitions, 5044 flow [2024-06-28 01:16:02,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 406 transitions, 5006 flow, removed 19 selfloop flow, removed 0 redundant places. [2024-06-28 01:16:02,044 INFO L231 Difference]: Finished difference. Result has 170 places, 249 transitions, 3675 flow [2024-06-28 01:16:02,045 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=2695, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=3675, PETRI_PLACES=170, PETRI_TRANSITIONS=249} [2024-06-28 01:16:02,046 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 102 predicate places. [2024-06-28 01:16:02,046 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 249 transitions, 3675 flow [2024-06-28 01:16:02,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 7 states have internal predecessors, (168), 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-28 01:16:02,047 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:16:02,047 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-28 01:16:02,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-28 01:16:02,047 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 01:16:02,048 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:16:02,048 INFO L85 PathProgramCache]: Analyzing trace with hash 14869578, now seen corresponding path program 1 times [2024-06-28 01:16:02,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:16:02,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031239567] [2024-06-28 01:16:02,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:16:02,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:16:02,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:16:02,103 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-28 01:16:02,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:16:02,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031239567] [2024-06-28 01:16:02,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031239567] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:16:02,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:16:02,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 01:16:02,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640057356] [2024-06-28 01:16:02,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:16:02,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 01:16:02,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:16:02,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 01:16:02,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-06-28 01:16:02,163 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 63 [2024-06-28 01:16:02,163 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 249 transitions, 3675 flow. Second operand has 6 states, 6 states have (on average 27.0) internal successors, (162), 6 states have internal predecessors, (162), 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-28 01:16:02,163 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:16:02,163 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 63 [2024-06-28 01:16:02,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:16:09,466 INFO L124 PetriNetUnfolderBase]: 30796/51983 cut-off events. [2024-06-28 01:16:09,467 INFO L125 PetriNetUnfolderBase]: For 779509/785888 co-relation queries the response was YES. [2024-06-28 01:16:09,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 269029 conditions, 51983 events. 30796/51983 cut-off events. For 779509/785888 co-relation queries the response was YES. Maximal size of possible extension queue 2988. Compared 472034 event pairs, 6905 based on Foata normal form. 635/50981 useless extension candidates. Maximal degree in co-relation 261139. Up to 17505 conditions per place. [2024-06-28 01:16:10,199 INFO L140 encePairwiseOnDemand]: 52/63 looper letters, 288 selfloop transitions, 147 changer transitions 12/512 dead transitions. [2024-06-28 01:16:10,200 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 512 transitions, 7887 flow [2024-06-28 01:16:10,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-28 01:16:10,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-28 01:16:10,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 515 transitions. [2024-06-28 01:16:10,202 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6288156288156288 [2024-06-28 01:16:10,202 INFO L175 Difference]: Start difference. First operand has 170 places, 249 transitions, 3675 flow. Second operand 13 states and 515 transitions. [2024-06-28 01:16:10,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 512 transitions, 7887 flow