./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-atomic/read_write_lock-2.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --validate ./goblint.2024-05-21_14-57-05.files/protection/read_write_lock-2.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cde23df1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-atomic/read_write_lock-2.i ./goblint.2024-05-21_14-57-05.files/protection/read_write_lock-2.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-cde23df-m [2024-06-14 11:45:55,980 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-14 11:45:56,041 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-14 11:45:56,047 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-14 11:45:56,047 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-14 11:45:56,066 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-14 11:45:56,067 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-14 11:45:56,067 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-14 11:45:56,067 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-14 11:45:56,068 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-14 11:45:56,068 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-14 11:45:56,069 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-14 11:45:56,069 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-14 11:45:56,070 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-14 11:45:56,070 INFO L153 SettingsManager]: * Use SBE=true [2024-06-14 11:45:56,070 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-14 11:45:56,071 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-14 11:45:56,071 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-14 11:45:56,071 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-14 11:45:56,072 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-14 11:45:56,072 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-14 11:45:56,073 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-14 11:45:56,073 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-14 11:45:56,073 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-14 11:45:56,074 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-14 11:45:56,074 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-14 11:45:56,074 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-14 11:45:56,075 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-14 11:45:56,075 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-14 11:45:56,075 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-14 11:45:56,076 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-14 11:45:56,076 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-14 11:45:56,076 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-14 11:45:56,077 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-14 11:45:56,077 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-14 11:45:56,078 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-14 11:45:56,078 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-14 11:45:56,078 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-14 11:45:56,079 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-14 11:45:56,079 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-14 11:45:56,079 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-14 11:45:56,080 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-14 11:45:56,080 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-14 11:45:56,080 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-14 11:45:56,356 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-14 11:45:56,387 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-14 11:45:56,390 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-14 11:45:56,391 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-14 11:45:56,392 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-14 11:45:56,393 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-05-21_14-57-05.files/protection/read_write_lock-2.yml/witness.yml [2024-06-14 11:45:56,484 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-14 11:45:56,485 INFO L274 PluginConnector]: CDTParser initialized [2024-06-14 11:45:56,485 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-atomic/read_write_lock-2.i [2024-06-14 11:45:57,661 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-14 11:45:57,931 INFO L384 CDTParser]: Found 1 translation units. [2024-06-14 11:45:57,932 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/read_write_lock-2.i [2024-06-14 11:45:57,943 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c5dcc561/e0556fc09e1b4b92ba46a543959c516a/FLAG81d1499cf [2024-06-14 11:45:57,954 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c5dcc561/e0556fc09e1b4b92ba46a543959c516a [2024-06-14 11:45:57,955 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-14 11:45:57,956 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-14 11:45:57,957 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-14 11:45:57,957 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-14 11:45:57,961 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-14 11:45:57,962 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 11:45:56" (1/2) ... [2024-06-14 11:45:57,963 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55e2ef89 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 11:45:57, skipping insertion in model container [2024-06-14 11:45:57,963 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 11:45:56" (1/2) ... [2024-06-14 11:45:57,965 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@6e011ef3 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 11:45:57, skipping insertion in model container [2024-06-14 11:45:57,965 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 11:45:57" (2/2) ... [2024-06-14 11:45:57,965 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55e2ef89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 11:45:57, skipping insertion in model container [2024-06-14 11:45:57,965 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 11:45:57" (2/2) ... [2024-06-14 11:45:57,966 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-14 11:45:58,001 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-14 11:45:58,002 INFO L97 edCorrectnessWitness]: Location invariant before [L751-L751] ((! multithreaded || ((0 <= w && w <= 1) && (w == 0 || w == 1))) && (! multithreaded || ((((0 <= x && x <= 3) && x <= 127) && x % 3 == 0) && (x == 0 || x == 3)))) && (! multithreaded || ((((0 <= y && y <= 3) && y <= 127) && y % 3 == 0) && (y == 0 || y == 3))) [2024-06-14 11:45:58,003 INFO L97 edCorrectnessWitness]: Location invariant before [L752-L752] ((! multithreaded || ((0 <= w && w <= 1) && (w == 0 || w == 1))) && (! multithreaded || ((((0 <= x && x <= 3) && x <= 127) && x % 3 == 0) && (x == 0 || x == 3)))) && (! multithreaded || ((((0 <= y && y <= 3) && y <= 127) && y % 3 == 0) && (y == 0 || y == 3))) [2024-06-14 11:45:58,003 INFO L97 edCorrectnessWitness]: Location invariant before [L750-L750] ((! multithreaded || ((0 <= w && w <= 1) && (w == 0 || w == 1))) && (! multithreaded || ((((0 <= x && x <= 3) && x <= 127) && x % 3 == 0) && (x == 0 || x == 3)))) && (! multithreaded || ((((0 <= y && y <= 3) && y <= 127) && y % 3 == 0) && (y == 0 || y == 3))) [2024-06-14 11:45:58,003 INFO L97 edCorrectnessWitness]: Location invariant before [L753-L753] ((! multithreaded || ((0 <= w && w <= 1) && (w == 0 || w == 1))) && (! multithreaded || ((((0 <= x && x <= 3) && x <= 127) && x % 3 == 0) && (x == 0 || x == 3)))) && (! multithreaded || ((((0 <= y && y <= 3) && y <= 127) && y % 3 == 0) && (y == 0 || y == 3))) [2024-06-14 11:45:58,003 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-14 11:45:58,003 INFO L106 edCorrectnessWitness]: ghost_update [L749-L749] multithreaded = 1; [2024-06-14 11:45:58,042 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-14 11:45:58,373 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-14 11:45:58,382 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-14 11:45:58,466 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-14 11:45:58,508 INFO L206 MainTranslator]: Completed translation [2024-06-14 11:45:58,509 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 11:45:58 WrapperNode [2024-06-14 11:45:58,509 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-14 11:45:58,512 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-14 11:45:58,512 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-14 11:45:58,512 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-14 11:45:58,519 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 11:45:58" (1/1) ... [2024-06-14 11:45:58,552 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 11:45:58" (1/1) ... [2024-06-14 11:45:58,590 INFO L138 Inliner]: procedures = 172, calls = 31, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 103 [2024-06-14 11:45:58,590 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-14 11:45:58,593 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-14 11:45:58,594 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-14 11:45:58,595 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-14 11:45:58,604 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 11:45:58" (1/1) ... [2024-06-14 11:45:58,605 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 11:45:58" (1/1) ... [2024-06-14 11:45:58,609 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 11:45:58" (1/1) ... [2024-06-14 11:45:58,638 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-14 11:45:58,639 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 11:45:58" (1/1) ... [2024-06-14 11:45:58,639 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 11:45:58" (1/1) ... [2024-06-14 11:45:58,651 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 11:45:58" (1/1) ... [2024-06-14 11:45:58,653 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 11:45:58" (1/1) ... [2024-06-14 11:45:58,654 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 11:45:58" (1/1) ... [2024-06-14 11:45:58,661 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 11:45:58" (1/1) ... [2024-06-14 11:45:58,664 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-14 11:45:58,665 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-14 11:45:58,665 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-14 11:45:58,665 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-14 11:45:58,666 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 11:45:58" (1/1) ... [2024-06-14 11:45:58,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-14 11:45:58,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-14 11:45:58,705 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-14 11:45:58,716 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-14 11:45:58,737 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-14 11:45:58,737 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-14 11:45:58,737 INFO L130 BoogieDeclarations]: Found specification of procedure reader [2024-06-14 11:45:58,738 INFO L138 BoogieDeclarations]: Found implementation of procedure reader [2024-06-14 11:45:58,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-14 11:45:58,738 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-14 11:45:58,738 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-14 11:45:58,738 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-14 11:45:58,738 INFO L130 BoogieDeclarations]: Found specification of procedure writer [2024-06-14 11:45:58,738 INFO L138 BoogieDeclarations]: Found implementation of procedure writer [2024-06-14 11:45:58,740 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-14 11:45:58,837 INFO L244 CfgBuilder]: Building ICFG [2024-06-14 11:45:58,839 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-14 11:45:59,088 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-14 11:45:59,088 INFO L293 CfgBuilder]: Performing block encoding [2024-06-14 11:45:59,198 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-14 11:45:59,202 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-14 11:45:59,204 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 11:45:59 BoogieIcfgContainer [2024-06-14 11:45:59,204 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-14 11:45:59,207 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-14 11:45:59,207 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-14 11:45:59,210 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-14 11:45:59,210 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 11:45:56" (1/4) ... [2024-06-14 11:45:59,211 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3186dc07 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 14.06 11:45:59, skipping insertion in model container [2024-06-14 11:45:59,211 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.06 11:45:57" (2/4) ... [2024-06-14 11:45:59,211 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3186dc07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.06 11:45:59, skipping insertion in model container [2024-06-14 11:45:59,212 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 11:45:58" (3/4) ... [2024-06-14 11:45:59,212 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3186dc07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.06 11:45:59, skipping insertion in model container [2024-06-14 11:45:59,212 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 11:45:59" (4/4) ... [2024-06-14 11:45:59,213 INFO L112 eAbstractionObserver]: Analyzing ICFG read_write_lock-2.i [2024-06-14 11:45:59,231 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-14 11:45:59,232 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-06-14 11:45:59,232 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-14 11:45:59,328 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-06-14 11:45:59,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 58 transitions, 144 flow [2024-06-14 11:45:59,421 INFO L124 PetriNetUnfolderBase]: 0/54 cut-off events. [2024-06-14 11:45:59,421 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-06-14 11:45:59,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71 conditions, 54 events. 0/54 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 97 event pairs, 0 based on Foata normal form. 0/50 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2024-06-14 11:45:59,423 INFO L82 GeneralOperation]: Start removeDead. Operand has 71 places, 58 transitions, 144 flow [2024-06-14 11:45:59,430 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 61 places, 48 transitions, 108 flow [2024-06-14 11:45:59,439 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-14 11:45:59,447 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;@6b1c8291, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-14 11:45:59,448 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-06-14 11:45:59,453 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-14 11:45:59,453 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-14 11:45:59,453 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-14 11:45:59,454 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:45:59,454 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-14 11:45:59,455 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-14 11:45:59,460 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:45:59,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1341263991, now seen corresponding path program 1 times [2024-06-14 11:45:59,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:45:59,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884880269] [2024-06-14 11:45:59,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:45:59,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:45:59,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:46:00,016 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-14 11:46:00,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:46:00,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884880269] [2024-06-14 11:46:00,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884880269] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:46:00,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:46:00,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-14 11:46:00,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859290340] [2024-06-14 11:46:00,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:46:00,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-14 11:46:00,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:46:00,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-14 11:46:00,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-14 11:46:00,108 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 58 [2024-06-14 11:46:00,111 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 48 transitions, 108 flow. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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-14 11:46:00,112 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:46:00,112 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 58 [2024-06-14 11:46:00,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:46:01,275 INFO L124 PetriNetUnfolderBase]: 5905/9727 cut-off events. [2024-06-14 11:46:01,275 INFO L125 PetriNetUnfolderBase]: For 117/117 co-relation queries the response was YES. [2024-06-14 11:46:01,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18099 conditions, 9727 events. 5905/9727 cut-off events. For 117/117 co-relation queries the response was YES. Maximal size of possible extension queue 397. Compared 66733 event pairs, 3124 based on Foata normal form. 9/9480 useless extension candidates. Maximal degree in co-relation 18083. Up to 8047 conditions per place. [2024-06-14 11:46:01,350 INFO L140 encePairwiseOnDemand]: 49/58 looper letters, 47 selfloop transitions, 5 changer transitions 0/66 dead transitions. [2024-06-14 11:46:01,350 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 66 transitions, 257 flow [2024-06-14 11:46:01,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-14 11:46:01,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-14 11:46:01,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2024-06-14 11:46:01,362 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6494252873563219 [2024-06-14 11:46:01,364 INFO L175 Difference]: Start difference. First operand has 61 places, 48 transitions, 108 flow. Second operand 3 states and 113 transitions. [2024-06-14 11:46:01,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 66 transitions, 257 flow [2024-06-14 11:46:01,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 66 transitions, 250 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-06-14 11:46:01,371 INFO L231 Difference]: Finished difference. Result has 60 places, 52 transitions, 143 flow [2024-06-14 11:46:01,374 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=143, PETRI_PLACES=60, PETRI_TRANSITIONS=52} [2024-06-14 11:46:01,377 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, -1 predicate places. [2024-06-14 11:46:01,377 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 52 transitions, 143 flow [2024-06-14 11:46:01,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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-14 11:46:01,378 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:46:01,378 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:46:01,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-14 11:46:01,379 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-14 11:46:01,379 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:46:01,379 INFO L85 PathProgramCache]: Analyzing trace with hash -464438168, now seen corresponding path program 1 times [2024-06-14 11:46:01,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:46:01,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469046127] [2024-06-14 11:46:01,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:46:01,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:46:01,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:46:01,605 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-14 11:46:01,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:46:01,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469046127] [2024-06-14 11:46:01,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469046127] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:46:01,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:46:01,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-14 11:46:01,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216737291] [2024-06-14 11:46:01,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:46:01,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-14 11:46:01,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:46:01,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-14 11:46:01,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-14 11:46:01,671 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 58 [2024-06-14 11:46:01,672 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 52 transitions, 143 flow. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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-14 11:46:01,672 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:46:01,672 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 58 [2024-06-14 11:46:01,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:46:03,132 INFO L124 PetriNetUnfolderBase]: 9222/14466 cut-off events. [2024-06-14 11:46:03,133 INFO L125 PetriNetUnfolderBase]: For 2061/2061 co-relation queries the response was YES. [2024-06-14 11:46:03,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30749 conditions, 14466 events. 9222/14466 cut-off events. For 2061/2061 co-relation queries the response was YES. Maximal size of possible extension queue 569. Compared 97480 event pairs, 4632 based on Foata normal form. 115/14415 useless extension candidates. Maximal degree in co-relation 30734. Up to 12366 conditions per place. [2024-06-14 11:46:03,238 INFO L140 encePairwiseOnDemand]: 45/58 looper letters, 61 selfloop transitions, 9 changer transitions 0/82 dead transitions. [2024-06-14 11:46:03,238 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 82 transitions, 359 flow [2024-06-14 11:46:03,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-14 11:46:03,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-14 11:46:03,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 146 transitions. [2024-06-14 11:46:03,241 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6293103448275862 [2024-06-14 11:46:03,241 INFO L175 Difference]: Start difference. First operand has 60 places, 52 transitions, 143 flow. Second operand 4 states and 146 transitions. [2024-06-14 11:46:03,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 82 transitions, 359 flow [2024-06-14 11:46:03,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 82 transitions, 354 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-14 11:46:03,244 INFO L231 Difference]: Finished difference. Result has 63 places, 56 transitions, 198 flow [2024-06-14 11:46:03,244 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=198, PETRI_PLACES=63, PETRI_TRANSITIONS=56} [2024-06-14 11:46:03,245 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 2 predicate places. [2024-06-14 11:46:03,245 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 56 transitions, 198 flow [2024-06-14 11:46:03,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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-14 11:46:03,246 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:46:03,246 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:46:03,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-14 11:46:03,246 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-14 11:46:03,247 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:46:03,247 INFO L85 PathProgramCache]: Analyzing trace with hash -1512679122, now seen corresponding path program 1 times [2024-06-14 11:46:03,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:46:03,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037546693] [2024-06-14 11:46:03,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:46:03,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:46:03,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:46:03,383 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-14 11:46:03,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:46:03,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037546693] [2024-06-14 11:46:03,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037546693] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:46:03,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:46:03,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-14 11:46:03,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992851344] [2024-06-14 11:46:03,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:46:03,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 11:46:03,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:46:03,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 11:46:03,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-14 11:46:03,431 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 58 [2024-06-14 11:46:03,432 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 56 transitions, 198 flow. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 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-14 11:46:03,432 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:46:03,432 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 58 [2024-06-14 11:46:03,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:46:04,734 INFO L124 PetriNetUnfolderBase]: 8409/13384 cut-off events. [2024-06-14 11:46:04,734 INFO L125 PetriNetUnfolderBase]: For 5780/5780 co-relation queries the response was YES. [2024-06-14 11:46:04,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33228 conditions, 13384 events. 8409/13384 cut-off events. For 5780/5780 co-relation queries the response was YES. Maximal size of possible extension queue 551. Compared 91055 event pairs, 2749 based on Foata normal form. 339/13440 useless extension candidates. Maximal degree in co-relation 33211. Up to 9313 conditions per place. [2024-06-14 11:46:04,832 INFO L140 encePairwiseOnDemand]: 43/58 looper letters, 81 selfloop transitions, 21 changer transitions 0/114 dead transitions. [2024-06-14 11:46:04,832 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 114 transitions, 594 flow [2024-06-14 11:46:04,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 11:46:04,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 11:46:04,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 189 transitions. [2024-06-14 11:46:04,834 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6517241379310345 [2024-06-14 11:46:04,835 INFO L175 Difference]: Start difference. First operand has 63 places, 56 transitions, 198 flow. Second operand 5 states and 189 transitions. [2024-06-14 11:46:04,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 114 transitions, 594 flow [2024-06-14 11:46:04,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 114 transitions, 578 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-06-14 11:46:04,839 INFO L231 Difference]: Finished difference. Result has 68 places, 68 transitions, 351 flow [2024-06-14 11:46:04,840 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=351, PETRI_PLACES=68, PETRI_TRANSITIONS=68} [2024-06-14 11:46:04,841 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 7 predicate places. [2024-06-14 11:46:04,841 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 68 transitions, 351 flow [2024-06-14 11:46:04,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 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-14 11:46:04,841 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:46:04,841 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:46:04,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-14 11:46:04,842 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-14 11:46:04,842 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:46:04,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1869887243, now seen corresponding path program 1 times [2024-06-14 11:46:04,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:46:04,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726754110] [2024-06-14 11:46:04,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:46:04,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:46:04,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:46:05,036 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-14 11:46:05,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:46:05,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726754110] [2024-06-14 11:46:05,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726754110] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:46:05,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:46:05,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-14 11:46:05,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336195244] [2024-06-14 11:46:05,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:46:05,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 11:46:05,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:46:05,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 11:46:05,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-14 11:46:05,083 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 58 [2024-06-14 11:46:05,084 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 68 transitions, 351 flow. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 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-14 11:46:05,084 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:46:05,084 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 58 [2024-06-14 11:46:05,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:46:06,482 INFO L124 PetriNetUnfolderBase]: 8195/12989 cut-off events. [2024-06-14 11:46:06,483 INFO L125 PetriNetUnfolderBase]: For 17024/17030 co-relation queries the response was YES. [2024-06-14 11:46:06,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40361 conditions, 12989 events. 8195/12989 cut-off events. For 17024/17030 co-relation queries the response was YES. Maximal size of possible extension queue 544. Compared 88248 event pairs, 2416 based on Foata normal form. 110/12779 useless extension candidates. Maximal degree in co-relation 40341. Up to 9283 conditions per place. [2024-06-14 11:46:06,583 INFO L140 encePairwiseOnDemand]: 45/58 looper letters, 81 selfloop transitions, 17 changer transitions 0/110 dead transitions. [2024-06-14 11:46:06,583 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 110 transitions, 677 flow [2024-06-14 11:46:06,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 11:46:06,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 11:46:06,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 183 transitions. [2024-06-14 11:46:06,585 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6310344827586207 [2024-06-14 11:46:06,585 INFO L175 Difference]: Start difference. First operand has 68 places, 68 transitions, 351 flow. Second operand 5 states and 183 transitions. [2024-06-14 11:46:06,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 110 transitions, 677 flow [2024-06-14 11:46:06,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 110 transitions, 669 flow, removed 4 selfloop flow, removed 0 redundant places. [2024-06-14 11:46:06,594 INFO L231 Difference]: Finished difference. Result has 72 places, 67 transitions, 381 flow [2024-06-14 11:46:06,595 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=335, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=381, PETRI_PLACES=72, PETRI_TRANSITIONS=67} [2024-06-14 11:46:06,596 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 11 predicate places. [2024-06-14 11:46:06,596 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 67 transitions, 381 flow [2024-06-14 11:46:06,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 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-14 11:46:06,596 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:46:06,596 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:46:06,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-14 11:46:06,597 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-14 11:46:06,597 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:46:06,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1742681279, now seen corresponding path program 1 times [2024-06-14 11:46:06,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:46:06,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626311637] [2024-06-14 11:46:06,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:46:06,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:46:06,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:46:06,773 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-14 11:46:06,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:46:06,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626311637] [2024-06-14 11:46:06,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626311637] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:46:06,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:46:06,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-14 11:46:06,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080478141] [2024-06-14 11:46:06,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:46:06,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 11:46:06,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:46:06,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 11:46:06,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-06-14 11:46:06,811 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 58 [2024-06-14 11:46:06,812 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 67 transitions, 381 flow. Second operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 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-14 11:46:06,812 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:46:06,812 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 58 [2024-06-14 11:46:06,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:46:08,176 INFO L124 PetriNetUnfolderBase]: 10109/16328 cut-off events. [2024-06-14 11:46:08,177 INFO L125 PetriNetUnfolderBase]: For 29498/29512 co-relation queries the response was YES. [2024-06-14 11:46:08,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51915 conditions, 16328 events. 10109/16328 cut-off events. For 29498/29512 co-relation queries the response was YES. Maximal size of possible extension queue 635. Compared 115666 event pairs, 3953 based on Foata normal form. 46/15984 useless extension candidates. Maximal degree in co-relation 51892. Up to 12984 conditions per place. [2024-06-14 11:46:08,523 INFO L140 encePairwiseOnDemand]: 48/58 looper letters, 90 selfloop transitions, 22 changer transitions 0/126 dead transitions. [2024-06-14 11:46:08,524 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 126 transitions, 878 flow [2024-06-14 11:46:08,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 11:46:08,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 11:46:08,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 200 transitions. [2024-06-14 11:46:08,527 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5747126436781609 [2024-06-14 11:46:08,527 INFO L175 Difference]: Start difference. First operand has 72 places, 67 transitions, 381 flow. Second operand 6 states and 200 transitions. [2024-06-14 11:46:08,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 126 transitions, 878 flow [2024-06-14 11:46:08,553 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 126 transitions, 836 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-06-14 11:46:08,556 INFO L231 Difference]: Finished difference. Result has 77 places, 85 transitions, 573 flow [2024-06-14 11:46:08,559 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=573, PETRI_PLACES=77, PETRI_TRANSITIONS=85} [2024-06-14 11:46:08,562 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 16 predicate places. [2024-06-14 11:46:08,562 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 85 transitions, 573 flow [2024-06-14 11:46:08,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 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-14 11:46:08,563 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:46:08,567 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:46:08,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-14 11:46:08,568 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-14 11:46:08,568 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:46:08,568 INFO L85 PathProgramCache]: Analyzing trace with hash -298585698, now seen corresponding path program 1 times [2024-06-14 11:46:08,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:46:08,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433403591] [2024-06-14 11:46:08,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:46:08,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:46:08,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:46:08,623 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-14 11:46:08,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:46:08,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433403591] [2024-06-14 11:46:08,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433403591] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:46:08,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:46:08,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-14 11:46:08,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181923451] [2024-06-14 11:46:08,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:46:08,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-14 11:46:08,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:46:08,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-14 11:46:08,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-14 11:46:08,635 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 58 [2024-06-14 11:46:08,635 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 85 transitions, 573 flow. Second operand has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 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-14 11:46:08,636 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:46:08,636 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 58 [2024-06-14 11:46:08,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:46:09,755 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([242] L714-->L714-1: Formula: (and (= v_~w~0_72 1) (not (= (ite (and (= v_~w~0_73 0) (= v_~r~0_51 0)) 1 0) 0))) InVars {~w~0=v_~w~0_73, ~r~0=v_~r~0_51} OutVars{~w~0=v_~w~0_72, writerThread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_writerThread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~r~0=v_~r~0_51, writerThread1of1ForFork3_assume_abort_if_not_~cond#1=|v_writerThread1of1ForFork3_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork3_assume_abort_if_not_~cond#1, writerThread1of1ForFork3_assume_abort_if_not_#in~cond#1][94], [Black: 95#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0)), writerThread1of1ForFork3InUse, writerThread1of1ForFork2InUse, 83#true, 59#L744true, readerThread1of1ForFork0InUse, 16#L720true, Black: 101#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), readerThread1of1ForFork1InUse, Black: 103#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), Black: 100#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 0)), 109#(= ~r~0 0), 97#true, Black: 76#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), Black: 81#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 12#L714-1true, Black: 85#(= ~y~0 0), 28#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, Black: 86#(and (= ~w~0 1) (= ~y~0 0)), 11#L744true, Black: 87#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0))]) [2024-06-14 11:46:09,756 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-06-14 11:46:09,756 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-06-14 11:46:09,756 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-06-14 11:46:09,756 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-06-14 11:46:09,786 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([247] L714-->L714-1: Formula: (and (= v_~w~0_72 1) (not (= (ite (and (= v_~w~0_73 0) (= v_~r~0_51 0)) 1 0) 0))) InVars {~w~0=v_~w~0_73, ~r~0=v_~r~0_51} OutVars{~w~0=v_~w~0_72, writerThread1of1ForFork2_assume_abort_if_not_~cond#1=|v_writerThread1of1ForFork2_assume_abort_if_not_~cond#1_1|, writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~r~0=v_~r~0_51} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork2_assume_abort_if_not_~cond#1, writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1][98], [Black: 95#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0)), writerThread1of1ForFork3InUse, writerThread1of1ForFork2InUse, 83#true, 59#L744true, readerThread1of1ForFork0InUse, 29#L714-1true, readerThread1of1ForFork1InUse, Black: 101#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), 6#L720true, Black: 103#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), Black: 100#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 0)), 109#(= ~r~0 0), 97#true, Black: 76#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), Black: 81#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), Black: 85#(= ~y~0 0), 28#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, Black: 86#(and (= ~w~0 1) (= ~y~0 0)), 11#L744true, Black: 87#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0))]) [2024-06-14 11:46:09,786 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-06-14 11:46:09,790 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-06-14 11:46:09,790 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-06-14 11:46:09,790 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-06-14 11:46:09,802 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([242] L714-->L714-1: Formula: (and (= v_~w~0_72 1) (not (= (ite (and (= v_~w~0_73 0) (= v_~r~0_51 0)) 1 0) 0))) InVars {~w~0=v_~w~0_73, ~r~0=v_~r~0_51} OutVars{~w~0=v_~w~0_72, writerThread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_writerThread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~r~0=v_~r~0_51, writerThread1of1ForFork3_assume_abort_if_not_~cond#1=|v_writerThread1of1ForFork3_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork3_assume_abort_if_not_~cond#1, writerThread1of1ForFork3_assume_abort_if_not_#in~cond#1][94], [Black: 95#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0)), writerThread1of1ForFork3InUse, writerThread1of1ForFork2InUse, 83#true, 59#L744true, readerThread1of1ForFork0InUse, 16#L720true, Black: 101#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), readerThread1of1ForFork1InUse, Black: 103#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), Black: 100#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 0)), 109#(= ~r~0 0), 97#true, Black: 76#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), Black: 81#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 28#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 12#L714-1true, Black: 85#(= ~y~0 0), Black: 86#(and (= ~w~0 1) (= ~y~0 0)), 11#L744true, Black: 87#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0))]) [2024-06-14 11:46:09,802 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-06-14 11:46:09,802 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-06-14 11:46:09,803 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-06-14 11:46:09,803 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-06-14 11:46:09,803 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-06-14 11:46:09,807 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([242] L714-->L714-1: Formula: (and (= v_~w~0_72 1) (not (= (ite (and (= v_~w~0_73 0) (= v_~r~0_51 0)) 1 0) 0))) InVars {~w~0=v_~w~0_73, ~r~0=v_~r~0_51} OutVars{~w~0=v_~w~0_72, writerThread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_writerThread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~r~0=v_~r~0_51, writerThread1of1ForFork3_assume_abort_if_not_~cond#1=|v_writerThread1of1ForFork3_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork3_assume_abort_if_not_~cond#1, writerThread1of1ForFork3_assume_abort_if_not_#in~cond#1][94], [Black: 95#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0)), writerThread1of1ForFork3InUse, writerThread1of1ForFork2InUse, 83#true, readerThread1of1ForFork0InUse, 16#L720true, Black: 101#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), readerThread1of1ForFork1InUse, Black: 103#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), Black: 100#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 0)), 109#(= ~r~0 0), 97#true, Black: 76#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), Black: 81#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 27#readerEXITtrue, 12#L714-1true, Black: 85#(= ~y~0 0), 28#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, Black: 86#(and (= ~w~0 1) (= ~y~0 0)), Black: 87#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), 11#L744true]) [2024-06-14 11:46:09,807 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2024-06-14 11:46:09,807 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-14 11:46:09,807 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-14 11:46:09,807 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-14 11:46:09,808 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([242] L714-->L714-1: Formula: (and (= v_~w~0_72 1) (not (= (ite (and (= v_~w~0_73 0) (= v_~r~0_51 0)) 1 0) 0))) InVars {~w~0=v_~w~0_73, ~r~0=v_~r~0_51} OutVars{~w~0=v_~w~0_72, writerThread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_writerThread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~r~0=v_~r~0_51, writerThread1of1ForFork3_assume_abort_if_not_~cond#1=|v_writerThread1of1ForFork3_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork3_assume_abort_if_not_~cond#1, writerThread1of1ForFork3_assume_abort_if_not_#in~cond#1][94], [Black: 95#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0)), writerThread1of1ForFork3InUse, writerThread1of1ForFork2InUse, 83#true, 59#L744true, readerThread1of1ForFork0InUse, 16#L720true, Black: 101#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), readerThread1of1ForFork1InUse, Black: 103#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), Black: 100#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 0)), 109#(= ~r~0 0), 97#true, Black: 76#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), Black: 81#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 12#L714-1true, Black: 85#(= ~y~0 0), 28#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, Black: 86#(and (= ~w~0 1) (= ~y~0 0)), Black: 87#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), 45#readerEXITtrue]) [2024-06-14 11:46:09,808 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2024-06-14 11:46:09,808 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-14 11:46:09,808 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-14 11:46:09,808 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-14 11:46:09,813 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([247] L714-->L714-1: Formula: (and (= v_~w~0_72 1) (not (= (ite (and (= v_~w~0_73 0) (= v_~r~0_51 0)) 1 0) 0))) InVars {~w~0=v_~w~0_73, ~r~0=v_~r~0_51} OutVars{~w~0=v_~w~0_72, writerThread1of1ForFork2_assume_abort_if_not_~cond#1=|v_writerThread1of1ForFork2_assume_abort_if_not_~cond#1_1|, writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~r~0=v_~r~0_51} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork2_assume_abort_if_not_~cond#1, writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1][98], [Black: 95#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0)), writerThread1of1ForFork3InUse, writerThread1of1ForFork2InUse, 83#true, 59#L744true, readerThread1of1ForFork0InUse, 29#L714-1true, Black: 101#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), readerThread1of1ForFork1InUse, Black: 103#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), 6#L720true, Black: 100#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 0)), 109#(= ~r~0 0), 97#true, Black: 76#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), Black: 81#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 28#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, Black: 85#(= ~y~0 0), Black: 86#(and (= ~w~0 1) (= ~y~0 0)), 11#L744true, Black: 87#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0))]) [2024-06-14 11:46:09,813 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-06-14 11:46:09,813 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-06-14 11:46:09,813 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-06-14 11:46:09,813 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-06-14 11:46:09,813 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-06-14 11:46:09,824 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([247] L714-->L714-1: Formula: (and (= v_~w~0_72 1) (not (= (ite (and (= v_~w~0_73 0) (= v_~r~0_51 0)) 1 0) 0))) InVars {~w~0=v_~w~0_73, ~r~0=v_~r~0_51} OutVars{~w~0=v_~w~0_72, writerThread1of1ForFork2_assume_abort_if_not_~cond#1=|v_writerThread1of1ForFork2_assume_abort_if_not_~cond#1_1|, writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~r~0=v_~r~0_51} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork2_assume_abort_if_not_~cond#1, writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1][98], [Black: 95#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0)), writerThread1of1ForFork3InUse, writerThread1of1ForFork2InUse, 83#true, readerThread1of1ForFork0InUse, 29#L714-1true, readerThread1of1ForFork1InUse, Black: 101#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), 6#L720true, Black: 103#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), Black: 100#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 0)), 109#(= ~r~0 0), 97#true, Black: 76#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), 27#readerEXITtrue, Black: 81#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), Black: 85#(= ~y~0 0), 28#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, Black: 86#(and (= ~w~0 1) (= ~y~0 0)), 11#L744true, Black: 87#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0))]) [2024-06-14 11:46:09,824 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2024-06-14 11:46:09,824 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-14 11:46:09,824 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-14 11:46:09,824 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-14 11:46:09,824 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([247] L714-->L714-1: Formula: (and (= v_~w~0_72 1) (not (= (ite (and (= v_~w~0_73 0) (= v_~r~0_51 0)) 1 0) 0))) InVars {~w~0=v_~w~0_73, ~r~0=v_~r~0_51} OutVars{~w~0=v_~w~0_72, writerThread1of1ForFork2_assume_abort_if_not_~cond#1=|v_writerThread1of1ForFork2_assume_abort_if_not_~cond#1_1|, writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~r~0=v_~r~0_51} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork2_assume_abort_if_not_~cond#1, writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1][98], [Black: 95#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0)), writerThread1of1ForFork3InUse, writerThread1of1ForFork2InUse, 83#true, 59#L744true, readerThread1of1ForFork0InUse, 29#L714-1true, readerThread1of1ForFork1InUse, Black: 101#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), 6#L720true, Black: 103#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), Black: 100#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 0)), 109#(= ~r~0 0), 97#true, Black: 76#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), Black: 81#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), Black: 85#(= ~y~0 0), 28#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, Black: 86#(and (= ~w~0 1) (= ~y~0 0)), Black: 87#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), 45#readerEXITtrue]) [2024-06-14 11:46:09,824 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2024-06-14 11:46:09,825 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-14 11:46:09,825 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-14 11:46:09,825 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-14 11:46:09,833 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([242] L714-->L714-1: Formula: (and (= v_~w~0_72 1) (not (= (ite (and (= v_~w~0_73 0) (= v_~r~0_51 0)) 1 0) 0))) InVars {~w~0=v_~w~0_73, ~r~0=v_~r~0_51} OutVars{~w~0=v_~w~0_72, writerThread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_writerThread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~r~0=v_~r~0_51, writerThread1of1ForFork3_assume_abort_if_not_~cond#1=|v_writerThread1of1ForFork3_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork3_assume_abort_if_not_~cond#1, writerThread1of1ForFork3_assume_abort_if_not_#in~cond#1][94], [Black: 95#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0)), writerThread1of1ForFork3InUse, writerThread1of1ForFork2InUse, 83#true, readerThread1of1ForFork0InUse, 16#L720true, Black: 101#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), readerThread1of1ForFork1InUse, Black: 103#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), Black: 100#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 0)), 109#(= ~r~0 0), 97#true, Black: 76#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), Black: 81#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 27#readerEXITtrue, 28#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 12#L714-1true, Black: 85#(= ~y~0 0), Black: 86#(and (= ~w~0 1) (= ~y~0 0)), 11#L744true, Black: 87#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0))]) [2024-06-14 11:46:09,834 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2024-06-14 11:46:09,834 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-14 11:46:09,834 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-14 11:46:09,834 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-14 11:46:09,834 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-14 11:46:09,836 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([242] L714-->L714-1: Formula: (and (= v_~w~0_72 1) (not (= (ite (and (= v_~w~0_73 0) (= v_~r~0_51 0)) 1 0) 0))) InVars {~w~0=v_~w~0_73, ~r~0=v_~r~0_51} OutVars{~w~0=v_~w~0_72, writerThread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_writerThread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~r~0=v_~r~0_51, writerThread1of1ForFork3_assume_abort_if_not_~cond#1=|v_writerThread1of1ForFork3_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork3_assume_abort_if_not_~cond#1, writerThread1of1ForFork3_assume_abort_if_not_#in~cond#1][94], [Black: 95#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0)), writerThread1of1ForFork3InUse, writerThread1of1ForFork2InUse, 83#true, 59#L744true, readerThread1of1ForFork0InUse, 16#L720true, Black: 101#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), readerThread1of1ForFork1InUse, Black: 103#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), Black: 100#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 0)), 109#(= ~r~0 0), 97#true, Black: 76#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), Black: 81#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 28#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 12#L714-1true, Black: 85#(= ~y~0 0), Black: 86#(and (= ~w~0 1) (= ~y~0 0)), Black: 87#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), 45#readerEXITtrue]) [2024-06-14 11:46:09,836 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2024-06-14 11:46:09,836 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-14 11:46:09,836 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-14 11:46:09,836 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-14 11:46:09,836 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-14 11:46:09,839 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([242] L714-->L714-1: Formula: (and (= v_~w~0_72 1) (not (= (ite (and (= v_~w~0_73 0) (= v_~r~0_51 0)) 1 0) 0))) InVars {~w~0=v_~w~0_73, ~r~0=v_~r~0_51} OutVars{~w~0=v_~w~0_72, writerThread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_writerThread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~r~0=v_~r~0_51, writerThread1of1ForFork3_assume_abort_if_not_~cond#1=|v_writerThread1of1ForFork3_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork3_assume_abort_if_not_~cond#1, writerThread1of1ForFork3_assume_abort_if_not_#in~cond#1][94], [Black: 95#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0)), writerThread1of1ForFork3InUse, writerThread1of1ForFork2InUse, 83#true, readerThread1of1ForFork0InUse, 16#L720true, Black: 101#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), readerThread1of1ForFork1InUse, Black: 103#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), Black: 100#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 0)), 109#(= ~r~0 0), 97#true, Black: 76#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), 27#readerEXITtrue, Black: 81#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 12#L714-1true, Black: 85#(= ~y~0 0), 28#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, Black: 86#(and (= ~w~0 1) (= ~y~0 0)), Black: 87#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), 45#readerEXITtrue]) [2024-06-14 11:46:09,839 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2024-06-14 11:46:09,839 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-06-14 11:46:09,839 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-06-14 11:46:09,839 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-06-14 11:46:09,843 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([247] L714-->L714-1: Formula: (and (= v_~w~0_72 1) (not (= (ite (and (= v_~w~0_73 0) (= v_~r~0_51 0)) 1 0) 0))) InVars {~w~0=v_~w~0_73, ~r~0=v_~r~0_51} OutVars{~w~0=v_~w~0_72, writerThread1of1ForFork2_assume_abort_if_not_~cond#1=|v_writerThread1of1ForFork2_assume_abort_if_not_~cond#1_1|, writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~r~0=v_~r~0_51} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork2_assume_abort_if_not_~cond#1, writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1][98], [Black: 95#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0)), writerThread1of1ForFork3InUse, writerThread1of1ForFork2InUse, 83#true, 29#L714-1true, readerThread1of1ForFork0InUse, Black: 101#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), readerThread1of1ForFork1InUse, Black: 103#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), 6#L720true, Black: 100#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 0)), 109#(= ~r~0 0), 97#true, Black: 76#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), Black: 81#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 27#readerEXITtrue, 28#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, Black: 85#(= ~y~0 0), Black: 86#(and (= ~w~0 1) (= ~y~0 0)), Black: 87#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), 11#L744true]) [2024-06-14 11:46:09,843 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2024-06-14 11:46:09,844 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-14 11:46:09,844 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-14 11:46:09,844 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-14 11:46:09,844 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-14 11:46:09,846 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([247] L714-->L714-1: Formula: (and (= v_~w~0_72 1) (not (= (ite (and (= v_~w~0_73 0) (= v_~r~0_51 0)) 1 0) 0))) InVars {~w~0=v_~w~0_73, ~r~0=v_~r~0_51} OutVars{~w~0=v_~w~0_72, writerThread1of1ForFork2_assume_abort_if_not_~cond#1=|v_writerThread1of1ForFork2_assume_abort_if_not_~cond#1_1|, writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~r~0=v_~r~0_51} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork2_assume_abort_if_not_~cond#1, writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1][98], [Black: 95#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0)), writerThread1of1ForFork3InUse, writerThread1of1ForFork2InUse, 83#true, 59#L744true, readerThread1of1ForFork0InUse, 29#L714-1true, Black: 101#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), readerThread1of1ForFork1InUse, Black: 103#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), 6#L720true, Black: 100#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 0)), 109#(= ~r~0 0), 97#true, Black: 76#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), Black: 81#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 28#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, Black: 85#(= ~y~0 0), Black: 86#(and (= ~w~0 1) (= ~y~0 0)), Black: 87#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), 45#readerEXITtrue]) [2024-06-14 11:46:09,846 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2024-06-14 11:46:09,846 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-14 11:46:09,846 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-14 11:46:09,846 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-14 11:46:09,846 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-14 11:46:09,852 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([247] L714-->L714-1: Formula: (and (= v_~w~0_72 1) (not (= (ite (and (= v_~w~0_73 0) (= v_~r~0_51 0)) 1 0) 0))) InVars {~w~0=v_~w~0_73, ~r~0=v_~r~0_51} OutVars{~w~0=v_~w~0_72, writerThread1of1ForFork2_assume_abort_if_not_~cond#1=|v_writerThread1of1ForFork2_assume_abort_if_not_~cond#1_1|, writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~r~0=v_~r~0_51} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork2_assume_abort_if_not_~cond#1, writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1][98], [Black: 95#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0)), writerThread1of1ForFork3InUse, writerThread1of1ForFork2InUse, 83#true, readerThread1of1ForFork0InUse, 29#L714-1true, readerThread1of1ForFork1InUse, Black: 101#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), 6#L720true, Black: 103#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), Black: 100#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 0)), 109#(= ~r~0 0), 97#true, Black: 76#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), 27#readerEXITtrue, Black: 81#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), Black: 85#(= ~y~0 0), 28#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, Black: 86#(and (= ~w~0 1) (= ~y~0 0)), Black: 87#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), 45#readerEXITtrue]) [2024-06-14 11:46:09,852 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2024-06-14 11:46:09,852 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-06-14 11:46:09,852 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-06-14 11:46:09,852 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-06-14 11:46:09,860 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([242] L714-->L714-1: Formula: (and (= v_~w~0_72 1) (not (= (ite (and (= v_~w~0_73 0) (= v_~r~0_51 0)) 1 0) 0))) InVars {~w~0=v_~w~0_73, ~r~0=v_~r~0_51} OutVars{~w~0=v_~w~0_72, writerThread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_writerThread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~r~0=v_~r~0_51, writerThread1of1ForFork3_assume_abort_if_not_~cond#1=|v_writerThread1of1ForFork3_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork3_assume_abort_if_not_~cond#1, writerThread1of1ForFork3_assume_abort_if_not_#in~cond#1][94], [Black: 95#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0)), writerThread1of1ForFork3InUse, writerThread1of1ForFork2InUse, 83#true, readerThread1of1ForFork0InUse, 16#L720true, Black: 101#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), readerThread1of1ForFork1InUse, Black: 103#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), Black: 100#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 0)), 109#(= ~r~0 0), 97#true, Black: 76#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), Black: 81#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 27#readerEXITtrue, 28#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 12#L714-1true, Black: 85#(= ~y~0 0), Black: 86#(and (= ~w~0 1) (= ~y~0 0)), Black: 87#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), 45#readerEXITtrue]) [2024-06-14 11:46:09,861 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2024-06-14 11:46:09,861 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-06-14 11:46:09,861 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-06-14 11:46:09,861 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-06-14 11:46:09,861 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-06-14 11:46:09,866 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([247] L714-->L714-1: Formula: (and (= v_~w~0_72 1) (not (= (ite (and (= v_~w~0_73 0) (= v_~r~0_51 0)) 1 0) 0))) InVars {~w~0=v_~w~0_73, ~r~0=v_~r~0_51} OutVars{~w~0=v_~w~0_72, writerThread1of1ForFork2_assume_abort_if_not_~cond#1=|v_writerThread1of1ForFork2_assume_abort_if_not_~cond#1_1|, writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~r~0=v_~r~0_51} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork2_assume_abort_if_not_~cond#1, writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1][98], [Black: 95#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0)), writerThread1of1ForFork3InUse, writerThread1of1ForFork2InUse, 83#true, readerThread1of1ForFork0InUse, 29#L714-1true, Black: 101#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), readerThread1of1ForFork1InUse, Black: 103#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), 6#L720true, Black: 100#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 0)), 109#(= ~r~0 0), 97#true, Black: 76#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), 27#readerEXITtrue, Black: 81#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 28#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, Black: 85#(= ~y~0 0), Black: 86#(and (= ~w~0 1) (= ~y~0 0)), Black: 87#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), 45#readerEXITtrue]) [2024-06-14 11:46:09,866 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2024-06-14 11:46:09,866 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-06-14 11:46:09,867 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-06-14 11:46:09,867 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-06-14 11:46:09,867 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-06-14 11:46:09,890 INFO L124 PetriNetUnfolderBase]: 7485/13543 cut-off events. [2024-06-14 11:46:09,891 INFO L125 PetriNetUnfolderBase]: For 50261/52356 co-relation queries the response was YES. [2024-06-14 11:46:09,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44369 conditions, 13543 events. 7485/13543 cut-off events. For 50261/52356 co-relation queries the response was YES. Maximal size of possible extension queue 667. Compared 110947 event pairs, 2690 based on Foata normal form. 842/13595 useless extension candidates. Maximal degree in co-relation 44344. Up to 4829 conditions per place. [2024-06-14 11:46:09,979 INFO L140 encePairwiseOnDemand]: 51/58 looper letters, 63 selfloop transitions, 17 changer transitions 0/117 dead transitions. [2024-06-14 11:46:09,979 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 117 transitions, 795 flow [2024-06-14 11:46:09,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-14 11:46:09,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-14 11:46:09,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 170 transitions. [2024-06-14 11:46:09,983 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7327586206896551 [2024-06-14 11:46:09,983 INFO L175 Difference]: Start difference. First operand has 77 places, 85 transitions, 573 flow. Second operand 4 states and 170 transitions. [2024-06-14 11:46:09,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 117 transitions, 795 flow [2024-06-14 11:46:10,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 117 transitions, 779 flow, removed 5 selfloop flow, removed 1 redundant places. [2024-06-14 11:46:10,026 INFO L231 Difference]: Finished difference. Result has 82 places, 85 transitions, 627 flow [2024-06-14 11:46:10,026 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=487, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=627, PETRI_PLACES=82, PETRI_TRANSITIONS=85} [2024-06-14 11:46:10,029 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 21 predicate places. [2024-06-14 11:46:10,029 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 85 transitions, 627 flow [2024-06-14 11:46:10,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 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-14 11:46:10,030 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:46:10,030 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:46:10,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-14 11:46:10,030 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-14 11:46:10,031 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:46:10,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1678712225, now seen corresponding path program 1 times [2024-06-14 11:46:10,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:46:10,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510480971] [2024-06-14 11:46:10,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:46:10,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:46:10,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:46:10,274 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-14 11:46:10,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:46:10,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510480971] [2024-06-14 11:46:10,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510480971] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:46:10,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:46:10,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 11:46:10,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062108307] [2024-06-14 11:46:10,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:46:10,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 11:46:10,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:46:10,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 11:46:10,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-06-14 11:46:10,347 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 58 [2024-06-14 11:46:10,348 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 85 transitions, 627 flow. Second operand has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 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-14 11:46:10,348 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:46:10,348 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 58 [2024-06-14 11:46:10,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:46:12,930 INFO L124 PetriNetUnfolderBase]: 17559/27535 cut-off events. [2024-06-14 11:46:12,931 INFO L125 PetriNetUnfolderBase]: For 99951/100719 co-relation queries the response was YES. [2024-06-14 11:46:13,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95160 conditions, 27535 events. 17559/27535 cut-off events. For 99951/100719 co-relation queries the response was YES. Maximal size of possible extension queue 1114. Compared 201122 event pairs, 2069 based on Foata normal form. 570/27849 useless extension candidates. Maximal degree in co-relation 95130. Up to 10804 conditions per place. [2024-06-14 11:46:13,119 INFO L140 encePairwiseOnDemand]: 43/58 looper letters, 177 selfloop transitions, 35 changer transitions 0/226 dead transitions. [2024-06-14 11:46:13,120 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 226 transitions, 1931 flow [2024-06-14 11:46:13,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 11:46:13,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 11:46:13,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 277 transitions. [2024-06-14 11:46:13,122 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6822660098522167 [2024-06-14 11:46:13,122 INFO L175 Difference]: Start difference. First operand has 82 places, 85 transitions, 627 flow. Second operand 7 states and 277 transitions. [2024-06-14 11:46:13,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 226 transitions, 1931 flow [2024-06-14 11:46:13,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 226 transitions, 1899 flow, removed 16 selfloop flow, removed 0 redundant places. [2024-06-14 11:46:13,191 INFO L231 Difference]: Finished difference. Result has 94 places, 117 transitions, 1193 flow [2024-06-14 11:46:13,192 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=615, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1193, PETRI_PLACES=94, PETRI_TRANSITIONS=117} [2024-06-14 11:46:13,192 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 33 predicate places. [2024-06-14 11:46:13,192 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 117 transitions, 1193 flow [2024-06-14 11:46:13,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 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-14 11:46:13,193 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:46:13,193 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-14 11:46:13,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-14 11:46:13,193 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-14 11:46:13,194 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:46:13,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1549403828, now seen corresponding path program 1 times [2024-06-14 11:46:13,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:46:13,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575893748] [2024-06-14 11:46:13,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:46:13,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:46:13,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:46:13,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 11:46:13,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:46:13,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575893748] [2024-06-14 11:46:13,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575893748] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:46:13,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:46:13,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 11:46:13,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896677023] [2024-06-14 11:46:13,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:46:13,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 11:46:13,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:46:13,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 11:46:13,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-14 11:46:13,459 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 58 [2024-06-14 11:46:13,460 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 117 transitions, 1193 flow. Second operand has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 6 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:46:13,460 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:46:13,460 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 58 [2024-06-14 11:46:13,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:46:15,943 INFO L124 PetriNetUnfolderBase]: 15039/24897 cut-off events. [2024-06-14 11:46:15,943 INFO L125 PetriNetUnfolderBase]: For 138912/140036 co-relation queries the response was YES. [2024-06-14 11:46:16,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100912 conditions, 24897 events. 15039/24897 cut-off events. For 138912/140036 co-relation queries the response was YES. Maximal size of possible extension queue 1076. Compared 192358 event pairs, 6611 based on Foata normal form. 262/24658 useless extension candidates. Maximal degree in co-relation 100876. Up to 19750 conditions per place. [2024-06-14 11:46:16,127 INFO L140 encePairwiseOnDemand]: 46/58 looper letters, 122 selfloop transitions, 13 changer transitions 0/158 dead transitions. [2024-06-14 11:46:16,127 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 158 transitions, 1655 flow [2024-06-14 11:46:16,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 11:46:16,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 11:46:16,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 190 transitions. [2024-06-14 11:46:16,128 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5459770114942529 [2024-06-14 11:46:16,129 INFO L175 Difference]: Start difference. First operand has 94 places, 117 transitions, 1193 flow. Second operand 6 states and 190 transitions. [2024-06-14 11:46:16,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 158 transitions, 1655 flow [2024-06-14 11:46:16,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 158 transitions, 1585 flow, removed 35 selfloop flow, removed 0 redundant places. [2024-06-14 11:46:16,359 INFO L231 Difference]: Finished difference. Result has 100 places, 119 transitions, 1183 flow [2024-06-14 11:46:16,359 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=1123, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1183, PETRI_PLACES=100, PETRI_TRANSITIONS=119} [2024-06-14 11:46:16,360 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 39 predicate places. [2024-06-14 11:46:16,360 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 119 transitions, 1183 flow [2024-06-14 11:46:16,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 6 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:46:16,360 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:46:16,360 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-14 11:46:16,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-14 11:46:16,361 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-14 11:46:16,361 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:46:16,361 INFO L85 PathProgramCache]: Analyzing trace with hash -2050380768, now seen corresponding path program 1 times [2024-06-14 11:46:16,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:46:16,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867220802] [2024-06-14 11:46:16,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:46:16,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:46:16,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:46:16,591 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-14 11:46:16,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:46:16,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867220802] [2024-06-14 11:46:16,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867220802] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:46:16,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:46:16,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 11:46:16,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911554952] [2024-06-14 11:46:16,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:46:16,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 11:46:16,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:46:16,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 11:46:16,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-14 11:46:16,678 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 58 [2024-06-14 11:46:16,678 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 119 transitions, 1183 flow. Second operand has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 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-14 11:46:16,679 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:46:16,679 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 58 [2024-06-14 11:46:16,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:46:19,405 INFO L124 PetriNetUnfolderBase]: 14963/24724 cut-off events. [2024-06-14 11:46:19,405 INFO L125 PetriNetUnfolderBase]: For 158874/159674 co-relation queries the response was YES. [2024-06-14 11:46:19,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101807 conditions, 24724 events. 14963/24724 cut-off events. For 158874/159674 co-relation queries the response was YES. Maximal size of possible extension queue 1083. Compared 193029 event pairs, 6765 based on Foata normal form. 311/24444 useless extension candidates. Maximal degree in co-relation 101767. Up to 19848 conditions per place. [2024-06-14 11:46:19,616 INFO L140 encePairwiseOnDemand]: 49/58 looper letters, 115 selfloop transitions, 26 changer transitions 0/170 dead transitions. [2024-06-14 11:46:19,616 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 170 transitions, 1697 flow [2024-06-14 11:46:19,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 11:46:19,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 11:46:19,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 211 transitions. [2024-06-14 11:46:19,618 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5197044334975369 [2024-06-14 11:46:19,618 INFO L175 Difference]: Start difference. First operand has 100 places, 119 transitions, 1183 flow. Second operand 7 states and 211 transitions. [2024-06-14 11:46:19,618 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 170 transitions, 1697 flow [2024-06-14 11:46:19,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 170 transitions, 1652 flow, removed 14 selfloop flow, removed 3 redundant places. [2024-06-14 11:46:19,800 INFO L231 Difference]: Finished difference. Result has 105 places, 129 transitions, 1301 flow [2024-06-14 11:46:19,800 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=1147, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1301, PETRI_PLACES=105, PETRI_TRANSITIONS=129} [2024-06-14 11:46:19,800 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 44 predicate places. [2024-06-14 11:46:19,801 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 129 transitions, 1301 flow [2024-06-14 11:46:19,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 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-14 11:46:19,801 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:46:19,801 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-14 11:46:19,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-14 11:46:19,801 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-14 11:46:19,802 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:46:19,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1854631479, now seen corresponding path program 1 times [2024-06-14 11:46:19,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:46:19,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463936647] [2024-06-14 11:46:19,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:46:19,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:46:19,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:46:19,982 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-14 11:46:19,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:46:19,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463936647] [2024-06-14 11:46:19,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463936647] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:46:19,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:46:19,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 11:46:19,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975860857] [2024-06-14 11:46:19,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:46:19,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 11:46:19,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:46:19,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 11:46:19,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-14 11:46:20,052 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 58 [2024-06-14 11:46:20,053 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 129 transitions, 1301 flow. Second operand has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 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-14 11:46:20,053 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:46:20,053 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 58 [2024-06-14 11:46:20,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:46:22,914 INFO L124 PetriNetUnfolderBase]: 17437/27924 cut-off events. [2024-06-14 11:46:22,915 INFO L125 PetriNetUnfolderBase]: For 182542/183166 co-relation queries the response was YES. [2024-06-14 11:46:23,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115336 conditions, 27924 events. 17437/27924 cut-off events. For 182542/183166 co-relation queries the response was YES. Maximal size of possible extension queue 1123. Compared 207412 event pairs, 6677 based on Foata normal form. 284/27885 useless extension candidates. Maximal degree in co-relation 115293. Up to 22452 conditions per place. [2024-06-14 11:46:23,122 INFO L140 encePairwiseOnDemand]: 45/58 looper letters, 154 selfloop transitions, 45 changer transitions 0/217 dead transitions. [2024-06-14 11:46:23,122 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 217 transitions, 2295 flow [2024-06-14 11:46:23,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 11:46:23,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 11:46:23,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 257 transitions. [2024-06-14 11:46:23,123 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5538793103448276 [2024-06-14 11:46:23,123 INFO L175 Difference]: Start difference. First operand has 105 places, 129 transitions, 1301 flow. Second operand 8 states and 257 transitions. [2024-06-14 11:46:23,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 217 transitions, 2295 flow [2024-06-14 11:46:23,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 217 transitions, 2261 flow, removed 16 selfloop flow, removed 1 redundant places. [2024-06-14 11:46:23,421 INFO L231 Difference]: Finished difference. Result has 117 places, 151 transitions, 1734 flow [2024-06-14 11:46:23,422 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=1267, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1734, PETRI_PLACES=117, PETRI_TRANSITIONS=151} [2024-06-14 11:46:23,422 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 56 predicate places. [2024-06-14 11:46:23,422 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 151 transitions, 1734 flow [2024-06-14 11:46:23,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 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-14 11:46:23,423 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:46:23,423 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-14 11:46:23,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-14 11:46:23,423 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-14 11:46:23,424 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:46:23,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1659002539, now seen corresponding path program 1 times [2024-06-14 11:46:23,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:46:23,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916514572] [2024-06-14 11:46:23,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:46:23,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:46:23,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:46:23,568 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-14 11:46:23,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:46:23,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916514572] [2024-06-14 11:46:23,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916514572] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:46:23,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:46:23,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 11:46:23,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943874186] [2024-06-14 11:46:23,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:46:23,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 11:46:23,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:46:23,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 11:46:23,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-14 11:46:23,700 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 58 [2024-06-14 11:46:23,701 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 151 transitions, 1734 flow. Second operand has 7 states, 7 states have (on average 17.428571428571427) internal successors, (122), 7 states have internal predecessors, (122), 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-14 11:46:23,701 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:46:23,701 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 58 [2024-06-14 11:46:23,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:46:28,234 INFO L124 PetriNetUnfolderBase]: 23331/36578 cut-off events. [2024-06-14 11:46:28,234 INFO L125 PetriNetUnfolderBase]: For 324788/325480 co-relation queries the response was YES. [2024-06-14 11:46:28,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161011 conditions, 36578 events. 23331/36578 cut-off events. For 324788/325480 co-relation queries the response was YES. Maximal size of possible extension queue 1657. Compared 278527 event pairs, 5203 based on Foata normal form. 536/36678 useless extension candidates. Maximal degree in co-relation 160961. Up to 18687 conditions per place. [2024-06-14 11:46:28,586 INFO L140 encePairwiseOnDemand]: 43/58 looper letters, 244 selfloop transitions, 87 changer transitions 0/349 dead transitions. [2024-06-14 11:46:28,587 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 349 transitions, 3790 flow [2024-06-14 11:46:28,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-06-14 11:46:28,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2024-06-14 11:46:28,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 478 transitions. [2024-06-14 11:46:28,590 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5494252873563218 [2024-06-14 11:46:28,590 INFO L175 Difference]: Start difference. First operand has 117 places, 151 transitions, 1734 flow. Second operand 15 states and 478 transitions. [2024-06-14 11:46:28,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 349 transitions, 3790 flow [2024-06-14 11:46:29,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 349 transitions, 3738 flow, removed 26 selfloop flow, removed 0 redundant places. [2024-06-14 11:46:29,295 INFO L231 Difference]: Finished difference. Result has 138 places, 183 transitions, 2434 flow [2024-06-14 11:46:29,295 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=1684, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=2434, PETRI_PLACES=138, PETRI_TRANSITIONS=183} [2024-06-14 11:46:29,296 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 77 predicate places. [2024-06-14 11:46:29,296 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 183 transitions, 2434 flow [2024-06-14 11:46:29,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.428571428571427) internal successors, (122), 7 states have internal predecessors, (122), 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-14 11:46:29,296 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:46:29,296 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:46:29,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-14 11:46:29,297 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-14 11:46:29,297 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:46:29,297 INFO L85 PathProgramCache]: Analyzing trace with hash 360468436, now seen corresponding path program 1 times [2024-06-14 11:46:29,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:46:29,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171793753] [2024-06-14 11:46:29,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:46:29,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:46:29,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:46:29,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 11:46:29,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:46:29,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171793753] [2024-06-14 11:46:29,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171793753] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:46:29,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:46:29,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 11:46:29,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228580918] [2024-06-14 11:46:29,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:46:29,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 11:46:29,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:46:29,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 11:46:29,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-14 11:46:29,555 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 58 [2024-06-14 11:46:29,556 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 183 transitions, 2434 flow. Second operand has 7 states, 7 states have (on average 17.571428571428573) internal successors, (123), 7 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:46:29,556 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:46:29,556 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 58 [2024-06-14 11:46:29,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:46:35,108 INFO L124 PetriNetUnfolderBase]: 26348/41702 cut-off events. [2024-06-14 11:46:35,108 INFO L125 PetriNetUnfolderBase]: For 515233/515957 co-relation queries the response was YES. [2024-06-14 11:46:35,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 204501 conditions, 41702 events. 26348/41702 cut-off events. For 515233/515957 co-relation queries the response was YES. Maximal size of possible extension queue 1944. Compared 328190 event pairs, 5240 based on Foata normal form. 638/41846 useless extension candidates. Maximal degree in co-relation 204442. Up to 18671 conditions per place. [2024-06-14 11:46:35,577 INFO L140 encePairwiseOnDemand]: 44/58 looper letters, 264 selfloop transitions, 80 changer transitions 0/362 dead transitions. [2024-06-14 11:46:35,577 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 362 transitions, 4714 flow [2024-06-14 11:46:35,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-14 11:46:35,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-14 11:46:35,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 417 transitions. [2024-06-14 11:46:35,579 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.553050397877984 [2024-06-14 11:46:35,579 INFO L175 Difference]: Start difference. First operand has 138 places, 183 transitions, 2434 flow. Second operand 13 states and 417 transitions. [2024-06-14 11:46:35,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 362 transitions, 4714 flow [2024-06-14 11:46:37,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 362 transitions, 4494 flow, removed 65 selfloop flow, removed 7 redundant places. [2024-06-14 11:46:37,535 INFO L231 Difference]: Finished difference. Result has 148 places, 211 transitions, 2932 flow [2024-06-14 11:46:37,536 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=2242, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2932, PETRI_PLACES=148, PETRI_TRANSITIONS=211} [2024-06-14 11:46:37,536 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 87 predicate places. [2024-06-14 11:46:37,536 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 211 transitions, 2932 flow [2024-06-14 11:46:37,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.571428571428573) internal successors, (123), 7 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:46:37,537 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:46:37,537 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-14 11:46:37,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-14 11:46:37,537 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-14 11:46:37,537 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:46:37,537 INFO L85 PathProgramCache]: Analyzing trace with hash -728996352, now seen corresponding path program 1 times [2024-06-14 11:46:37,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:46:37,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616323107] [2024-06-14 11:46:37,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:46:37,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:46:37,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:46:37,751 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-14 11:46:37,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:46:37,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616323107] [2024-06-14 11:46:37,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616323107] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:46:37,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:46:37,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 11:46:37,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666366374] [2024-06-14 11:46:37,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:46:37,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 11:46:37,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:46:37,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 11:46:37,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-06-14 11:46:37,808 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 58 [2024-06-14 11:46:37,808 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 211 transitions, 2932 flow. Second operand has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 6 states have internal predecessors, (112), 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-14 11:46:37,808 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:46:37,809 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 58 [2024-06-14 11:46:37,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:46:43,230 INFO L124 PetriNetUnfolderBase]: 24999/39031 cut-off events. [2024-06-14 11:46:43,230 INFO L125 PetriNetUnfolderBase]: For 644173/644880 co-relation queries the response was YES. [2024-06-14 11:46:43,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 210687 conditions, 39031 events. 24999/39031 cut-off events. For 644173/644880 co-relation queries the response was YES. Maximal size of possible extension queue 1924. Compared 304074 event pairs, 3388 based on Foata normal form. 704/38918 useless extension candidates. Maximal degree in co-relation 210622. Up to 18127 conditions per place. [2024-06-14 11:46:43,706 INFO L140 encePairwiseOnDemand]: 45/58 looper letters, 197 selfloop transitions, 86 changer transitions 6/321 dead transitions. [2024-06-14 11:46:43,706 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 321 transitions, 4509 flow [2024-06-14 11:46:43,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 11:46:43,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 11:46:43,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 251 transitions. [2024-06-14 11:46:43,708 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6182266009852216 [2024-06-14 11:46:43,708 INFO L175 Difference]: Start difference. First operand has 148 places, 211 transitions, 2932 flow. Second operand 7 states and 251 transitions. [2024-06-14 11:46:43,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 321 transitions, 4509 flow [2024-06-14 11:46:45,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 321 transitions, 4359 flow, removed 39 selfloop flow, removed 7 redundant places. [2024-06-14 11:46:45,783 INFO L231 Difference]: Finished difference. Result has 151 places, 224 transitions, 3303 flow [2024-06-14 11:46:45,784 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=2820, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3303, PETRI_PLACES=151, PETRI_TRANSITIONS=224} [2024-06-14 11:46:45,784 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 90 predicate places. [2024-06-14 11:46:45,784 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 224 transitions, 3303 flow [2024-06-14 11:46:45,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 6 states have internal predecessors, (112), 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-14 11:46:45,785 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:46:45,785 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-14 11:46:45,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-14 11:46:45,785 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-14 11:46:45,785 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:46:45,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1209041438, now seen corresponding path program 1 times [2024-06-14 11:46:45,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:46:45,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479140975] [2024-06-14 11:46:45,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:46:45,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:46:45,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:46:45,992 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-14 11:46:45,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:46:45,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479140975] [2024-06-14 11:46:45,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479140975] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:46:45,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:46:45,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 11:46:45,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697943563] [2024-06-14 11:46:45,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:46:45,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 11:46:45,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:46:45,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 11:46:45,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-06-14 11:46:46,071 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 58 [2024-06-14 11:46:46,072 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 224 transitions, 3303 flow. Second operand has 7 states, 7 states have (on average 18.142857142857142) internal successors, (127), 7 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:46:46,072 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:46:46,072 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 58 [2024-06-14 11:46:46,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:46:50,588 INFO L124 PetriNetUnfolderBase]: 20135/32007 cut-off events. [2024-06-14 11:46:50,588 INFO L125 PetriNetUnfolderBase]: For 536964/537520 co-relation queries the response was YES. [2024-06-14 11:46:50,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 178744 conditions, 32007 events. 20135/32007 cut-off events. For 536964/537520 co-relation queries the response was YES. Maximal size of possible extension queue 1497. Compared 245708 event pairs, 7477 based on Foata normal form. 420/32015 useless extension candidates. Maximal degree in co-relation 178677. Up to 26939 conditions per place. [2024-06-14 11:46:50,950 INFO L140 encePairwiseOnDemand]: 46/58 looper letters, 214 selfloop transitions, 54 changer transitions 0/300 dead transitions. [2024-06-14 11:46:50,950 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 300 transitions, 4353 flow [2024-06-14 11:46:50,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 11:46:50,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 11:46:50,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 268 transitions. [2024-06-14 11:46:50,952 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5134099616858238 [2024-06-14 11:46:50,952 INFO L175 Difference]: Start difference. First operand has 151 places, 224 transitions, 3303 flow. Second operand 9 states and 268 transitions. [2024-06-14 11:46:50,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 300 transitions, 4353 flow