./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-atomic/read_write_lock-1.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --validate ./goblint.2024-05-21_14-57-05.files/protection/read_write_lock-1.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version bcb38a6f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-atomic/read_write_lock-1.i ./goblint.2024-05-21_14-57-05.files/protection/read_write_lock-1.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-bcb38a6-m [2024-06-04 14:05:30,331 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-04 14:05:30,414 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-04 14:05:30,417 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-04 14:05:30,417 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-04 14:05:30,439 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-04 14:05:30,439 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-04 14:05:30,439 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-04 14:05:30,440 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-04 14:05:30,441 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-04 14:05:30,442 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-04 14:05:30,442 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-04 14:05:30,442 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-04 14:05:30,442 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-04 14:05:30,443 INFO L153 SettingsManager]: * Use SBE=true [2024-06-04 14:05:30,443 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-04 14:05:30,443 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-04 14:05:30,443 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-04 14:05:30,444 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-04 14:05:30,444 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-04 14:05:30,444 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-04 14:05:30,446 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-04 14:05:30,446 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-04 14:05:30,447 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-04 14:05:30,447 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-04 14:05:30,447 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-04 14:05:30,447 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-04 14:05:30,447 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-04 14:05:30,448 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-04 14:05:30,448 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-04 14:05:30,449 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-04 14:05:30,449 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-04 14:05:30,449 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-04 14:05:30,449 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-04 14:05:30,450 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-04 14:05:30,450 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-04 14:05:30,450 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-04 14:05:30,450 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-04 14:05:30,450 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-04 14:05:30,450 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-04 14:05:30,451 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-04 14:05:30,451 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-04 14:05:30,451 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-04 14:05:30,451 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2024-06-04 14:05:30,652 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-04 14:05:30,684 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-04 14:05:30,686 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-04 14:05:30,687 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-04 14:05:30,688 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-04 14:05:30,689 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-1.yml/witness.yml [2024-06-04 14:05:30,815 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-04 14:05:30,815 INFO L274 PluginConnector]: CDTParser initialized [2024-06-04 14:05:30,816 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-atomic/read_write_lock-1.i [2024-06-04 14:05:31,818 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-04 14:05:32,040 INFO L384 CDTParser]: Found 1 translation units. [2024-06-04 14:05:32,041 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/read_write_lock-1.i [2024-06-04 14:05:32,054 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01ae1cd71/2a6b83494fbe47fa960d3e7a914f9d43/FLAG094f93250 [2024-06-04 14:05:32,070 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01ae1cd71/2a6b83494fbe47fa960d3e7a914f9d43 [2024-06-04 14:05:32,071 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-04 14:05:32,073 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-04 14:05:32,076 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-04 14:05:32,076 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-04 14:05:32,081 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-04 14:05:32,081 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 02:05:30" (1/2) ... [2024-06-04 14:05:32,082 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c7dacfc and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 02:05:32, skipping insertion in model container [2024-06-04 14:05:32,082 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 02:05:30" (1/2) ... [2024-06-04 14:05:32,085 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@3554f82b and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 02:05:32, skipping insertion in model container [2024-06-04 14:05:32,085 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 02:05:32" (2/2) ... [2024-06-04 14:05:32,086 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c7dacfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 02:05:32, skipping insertion in model container [2024-06-04 14:05:32,086 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 02:05:32" (2/2) ... [2024-06-04 14:05:32,087 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-04 14:05:32,126 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-04 14:05:32,128 INFO L97 edCorrectnessWitness]: Location invariant before [L749-L749] ((! 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-04 14:05:32,128 INFO L97 edCorrectnessWitness]: Location invariant before [L747-L747] ((! 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-04 14:05:32,128 INFO L97 edCorrectnessWitness]: Location invariant before [L746-L746] ((! 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-04 14:05:32,128 INFO L97 edCorrectnessWitness]: Location invariant before [L748-L748] ((! 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-04 14:05:32,128 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-04 14:05:32,129 INFO L106 edCorrectnessWitness]: ghost_update [L745-L745] multithreaded = 1; [2024-06-04 14:05:32,172 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-04 14:05:32,443 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-04 14:05:32,452 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-04 14:05:32,564 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-04 14:05:32,605 INFO L206 MainTranslator]: Completed translation [2024-06-04 14:05:32,606 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 02:05:32 WrapperNode [2024-06-04 14:05:32,606 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-04 14:05:32,607 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-04 14:05:32,608 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-04 14:05:32,608 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-04 14:05:32,614 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 02:05:32" (1/1) ... [2024-06-04 14:05:32,641 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 02:05:32" (1/1) ... [2024-06-04 14:05:32,673 INFO L138 Inliner]: procedures = 173, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 98 [2024-06-04 14:05:32,674 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-04 14:05:32,675 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-04 14:05:32,675 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-04 14:05:32,675 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-04 14:05:32,684 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 02:05:32" (1/1) ... [2024-06-04 14:05:32,684 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 02:05:32" (1/1) ... [2024-06-04 14:05:32,689 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 02:05:32" (1/1) ... [2024-06-04 14:05:32,711 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-06-04 14:05:32,711 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 02:05:32" (1/1) ... [2024-06-04 14:05:32,711 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 02:05:32" (1/1) ... [2024-06-04 14:05:32,728 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 02:05:32" (1/1) ... [2024-06-04 14:05:32,730 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 02:05:32" (1/1) ... [2024-06-04 14:05:32,731 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 02:05:32" (1/1) ... [2024-06-04 14:05:32,732 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 02:05:32" (1/1) ... [2024-06-04 14:05:32,733 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-04 14:05:32,734 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-04 14:05:32,734 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-04 14:05:32,734 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-04 14:05:32,735 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 02:05:32" (1/1) ... [2024-06-04 14:05:32,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-04 14:05:32,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-04 14:05:32,757 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-06-04 14:05:32,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-06-04 14:05:32,812 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-04 14:05:32,812 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-04 14:05:32,813 INFO L130 BoogieDeclarations]: Found specification of procedure reader [2024-06-04 14:05:32,813 INFO L138 BoogieDeclarations]: Found implementation of procedure reader [2024-06-04 14:05:32,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-04 14:05:32,813 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-04 14:05:32,813 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-04 14:05:32,813 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-04 14:05:32,813 INFO L130 BoogieDeclarations]: Found specification of procedure writer [2024-06-04 14:05:32,813 INFO L138 BoogieDeclarations]: Found implementation of procedure writer [2024-06-04 14:05:32,814 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-04 14:05:32,915 INFO L244 CfgBuilder]: Building ICFG [2024-06-04 14:05:32,917 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-04 14:05:33,130 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-04 14:05:33,130 INFO L293 CfgBuilder]: Performing block encoding [2024-06-04 14:05:33,201 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-04 14:05:33,202 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-04 14:05:33,202 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 02:05:33 BoogieIcfgContainer [2024-06-04 14:05:33,202 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-04 14:05:33,204 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-04 14:05:33,204 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-04 14:05:33,206 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-04 14:05:33,206 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 02:05:30" (1/4) ... [2024-06-04 14:05:33,207 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57a0e32e and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 04.06 02:05:33, skipping insertion in model container [2024-06-04 14:05:33,207 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.06 02:05:32" (2/4) ... [2024-06-04 14:05:33,207 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57a0e32e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.06 02:05:33, skipping insertion in model container [2024-06-04 14:05:33,207 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 02:05:32" (3/4) ... [2024-06-04 14:05:33,207 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57a0e32e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.06 02:05:33, skipping insertion in model container [2024-06-04 14:05:33,208 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 02:05:33" (4/4) ... [2024-06-04 14:05:33,208 INFO L112 eAbstractionObserver]: Analyzing ICFG read_write_lock-1.i [2024-06-04 14:05:33,220 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-04 14:05:33,221 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-06-04 14:05:33,221 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-04 14:05:33,288 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-06-04 14:05:33,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 56 transitions, 140 flow [2024-06-04 14:05:33,341 INFO L124 PetriNetUnfolderBase]: 0/52 cut-off events. [2024-06-04 14:05:33,343 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-06-04 14:05:33,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69 conditions, 52 events. 0/52 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 96 event pairs, 0 based on Foata normal form. 0/48 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2024-06-04 14:05:33,345 INFO L82 GeneralOperation]: Start removeDead. Operand has 69 places, 56 transitions, 140 flow [2024-06-04 14:05:33,350 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 59 places, 46 transitions, 104 flow [2024-06-04 14:05:33,356 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-04 14:05:33,362 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;@44919dc5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-04 14:05:33,362 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-06-04 14:05:33,365 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-04 14:05:33,365 INFO L124 PetriNetUnfolderBase]: 0/7 cut-off events. [2024-06-04 14:05:33,365 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-04 14:05:33,365 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 14:05:33,366 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-04 14:05:33,366 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-04 14:05:33,369 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 14:05:33,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1248141548, now seen corresponding path program 1 times [2024-06-04 14:05:33,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 14:05:33,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691235794] [2024-06-04 14:05:33,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 14:05:33,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 14:05:33,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 14:05:33,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 14:05:33,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 14:05:33,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691235794] [2024-06-04 14:05:33,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691235794] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 14:05:33,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 14:05:33,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-04 14:05:33,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529029449] [2024-06-04 14:05:33,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 14:05:33,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-04 14:05:33,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 14:05:33,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-04 14:05:33,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-04 14:05:33,948 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 56 [2024-06-04 14:05:33,950 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 46 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:05:33,950 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 14:05:33,951 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 56 [2024-06-04 14:05:33,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 14:05:35,121 INFO L124 PetriNetUnfolderBase]: 7973/11888 cut-off events. [2024-06-04 14:05:35,121 INFO L125 PetriNetUnfolderBase]: For 138/138 co-relation queries the response was YES. [2024-06-04 14:05:35,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23072 conditions, 11888 events. 7973/11888 cut-off events. For 138/138 co-relation queries the response was YES. Maximal size of possible extension queue 435. Compared 72068 event pairs, 4535 based on Foata normal form. 9/11682 useless extension candidates. Maximal degree in co-relation 23056. Up to 10819 conditions per place. [2024-06-04 14:05:35,182 INFO L140 encePairwiseOnDemand]: 47/56 looper letters, 49 selfloop transitions, 5 changer transitions 0/64 dead transitions. [2024-06-04 14:05:35,182 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 64 transitions, 257 flow [2024-06-04 14:05:35,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-04 14:05:35,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-04 14:05:35,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 103 transitions. [2024-06-04 14:05:35,191 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6130952380952381 [2024-06-04 14:05:35,192 INFO L175 Difference]: Start difference. First operand has 59 places, 46 transitions, 104 flow. Second operand 3 states and 103 transitions. [2024-06-04 14:05:35,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 64 transitions, 257 flow [2024-06-04 14:05:35,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 64 transitions, 250 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-06-04 14:05:35,197 INFO L231 Difference]: Finished difference. Result has 58 places, 50 transitions, 139 flow [2024-06-04 14:05:35,198 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=139, PETRI_PLACES=58, PETRI_TRANSITIONS=50} [2024-06-04 14:05:35,201 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -1 predicate places. [2024-06-04 14:05:35,201 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 50 transitions, 139 flow [2024-06-04 14:05:35,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:05:35,201 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 14:05:35,201 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 14:05:35,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-04 14:05:35,202 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-04 14:05:35,202 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 14:05:35,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1168112653, now seen corresponding path program 1 times [2024-06-04 14:05:35,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 14:05:35,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81852514] [2024-06-04 14:05:35,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 14:05:35,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 14:05:35,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 14:05:35,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 14:05:35,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 14:05:35,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81852514] [2024-06-04 14:05:35,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81852514] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 14:05:35,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 14:05:35,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-04 14:05:35,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029025996] [2024-06-04 14:05:35,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 14:05:35,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-04 14:05:35,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 14:05:35,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-04 14:05:35,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-04 14:05:35,421 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 56 [2024-06-04 14:05:35,422 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 50 transitions, 139 flow. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:05:35,422 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 14:05:35,422 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 56 [2024-06-04 14:05:35,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 14:05:36,692 INFO L124 PetriNetUnfolderBase]: 12553/18107 cut-off events. [2024-06-04 14:05:36,692 INFO L125 PetriNetUnfolderBase]: For 2961/2961 co-relation queries the response was YES. [2024-06-04 14:05:36,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39815 conditions, 18107 events. 12553/18107 cut-off events. For 2961/2961 co-relation queries the response was YES. Maximal size of possible extension queue 600. Compared 106899 event pairs, 6762 based on Foata normal form. 115/18139 useless extension candidates. Maximal degree in co-relation 39800. Up to 16792 conditions per place. [2024-06-04 14:05:36,797 INFO L140 encePairwiseOnDemand]: 43/56 looper letters, 63 selfloop transitions, 9 changer transitions 0/80 dead transitions. [2024-06-04 14:05:36,798 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 80 transitions, 359 flow [2024-06-04 14:05:36,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-04 14:05:36,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-04 14:05:36,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 132 transitions. [2024-06-04 14:05:36,803 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5892857142857143 [2024-06-04 14:05:36,803 INFO L175 Difference]: Start difference. First operand has 58 places, 50 transitions, 139 flow. Second operand 4 states and 132 transitions. [2024-06-04 14:05:36,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 80 transitions, 359 flow [2024-06-04 14:05:36,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 80 transitions, 354 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-04 14:05:36,806 INFO L231 Difference]: Finished difference. Result has 61 places, 54 transitions, 194 flow [2024-06-04 14:05:36,807 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=194, PETRI_PLACES=61, PETRI_TRANSITIONS=54} [2024-06-04 14:05:36,808 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 2 predicate places. [2024-06-04 14:05:36,808 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 54 transitions, 194 flow [2024-06-04 14:05:36,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:05:36,809 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 14:05:36,809 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 14:05:36,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-04 14:05:36,812 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-04 14:05:36,814 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 14:05:36,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1851752583, now seen corresponding path program 1 times [2024-06-04 14:05:36,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 14:05:36,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565040929] [2024-06-04 14:05:36,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 14:05:36,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 14:05:36,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 14:05:36,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 14:05:36,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 14:05:36,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565040929] [2024-06-04 14:05:36,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565040929] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 14:05:36,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 14:05:36,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-04 14:05:36,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424964140] [2024-06-04 14:05:36,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 14:05:36,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-04 14:05:36,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 14:05:36,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-04 14:05:36,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-04 14:05:37,033 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 56 [2024-06-04 14:05:37,034 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 54 transitions, 194 flow. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:05:37,034 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 14:05:37,034 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 56 [2024-06-04 14:05:37,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 14:05:38,321 INFO L124 PetriNetUnfolderBase]: 11740/17119 cut-off events. [2024-06-04 14:05:38,321 INFO L125 PetriNetUnfolderBase]: For 9244/9244 co-relation queries the response was YES. [2024-06-04 14:05:38,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43911 conditions, 17119 events. 11740/17119 cut-off events. For 9244/9244 co-relation queries the response was YES. Maximal size of possible extension queue 587. Compared 101916 event pairs, 4126 based on Foata normal form. 339/17316 useless extension candidates. Maximal degree in co-relation 43894. Up to 13739 conditions per place. [2024-06-04 14:05:38,453 INFO L140 encePairwiseOnDemand]: 41/56 looper letters, 83 selfloop transitions, 21 changer transitions 0/112 dead transitions. [2024-06-04 14:05:38,453 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 112 transitions, 594 flow [2024-06-04 14:05:38,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 14:05:38,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 14:05:38,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 171 transitions. [2024-06-04 14:05:38,455 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6107142857142858 [2024-06-04 14:05:38,455 INFO L175 Difference]: Start difference. First operand has 61 places, 54 transitions, 194 flow. Second operand 5 states and 171 transitions. [2024-06-04 14:05:38,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 112 transitions, 594 flow [2024-06-04 14:05:38,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 112 transitions, 578 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-06-04 14:05:38,459 INFO L231 Difference]: Finished difference. Result has 66 places, 66 transitions, 347 flow [2024-06-04 14:05:38,459 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=347, PETRI_PLACES=66, PETRI_TRANSITIONS=66} [2024-06-04 14:05:38,460 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 7 predicate places. [2024-06-04 14:05:38,460 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 66 transitions, 347 flow [2024-06-04 14:05:38,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:05:38,461 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 14:05:38,461 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 14:05:38,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-04 14:05:38,461 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-04 14:05:38,462 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 14:05:38,578 INFO L85 PathProgramCache]: Analyzing trace with hash -738555242, now seen corresponding path program 1 times [2024-06-04 14:05:38,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 14:05:38,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305049541] [2024-06-04 14:05:38,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 14:05:38,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 14:05:38,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 14:05:38,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 14:05:38,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 14:05:38,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305049541] [2024-06-04 14:05:38,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305049541] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 14:05:38,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 14:05:38,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-04 14:05:38,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059768343] [2024-06-04 14:05:38,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 14:05:38,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-04 14:05:38,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 14:05:38,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-04 14:05:38,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-04 14:05:38,704 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 56 [2024-06-04 14:05:38,705 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 66 transitions, 347 flow. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:05:38,705 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 14:05:38,705 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 56 [2024-06-04 14:05:38,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 14:05:39,929 INFO L124 PetriNetUnfolderBase]: 11526/16756 cut-off events. [2024-06-04 14:05:39,929 INFO L125 PetriNetUnfolderBase]: For 27031/27037 co-relation queries the response was YES. [2024-06-04 14:05:39,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53617 conditions, 16756 events. 11526/16756 cut-off events. For 27031/27037 co-relation queries the response was YES. Maximal size of possible extension queue 584. Compared 99604 event pairs, 3905 based on Foata normal form. 110/16706 useless extension candidates. Maximal degree in co-relation 53597. Up to 13709 conditions per place. [2024-06-04 14:05:40,033 INFO L140 encePairwiseOnDemand]: 43/56 looper letters, 83 selfloop transitions, 17 changer transitions 0/108 dead transitions. [2024-06-04 14:05:40,034 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 108 transitions, 677 flow [2024-06-04 14:05:40,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 14:05:40,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 14:05:40,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 165 transitions. [2024-06-04 14:05:40,035 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5892857142857143 [2024-06-04 14:05:40,036 INFO L175 Difference]: Start difference. First operand has 66 places, 66 transitions, 347 flow. Second operand 5 states and 165 transitions. [2024-06-04 14:05:40,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 108 transitions, 677 flow [2024-06-04 14:05:40,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 108 transitions, 669 flow, removed 4 selfloop flow, removed 0 redundant places. [2024-06-04 14:05:40,046 INFO L231 Difference]: Finished difference. Result has 70 places, 65 transitions, 377 flow [2024-06-04 14:05:40,046 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=331, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=377, PETRI_PLACES=70, PETRI_TRANSITIONS=65} [2024-06-04 14:05:40,047 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 11 predicate places. [2024-06-04 14:05:40,047 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 65 transitions, 377 flow [2024-06-04 14:05:40,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:05:40,047 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 14:05:40,048 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 14:05:40,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-04 14:05:40,048 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-04 14:05:40,048 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 14:05:40,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1400516435, now seen corresponding path program 1 times [2024-06-04 14:05:40,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 14:05:40,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553023793] [2024-06-04 14:05:40,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 14:05:40,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 14:05:40,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 14:05:40,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 14:05:40,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 14:05:40,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553023793] [2024-06-04 14:05:40,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553023793] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 14:05:40,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 14:05:40,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-04 14:05:40,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491799754] [2024-06-04 14:05:40,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 14:05:40,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-04 14:05:40,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 14:05:40,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-04 14:05:40,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-06-04 14:05:40,252 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 56 [2024-06-04 14:05:40,252 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 65 transitions, 377 flow. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:05:40,252 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 14:05:40,252 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 56 [2024-06-04 14:05:40,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 14:05:41,672 INFO L124 PetriNetUnfolderBase]: 11921/17779 cut-off events. [2024-06-04 14:05:41,672 INFO L125 PetriNetUnfolderBase]: For 37613/37627 co-relation queries the response was YES. [2024-06-04 14:05:41,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58890 conditions, 17779 events. 11921/17779 cut-off events. For 37613/37627 co-relation queries the response was YES. Maximal size of possible extension queue 650. Compared 112235 event pairs, 4615 based on Foata normal form. 50/17426 useless extension candidates. Maximal degree in co-relation 58867. Up to 15428 conditions per place. [2024-06-04 14:05:41,799 INFO L140 encePairwiseOnDemand]: 47/56 looper letters, 94 selfloop transitions, 17 changer transitions 0/122 dead transitions. [2024-06-04 14:05:41,799 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 122 transitions, 846 flow [2024-06-04 14:05:41,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 14:05:41,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 14:05:41,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 181 transitions. [2024-06-04 14:05:41,800 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5386904761904762 [2024-06-04 14:05:41,801 INFO L175 Difference]: Start difference. First operand has 70 places, 65 transitions, 377 flow. Second operand 6 states and 181 transitions. [2024-06-04 14:05:41,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 122 transitions, 846 flow [2024-06-04 14:05:41,822 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 122 transitions, 804 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-06-04 14:05:41,826 INFO L231 Difference]: Finished difference. Result has 74 places, 78 transitions, 508 flow [2024-06-04 14:05:41,826 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=340, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=508, PETRI_PLACES=74, PETRI_TRANSITIONS=78} [2024-06-04 14:05:41,828 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 15 predicate places. [2024-06-04 14:05:41,828 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 78 transitions, 508 flow [2024-06-04 14:05:41,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:05:41,829 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 14:05:41,830 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 14:05:41,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-04 14:05:41,830 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-04 14:05:41,830 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 14:05:41,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1586814578, now seen corresponding path program 1 times [2024-06-04 14:05:41,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 14:05:41,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037390566] [2024-06-04 14:05:41,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 14:05:41,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 14:05:41,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 14:05:41,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 14:05:41,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 14:05:41,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037390566] [2024-06-04 14:05:41,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037390566] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 14:05:41,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 14:05:41,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-04 14:05:41,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732656141] [2024-06-04 14:05:41,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 14:05:41,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-04 14:05:41,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 14:05:41,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-04 14:05:41,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-04 14:05:41,875 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 56 [2024-06-04 14:05:41,876 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 78 transitions, 508 flow. Second operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:05:41,876 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 14:05:41,876 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 56 [2024-06-04 14:05:41,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 14:05:42,643 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([186] L749-->ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT: Formula: (let ((.cse0 (not (= |v_#ghost~multithreaded_9| 0)))) (or (and .cse0 (or (< v_~w~0_9 0) (< 1 v_~w~0_9) (and (not (= v_~w~0_9 0)) (not (= v_~w~0_9 1))))) (and .cse0 (let ((.cse1 (< v_~y~0_10 0))) (or .cse1 (and (not (= v_~y~0_10 3)) (not (= v_~y~0_10 0))) (not (= (let ((.cse2 (mod v_~y~0_10 3))) (ite (and (not (= .cse2 0)) .cse1) (+ .cse2 (- 3)) .cse2)) 0)) (< 127 v_~y~0_10) (< 3 v_~y~0_10)))) (and .cse0 (let ((.cse4 (< v_~x~0_10 0))) (or (< 127 v_~x~0_10) (not (= (let ((.cse3 (mod v_~x~0_10 3))) (ite (and (not (= .cse3 0)) .cse4) (+ .cse3 (- 3)) .cse3)) 0)) (and (not (= v_~x~0_10 3)) (not (= v_~x~0_10 0))) (< 3 v_~x~0_10) .cse4))))) InVars {~w~0=v_~w~0_9, #ghost~multithreaded=|v_#ghost~multithreaded_9|, ~y~0=v_~y~0_10, ~x~0=v_~x~0_10} OutVars{~w~0=v_~w~0_9, #ghost~multithreaded=|v_#ghost~multithreaded_9|, ~y~0=v_~y~0_10, ~x~0=v_~x~0_10} AuxVars[] AssignedVars[][70], [readerThread1of1ForFork3InUse, readerThread1of1ForFork2InUse, writerThread1of1ForFork0InUse, writerThread1of1ForFork1InUse, Black: 101#(and (= ~x~0 0) (= |readerThread1of1ForFork2_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), Black: 98#(and (= ~x~0 0) (= |readerThread1of1ForFork2_~l~0#1| 0) (= ~w~0 0)), Black: 74#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), 95#true, 81#true, Black: 79#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 106#(= ~r~0 0), 61#L721true, 49#L740true, Black: 83#(= ~y~0 0), Black: 85#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), 28#L721true, Black: 84#(and (= ~w~0 1) (= ~y~0 0)), 31#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 46#L732true, Black: 93#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0))]) [2024-06-04 14:05:42,643 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is not cut-off event [2024-06-04 14:05:42,643 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is not cut-off event [2024-06-04 14:05:42,643 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is not cut-off event [2024-06-04 14:05:42,644 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is not cut-off event [2024-06-04 14:05:42,650 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([246] L717-->L717-1: Formula: (and (not (= (ite (and (= v_~r~0_55 0) (= v_~w~0_73 0)) 1 0) 0)) (= v_~w~0_72 1)) InVars {~w~0=v_~w~0_73, ~r~0=v_~r~0_55} OutVars{~w~0=v_~w~0_72, writerThread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_writerThread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, writerThread1of1ForFork1_assume_abort_if_not_~cond#1=|v_writerThread1of1ForFork1_assume_abort_if_not_~cond#1_1|, ~r~0=v_~r~0_55} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork1_assume_abort_if_not_~cond#1, writerThread1of1ForFork1_assume_abort_if_not_#in~cond#1][90], [readerThread1of1ForFork3InUse, readerThread1of1ForFork2InUse, writerThread1of1ForFork0InUse, writerThread1of1ForFork1InUse, Black: 101#(and (= ~x~0 0) (= |readerThread1of1ForFork2_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), Black: 98#(and (= ~x~0 0) (= |readerThread1of1ForFork2_~l~0#1| 0) (= ~w~0 0)), 36#L717-1true, Black: 74#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), 95#true, 81#true, Black: 79#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 106#(= ~r~0 0), 49#L740true, Black: 83#(= ~y~0 0), Black: 85#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), 28#L721true, Black: 84#(and (= ~w~0 1) (= ~y~0 0)), 31#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 19#L740true, Black: 93#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0))]) [2024-06-04 14:05:42,650 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-06-04 14:05:42,650 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-06-04 14:05:42,650 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-06-04 14:05:42,650 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-06-04 14:05:42,792 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([241] L717-->L717-1: Formula: (and (not (= (ite (and (= v_~r~0_55 0) (= v_~w~0_73 0)) 1 0) 0)) (= v_~w~0_72 1)) InVars {~w~0=v_~w~0_73, ~r~0=v_~r~0_55} OutVars{~w~0=v_~w~0_72, writerThread1of1ForFork0_assume_abort_if_not_~cond#1=|v_writerThread1of1ForFork0_assume_abort_if_not_~cond#1_1|, writerThread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_writerThread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~r~0=v_~r~0_55} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork0_assume_abort_if_not_#in~cond#1, writerThread1of1ForFork0_assume_abort_if_not_~cond#1][93], [readerThread1of1ForFork3InUse, readerThread1of1ForFork2InUse, writerThread1of1ForFork0InUse, writerThread1of1ForFork1InUse, Black: 101#(and (= ~x~0 0) (= |readerThread1of1ForFork2_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), Black: 98#(and (= ~x~0 0) (= |readerThread1of1ForFork2_~l~0#1| 0) (= ~w~0 0)), Black: 74#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), 95#true, 81#true, Black: 79#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 106#(= ~r~0 0), 61#L721true, 49#L740true, Black: 83#(= ~y~0 0), Black: 85#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), Black: 84#(and (= ~w~0 1) (= ~y~0 0)), 31#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 21#L717-1true, 19#L740true, Black: 93#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0))]) [2024-06-04 14:05:42,793 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-06-04 14:05:42,793 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-06-04 14:05:42,793 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-06-04 14:05:42,793 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-06-04 14:05:42,803 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([186] L749-->ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT: Formula: (let ((.cse0 (not (= |v_#ghost~multithreaded_9| 0)))) (or (and .cse0 (or (< v_~w~0_9 0) (< 1 v_~w~0_9) (and (not (= v_~w~0_9 0)) (not (= v_~w~0_9 1))))) (and .cse0 (let ((.cse1 (< v_~y~0_10 0))) (or .cse1 (and (not (= v_~y~0_10 3)) (not (= v_~y~0_10 0))) (not (= (let ((.cse2 (mod v_~y~0_10 3))) (ite (and (not (= .cse2 0)) .cse1) (+ .cse2 (- 3)) .cse2)) 0)) (< 127 v_~y~0_10) (< 3 v_~y~0_10)))) (and .cse0 (let ((.cse4 (< v_~x~0_10 0))) (or (< 127 v_~x~0_10) (not (= (let ((.cse3 (mod v_~x~0_10 3))) (ite (and (not (= .cse3 0)) .cse4) (+ .cse3 (- 3)) .cse3)) 0)) (and (not (= v_~x~0_10 3)) (not (= v_~x~0_10 0))) (< 3 v_~x~0_10) .cse4))))) InVars {~w~0=v_~w~0_9, #ghost~multithreaded=|v_#ghost~multithreaded_9|, ~y~0=v_~y~0_10, ~x~0=v_~x~0_10} OutVars{~w~0=v_~w~0_9, #ghost~multithreaded=|v_#ghost~multithreaded_9|, ~y~0=v_~y~0_10, ~x~0=v_~x~0_10} AuxVars[] AssignedVars[][70], [readerThread1of1ForFork3InUse, readerThread1of1ForFork2InUse, writerThread1of1ForFork0InUse, writerThread1of1ForFork1InUse, Black: 101#(and (= ~x~0 0) (= |readerThread1of1ForFork2_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), Black: 98#(and (= ~x~0 0) (= |readerThread1of1ForFork2_~l~0#1| 0) (= ~w~0 0)), Black: 74#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), 95#true, 81#true, Black: 79#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 106#(= ~r~0 0), 15#readerEXITtrue, 61#L721true, Black: 83#(= ~y~0 0), Black: 85#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), 28#L721true, Black: 84#(and (= ~w~0 1) (= ~y~0 0)), 31#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 46#L732true, Black: 93#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0))]) [2024-06-04 14:05:42,803 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is not cut-off event [2024-06-04 14:05:42,803 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is not cut-off event [2024-06-04 14:05:42,803 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is not cut-off event [2024-06-04 14:05:42,803 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is not cut-off event [2024-06-04 14:05:42,804 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([246] L717-->L717-1: Formula: (and (not (= (ite (and (= v_~r~0_55 0) (= v_~w~0_73 0)) 1 0) 0)) (= v_~w~0_72 1)) InVars {~w~0=v_~w~0_73, ~r~0=v_~r~0_55} OutVars{~w~0=v_~w~0_72, writerThread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_writerThread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, writerThread1of1ForFork1_assume_abort_if_not_~cond#1=|v_writerThread1of1ForFork1_assume_abort_if_not_~cond#1_1|, ~r~0=v_~r~0_55} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork1_assume_abort_if_not_~cond#1, writerThread1of1ForFork1_assume_abort_if_not_#in~cond#1][90], [readerThread1of1ForFork3InUse, readerThread1of1ForFork2InUse, writerThread1of1ForFork0InUse, Black: 101#(and (= ~x~0 0) (= |readerThread1of1ForFork2_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), writerThread1of1ForFork1InUse, Black: 98#(and (= ~x~0 0) (= |readerThread1of1ForFork2_~l~0#1| 0) (= ~w~0 0)), 36#L717-1true, Black: 74#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), 95#true, 81#true, Black: 79#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 106#(= ~r~0 0), Black: 83#(= ~y~0 0), 49#L740true, Black: 85#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), 28#L721true, Black: 84#(and (= ~w~0 1) (= ~y~0 0)), 31#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 19#L740true, Black: 93#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0))]) [2024-06-04 14:05:42,804 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-06-04 14:05:42,804 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-06-04 14:05:42,804 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-06-04 14:05:42,805 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-06-04 14:05:42,805 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-06-04 14:05:42,809 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([246] L717-->L717-1: Formula: (and (not (= (ite (and (= v_~r~0_55 0) (= v_~w~0_73 0)) 1 0) 0)) (= v_~w~0_72 1)) InVars {~w~0=v_~w~0_73, ~r~0=v_~r~0_55} OutVars{~w~0=v_~w~0_72, writerThread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_writerThread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, writerThread1of1ForFork1_assume_abort_if_not_~cond#1=|v_writerThread1of1ForFork1_assume_abort_if_not_~cond#1_1|, ~r~0=v_~r~0_55} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork1_assume_abort_if_not_~cond#1, writerThread1of1ForFork1_assume_abort_if_not_#in~cond#1][90], [readerThread1of1ForFork3InUse, readerThread1of1ForFork2InUse, writerThread1of1ForFork0InUse, writerThread1of1ForFork1InUse, Black: 101#(and (= ~x~0 0) (= |readerThread1of1ForFork2_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), Black: 98#(and (= ~x~0 0) (= |readerThread1of1ForFork2_~l~0#1| 0) (= ~w~0 0)), 36#L717-1true, Black: 74#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), 95#true, 81#true, Black: 79#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 106#(= ~r~0 0), 15#readerEXITtrue, Black: 83#(= ~y~0 0), Black: 85#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), 28#L721true, Black: 84#(and (= ~w~0 1) (= ~y~0 0)), 31#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 19#L740true, Black: 93#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0))]) [2024-06-04 14:05:42,809 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-06-04 14:05:42,809 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-06-04 14:05:42,809 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-06-04 14:05:42,809 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-06-04 14:05:42,809 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([246] L717-->L717-1: Formula: (and (not (= (ite (and (= v_~r~0_55 0) (= v_~w~0_73 0)) 1 0) 0)) (= v_~w~0_72 1)) InVars {~w~0=v_~w~0_73, ~r~0=v_~r~0_55} OutVars{~w~0=v_~w~0_72, writerThread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_writerThread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, writerThread1of1ForFork1_assume_abort_if_not_~cond#1=|v_writerThread1of1ForFork1_assume_abort_if_not_~cond#1_1|, ~r~0=v_~r~0_55} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork1_assume_abort_if_not_~cond#1, writerThread1of1ForFork1_assume_abort_if_not_#in~cond#1][90], [readerThread1of1ForFork3InUse, readerThread1of1ForFork2InUse, writerThread1of1ForFork0InUse, writerThread1of1ForFork1InUse, Black: 101#(and (= ~x~0 0) (= |readerThread1of1ForFork2_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), Black: 98#(and (= ~x~0 0) (= |readerThread1of1ForFork2_~l~0#1| 0) (= ~w~0 0)), 36#L717-1true, Black: 74#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), 95#true, 81#true, Black: 79#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 106#(= ~r~0 0), 27#readerEXITtrue, Black: 83#(= ~y~0 0), 49#L740true, Black: 85#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), 28#L721true, Black: 84#(and (= ~w~0 1) (= ~y~0 0)), 31#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, Black: 93#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0))]) [2024-06-04 14:05:42,810 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-06-04 14:05:42,810 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-06-04 14:05:42,810 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-06-04 14:05:42,810 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-06-04 14:05:42,814 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([241] L717-->L717-1: Formula: (and (not (= (ite (and (= v_~r~0_55 0) (= v_~w~0_73 0)) 1 0) 0)) (= v_~w~0_72 1)) InVars {~w~0=v_~w~0_73, ~r~0=v_~r~0_55} OutVars{~w~0=v_~w~0_72, writerThread1of1ForFork0_assume_abort_if_not_~cond#1=|v_writerThread1of1ForFork0_assume_abort_if_not_~cond#1_1|, writerThread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_writerThread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~r~0=v_~r~0_55} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork0_assume_abort_if_not_#in~cond#1, writerThread1of1ForFork0_assume_abort_if_not_~cond#1][93], [readerThread1of1ForFork3InUse, readerThread1of1ForFork2InUse, writerThread1of1ForFork0InUse, writerThread1of1ForFork1InUse, Black: 101#(and (= ~x~0 0) (= |readerThread1of1ForFork2_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), Black: 98#(and (= ~x~0 0) (= |readerThread1of1ForFork2_~l~0#1| 0) (= ~w~0 0)), Black: 74#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), 95#true, 81#true, Black: 79#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 106#(= ~r~0 0), 61#L721true, 49#L740true, Black: 83#(= ~y~0 0), Black: 85#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), Black: 84#(and (= ~w~0 1) (= ~y~0 0)), 31#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 21#L717-1true, 19#L740true, Black: 93#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0))]) [2024-06-04 14:05:42,814 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-06-04 14:05:42,814 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-06-04 14:05:42,814 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-06-04 14:05:42,814 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-06-04 14:05:42,814 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-06-04 14:05:42,825 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([241] L717-->L717-1: Formula: (and (not (= (ite (and (= v_~r~0_55 0) (= v_~w~0_73 0)) 1 0) 0)) (= v_~w~0_72 1)) InVars {~w~0=v_~w~0_73, ~r~0=v_~r~0_55} OutVars{~w~0=v_~w~0_72, writerThread1of1ForFork0_assume_abort_if_not_~cond#1=|v_writerThread1of1ForFork0_assume_abort_if_not_~cond#1_1|, writerThread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_writerThread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~r~0=v_~r~0_55} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork0_assume_abort_if_not_#in~cond#1, writerThread1of1ForFork0_assume_abort_if_not_~cond#1][93], [readerThread1of1ForFork3InUse, readerThread1of1ForFork2InUse, writerThread1of1ForFork0InUse, Black: 101#(and (= ~x~0 0) (= |readerThread1of1ForFork2_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), writerThread1of1ForFork1InUse, Black: 98#(and (= ~x~0 0) (= |readerThread1of1ForFork2_~l~0#1| 0) (= ~w~0 0)), Black: 74#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), 95#true, 81#true, Black: 79#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 106#(= ~r~0 0), 15#readerEXITtrue, 61#L721true, Black: 83#(= ~y~0 0), Black: 85#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), Black: 84#(and (= ~w~0 1) (= ~y~0 0)), 31#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 21#L717-1true, 19#L740true, Black: 93#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0))]) [2024-06-04 14:05:42,825 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-06-04 14:05:42,825 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-06-04 14:05:42,825 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-06-04 14:05:42,825 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-06-04 14:05:42,825 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([241] L717-->L717-1: Formula: (and (not (= (ite (and (= v_~r~0_55 0) (= v_~w~0_73 0)) 1 0) 0)) (= v_~w~0_72 1)) InVars {~w~0=v_~w~0_73, ~r~0=v_~r~0_55} OutVars{~w~0=v_~w~0_72, writerThread1of1ForFork0_assume_abort_if_not_~cond#1=|v_writerThread1of1ForFork0_assume_abort_if_not_~cond#1_1|, writerThread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_writerThread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~r~0=v_~r~0_55} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork0_assume_abort_if_not_#in~cond#1, writerThread1of1ForFork0_assume_abort_if_not_~cond#1][93], [readerThread1of1ForFork3InUse, readerThread1of1ForFork2InUse, writerThread1of1ForFork0InUse, writerThread1of1ForFork1InUse, Black: 101#(and (= ~x~0 0) (= |readerThread1of1ForFork2_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), Black: 98#(and (= ~x~0 0) (= |readerThread1of1ForFork2_~l~0#1| 0) (= ~w~0 0)), Black: 74#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), 95#true, 81#true, Black: 79#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 106#(= ~r~0 0), 27#readerEXITtrue, 61#L721true, 49#L740true, Black: 83#(= ~y~0 0), Black: 85#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), Black: 84#(and (= ~w~0 1) (= ~y~0 0)), 31#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 21#L717-1true, Black: 93#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0))]) [2024-06-04 14:05:42,825 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-06-04 14:05:42,826 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-06-04 14:05:42,826 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-06-04 14:05:42,826 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-06-04 14:05:42,836 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([246] L717-->L717-1: Formula: (and (not (= (ite (and (= v_~r~0_55 0) (= v_~w~0_73 0)) 1 0) 0)) (= v_~w~0_72 1)) InVars {~w~0=v_~w~0_73, ~r~0=v_~r~0_55} OutVars{~w~0=v_~w~0_72, writerThread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_writerThread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, writerThread1of1ForFork1_assume_abort_if_not_~cond#1=|v_writerThread1of1ForFork1_assume_abort_if_not_~cond#1_1|, ~r~0=v_~r~0_55} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork1_assume_abort_if_not_~cond#1, writerThread1of1ForFork1_assume_abort_if_not_#in~cond#1][90], [readerThread1of1ForFork3InUse, readerThread1of1ForFork2InUse, writerThread1of1ForFork0InUse, Black: 101#(and (= ~x~0 0) (= |readerThread1of1ForFork2_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), writerThread1of1ForFork1InUse, Black: 98#(and (= ~x~0 0) (= |readerThread1of1ForFork2_~l~0#1| 0) (= ~w~0 0)), 36#L717-1true, Black: 74#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), 95#true, 81#true, Black: 79#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 106#(= ~r~0 0), 15#readerEXITtrue, Black: 83#(= ~y~0 0), Black: 85#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), 28#L721true, Black: 84#(and (= ~w~0 1) (= ~y~0 0)), 31#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 19#L740true, Black: 93#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0))]) [2024-06-04 14:05:42,836 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-06-04 14:05:42,836 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-06-04 14:05:42,837 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-06-04 14:05:42,837 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-06-04 14:05:42,837 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-06-04 14:05:42,838 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([246] L717-->L717-1: Formula: (and (not (= (ite (and (= v_~r~0_55 0) (= v_~w~0_73 0)) 1 0) 0)) (= v_~w~0_72 1)) InVars {~w~0=v_~w~0_73, ~r~0=v_~r~0_55} OutVars{~w~0=v_~w~0_72, writerThread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_writerThread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, writerThread1of1ForFork1_assume_abort_if_not_~cond#1=|v_writerThread1of1ForFork1_assume_abort_if_not_~cond#1_1|, ~r~0=v_~r~0_55} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork1_assume_abort_if_not_~cond#1, writerThread1of1ForFork1_assume_abort_if_not_#in~cond#1][90], [readerThread1of1ForFork3InUse, readerThread1of1ForFork2InUse, writerThread1of1ForFork0InUse, Black: 101#(and (= ~x~0 0) (= |readerThread1of1ForFork2_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), writerThread1of1ForFork1InUse, Black: 98#(and (= ~x~0 0) (= |readerThread1of1ForFork2_~l~0#1| 0) (= ~w~0 0)), 36#L717-1true, Black: 74#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), 95#true, 81#true, Black: 79#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 27#readerEXITtrue, 106#(= ~r~0 0), Black: 83#(= ~y~0 0), 49#L740true, Black: 85#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), 28#L721true, Black: 84#(and (= ~w~0 1) (= ~y~0 0)), 31#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, Black: 93#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0))]) [2024-06-04 14:05:42,838 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-06-04 14:05:42,838 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-06-04 14:05:42,838 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-06-04 14:05:42,838 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-06-04 14:05:42,839 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-06-04 14:05:42,842 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([246] L717-->L717-1: Formula: (and (not (= (ite (and (= v_~r~0_55 0) (= v_~w~0_73 0)) 1 0) 0)) (= v_~w~0_72 1)) InVars {~w~0=v_~w~0_73, ~r~0=v_~r~0_55} OutVars{~w~0=v_~w~0_72, writerThread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_writerThread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, writerThread1of1ForFork1_assume_abort_if_not_~cond#1=|v_writerThread1of1ForFork1_assume_abort_if_not_~cond#1_1|, ~r~0=v_~r~0_55} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork1_assume_abort_if_not_~cond#1, writerThread1of1ForFork1_assume_abort_if_not_#in~cond#1][90], [readerThread1of1ForFork3InUse, readerThread1of1ForFork2InUse, writerThread1of1ForFork0InUse, writerThread1of1ForFork1InUse, Black: 101#(and (= ~x~0 0) (= |readerThread1of1ForFork2_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), Black: 98#(and (= ~x~0 0) (= |readerThread1of1ForFork2_~l~0#1| 0) (= ~w~0 0)), 36#L717-1true, Black: 74#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), 95#true, 81#true, Black: 79#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 106#(= ~r~0 0), 27#readerEXITtrue, 15#readerEXITtrue, Black: 83#(= ~y~0 0), Black: 85#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), 28#L721true, Black: 84#(and (= ~w~0 1) (= ~y~0 0)), 31#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, Black: 93#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0))]) [2024-06-04 14:05:42,842 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-06-04 14:05:42,842 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-06-04 14:05:42,842 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-06-04 14:05:42,842 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-06-04 14:05:42,845 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([241] L717-->L717-1: Formula: (and (not (= (ite (and (= v_~r~0_55 0) (= v_~w~0_73 0)) 1 0) 0)) (= v_~w~0_72 1)) InVars {~w~0=v_~w~0_73, ~r~0=v_~r~0_55} OutVars{~w~0=v_~w~0_72, writerThread1of1ForFork0_assume_abort_if_not_~cond#1=|v_writerThread1of1ForFork0_assume_abort_if_not_~cond#1_1|, writerThread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_writerThread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~r~0=v_~r~0_55} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork0_assume_abort_if_not_#in~cond#1, writerThread1of1ForFork0_assume_abort_if_not_~cond#1][93], [readerThread1of1ForFork3InUse, readerThread1of1ForFork2InUse, writerThread1of1ForFork0InUse, writerThread1of1ForFork1InUse, Black: 101#(and (= ~x~0 0) (= |readerThread1of1ForFork2_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), Black: 98#(and (= ~x~0 0) (= |readerThread1of1ForFork2_~l~0#1| 0) (= ~w~0 0)), Black: 74#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), 95#true, 81#true, Black: 79#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 106#(= ~r~0 0), 15#readerEXITtrue, 61#L721true, Black: 83#(= ~y~0 0), Black: 85#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), Black: 84#(and (= ~w~0 1) (= ~y~0 0)), 21#L717-1true, 31#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 19#L740true, Black: 93#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0))]) [2024-06-04 14:05:42,845 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-06-04 14:05:42,846 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-06-04 14:05:42,846 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-06-04 14:05:42,846 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-06-04 14:05:42,846 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-06-04 14:05:42,847 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([241] L717-->L717-1: Formula: (and (not (= (ite (and (= v_~r~0_55 0) (= v_~w~0_73 0)) 1 0) 0)) (= v_~w~0_72 1)) InVars {~w~0=v_~w~0_73, ~r~0=v_~r~0_55} OutVars{~w~0=v_~w~0_72, writerThread1of1ForFork0_assume_abort_if_not_~cond#1=|v_writerThread1of1ForFork0_assume_abort_if_not_~cond#1_1|, writerThread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_writerThread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~r~0=v_~r~0_55} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork0_assume_abort_if_not_#in~cond#1, writerThread1of1ForFork0_assume_abort_if_not_~cond#1][93], [readerThread1of1ForFork3InUse, readerThread1of1ForFork2InUse, writerThread1of1ForFork0InUse, writerThread1of1ForFork1InUse, Black: 101#(and (= ~x~0 0) (= |readerThread1of1ForFork2_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), Black: 98#(and (= ~x~0 0) (= |readerThread1of1ForFork2_~l~0#1| 0) (= ~w~0 0)), Black: 74#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), 95#true, 81#true, Black: 79#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 106#(= ~r~0 0), 27#readerEXITtrue, 61#L721true, 49#L740true, Black: 83#(= ~y~0 0), Black: 85#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), Black: 84#(and (= ~w~0 1) (= ~y~0 0)), 31#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 21#L717-1true, Black: 93#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0))]) [2024-06-04 14:05:42,847 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-06-04 14:05:42,848 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-06-04 14:05:42,848 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-06-04 14:05:42,848 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-06-04 14:05:42,848 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-06-04 14:05:42,855 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([241] L717-->L717-1: Formula: (and (not (= (ite (and (= v_~r~0_55 0) (= v_~w~0_73 0)) 1 0) 0)) (= v_~w~0_72 1)) InVars {~w~0=v_~w~0_73, ~r~0=v_~r~0_55} OutVars{~w~0=v_~w~0_72, writerThread1of1ForFork0_assume_abort_if_not_~cond#1=|v_writerThread1of1ForFork0_assume_abort_if_not_~cond#1_1|, writerThread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_writerThread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~r~0=v_~r~0_55} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork0_assume_abort_if_not_#in~cond#1, writerThread1of1ForFork0_assume_abort_if_not_~cond#1][93], [readerThread1of1ForFork3InUse, readerThread1of1ForFork2InUse, writerThread1of1ForFork0InUse, Black: 101#(and (= ~x~0 0) (= |readerThread1of1ForFork2_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), writerThread1of1ForFork1InUse, Black: 98#(and (= ~x~0 0) (= |readerThread1of1ForFork2_~l~0#1| 0) (= ~w~0 0)), Black: 74#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), 95#true, 81#true, Black: 79#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 106#(= ~r~0 0), 27#readerEXITtrue, 15#readerEXITtrue, 61#L721true, Black: 83#(= ~y~0 0), Black: 85#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), Black: 84#(and (= ~w~0 1) (= ~y~0 0)), 21#L717-1true, 31#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, Black: 93#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0))]) [2024-06-04 14:05:42,856 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-06-04 14:05:42,856 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-06-04 14:05:42,856 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-06-04 14:05:42,856 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-06-04 14:05:42,865 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([246] L717-->L717-1: Formula: (and (not (= (ite (and (= v_~r~0_55 0) (= v_~w~0_73 0)) 1 0) 0)) (= v_~w~0_72 1)) InVars {~w~0=v_~w~0_73, ~r~0=v_~r~0_55} OutVars{~w~0=v_~w~0_72, writerThread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_writerThread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, writerThread1of1ForFork1_assume_abort_if_not_~cond#1=|v_writerThread1of1ForFork1_assume_abort_if_not_~cond#1_1|, ~r~0=v_~r~0_55} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork1_assume_abort_if_not_~cond#1, writerThread1of1ForFork1_assume_abort_if_not_#in~cond#1][90], [readerThread1of1ForFork3InUse, readerThread1of1ForFork2InUse, writerThread1of1ForFork0InUse, Black: 101#(and (= ~x~0 0) (= |readerThread1of1ForFork2_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), writerThread1of1ForFork1InUse, Black: 98#(and (= ~x~0 0) (= |readerThread1of1ForFork2_~l~0#1| 0) (= ~w~0 0)), 36#L717-1true, Black: 74#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), 95#true, 81#true, Black: 79#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 27#readerEXITtrue, 106#(= ~r~0 0), 15#readerEXITtrue, Black: 83#(= ~y~0 0), Black: 85#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), 28#L721true, Black: 84#(and (= ~w~0 1) (= ~y~0 0)), 31#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, Black: 93#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0))]) [2024-06-04 14:05:42,865 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-06-04 14:05:42,865 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-06-04 14:05:42,865 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-06-04 14:05:42,865 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-06-04 14:05:42,865 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-06-04 14:05:42,871 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([241] L717-->L717-1: Formula: (and (not (= (ite (and (= v_~r~0_55 0) (= v_~w~0_73 0)) 1 0) 0)) (= v_~w~0_72 1)) InVars {~w~0=v_~w~0_73, ~r~0=v_~r~0_55} OutVars{~w~0=v_~w~0_72, writerThread1of1ForFork0_assume_abort_if_not_~cond#1=|v_writerThread1of1ForFork0_assume_abort_if_not_~cond#1_1|, writerThread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_writerThread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~r~0=v_~r~0_55} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork0_assume_abort_if_not_#in~cond#1, writerThread1of1ForFork0_assume_abort_if_not_~cond#1][93], [readerThread1of1ForFork3InUse, readerThread1of1ForFork2InUse, writerThread1of1ForFork0InUse, writerThread1of1ForFork1InUse, Black: 101#(and (= ~x~0 0) (= |readerThread1of1ForFork2_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), Black: 98#(and (= ~x~0 0) (= |readerThread1of1ForFork2_~l~0#1| 0) (= ~w~0 0)), Black: 74#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), 95#true, 81#true, Black: 79#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 27#readerEXITtrue, 106#(= ~r~0 0), 15#readerEXITtrue, 61#L721true, Black: 83#(= ~y~0 0), Black: 85#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), Black: 84#(and (= ~w~0 1) (= ~y~0 0)), 21#L717-1true, 31#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, Black: 93#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0))]) [2024-06-04 14:05:42,871 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-06-04 14:05:42,871 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-06-04 14:05:42,871 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-06-04 14:05:42,871 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-06-04 14:05:42,871 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-06-04 14:05:42,898 INFO L124 PetriNetUnfolderBase]: 7308/12759 cut-off events. [2024-06-04 14:05:42,899 INFO L125 PetriNetUnfolderBase]: For 46221/48021 co-relation queries the response was YES. [2024-06-04 14:05:42,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42008 conditions, 12759 events. 7308/12759 cut-off events. For 46221/48021 co-relation queries the response was YES. Maximal size of possible extension queue 659. Compared 101157 event pairs, 2644 based on Foata normal form. 733/12618 useless extension candidates. Maximal degree in co-relation 41984. Up to 4738 conditions per place. [2024-06-04 14:05:42,977 INFO L140 encePairwiseOnDemand]: 49/56 looper letters, 63 selfloop transitions, 15 changer transitions 0/110 dead transitions. [2024-06-04 14:05:42,977 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 110 transitions, 726 flow [2024-06-04 14:05:42,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-04 14:05:42,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-04 14:05:42,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 162 transitions. [2024-06-04 14:05:42,979 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7232142857142857 [2024-06-04 14:05:42,979 INFO L175 Difference]: Start difference. First operand has 74 places, 78 transitions, 508 flow. Second operand 4 states and 162 transitions. [2024-06-04 14:05:42,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 110 transitions, 726 flow [2024-06-04 14:05:42,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 110 transitions, 710 flow, removed 5 selfloop flow, removed 1 redundant places. [2024-06-04 14:05:42,994 INFO L231 Difference]: Finished difference. Result has 79 places, 78 transitions, 554 flow [2024-06-04 14:05:42,994 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=422, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=554, PETRI_PLACES=79, PETRI_TRANSITIONS=78} [2024-06-04 14:05:42,997 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 20 predicate places. [2024-06-04 14:05:42,997 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 78 transitions, 554 flow [2024-06-04 14:05:42,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:05:42,997 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 14:05:42,997 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 14:05:42,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-04 14:05:42,998 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-04 14:05:42,998 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 14:05:42,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1046716557, now seen corresponding path program 1 times [2024-06-04 14:05:42,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 14:05:43,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92037864] [2024-06-04 14:05:43,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 14:05:43,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 14:05:43,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 14:05:43,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 14:05:43,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 14:05:43,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92037864] [2024-06-04 14:05:43,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92037864] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 14:05:43,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 14:05:43,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 14:05:43,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402067300] [2024-06-04 14:05:43,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 14:05:43,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-04 14:05:43,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 14:05:43,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-04 14:05:43,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-06-04 14:05:43,228 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 56 [2024-06-04 14:05:43,228 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 78 transitions, 554 flow. Second operand has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:05:43,228 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 14:05:43,228 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 56 [2024-06-04 14:05:43,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 14:05:45,387 INFO L124 PetriNetUnfolderBase]: 17838/27042 cut-off events. [2024-06-04 14:05:45,387 INFO L125 PetriNetUnfolderBase]: For 85198/85202 co-relation queries the response was YES. [2024-06-04 14:05:45,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93266 conditions, 27042 events. 17838/27042 cut-off events. For 85198/85202 co-relation queries the response was YES. Maximal size of possible extension queue 1059. Compared 185397 event pairs, 2134 based on Foata normal form. 468/27415 useless extension candidates. Maximal degree in co-relation 93237. Up to 10641 conditions per place. [2024-06-04 14:05:45,557 INFO L140 encePairwiseOnDemand]: 42/56 looper letters, 176 selfloop transitions, 28 changer transitions 0/211 dead transitions. [2024-06-04 14:05:45,557 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 211 transitions, 1776 flow [2024-06-04 14:05:45,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 14:05:45,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 14:05:45,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 227 transitions. [2024-06-04 14:05:45,559 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6755952380952381 [2024-06-04 14:05:45,559 INFO L175 Difference]: Start difference. First operand has 79 places, 78 transitions, 554 flow. Second operand 6 states and 227 transitions. [2024-06-04 14:05:45,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 211 transitions, 1776 flow [2024-06-04 14:05:45,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 211 transitions, 1752 flow, removed 12 selfloop flow, removed 0 redundant places. [2024-06-04 14:05:45,631 INFO L231 Difference]: Finished difference. Result has 89 places, 103 transitions, 1006 flow [2024-06-04 14:05:45,631 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=546, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1006, PETRI_PLACES=89, PETRI_TRANSITIONS=103} [2024-06-04 14:05:45,631 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 30 predicate places. [2024-06-04 14:05:45,631 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 103 transitions, 1006 flow [2024-06-04 14:05:45,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:05:45,632 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 14:05:45,632 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 14:05:45,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-04 14:05:45,632 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-04 14:05:45,632 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 14:05:45,632 INFO L85 PathProgramCache]: Analyzing trace with hash -2024990247, now seen corresponding path program 1 times [2024-06-04 14:05:45,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 14:05:45,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000184384] [2024-06-04 14:05:45,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 14:05:45,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 14:05:45,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 14:05:45,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 14:05:45,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 14:05:45,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000184384] [2024-06-04 14:05:45,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000184384] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 14:05:45,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 14:05:45,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-04 14:05:45,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869187159] [2024-06-04 14:05:45,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 14:05:45,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-04 14:05:45,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 14:05:45,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-04 14:05:45,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-04 14:05:45,821 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 56 [2024-06-04 14:05:45,821 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 103 transitions, 1006 flow. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:05:45,821 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 14:05:45,821 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 56 [2024-06-04 14:05:45,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 14:05:48,032 INFO L124 PetriNetUnfolderBase]: 16474/25524 cut-off events. [2024-06-04 14:05:48,033 INFO L125 PetriNetUnfolderBase]: For 115195/115557 co-relation queries the response was YES. [2024-06-04 14:05:48,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100110 conditions, 25524 events. 16474/25524 cut-off events. For 115195/115557 co-relation queries the response was YES. Maximal size of possible extension queue 1030. Compared 177909 event pairs, 7137 based on Foata normal form. 194/25481 useless extension candidates. Maximal degree in co-relation 100076. Up to 22101 conditions per place. [2024-06-04 14:05:48,194 INFO L140 encePairwiseOnDemand]: 44/56 looper letters, 120 selfloop transitions, 13 changer transitions 0/144 dead transitions. [2024-06-04 14:05:48,194 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 144 transitions, 1464 flow [2024-06-04 14:05:48,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 14:05:48,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 14:05:48,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 168 transitions. [2024-06-04 14:05:48,196 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-06-04 14:05:48,196 INFO L175 Difference]: Start difference. First operand has 89 places, 103 transitions, 1006 flow. Second operand 6 states and 168 transitions. [2024-06-04 14:05:48,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 144 transitions, 1464 flow [2024-06-04 14:05:48,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 144 transitions, 1414 flow, removed 25 selfloop flow, removed 0 redundant places. [2024-06-04 14:05:48,342 INFO L231 Difference]: Finished difference. Result has 95 places, 105 transitions, 1016 flow [2024-06-04 14:05:48,342 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=956, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1016, PETRI_PLACES=95, PETRI_TRANSITIONS=105} [2024-06-04 14:05:48,343 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 36 predicate places. [2024-06-04 14:05:48,343 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 105 transitions, 1016 flow [2024-06-04 14:05:48,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:05:48,343 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 14:05:48,343 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 14:05:48,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-04 14:05:48,344 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-04 14:05:48,344 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 14:05:48,344 INFO L85 PathProgramCache]: Analyzing trace with hash -7795348, now seen corresponding path program 1 times [2024-06-04 14:05:48,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 14:05:48,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211802365] [2024-06-04 14:05:48,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 14:05:48,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 14:05:48,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 14:05:48,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 14:05:48,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 14:05:48,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211802365] [2024-06-04 14:05:48,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211802365] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 14:05:48,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 14:05:48,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-04 14:05:48,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332855233] [2024-06-04 14:05:48,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 14:05:48,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-04 14:05:48,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 14:05:48,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-04 14:05:48,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-04 14:05:48,502 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 56 [2024-06-04 14:05:48,503 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 105 transitions, 1016 flow. Second operand has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:05:48,503 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 14:05:48,503 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 56 [2024-06-04 14:05:48,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 14:05:50,938 INFO L124 PetriNetUnfolderBase]: 17434/26932 cut-off events. [2024-06-04 14:05:50,939 INFO L125 PetriNetUnfolderBase]: For 116184/116188 co-relation queries the response was YES. [2024-06-04 14:05:51,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104265 conditions, 26932 events. 17434/26932 cut-off events. For 116184/116188 co-relation queries the response was YES. Maximal size of possible extension queue 1069. Compared 187269 event pairs, 6596 based on Foata normal form. 206/26969 useless extension candidates. Maximal degree in co-relation 104227. Up to 22808 conditions per place. [2024-06-04 14:05:51,150 INFO L140 encePairwiseOnDemand]: 44/56 looper letters, 166 selfloop transitions, 28 changer transitions 0/201 dead transitions. [2024-06-04 14:05:51,150 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 201 transitions, 1938 flow [2024-06-04 14:05:51,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 14:05:51,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 14:05:51,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 236 transitions. [2024-06-04 14:05:51,152 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5267857142857143 [2024-06-04 14:05:51,152 INFO L175 Difference]: Start difference. First operand has 95 places, 105 transitions, 1016 flow. Second operand 8 states and 236 transitions. [2024-06-04 14:05:51,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 201 transitions, 1938 flow [2024-06-04 14:05:51,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 201 transitions, 1922 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-04 14:05:51,318 INFO L231 Difference]: Finished difference. Result has 103 places, 118 transitions, 1280 flow [2024-06-04 14:05:51,318 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=1000, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1280, PETRI_PLACES=103, PETRI_TRANSITIONS=118} [2024-06-04 14:05:51,318 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 44 predicate places. [2024-06-04 14:05:51,319 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 118 transitions, 1280 flow [2024-06-04 14:05:51,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:05:51,319 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 14:05:51,319 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 14:05:51,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-04 14:05:51,319 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-04 14:05:51,320 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 14:05:51,320 INFO L85 PathProgramCache]: Analyzing trace with hash 746510900, now seen corresponding path program 1 times [2024-06-04 14:05:51,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 14:05:51,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379960053] [2024-06-04 14:05:51,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 14:05:51,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 14:05:51,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 14:05:51,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 14:05:51,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 14:05:51,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379960053] [2024-06-04 14:05:51,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379960053] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 14:05:51,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 14:05:51,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-04 14:05:51,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394819553] [2024-06-04 14:05:51,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 14:05:51,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-04 14:05:51,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 14:05:51,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-04 14:05:51,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-04 14:05:51,565 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 56 [2024-06-04 14:05:51,566 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 118 transitions, 1280 flow. Second operand has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:05:51,566 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 14:05:51,566 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 56 [2024-06-04 14:05:51,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 14:05:54,027 INFO L124 PetriNetUnfolderBase]: 14943/23771 cut-off events. [2024-06-04 14:05:54,028 INFO L125 PetriNetUnfolderBase]: For 127331/127797 co-relation queries the response was YES. [2024-06-04 14:05:54,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96721 conditions, 23771 events. 14943/23771 cut-off events. For 127331/127797 co-relation queries the response was YES. Maximal size of possible extension queue 1033. Compared 173868 event pairs, 6389 based on Foata normal form. 184/23557 useless extension candidates. Maximal degree in co-relation 96679. Up to 20256 conditions per place. [2024-06-04 14:05:54,208 INFO L140 encePairwiseOnDemand]: 48/56 looper letters, 134 selfloop transitions, 18 changer transitions 0/171 dead transitions. [2024-06-04 14:05:54,208 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 171 transitions, 1825 flow [2024-06-04 14:05:54,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 14:05:54,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 14:05:54,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 191 transitions. [2024-06-04 14:05:54,215 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4872448979591837 [2024-06-04 14:05:54,215 INFO L175 Difference]: Start difference. First operand has 103 places, 118 transitions, 1280 flow. Second operand 7 states and 191 transitions. [2024-06-04 14:05:54,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 171 transitions, 1825 flow [2024-06-04 14:05:54,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 171 transitions, 1747 flow, removed 29 selfloop flow, removed 3 redundant places. [2024-06-04 14:05:54,391 INFO L231 Difference]: Finished difference. Result has 107 places, 123 transitions, 1299 flow [2024-06-04 14:05:54,391 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=1202, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1299, PETRI_PLACES=107, PETRI_TRANSITIONS=123} [2024-06-04 14:05:54,392 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 48 predicate places. [2024-06-04 14:05:54,392 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 123 transitions, 1299 flow [2024-06-04 14:05:54,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:05:54,392 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 14:05:54,392 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 14:05:54,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-04 14:05:54,393 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-04 14:05:54,393 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 14:05:54,393 INFO L85 PathProgramCache]: Analyzing trace with hash 596080460, now seen corresponding path program 1 times [2024-06-04 14:05:54,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 14:05:54,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102057716] [2024-06-04 14:05:54,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 14:05:54,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 14:05:54,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 14:05:54,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 14:05:54,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 14:05:54,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102057716] [2024-06-04 14:05:54,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102057716] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 14:05:54,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 14:05:54,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 14:05:54,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973690841] [2024-06-04 14:05:54,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 14:05:54,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 14:05:54,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 14:05:54,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 14:05:54,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-04 14:05:54,561 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 56 [2024-06-04 14:05:54,562 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 123 transitions, 1299 flow. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 7 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:05:54,562 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 14:05:54,562 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 56 [2024-06-04 14:05:54,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 14:05:58,396 INFO L124 PetriNetUnfolderBase]: 24611/37649 cut-off events. [2024-06-04 14:05:58,396 INFO L125 PetriNetUnfolderBase]: For 205860/205970 co-relation queries the response was YES. [2024-06-04 14:05:58,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 149647 conditions, 37649 events. 24611/37649 cut-off events. For 205860/205970 co-relation queries the response was YES. Maximal size of possible extension queue 1663. Compared 274774 event pairs, 5701 based on Foata normal form. 416/37863 useless extension candidates. Maximal degree in co-relation 149603. Up to 17463 conditions per place. [2024-06-04 14:05:58,750 INFO L140 encePairwiseOnDemand]: 42/56 looper letters, 279 selfloop transitions, 58 changer transitions 0/346 dead transitions. [2024-06-04 14:05:58,750 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 346 transitions, 3249 flow [2024-06-04 14:05:58,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-06-04 14:05:58,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2024-06-04 14:05:58,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 449 transitions. [2024-06-04 14:05:58,752 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5345238095238095 [2024-06-04 14:05:58,752 INFO L175 Difference]: Start difference. First operand has 107 places, 123 transitions, 1299 flow. Second operand 15 states and 449 transitions. [2024-06-04 14:05:58,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 346 transitions, 3249 flow [2024-06-04 14:05:59,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 346 transitions, 3225 flow, removed 11 selfloop flow, removed 1 redundant places. [2024-06-04 14:05:59,039 INFO L231 Difference]: Finished difference. Result has 124 places, 141 transitions, 1717 flow [2024-06-04 14:05:59,039 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=1275, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1717, PETRI_PLACES=124, PETRI_TRANSITIONS=141} [2024-06-04 14:05:59,039 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 65 predicate places. [2024-06-04 14:05:59,040 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 141 transitions, 1717 flow [2024-06-04 14:05:59,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 7 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:05:59,040 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 14:05:59,040 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 14:05:59,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-04 14:05:59,040 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-04 14:05:59,040 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 14:05:59,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1298626639, now seen corresponding path program 1 times [2024-06-04 14:05:59,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 14:05:59,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27907456] [2024-06-04 14:05:59,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 14:05:59,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 14:05:59,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 14:05:59,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 14:05:59,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 14:05:59,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27907456] [2024-06-04 14:05:59,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27907456] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 14:05:59,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 14:05:59,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 14:05:59,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217380946] [2024-06-04 14:05:59,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 14:05:59,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 14:05:59,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 14:05:59,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 14:05:59,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-04 14:05:59,201 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 56 [2024-06-04 14:05:59,201 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 141 transitions, 1717 flow. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:05:59,202 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 14:05:59,202 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 56 [2024-06-04 14:05:59,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 14:06:03,578 INFO L124 PetriNetUnfolderBase]: 27349/42063 cut-off events. [2024-06-04 14:06:03,578 INFO L125 PetriNetUnfolderBase]: For 296750/296866 co-relation queries the response was YES. [2024-06-04 14:06:03,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 179553 conditions, 42063 events. 27349/42063 cut-off events. For 296750/296866 co-relation queries the response was YES. Maximal size of possible extension queue 1947. Compared 315639 event pairs, 5822 based on Foata normal form. 460/42319 useless extension candidates. Maximal degree in co-relation 179504. Up to 17463 conditions per place. [2024-06-04 14:06:03,974 INFO L140 encePairwiseOnDemand]: 43/56 looper letters, 270 selfloop transitions, 48 changer transitions 0/327 dead transitions. [2024-06-04 14:06:03,975 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 327 transitions, 3617 flow [2024-06-04 14:06:03,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-04 14:06:03,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-04 14:06:03,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 367 transitions. [2024-06-04 14:06:03,976 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5461309523809523 [2024-06-04 14:06:03,976 INFO L175 Difference]: Start difference. First operand has 124 places, 141 transitions, 1717 flow. Second operand 12 states and 367 transitions. [2024-06-04 14:06:03,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 327 transitions, 3617 flow [2024-06-04 14:06:04,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 327 transitions, 3476 flow, removed 34 selfloop flow, removed 9 redundant places. [2024-06-04 14:06:04,746 INFO L231 Difference]: Finished difference. Result has 128 places, 154 transitions, 1922 flow [2024-06-04 14:06:04,747 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=1578, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1922, PETRI_PLACES=128, PETRI_TRANSITIONS=154} [2024-06-04 14:06:04,747 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 69 predicate places. [2024-06-04 14:06:04,747 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 154 transitions, 1922 flow [2024-06-04 14:06:04,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:06:04,747 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 14:06:04,747 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 14:06:04,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-04 14:06:04,748 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-04 14:06:04,748 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 14:06:04,748 INFO L85 PathProgramCache]: Analyzing trace with hash -257690284, now seen corresponding path program 1 times [2024-06-04 14:06:04,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 14:06:04,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287194904] [2024-06-04 14:06:04,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 14:06:04,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 14:06:04,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 14:06:04,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 14:06:04,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 14:06:04,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287194904] [2024-06-04 14:06:04,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287194904] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 14:06:04,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 14:06:04,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 14:06:04,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320420813] [2024-06-04 14:06:04,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 14:06:04,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-04 14:06:04,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 14:06:04,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-04 14:06:04,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-06-04 14:06:04,951 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 56 [2024-06-04 14:06:04,953 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 154 transitions, 1922 flow. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:06:04,953 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 14:06:04,953 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 56 [2024-06-04 14:06:04,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 14:06:09,412 INFO L124 PetriNetUnfolderBase]: 27162/40922 cut-off events. [2024-06-04 14:06:09,412 INFO L125 PetriNetUnfolderBase]: For 343296/343548 co-relation queries the response was YES. [2024-06-04 14:06:09,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 184508 conditions, 40922 events. 27162/40922 cut-off events. For 343296/343548 co-relation queries the response was YES. Maximal size of possible extension queue 1911. Compared 299716 event pairs, 3926 based on Foata normal form. 566/41110 useless extension candidates. Maximal degree in co-relation 184455. Up to 19890 conditions per place. [2024-06-04 14:06:09,879 INFO L140 encePairwiseOnDemand]: 44/56 looper letters, 183 selfloop transitions, 58 changer transitions 6/258 dead transitions. [2024-06-04 14:06:09,880 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 258 transitions, 3171 flow [2024-06-04 14:06:09,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 14:06:09,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 14:06:09,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 209 transitions. [2024-06-04 14:06:09,881 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6220238095238095 [2024-06-04 14:06:09,881 INFO L175 Difference]: Start difference. First operand has 128 places, 154 transitions, 1922 flow. Second operand 6 states and 209 transitions. [2024-06-04 14:06:09,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 258 transitions, 3171 flow [2024-06-04 14:06:10,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 258 transitions, 3071 flow, removed 20 selfloop flow, removed 8 redundant places. [2024-06-04 14:06:10,694 INFO L231 Difference]: Finished difference. Result has 128 places, 160 transitions, 2144 flow [2024-06-04 14:06:10,694 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=1844, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2144, PETRI_PLACES=128, PETRI_TRANSITIONS=160} [2024-06-04 14:06:10,695 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 69 predicate places. [2024-06-04 14:06:10,695 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 160 transitions, 2144 flow [2024-06-04 14:06:10,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:06:10,695 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 14:06:10,695 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 14:06:10,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-04 14:06:10,695 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-04 14:06:10,696 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 14:06:10,696 INFO L85 PathProgramCache]: Analyzing trace with hash 471427273, now seen corresponding path program 1 times [2024-06-04 14:06:10,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 14:06:10,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851859415] [2024-06-04 14:06:10,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 14:06:10,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 14:06:10,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 14:06:11,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 14:06:11,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 14:06:11,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851859415] [2024-06-04 14:06:11,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851859415] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 14:06:11,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 14:06:11,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 14:06:11,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183502777] [2024-06-04 14:06:11,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 14:06:11,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 14:06:11,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 14:06:11,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 14:06:11,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-06-04 14:06:11,144 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 56 [2024-06-04 14:06:11,144 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 160 transitions, 2144 flow. Second operand has 7 states, 7 states have (on average 15.142857142857142) internal successors, (106), 7 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:06:11,144 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 14:06:11,144 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 56 [2024-06-04 14:06:11,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 14:06:14,853 INFO L124 PetriNetUnfolderBase]: 22356/34046 cut-off events. [2024-06-04 14:06:14,853 INFO L125 PetriNetUnfolderBase]: For 323114/323400 co-relation queries the response was YES. [2024-06-04 14:06:15,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161115 conditions, 34046 events. 22356/34046 cut-off events. For 323114/323400 co-relation queries the response was YES. Maximal size of possible extension queue 1538. Compared 245520 event pairs, 9058 based on Foata normal form. 302/34036 useless extension candidates. Maximal degree in co-relation 161060. Up to 30762 conditions per place. [2024-06-04 14:06:15,201 INFO L140 encePairwiseOnDemand]: 45/56 looper letters, 192 selfloop transitions, 35 changer transitions 0/238 dead transitions. [2024-06-04 14:06:15,201 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 238 transitions, 2976 flow [2024-06-04 14:06:15,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 14:06:15,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 14:06:15,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 238 transitions. [2024-06-04 14:06:15,202 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4722222222222222 [2024-06-04 14:06:15,202 INFO L175 Difference]: Start difference. First operand has 128 places, 160 transitions, 2144 flow. Second operand 9 states and 238 transitions. [2024-06-04 14:06:15,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 238 transitions, 2976 flow [2024-06-04 14:06:16,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 238 transitions, 2816 flow, removed 43 selfloop flow, removed 4 redundant places. [2024-06-04 14:06:16,231 INFO L231 Difference]: Finished difference. Result has 132 places, 165 transitions, 2156 flow [2024-06-04 14:06:16,231 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=2008, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2156, PETRI_PLACES=132, PETRI_TRANSITIONS=165} [2024-06-04 14:06:16,232 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 73 predicate places. [2024-06-04 14:06:16,232 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 165 transitions, 2156 flow [2024-06-04 14:06:16,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.142857142857142) internal successors, (106), 7 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:06:16,232 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 14:06:16,232 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 14:06:16,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-04 14:06:16,232 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-04 14:06:16,233 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 14:06:16,233 INFO L85 PathProgramCache]: Analyzing trace with hash 526866637, now seen corresponding path program 1 times [2024-06-04 14:06:16,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 14:06:16,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579791985] [2024-06-04 14:06:16,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 14:06:16,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 14:06:16,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 14:06:16,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 14:06:16,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 14:06:16,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579791985] [2024-06-04 14:06:16,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579791985] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 14:06:16,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 14:06:16,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 14:06:16,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057595066] [2024-06-04 14:06:16,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 14:06:16,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-04 14:06:16,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 14:06:16,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-04 14:06:16,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-04 14:06:16,417 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 56 [2024-06-04 14:06:16,417 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 165 transitions, 2156 flow. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:06:16,417 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 14:06:16,417 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 56 [2024-06-04 14:06:16,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand