./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 --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --validate ./goblint.2024-05-21_14-57-05.files/protection/read_write_lock-2.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 76401ed0 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-atomic/read_write_lock-2.i ./goblint.2024-05-21_14-57-05.files/protection/read_write_lock-2.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-76401ed-m [2024-06-20 15:40:20,334 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-20 15:40:20,410 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-20 15:40:20,416 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-20 15:40:20,416 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-20 15:40:20,450 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-20 15:40:20,451 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-20 15:40:20,451 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-20 15:40:20,452 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-20 15:40:20,456 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-20 15:40:20,456 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-20 15:40:20,456 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-20 15:40:20,457 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-20 15:40:20,458 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-20 15:40:20,459 INFO L153 SettingsManager]: * Use SBE=true [2024-06-20 15:40:20,459 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-20 15:40:20,459 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-20 15:40:20,459 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-20 15:40:20,460 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-20 15:40:20,460 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-20 15:40:20,460 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-20 15:40:20,461 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-20 15:40:20,461 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-20 15:40:20,461 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-20 15:40:20,461 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-20 15:40:20,462 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-20 15:40:20,462 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-20 15:40:20,462 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-20 15:40:20,463 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-20 15:40:20,463 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-20 15:40:20,463 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-20 15:40:20,463 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-20 15:40:20,464 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-20 15:40:20,464 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-20 15:40:20,464 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-20 15:40:20,464 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-20 15:40:20,465 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-20 15:40:20,466 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-20 15:40:20,466 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-20 15:40:20,466 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-20 15:40:20,466 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-20 15:40:20,467 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-20 15:40:20,467 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-20 15:40:20,467 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2024-06-20 15:40:20,724 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-20 15:40:20,746 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-20 15:40:20,748 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-20 15:40:20,749 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-20 15:40:20,749 INFO L274 PluginConnector]: CDTParser initialized [2024-06-20 15:40:20,750 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-20 15:40:21,891 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-20 15:40:22,188 INFO L384 CDTParser]: Found 1 translation units. [2024-06-20 15:40:22,193 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/read_write_lock-2.i [2024-06-20 15:40:22,213 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69a807dce/efbf1c49132d4b0d8b9333d88af5aa0c/FLAG0b2e36077 [2024-06-20 15:40:22,226 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69a807dce/efbf1c49132d4b0d8b9333d88af5aa0c [2024-06-20 15:40:22,228 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-20 15:40:22,229 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-20 15:40:22,229 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-05-21_14-57-05.files/protection/read_write_lock-2.yml/witness.yml [2024-06-20 15:40:22,329 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-20 15:40:22,330 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-20 15:40:22,332 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-20 15:40:22,333 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-20 15:40:22,337 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-20 15:40:22,338 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.06 03:40:22" (1/2) ... [2024-06-20 15:40:22,338 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2dbe6bdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 03:40:22, skipping insertion in model container [2024-06-20 15:40:22,339 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.06 03:40:22" (1/2) ... [2024-06-20 15:40:22,342 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@6a2ca02e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 03:40:22, skipping insertion in model container [2024-06-20 15:40:22,342 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.06 03:40:22" (2/2) ... [2024-06-20 15:40:22,343 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2dbe6bdb and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 03:40:22, skipping insertion in model container [2024-06-20 15:40:22,343 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.06 03:40:22" (2/2) ... [2024-06-20 15:40:22,343 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-20 15:40:22,380 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-20 15:40:22,381 INFO L97 edCorrectnessWitness]: Location invariant before [L750-L750] ((! multithreaded || ((0 <= w && w <= 1) && (w == 0 || w == 1))) && (! multithreaded || ((((0 <= x && x <= 3) && x <= 127) && x % 3 == 0) && (x == 0 || x == 3)))) && (! multithreaded || ((((0 <= y && y <= 3) && y <= 127) && y % 3 == 0) && (y == 0 || y == 3))) [2024-06-20 15:40:22,382 INFO L97 edCorrectnessWitness]: Location invariant before [L751-L751] ((! multithreaded || ((0 <= w && w <= 1) && (w == 0 || w == 1))) && (! multithreaded || ((((0 <= x && x <= 3) && x <= 127) && x % 3 == 0) && (x == 0 || x == 3)))) && (! multithreaded || ((((0 <= y && y <= 3) && y <= 127) && y % 3 == 0) && (y == 0 || y == 3))) [2024-06-20 15:40:22,382 INFO L97 edCorrectnessWitness]: Location invariant before [L752-L752] ((! multithreaded || ((0 <= w && w <= 1) && (w == 0 || w == 1))) && (! multithreaded || ((((0 <= x && x <= 3) && x <= 127) && x % 3 == 0) && (x == 0 || x == 3)))) && (! multithreaded || ((((0 <= y && y <= 3) && y <= 127) && y % 3 == 0) && (y == 0 || y == 3))) [2024-06-20 15:40:22,382 INFO L97 edCorrectnessWitness]: Location invariant before [L753-L753] ((! multithreaded || ((0 <= w && w <= 1) && (w == 0 || w == 1))) && (! multithreaded || ((((0 <= x && x <= 3) && x <= 127) && x % 3 == 0) && (x == 0 || x == 3)))) && (! multithreaded || ((((0 <= y && y <= 3) && y <= 127) && y % 3 == 0) && (y == 0 || y == 3))) [2024-06-20 15:40:22,382 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-20 15:40:22,383 INFO L106 edCorrectnessWitness]: ghost_update [L749-L749] multithreaded = 1; [2024-06-20 15:40:22,422 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-20 15:40:22,771 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-20 15:40:22,783 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-20 15:40:22,905 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-20 15:40:22,948 INFO L206 MainTranslator]: Completed translation [2024-06-20 15:40:22,948 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 03:40:22 WrapperNode [2024-06-20 15:40:22,948 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-20 15:40:22,950 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-20 15:40:22,950 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-20 15:40:22,950 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-20 15:40:22,956 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 20.06 03:40:22" (1/1) ... [2024-06-20 15:40:22,988 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 20.06 03:40:22" (1/1) ... [2024-06-20 15:40:23,012 INFO L138 Inliner]: procedures = 172, calls = 31, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 103 [2024-06-20 15:40:23,013 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-20 15:40:23,013 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-20 15:40:23,013 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-20 15:40:23,013 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-20 15:40:23,022 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 03:40:22" (1/1) ... [2024-06-20 15:40:23,022 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 03:40:22" (1/1) ... [2024-06-20 15:40:23,025 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 03:40:22" (1/1) ... [2024-06-20 15:40:23,035 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-20 15:40:23,036 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 03:40:22" (1/1) ... [2024-06-20 15:40:23,036 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 03:40:22" (1/1) ... [2024-06-20 15:40:23,041 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 03:40:22" (1/1) ... [2024-06-20 15:40:23,048 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 03:40:22" (1/1) ... [2024-06-20 15:40:23,050 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 03:40:22" (1/1) ... [2024-06-20 15:40:23,051 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 03:40:22" (1/1) ... [2024-06-20 15:40:23,054 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-20 15:40:23,055 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-20 15:40:23,055 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-20 15:40:23,055 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-20 15:40:23,056 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 03:40:22" (1/1) ... [2024-06-20 15:40:23,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-20 15:40:23,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-20 15:40:23,083 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-20 15:40:23,108 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-20 15:40:23,127 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-20 15:40:23,127 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-20 15:40:23,127 INFO L130 BoogieDeclarations]: Found specification of procedure reader [2024-06-20 15:40:23,127 INFO L138 BoogieDeclarations]: Found implementation of procedure reader [2024-06-20 15:40:23,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-20 15:40:23,128 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-20 15:40:23,128 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-20 15:40:23,128 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-20 15:40:23,128 INFO L130 BoogieDeclarations]: Found specification of procedure writer [2024-06-20 15:40:23,129 INFO L138 BoogieDeclarations]: Found implementation of procedure writer [2024-06-20 15:40:23,130 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-20 15:40:23,284 INFO L244 CfgBuilder]: Building ICFG [2024-06-20 15:40:23,286 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-20 15:40:23,499 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-20 15:40:23,500 INFO L293 CfgBuilder]: Performing block encoding [2024-06-20 15:40:23,592 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-20 15:40:23,592 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-20 15:40:23,593 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.06 03:40:23 BoogieIcfgContainer [2024-06-20 15:40:23,593 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-20 15:40:23,594 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-20 15:40:23,595 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-20 15:40:23,597 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-20 15:40:23,597 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.06 03:40:22" (1/4) ... [2024-06-20 15:40:23,598 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d0a5d30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.06 03:40:23, skipping insertion in model container [2024-06-20 15:40:23,598 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.06 03:40:22" (2/4) ... [2024-06-20 15:40:23,598 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d0a5d30 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 20.06 03:40:23, skipping insertion in model container [2024-06-20 15:40:23,599 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 03:40:22" (3/4) ... [2024-06-20 15:40:23,599 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d0a5d30 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 20.06 03:40:23, skipping insertion in model container [2024-06-20 15:40:23,599 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.06 03:40:23" (4/4) ... [2024-06-20 15:40:23,600 INFO L112 eAbstractionObserver]: Analyzing ICFG read_write_lock-2.i [2024-06-20 15:40:23,615 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-20 15:40:23,615 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-06-20 15:40:23,615 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-20 15:40:23,664 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-06-20 15:40:23,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 70 places, 57 transitions, 142 flow [2024-06-20 15:40:23,720 INFO L124 PetriNetUnfolderBase]: 0/53 cut-off events. [2024-06-20 15:40:23,720 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-06-20 15:40:23,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70 conditions, 53 events. 0/53 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 97 event pairs, 0 based on Foata normal form. 0/49 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2024-06-20 15:40:23,722 INFO L82 GeneralOperation]: Start removeDead. Operand has 70 places, 57 transitions, 142 flow [2024-06-20 15:40:23,725 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 60 places, 47 transitions, 106 flow [2024-06-20 15:40:23,733 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-20 15:40:23,741 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;@18869eab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-20 15:40:23,741 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-06-20 15:40:23,744 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-20 15:40:23,744 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-06-20 15:40:23,745 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-20 15:40:23,745 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 15:40:23,745 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-20 15:40:23,746 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-20 15:40:23,750 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 15:40:23,750 INFO L85 PathProgramCache]: Analyzing trace with hash 234022191, now seen corresponding path program 1 times [2024-06-20 15:40:23,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 15:40:23,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915978204] [2024-06-20 15:40:23,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 15:40:23,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 15:40:23,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 15:40:24,269 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-20 15:40:24,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 15:40:24,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915978204] [2024-06-20 15:40:24,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915978204] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 15:40:24,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 15:40:24,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-20 15:40:24,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039787501] [2024-06-20 15:40:24,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 15:40:24,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-20 15:40:24,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 15:40:24,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-20 15:40:24,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-20 15:40:24,354 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 57 [2024-06-20 15:40:24,356 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 47 transitions, 106 flow. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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-20 15:40:24,357 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 15:40:24,357 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 57 [2024-06-20 15:40:24,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 15:40:25,430 INFO L124 PetriNetUnfolderBase]: 5905/9727 cut-off events. [2024-06-20 15:40:25,431 INFO L125 PetriNetUnfolderBase]: For 119/119 co-relation queries the response was YES. [2024-06-20 15:40:25,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18097 conditions, 9727 events. 5905/9727 cut-off events. For 119/119 co-relation queries the response was YES. Maximal size of possible extension queue 398. Compared 66787 event pairs, 3124 based on Foata normal form. 9/9477 useless extension candidates. Maximal degree in co-relation 18084. Up to 8047 conditions per place. [2024-06-20 15:40:25,512 INFO L140 encePairwiseOnDemand]: 48/57 looper letters, 45 selfloop transitions, 5 changer transitions 0/65 dead transitions. [2024-06-20 15:40:25,513 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 65 transitions, 251 flow [2024-06-20 15:40:25,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-20 15:40:25,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-20 15:40:25,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions. [2024-06-20 15:40:25,526 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2024-06-20 15:40:25,528 INFO L175 Difference]: Start difference. First operand has 60 places, 47 transitions, 106 flow. Second operand 3 states and 114 transitions. [2024-06-20 15:40:25,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 65 transitions, 251 flow [2024-06-20 15:40:25,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 65 transitions, 244 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-06-20 15:40:25,540 INFO L231 Difference]: Finished difference. Result has 59 places, 51 transitions, 141 flow [2024-06-20 15:40:25,542 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=141, PETRI_PLACES=59, PETRI_TRANSITIONS=51} [2024-06-20 15:40:25,546 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -1 predicate places. [2024-06-20 15:40:25,546 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 51 transitions, 141 flow [2024-06-20 15:40:25,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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-20 15:40:25,546 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 15:40:25,546 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-20 15:40:25,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-20 15:40:25,547 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-20 15:40:25,550 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 15:40:25,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1557093582, now seen corresponding path program 1 times [2024-06-20 15:40:25,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 15:40:25,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774318236] [2024-06-20 15:40:25,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 15:40:25,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 15:40:25,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 15:40:25,879 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-20 15:40:25,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 15:40:25,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774318236] [2024-06-20 15:40:25,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774318236] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 15:40:25,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 15:40:25,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-20 15:40:25,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078825027] [2024-06-20 15:40:25,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 15:40:25,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-20 15:40:25,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 15:40:25,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-20 15:40:25,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-20 15:40:25,936 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 57 [2024-06-20 15:40:25,937 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 51 transitions, 141 flow. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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-20 15:40:25,938 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 15:40:25,938 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 57 [2024-06-20 15:40:25,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 15:40:27,208 INFO L124 PetriNetUnfolderBase]: 9222/14466 cut-off events. [2024-06-20 15:40:27,209 INFO L125 PetriNetUnfolderBase]: For 2061/2061 co-relation queries the response was YES. [2024-06-20 15:40:27,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30747 conditions, 14466 events. 9222/14466 cut-off events. For 2061/2061 co-relation queries the response was YES. Maximal size of possible extension queue 569. Compared 97234 event pairs, 4632 based on Foata normal form. 115/14412 useless extension candidates. Maximal degree in co-relation 30735. Up to 12366 conditions per place. [2024-06-20 15:40:27,305 INFO L140 encePairwiseOnDemand]: 44/57 looper letters, 59 selfloop transitions, 9 changer transitions 0/81 dead transitions. [2024-06-20 15:40:27,305 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 81 transitions, 353 flow [2024-06-20 15:40:27,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-20 15:40:27,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-20 15:40:27,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 148 transitions. [2024-06-20 15:40:27,315 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6491228070175439 [2024-06-20 15:40:27,315 INFO L175 Difference]: Start difference. First operand has 59 places, 51 transitions, 141 flow. Second operand 4 states and 148 transitions. [2024-06-20 15:40:27,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 81 transitions, 353 flow [2024-06-20 15:40:27,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 81 transitions, 348 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-20 15:40:27,319 INFO L231 Difference]: Finished difference. Result has 62 places, 55 transitions, 196 flow [2024-06-20 15:40:27,319 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=196, PETRI_PLACES=62, PETRI_TRANSITIONS=55} [2024-06-20 15:40:27,320 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 2 predicate places. [2024-06-20 15:40:27,320 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 55 transitions, 196 flow [2024-06-20 15:40:27,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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-20 15:40:27,321 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 15:40:27,321 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 15:40:27,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-20 15:40:27,323 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-20 15:40:27,326 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 15:40:27,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1025262954, now seen corresponding path program 1 times [2024-06-20 15:40:27,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 15:40:27,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184782297] [2024-06-20 15:40:27,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 15:40:27,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 15:40:27,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 15:40:27,452 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-20 15:40:27,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 15:40:27,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184782297] [2024-06-20 15:40:27,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184782297] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 15:40:27,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 15:40:27,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-20 15:40:27,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731735354] [2024-06-20 15:40:27,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 15:40:27,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-20 15:40:27,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 15:40:27,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-20 15:40:27,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-20 15:40:27,485 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 57 [2024-06-20 15:40:27,485 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 55 transitions, 196 flow. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 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-20 15:40:27,486 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 15:40:27,486 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 57 [2024-06-20 15:40:27,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 15:40:28,804 INFO L124 PetriNetUnfolderBase]: 8409/13367 cut-off events. [2024-06-20 15:40:28,804 INFO L125 PetriNetUnfolderBase]: For 5918/5918 co-relation queries the response was YES. [2024-06-20 15:40:28,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33209 conditions, 13367 events. 8409/13367 cut-off events. For 5918/5918 co-relation queries the response was YES. Maximal size of possible extension queue 552. Compared 90932 event pairs, 2749 based on Foata normal form. 339/13395 useless extension candidates. Maximal degree in co-relation 33195. Up to 9313 conditions per place. [2024-06-20 15:40:28,881 INFO L140 encePairwiseOnDemand]: 42/57 looper letters, 79 selfloop transitions, 21 changer transitions 0/113 dead transitions. [2024-06-20 15:40:28,882 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 113 transitions, 588 flow [2024-06-20 15:40:28,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-20 15:40:28,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-20 15:40:28,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 192 transitions. [2024-06-20 15:40:28,884 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6736842105263158 [2024-06-20 15:40:28,884 INFO L175 Difference]: Start difference. First operand has 62 places, 55 transitions, 196 flow. Second operand 5 states and 192 transitions. [2024-06-20 15:40:28,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 113 transitions, 588 flow [2024-06-20 15:40:28,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 113 transitions, 572 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-06-20 15:40:28,891 INFO L231 Difference]: Finished difference. Result has 67 places, 67 transitions, 349 flow [2024-06-20 15:40:28,892 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=349, PETRI_PLACES=67, PETRI_TRANSITIONS=67} [2024-06-20 15:40:28,893 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 7 predicate places. [2024-06-20 15:40:28,893 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 67 transitions, 349 flow [2024-06-20 15:40:28,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 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-20 15:40:28,894 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 15:40:28,894 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 15:40:28,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-20 15:40:28,894 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-20 15:40:28,895 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 15:40:28,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1086916175, now seen corresponding path program 1 times [2024-06-20 15:40:28,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 15:40:28,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36367224] [2024-06-20 15:40:28,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 15:40:28,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 15:40:28,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 15:40:29,055 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-20 15:40:29,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 15:40:29,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36367224] [2024-06-20 15:40:29,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36367224] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 15:40:29,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 15:40:29,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-20 15:40:29,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079839997] [2024-06-20 15:40:29,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 15:40:29,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-20 15:40:29,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 15:40:29,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-20 15:40:29,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-20 15:40:29,109 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 57 [2024-06-20 15:40:29,110 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 67 transitions, 349 flow. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 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-20 15:40:29,110 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 15:40:29,110 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 57 [2024-06-20 15:40:29,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 15:40:30,381 INFO L124 PetriNetUnfolderBase]: 8195/12989 cut-off events. [2024-06-20 15:40:30,381 INFO L125 PetriNetUnfolderBase]: For 17383/17392 co-relation queries the response was YES. [2024-06-20 15:40:30,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40359 conditions, 12989 events. 8195/12989 cut-off events. For 17383/17392 co-relation queries the response was YES. Maximal size of possible extension queue 545. Compared 88090 event pairs, 2416 based on Foata normal form. 110/12776 useless extension candidates. Maximal degree in co-relation 40342. Up to 9283 conditions per place. [2024-06-20 15:40:30,466 INFO L140 encePairwiseOnDemand]: 44/57 looper letters, 79 selfloop transitions, 17 changer transitions 0/109 dead transitions. [2024-06-20 15:40:30,466 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 109 transitions, 671 flow [2024-06-20 15:40:30,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-20 15:40:30,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-20 15:40:30,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 186 transitions. [2024-06-20 15:40:30,468 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6526315789473685 [2024-06-20 15:40:30,468 INFO L175 Difference]: Start difference. First operand has 67 places, 67 transitions, 349 flow. Second operand 5 states and 186 transitions. [2024-06-20 15:40:30,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 109 transitions, 671 flow [2024-06-20 15:40:30,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 109 transitions, 663 flow, removed 4 selfloop flow, removed 0 redundant places. [2024-06-20 15:40:30,478 INFO L231 Difference]: Finished difference. Result has 71 places, 66 transitions, 379 flow [2024-06-20 15:40:30,478 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=333, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=379, PETRI_PLACES=71, PETRI_TRANSITIONS=66} [2024-06-20 15:40:30,480 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 11 predicate places. [2024-06-20 15:40:30,480 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 66 transitions, 379 flow [2024-06-20 15:40:30,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 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-20 15:40:30,481 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 15:40:30,481 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 15:40:30,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-20 15:40:30,481 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-20 15:40:30,482 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 15:40:30,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1003026236, now seen corresponding path program 1 times [2024-06-20 15:40:30,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 15:40:30,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001403647] [2024-06-20 15:40:30,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 15:40:30,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 15:40:30,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 15:40:30,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 15:40:30,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 15:40:30,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001403647] [2024-06-20 15:40:30,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001403647] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 15:40:30,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 15:40:30,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-20 15:40:30,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392185686] [2024-06-20 15:40:30,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 15:40:30,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-20 15:40:30,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 15:40:30,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-20 15:40:30,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-06-20 15:40:30,767 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 57 [2024-06-20 15:40:30,768 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 66 transitions, 379 flow. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 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-20 15:40:30,768 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 15:40:30,768 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 57 [2024-06-20 15:40:30,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 15:40:32,315 INFO L124 PetriNetUnfolderBase]: 10109/16326 cut-off events. [2024-06-20 15:40:32,316 INFO L125 PetriNetUnfolderBase]: For 29329/29343 co-relation queries the response was YES. [2024-06-20 15:40:32,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51911 conditions, 16326 events. 10109/16326 cut-off events. For 29329/29343 co-relation queries the response was YES. Maximal size of possible extension queue 636. Compared 115596 event pairs, 3953 based on Foata normal form. 46/15979 useless extension candidates. Maximal degree in co-relation 51891. Up to 12984 conditions per place. [2024-06-20 15:40:32,431 INFO L140 encePairwiseOnDemand]: 47/57 looper letters, 88 selfloop transitions, 22 changer transitions 0/125 dead transitions. [2024-06-20 15:40:32,432 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 125 transitions, 872 flow [2024-06-20 15:40:32,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-20 15:40:32,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-20 15:40:32,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 204 transitions. [2024-06-20 15:40:32,434 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5964912280701754 [2024-06-20 15:40:32,434 INFO L175 Difference]: Start difference. First operand has 71 places, 66 transitions, 379 flow. Second operand 6 states and 204 transitions. [2024-06-20 15:40:32,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 125 transitions, 872 flow [2024-06-20 15:40:32,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 125 transitions, 830 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-06-20 15:40:32,458 INFO L231 Difference]: Finished difference. Result has 76 places, 84 transitions, 571 flow [2024-06-20 15:40:32,459 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=342, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=571, PETRI_PLACES=76, PETRI_TRANSITIONS=84} [2024-06-20 15:40:32,460 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 16 predicate places. [2024-06-20 15:40:32,460 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 84 transitions, 571 flow [2024-06-20 15:40:32,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 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-20 15:40:32,460 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 15:40:32,460 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 15:40:32,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-20 15:40:32,461 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-20 15:40:32,461 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 15:40:32,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1857488155, now seen corresponding path program 1 times [2024-06-20 15:40:32,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 15:40:32,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408149572] [2024-06-20 15:40:32,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 15:40:32,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 15:40:32,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 15:40:32,512 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-20 15:40:32,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 15:40:32,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408149572] [2024-06-20 15:40:32,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408149572] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 15:40:32,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 15:40:32,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-20 15:40:32,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235741056] [2024-06-20 15:40:32,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 15:40:32,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-20 15:40:32,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 15:40:32,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-20 15:40:32,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-20 15:40:32,524 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 57 [2024-06-20 15:40:32,525 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 84 transitions, 571 flow. Second operand has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 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-20 15:40:32,525 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 15:40:32,525 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 57 [2024-06-20 15:40:32,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 15:40:33,551 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([242] 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][93], [writerThread1of1ForFork3InUse, writerThread1of1ForFork2InUse, readerThread1of1ForFork0InUse, Black: 99#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 0)), readerThread1of1ForFork1InUse, Black: 102#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), Black: 100#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), 108#(= ~r~0 0), Black: 75#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), 10#L744true, Black: 80#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 27#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 15#L720true, Black: 85#(and (= ~w~0 1) (= ~y~0 0)), 96#true, Black: 86#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), Black: 84#(= ~y~0 0), 11#L714-1true, 58#L744true, 82#true, Black: 94#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0))]) [2024-06-20 15:40:33,552 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-06-20 15:40:33,552 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-06-20 15:40:33,552 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-06-20 15:40:33,552 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-06-20 15:40:33,578 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([247] 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, writerThread1of1ForFork2_assume_abort_if_not_~cond#1=|v_writerThread1of1ForFork2_assume_abort_if_not_~cond#1_1|, writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~r~0=v_~r~0_57} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork2_assume_abort_if_not_~cond#1, writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1][97], [writerThread1of1ForFork3InUse, writerThread1of1ForFork2InUse, readerThread1of1ForFork0InUse, Black: 99#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 0)), readerThread1of1ForFork1InUse, Black: 102#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), Black: 100#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), 108#(= ~r~0 0), Black: 75#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), 10#L744true, 5#L720true, Black: 80#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 27#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, Black: 85#(and (= ~w~0 1) (= ~y~0 0)), 96#true, 28#L714-1true, Black: 86#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), Black: 84#(= ~y~0 0), 58#L744true, 82#true, Black: 94#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0))]) [2024-06-20 15:40:33,579 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-06-20 15:40:33,579 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-06-20 15:40:33,579 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-06-20 15:40:33,579 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-06-20 15:40:33,594 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([242] 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][93], [writerThread1of1ForFork3InUse, writerThread1of1ForFork2InUse, readerThread1of1ForFork0InUse, Black: 99#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 0)), readerThread1of1ForFork1InUse, Black: 102#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), Black: 100#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), 108#(= ~r~0 0), Black: 75#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), 10#L744true, Black: 80#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 27#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 15#L720true, Black: 85#(and (= ~w~0 1) (= ~y~0 0)), 96#true, Black: 86#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), Black: 84#(= ~y~0 0), 11#L714-1true, 58#L744true, 82#true, Black: 94#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0))]) [2024-06-20 15:40:33,595 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-06-20 15:40:33,595 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-06-20 15:40:33,595 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-06-20 15:40:33,595 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-06-20 15:40:33,596 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-06-20 15:40:33,601 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([242] 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][93], [writerThread1of1ForFork3InUse, writerThread1of1ForFork2InUse, 26#readerEXITtrue, readerThread1of1ForFork0InUse, Black: 99#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 0)), readerThread1of1ForFork1InUse, Black: 102#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), Black: 100#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), 108#(= ~r~0 0), Black: 75#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), 10#L744true, Black: 80#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 27#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 15#L720true, Black: 85#(and (= ~w~0 1) (= ~y~0 0)), 96#true, Black: 86#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), Black: 84#(= ~y~0 0), 11#L714-1true, 82#true, Black: 94#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0))]) [2024-06-20 15:40:33,602 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-06-20 15:40:33,602 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-06-20 15:40:33,602 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-06-20 15:40:33,602 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-06-20 15:40:33,603 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([242] 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][93], [writerThread1of1ForFork3InUse, writerThread1of1ForFork2InUse, readerThread1of1ForFork0InUse, Black: 99#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 0)), readerThread1of1ForFork1InUse, Black: 102#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), Black: 100#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), 108#(= ~r~0 0), Black: 75#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), Black: 80#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 27#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 15#L720true, Black: 85#(and (= ~w~0 1) (= ~y~0 0)), 96#true, Black: 86#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), Black: 84#(= ~y~0 0), 11#L714-1true, 58#L744true, 45#readerEXITtrue, 82#true, Black: 94#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0))]) [2024-06-20 15:40:33,603 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-06-20 15:40:33,603 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-06-20 15:40:33,603 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-06-20 15:40:33,604 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-06-20 15:40:33,609 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([247] 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, writerThread1of1ForFork2_assume_abort_if_not_~cond#1=|v_writerThread1of1ForFork2_assume_abort_if_not_~cond#1_1|, writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~r~0=v_~r~0_57} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork2_assume_abort_if_not_~cond#1, writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1][97], [writerThread1of1ForFork3InUse, writerThread1of1ForFork2InUse, readerThread1of1ForFork0InUse, Black: 99#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 0)), readerThread1of1ForFork1InUse, Black: 102#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), Black: 100#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), 108#(= ~r~0 0), Black: 75#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), 10#L744true, 5#L720true, Black: 80#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 27#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, Black: 85#(and (= ~w~0 1) (= ~y~0 0)), 96#true, 28#L714-1true, Black: 86#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), Black: 84#(= ~y~0 0), 58#L744true, 82#true, Black: 94#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0))]) [2024-06-20 15:40:33,609 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-06-20 15:40:33,609 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-06-20 15:40:33,609 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-06-20 15:40:33,609 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-06-20 15:40:33,610 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-06-20 15:40:33,627 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([247] 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, writerThread1of1ForFork2_assume_abort_if_not_~cond#1=|v_writerThread1of1ForFork2_assume_abort_if_not_~cond#1_1|, writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~r~0=v_~r~0_57} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork2_assume_abort_if_not_~cond#1, writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1][97], [writerThread1of1ForFork3InUse, writerThread1of1ForFork2InUse, 26#readerEXITtrue, readerThread1of1ForFork0InUse, Black: 99#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 0)), readerThread1of1ForFork1InUse, Black: 102#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), Black: 100#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), 108#(= ~r~0 0), Black: 75#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), 10#L744true, 5#L720true, Black: 80#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 27#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, Black: 85#(and (= ~w~0 1) (= ~y~0 0)), 96#true, 28#L714-1true, Black: 86#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), Black: 84#(= ~y~0 0), 82#true, Black: 94#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0))]) [2024-06-20 15:40:33,627 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-06-20 15:40:33,628 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-06-20 15:40:33,628 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-06-20 15:40:33,628 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-06-20 15:40:33,629 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([247] 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, writerThread1of1ForFork2_assume_abort_if_not_~cond#1=|v_writerThread1of1ForFork2_assume_abort_if_not_~cond#1_1|, writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~r~0=v_~r~0_57} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork2_assume_abort_if_not_~cond#1, writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1][97], [writerThread1of1ForFork3InUse, writerThread1of1ForFork2InUse, readerThread1of1ForFork0InUse, Black: 99#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 0)), readerThread1of1ForFork1InUse, Black: 102#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), Black: 100#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), 108#(= ~r~0 0), Black: 75#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), 5#L720true, Black: 80#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 27#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, Black: 85#(and (= ~w~0 1) (= ~y~0 0)), 96#true, 28#L714-1true, Black: 86#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), Black: 84#(= ~y~0 0), 45#readerEXITtrue, 58#L744true, 82#true, Black: 94#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0))]) [2024-06-20 15:40:33,629 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-06-20 15:40:33,629 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-06-20 15:40:33,629 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-06-20 15:40:33,629 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-06-20 15:40:33,642 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([242] 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][93], [writerThread1of1ForFork3InUse, writerThread1of1ForFork2InUse, 26#readerEXITtrue, readerThread1of1ForFork0InUse, Black: 99#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 0)), readerThread1of1ForFork1InUse, Black: 102#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), Black: 100#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), 108#(= ~r~0 0), Black: 75#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), 10#L744true, Black: 80#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 27#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 15#L720true, Black: 85#(and (= ~w~0 1) (= ~y~0 0)), 96#true, Black: 86#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), Black: 84#(= ~y~0 0), 11#L714-1true, 82#true, Black: 94#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0))]) [2024-06-20 15:40:33,643 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-06-20 15:40:33,643 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-06-20 15:40:33,643 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-06-20 15:40:33,643 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-06-20 15:40:33,643 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-06-20 15:40:33,644 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([242] 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][93], [writerThread1of1ForFork3InUse, writerThread1of1ForFork2InUse, readerThread1of1ForFork0InUse, Black: 99#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 0)), readerThread1of1ForFork1InUse, Black: 102#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), Black: 100#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), 108#(= ~r~0 0), Black: 75#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), Black: 80#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 27#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 15#L720true, Black: 85#(and (= ~w~0 1) (= ~y~0 0)), 96#true, Black: 86#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), Black: 84#(= ~y~0 0), 11#L714-1true, 58#L744true, 45#readerEXITtrue, 82#true, Black: 94#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0))]) [2024-06-20 15:40:33,644 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-06-20 15:40:33,645 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-06-20 15:40:33,645 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-06-20 15:40:33,645 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-06-20 15:40:33,645 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-06-20 15:40:33,649 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([242] 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][93], [writerThread1of1ForFork3InUse, writerThread1of1ForFork2InUse, 26#readerEXITtrue, readerThread1of1ForFork0InUse, Black: 99#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 0)), readerThread1of1ForFork1InUse, Black: 102#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), Black: 100#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), 108#(= ~r~0 0), Black: 75#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), Black: 80#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 27#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 15#L720true, Black: 85#(and (= ~w~0 1) (= ~y~0 0)), 96#true, Black: 86#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), Black: 84#(= ~y~0 0), 11#L714-1true, 45#readerEXITtrue, 82#true, Black: 94#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0))]) [2024-06-20 15:40:33,649 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2024-06-20 15:40:33,649 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-20 15:40:33,650 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-20 15:40:33,650 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-20 15:40:33,654 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([247] 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, writerThread1of1ForFork2_assume_abort_if_not_~cond#1=|v_writerThread1of1ForFork2_assume_abort_if_not_~cond#1_1|, writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~r~0=v_~r~0_57} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork2_assume_abort_if_not_~cond#1, writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1][97], [writerThread1of1ForFork3InUse, writerThread1of1ForFork2InUse, 26#readerEXITtrue, readerThread1of1ForFork0InUse, Black: 99#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 0)), readerThread1of1ForFork1InUse, Black: 102#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), Black: 100#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), 108#(= ~r~0 0), Black: 75#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), 10#L744true, 5#L720true, Black: 80#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 27#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, Black: 85#(and (= ~w~0 1) (= ~y~0 0)), 96#true, 28#L714-1true, Black: 86#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), Black: 84#(= ~y~0 0), 82#true, Black: 94#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0))]) [2024-06-20 15:40:33,654 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-06-20 15:40:33,654 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-06-20 15:40:33,654 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-06-20 15:40:33,655 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-06-20 15:40:33,655 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-06-20 15:40:33,657 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([247] 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, writerThread1of1ForFork2_assume_abort_if_not_~cond#1=|v_writerThread1of1ForFork2_assume_abort_if_not_~cond#1_1|, writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~r~0=v_~r~0_57} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork2_assume_abort_if_not_~cond#1, writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1][97], [writerThread1of1ForFork3InUse, writerThread1of1ForFork2InUse, readerThread1of1ForFork0InUse, Black: 99#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 0)), readerThread1of1ForFork1InUse, Black: 102#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), Black: 100#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), 108#(= ~r~0 0), Black: 75#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), 5#L720true, Black: 80#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 27#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, Black: 85#(and (= ~w~0 1) (= ~y~0 0)), 96#true, 28#L714-1true, Black: 86#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), Black: 84#(= ~y~0 0), 58#L744true, 45#readerEXITtrue, 82#true, Black: 94#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0))]) [2024-06-20 15:40:33,657 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-06-20 15:40:33,657 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-06-20 15:40:33,657 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-06-20 15:40:33,657 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-06-20 15:40:33,658 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-06-20 15:40:33,667 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([247] 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, writerThread1of1ForFork2_assume_abort_if_not_~cond#1=|v_writerThread1of1ForFork2_assume_abort_if_not_~cond#1_1|, writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~r~0=v_~r~0_57} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork2_assume_abort_if_not_~cond#1, writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1][97], [writerThread1of1ForFork3InUse, writerThread1of1ForFork2InUse, 26#readerEXITtrue, readerThread1of1ForFork0InUse, Black: 99#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 0)), readerThread1of1ForFork1InUse, Black: 102#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), Black: 100#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), 108#(= ~r~0 0), Black: 75#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), 5#L720true, Black: 80#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 27#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, Black: 85#(and (= ~w~0 1) (= ~y~0 0)), 96#true, 28#L714-1true, Black: 86#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), Black: 84#(= ~y~0 0), 45#readerEXITtrue, 82#true, Black: 94#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0))]) [2024-06-20 15:40:33,668 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2024-06-20 15:40:33,668 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-20 15:40:33,668 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-20 15:40:33,668 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-20 15:40:33,684 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([242] 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][93], [writerThread1of1ForFork3InUse, writerThread1of1ForFork2InUse, 26#readerEXITtrue, readerThread1of1ForFork0InUse, Black: 99#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 0)), readerThread1of1ForFork1InUse, Black: 102#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), Black: 100#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), 108#(= ~r~0 0), Black: 75#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), Black: 80#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 27#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 15#L720true, Black: 85#(and (= ~w~0 1) (= ~y~0 0)), 96#true, Black: 86#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), Black: 84#(= ~y~0 0), 11#L714-1true, 45#readerEXITtrue, 82#true, Black: 94#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0))]) [2024-06-20 15:40:33,685 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2024-06-20 15:40:33,685 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-20 15:40:33,685 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-20 15:40:33,685 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-20 15:40:33,685 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-20 15:40:33,692 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([247] 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, writerThread1of1ForFork2_assume_abort_if_not_~cond#1=|v_writerThread1of1ForFork2_assume_abort_if_not_~cond#1_1|, writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~r~0=v_~r~0_57} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork2_assume_abort_if_not_~cond#1, writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1][97], [writerThread1of1ForFork3InUse, writerThread1of1ForFork2InUse, 26#readerEXITtrue, readerThread1of1ForFork0InUse, Black: 99#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 0)), readerThread1of1ForFork1InUse, Black: 102#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), Black: 100#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), 108#(= ~r~0 0), Black: 75#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), 5#L720true, Black: 80#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 27#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, Black: 85#(and (= ~w~0 1) (= ~y~0 0)), 96#true, 28#L714-1true, Black: 86#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), Black: 84#(= ~y~0 0), 45#readerEXITtrue, 82#true, Black: 94#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0))]) [2024-06-20 15:40:33,692 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2024-06-20 15:40:33,693 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-20 15:40:33,693 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-20 15:40:33,693 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-20 15:40:33,693 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-20 15:40:33,726 INFO L124 PetriNetUnfolderBase]: 7627/13636 cut-off events. [2024-06-20 15:40:33,726 INFO L125 PetriNetUnfolderBase]: For 53541/55568 co-relation queries the response was YES. [2024-06-20 15:40:33,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45428 conditions, 13636 events. 7627/13636 cut-off events. For 53541/55568 co-relation queries the response was YES. Maximal size of possible extension queue 682. Compared 111258 event pairs, 2764 based on Foata normal form. 843/13527 useless extension candidates. Maximal degree in co-relation 45406. Up to 4939 conditions per place. [2024-06-20 15:40:33,836 INFO L140 encePairwiseOnDemand]: 50/57 looper letters, 61 selfloop transitions, 17 changer transitions 0/116 dead transitions. [2024-06-20 15:40:33,836 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 116 transitions, 789 flow [2024-06-20 15:40:33,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-20 15:40:33,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-20 15:40:33,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 172 transitions. [2024-06-20 15:40:33,837 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7543859649122807 [2024-06-20 15:40:33,838 INFO L175 Difference]: Start difference. First operand has 76 places, 84 transitions, 571 flow. Second operand 4 states and 172 transitions. [2024-06-20 15:40:33,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 116 transitions, 789 flow [2024-06-20 15:40:33,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 116 transitions, 773 flow, removed 5 selfloop flow, removed 1 redundant places. [2024-06-20 15:40:33,900 INFO L231 Difference]: Finished difference. Result has 81 places, 84 transitions, 625 flow [2024-06-20 15:40:33,902 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=485, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=625, PETRI_PLACES=81, PETRI_TRANSITIONS=84} [2024-06-20 15:40:33,905 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 21 predicate places. [2024-06-20 15:40:33,905 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 84 transitions, 625 flow [2024-06-20 15:40:33,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 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-20 15:40:33,905 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 15:40:33,905 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 15:40:33,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-20 15:40:33,906 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-20 15:40:33,906 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 15:40:33,907 INFO L85 PathProgramCache]: Analyzing trace with hash -939487396, now seen corresponding path program 1 times [2024-06-20 15:40:33,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 15:40:33,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816145222] [2024-06-20 15:40:33,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 15:40:33,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 15:40:33,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 15:40:34,169 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-20 15:40:34,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 15:40:34,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816145222] [2024-06-20 15:40:34,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816145222] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 15:40:34,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 15:40:34,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-20 15:40:34,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026938130] [2024-06-20 15:40:34,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 15:40:34,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-20 15:40:34,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 15:40:34,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-20 15:40:34,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-06-20 15:40:34,234 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 57 [2024-06-20 15:40:34,234 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 84 transitions, 625 flow. Second operand has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 6 states have internal predecessors, (110), 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-20 15:40:34,234 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 15:40:34,234 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 57 [2024-06-20 15:40:34,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 15:40:36,363 INFO L124 PetriNetUnfolderBase]: 17556/27532 cut-off events. [2024-06-20 15:40:36,363 INFO L125 PetriNetUnfolderBase]: For 99631/100397 co-relation queries the response was YES. [2024-06-20 15:40:36,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95149 conditions, 27532 events. 17556/27532 cut-off events. For 99631/100397 co-relation queries the response was YES. Maximal size of possible extension queue 1116. Compared 201091 event pairs, 2069 based on Foata normal form. 570/27844 useless extension candidates. Maximal degree in co-relation 95122. Up to 10804 conditions per place. [2024-06-20 15:40:36,863 INFO L140 encePairwiseOnDemand]: 42/57 looper letters, 175 selfloop transitions, 35 changer transitions 0/225 dead transitions. [2024-06-20 15:40:36,863 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 225 transitions, 1925 flow [2024-06-20 15:40:36,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 15:40:36,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 15:40:36,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 282 transitions. [2024-06-20 15:40:36,864 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.706766917293233 [2024-06-20 15:40:36,865 INFO L175 Difference]: Start difference. First operand has 81 places, 84 transitions, 625 flow. Second operand 7 states and 282 transitions. [2024-06-20 15:40:36,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 225 transitions, 1925 flow [2024-06-20 15:40:36,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 225 transitions, 1893 flow, removed 16 selfloop flow, removed 0 redundant places. [2024-06-20 15:40:36,942 INFO L231 Difference]: Finished difference. Result has 93 places, 116 transitions, 1191 flow [2024-06-20 15:40:36,942 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=613, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1191, PETRI_PLACES=93, PETRI_TRANSITIONS=116} [2024-06-20 15:40:36,943 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 33 predicate places. [2024-06-20 15:40:36,943 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 116 transitions, 1191 flow [2024-06-20 15:40:36,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 6 states have internal predecessors, (110), 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-20 15:40:36,943 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 15:40:36,944 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 15:40:36,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-20 15:40:36,944 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-20 15:40:36,944 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 15:40:36,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1218198454, now seen corresponding path program 1 times [2024-06-20 15:40:36,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 15:40:36,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145217065] [2024-06-20 15:40:36,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 15:40:36,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 15:40:36,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 15:40:37,293 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-20 15:40:37,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 15:40:37,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145217065] [2024-06-20 15:40:37,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145217065] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 15:40:37,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 15:40:37,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-20 15:40:37,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2685533] [2024-06-20 15:40:37,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 15:40:37,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-20 15:40:37,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 15:40:37,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-20 15:40:37,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-20 15:40:37,351 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 57 [2024-06-20 15:40:37,352 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 116 transitions, 1191 flow. Second operand has 6 states, 6 states have (on average 19.5) internal successors, (117), 6 states have internal predecessors, (117), 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-20 15:40:37,352 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 15:40:37,352 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 57 [2024-06-20 15:40:37,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 15:40:39,832 INFO L124 PetriNetUnfolderBase]: 15036/24882 cut-off events. [2024-06-20 15:40:39,833 INFO L125 PetriNetUnfolderBase]: For 141512/142753 co-relation queries the response was YES. [2024-06-20 15:40:39,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100892 conditions, 24882 events. 15036/24882 cut-off events. For 141512/142753 co-relation queries the response was YES. Maximal size of possible extension queue 1076. Compared 192086 event pairs, 6611 based on Foata normal form. 269/24648 useless extension candidates. Maximal degree in co-relation 100858. Up to 19756 conditions per place. [2024-06-20 15:40:40,184 INFO L140 encePairwiseOnDemand]: 45/57 looper letters, 121 selfloop transitions, 13 changer transitions 0/157 dead transitions. [2024-06-20 15:40:40,185 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 157 transitions, 1651 flow [2024-06-20 15:40:40,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-20 15:40:40,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-20 15:40:40,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 189 transitions. [2024-06-20 15:40:40,187 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5526315789473685 [2024-06-20 15:40:40,187 INFO L175 Difference]: Start difference. First operand has 93 places, 116 transitions, 1191 flow. Second operand 6 states and 189 transitions. [2024-06-20 15:40:40,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 157 transitions, 1651 flow [2024-06-20 15:40:40,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 157 transitions, 1581 flow, removed 35 selfloop flow, removed 0 redundant places. [2024-06-20 15:40:40,451 INFO L231 Difference]: Finished difference. Result has 99 places, 118 transitions, 1181 flow [2024-06-20 15:40:40,451 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=1121, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1181, PETRI_PLACES=99, PETRI_TRANSITIONS=118} [2024-06-20 15:40:40,452 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 39 predicate places. [2024-06-20 15:40:40,452 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 118 transitions, 1181 flow [2024-06-20 15:40:40,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.5) internal successors, (117), 6 states have internal predecessors, (117), 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-20 15:40:40,452 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 15:40:40,453 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-20 15:40:40,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-20 15:40:40,453 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-20 15:40:40,453 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 15:40:40,454 INFO L85 PathProgramCache]: Analyzing trace with hash -15221941, now seen corresponding path program 1 times [2024-06-20 15:40:40,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 15:40:40,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448917529] [2024-06-20 15:40:40,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 15:40:40,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 15:40:40,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 15:40:40,686 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-20 15:40:40,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 15:40:40,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448917529] [2024-06-20 15:40:40,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448917529] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 15:40:40,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 15:40:40,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-20 15:40:40,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617612719] [2024-06-20 15:40:40,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 15:40:40,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-20 15:40:40,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 15:40:40,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-20 15:40:40,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-06-20 15:40:40,750 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 57 [2024-06-20 15:40:40,751 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 118 transitions, 1181 flow. Second operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 15:40:40,751 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 15:40:40,751 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 57 [2024-06-20 15:40:40,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 15:40:43,253 INFO L124 PetriNetUnfolderBase]: 14963/24724 cut-off events. [2024-06-20 15:40:43,253 INFO L125 PetriNetUnfolderBase]: For 155141/155941 co-relation queries the response was YES. [2024-06-20 15:40:43,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101807 conditions, 24724 events. 14963/24724 cut-off events. For 155141/155941 co-relation queries the response was YES. Maximal size of possible extension queue 1083. Compared 193054 event pairs, 6765 based on Foata normal form. 311/24442 useless extension candidates. Maximal degree in co-relation 101770. Up to 19848 conditions per place. [2024-06-20 15:40:43,462 INFO L140 encePairwiseOnDemand]: 49/57 looper letters, 114 selfloop transitions, 25 changer transitions 0/169 dead transitions. [2024-06-20 15:40:43,462 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 169 transitions, 1691 flow [2024-06-20 15:40:43,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-20 15:40:43,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-20 15:40:43,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 198 transitions. [2024-06-20 15:40:43,464 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5789473684210527 [2024-06-20 15:40:43,464 INFO L175 Difference]: Start difference. First operand has 99 places, 118 transitions, 1181 flow. Second operand 6 states and 198 transitions. [2024-06-20 15:40:43,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 169 transitions, 1691 flow [2024-06-20 15:40:43,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 169 transitions, 1646 flow, removed 14 selfloop flow, removed 3 redundant places. [2024-06-20 15:40:43,671 INFO L231 Difference]: Finished difference. Result has 103 places, 128 transitions, 1297 flow [2024-06-20 15:40:43,671 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=1145, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1297, PETRI_PLACES=103, PETRI_TRANSITIONS=128} [2024-06-20 15:40:43,672 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 43 predicate places. [2024-06-20 15:40:43,672 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 128 transitions, 1297 flow [2024-06-20 15:40:43,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 15:40:43,673 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 15:40:43,673 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 15:40:43,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-20 15:40:43,673 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-20 15:40:43,674 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 15:40:43,674 INFO L85 PathProgramCache]: Analyzing trace with hash 127215676, now seen corresponding path program 1 times [2024-06-20 15:40:43,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 15:40:43,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079643703] [2024-06-20 15:40:43,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 15:40:43,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 15:40:43,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 15:40:43,862 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-20 15:40:43,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 15:40:43,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079643703] [2024-06-20 15:40:43,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079643703] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 15:40:43,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 15:40:43,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-20 15:40:43,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443292720] [2024-06-20 15:40:43,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 15:40:43,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-20 15:40:43,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 15:40:43,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-20 15:40:43,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-20 15:40:43,932 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 57 [2024-06-20 15:40:43,932 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 128 transitions, 1297 flow. Second operand has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 6 states have internal predecessors, (110), 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-20 15:40:43,932 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 15:40:43,932 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 57 [2024-06-20 15:40:43,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 15:40:46,566 INFO L124 PetriNetUnfolderBase]: 17435/27920 cut-off events. [2024-06-20 15:40:46,566 INFO L125 PetriNetUnfolderBase]: For 182656/183358 co-relation queries the response was YES. [2024-06-20 15:40:46,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115321 conditions, 27920 events. 17435/27920 cut-off events. For 182656/183358 co-relation queries the response was YES. Maximal size of possible extension queue 1123. Compared 207648 event pairs, 6675 based on Foata normal form. 280/27874 useless extension candidates. Maximal degree in co-relation 115282. Up to 22452 conditions per place. [2024-06-20 15:40:47,022 INFO L140 encePairwiseOnDemand]: 44/57 looper letters, 152 selfloop transitions, 45 changer transitions 0/216 dead transitions. [2024-06-20 15:40:47,023 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 216 transitions, 2287 flow [2024-06-20 15:40:47,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 15:40:47,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 15:40:47,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 263 transitions. [2024-06-20 15:40:47,024 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5767543859649122 [2024-06-20 15:40:47,024 INFO L175 Difference]: Start difference. First operand has 103 places, 128 transitions, 1297 flow. Second operand 8 states and 263 transitions. [2024-06-20 15:40:47,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 216 transitions, 2287 flow [2024-06-20 15:40:47,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 216 transitions, 2255 flow, removed 16 selfloop flow, removed 0 redundant places. [2024-06-20 15:40:47,349 INFO L231 Difference]: Finished difference. Result has 116 places, 150 transitions, 1732 flow [2024-06-20 15:40:47,350 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=1265, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1732, PETRI_PLACES=116, PETRI_TRANSITIONS=150} [2024-06-20 15:40:47,350 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 56 predicate places. [2024-06-20 15:40:47,350 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 150 transitions, 1732 flow [2024-06-20 15:40:47,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 6 states have internal predecessors, (110), 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-20 15:40:47,351 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 15:40:47,351 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-20 15:40:47,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-20 15:40:47,351 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-20 15:40:47,352 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 15:40:47,352 INFO L85 PathProgramCache]: Analyzing trace with hash -351279832, now seen corresponding path program 1 times [2024-06-20 15:40:47,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 15:40:47,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615584403] [2024-06-20 15:40:47,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 15:40:47,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 15:40:47,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 15:40:47,535 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-20 15:40:47,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 15:40:47,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615584403] [2024-06-20 15:40:47,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615584403] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 15:40:47,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 15:40:47,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-20 15:40:47,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313404330] [2024-06-20 15:40:47,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 15:40:47,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-20 15:40:47,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 15:40:47,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-20 15:40:47,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-20 15:40:47,599 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 57 [2024-06-20 15:40:47,600 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 150 transitions, 1732 flow. Second operand has 7 states, 7 states have (on average 18.142857142857142) internal successors, (127), 7 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-20 15:40:47,600 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 15:40:47,600 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 57 [2024-06-20 15:40:47,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 15:40:51,904 INFO L124 PetriNetUnfolderBase]: 23329/36862 cut-off events. [2024-06-20 15:40:51,904 INFO L125 PetriNetUnfolderBase]: For 323944/324690 co-relation queries the response was YES. [2024-06-20 15:40:52,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161291 conditions, 36862 events. 23329/36862 cut-off events. For 323944/324690 co-relation queries the response was YES. Maximal size of possible extension queue 1658. Compared 284071 event pairs, 5167 based on Foata normal form. 536/36971 useless extension candidates. Maximal degree in co-relation 161244. Up to 18687 conditions per place. [2024-06-20 15:40:52,320 INFO L140 encePairwiseOnDemand]: 42/57 looper letters, 242 selfloop transitions, 87 changer transitions 0/348 dead transitions. [2024-06-20 15:40:52,320 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 348 transitions, 3784 flow [2024-06-20 15:40:52,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-06-20 15:40:52,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2024-06-20 15:40:52,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 491 transitions. [2024-06-20 15:40:52,323 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5742690058479533 [2024-06-20 15:40:52,323 INFO L175 Difference]: Start difference. First operand has 116 places, 150 transitions, 1732 flow. Second operand 15 states and 491 transitions. [2024-06-20 15:40:52,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 348 transitions, 3784 flow [2024-06-20 15:40:53,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 348 transitions, 3732 flow, removed 26 selfloop flow, removed 0 redundant places. [2024-06-20 15:40:53,685 INFO L231 Difference]: Finished difference. Result has 137 places, 182 transitions, 2432 flow [2024-06-20 15:40:53,685 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=1682, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=2432, PETRI_PLACES=137, PETRI_TRANSITIONS=182} [2024-06-20 15:40:53,686 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 77 predicate places. [2024-06-20 15:40:53,686 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 182 transitions, 2432 flow [2024-06-20 15:40:53,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.142857142857142) internal successors, (127), 7 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-20 15:40:53,686 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 15:40:53,687 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 15:40:53,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-20 15:40:53,687 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-20 15:40:53,687 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 15:40:53,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1828742951, now seen corresponding path program 1 times [2024-06-20 15:40:53,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 15:40:53,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309064209] [2024-06-20 15:40:53,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 15:40:53,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 15:40:53,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 15:40:53,829 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-20 15:40:53,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 15:40:53,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309064209] [2024-06-20 15:40:53,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309064209] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 15:40:53,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 15:40:53,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-20 15:40:53,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185112865] [2024-06-20 15:40:53,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 15:40:53,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-20 15:40:53,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 15:40:53,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-20 15:40:53,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-20 15:40:53,911 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 57 [2024-06-20 15:40:53,912 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 182 transitions, 2432 flow. Second operand has 7 states, 7 states have (on average 18.285714285714285) internal successors, (128), 7 states have internal predecessors, (128), 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-20 15:40:53,912 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 15:40:53,912 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 57 [2024-06-20 15:40:53,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 15:40:59,011 INFO L124 PetriNetUnfolderBase]: 26346/41697 cut-off events. [2024-06-20 15:40:59,012 INFO L125 PetriNetUnfolderBase]: For 515022/515794 co-relation queries the response was YES. [2024-06-20 15:40:59,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 204486 conditions, 41697 events. 26346/41697 cut-off events. For 515022/515794 co-relation queries the response was YES. Maximal size of possible extension queue 1944. Compared 328267 event pairs, 5238 based on Foata normal form. 634/41834 useless extension candidates. Maximal degree in co-relation 204430. Up to 18671 conditions per place. [2024-06-20 15:40:59,436 INFO L140 encePairwiseOnDemand]: 43/57 looper letters, 262 selfloop transitions, 80 changer transitions 0/361 dead transitions. [2024-06-20 15:40:59,437 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 361 transitions, 4708 flow [2024-06-20 15:40:59,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-20 15:40:59,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-20 15:40:59,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 428 transitions. [2024-06-20 15:40:59,438 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5775978407557355 [2024-06-20 15:40:59,438 INFO L175 Difference]: Start difference. First operand has 137 places, 182 transitions, 2432 flow. Second operand 13 states and 428 transitions. [2024-06-20 15:40:59,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 361 transitions, 4708 flow [2024-06-20 15:41:01,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 361 transitions, 4488 flow, removed 65 selfloop flow, removed 7 redundant places. [2024-06-20 15:41:01,281 INFO L231 Difference]: Finished difference. Result has 147 places, 210 transitions, 2930 flow [2024-06-20 15:41:01,281 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=2240, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2930, PETRI_PLACES=147, PETRI_TRANSITIONS=210} [2024-06-20 15:41:01,282 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 87 predicate places. [2024-06-20 15:41:01,282 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 210 transitions, 2930 flow [2024-06-20 15:41:01,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.285714285714285) internal successors, (128), 7 states have internal predecessors, (128), 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-20 15:41:01,282 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 15:41:01,282 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 15:41:01,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-20 15:41:01,283 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-20 15:41:01,283 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 15:41:01,283 INFO L85 PathProgramCache]: Analyzing trace with hash 296144875, now seen corresponding path program 1 times [2024-06-20 15:41:01,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 15:41:01,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055187867] [2024-06-20 15:41:01,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 15:41:01,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 15:41:01,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 15:41:01,461 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-20 15:41:01,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 15:41:01,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055187867] [2024-06-20 15:41:01,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055187867] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 15:41:01,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 15:41:01,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-20 15:41:01,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818001834] [2024-06-20 15:41:01,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 15:41:01,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-20 15:41:01,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 15:41:01,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-20 15:41:01,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-06-20 15:41:01,509 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 57 [2024-06-20 15:41:01,510 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 210 transitions, 2930 flow. Second operand has 6 states, 6 states have (on average 19.333333333333332) internal successors, (116), 6 states have internal predecessors, (116), 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-20 15:41:01,510 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 15:41:01,511 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 57 [2024-06-20 15:41:01,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 15:41:06,693 INFO L124 PetriNetUnfolderBase]: 24993/39069 cut-off events. [2024-06-20 15:41:06,693 INFO L125 PetriNetUnfolderBase]: For 644079/644856 co-relation queries the response was YES. [2024-06-20 15:41:06,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 210701 conditions, 39069 events. 24993/39069 cut-off events. For 644079/644856 co-relation queries the response was YES. Maximal size of possible extension queue 1926. Compared 305140 event pairs, 3408 based on Foata normal form. 702/38932 useless extension candidates. Maximal degree in co-relation 210639. Up to 18127 conditions per place. [2024-06-20 15:41:07,112 INFO L140 encePairwiseOnDemand]: 44/57 looper letters, 195 selfloop transitions, 86 changer transitions 6/320 dead transitions. [2024-06-20 15:41:07,113 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 320 transitions, 4503 flow [2024-06-20 15:41:07,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 15:41:07,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 15:41:07,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 256 transitions. [2024-06-20 15:41:07,115 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6416040100250626 [2024-06-20 15:41:07,115 INFO L175 Difference]: Start difference. First operand has 147 places, 210 transitions, 2930 flow. Second operand 7 states and 256 transitions. [2024-06-20 15:41:07,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 320 transitions, 4503 flow [2024-06-20 15:41:09,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 320 transitions, 4353 flow, removed 39 selfloop flow, removed 7 redundant places. [2024-06-20 15:41:09,247 INFO L231 Difference]: Finished difference. Result has 150 places, 223 transitions, 3301 flow [2024-06-20 15:41:09,248 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=2818, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3301, PETRI_PLACES=150, PETRI_TRANSITIONS=223} [2024-06-20 15:41:09,248 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 90 predicate places. [2024-06-20 15:41:09,248 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 223 transitions, 3301 flow [2024-06-20 15:41:09,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.333333333333332) internal successors, (116), 6 states have internal predecessors, (116), 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-20 15:41:09,249 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 15:41:09,249 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 15:41:09,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-20 15:41:09,249 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-20 15:41:09,249 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 15:41:09,249 INFO L85 PathProgramCache]: Analyzing trace with hash -9036653, now seen corresponding path program 1 times [2024-06-20 15:41:09,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 15:41:09,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506230676] [2024-06-20 15:41:09,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 15:41:09,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 15:41:09,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 15:41:09,424 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-20 15:41:09,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 15:41:09,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506230676] [2024-06-20 15:41:09,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506230676] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 15:41:09,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 15:41:09,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-20 15:41:09,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588753851] [2024-06-20 15:41:09,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 15:41:09,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-20 15:41:09,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 15:41:09,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-20 15:41:09,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-20 15:41:09,473 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 57 [2024-06-20 15:41:09,474 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 223 transitions, 3301 flow. Second operand has 6 states, 6 states have (on average 19.333333333333332) internal successors, (116), 6 states have internal predecessors, (116), 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-20 15:41:09,474 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 15:41:09,474 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 57 [2024-06-20 15:41:09,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand