./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-06-19_11-23-25.files/mutex-meet-nonrel/read_write_lock-2.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version eb4cb34f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-atomic/read_write_lock-2.i ./goblint.2024-06-19_11-23-25.files/mutex-meet-nonrel/read_write_lock-2.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-eb4cb34-m [2024-06-21 20:29:13,525 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-21 20:29:13,571 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-21 20:29:13,579 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-21 20:29:13,580 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-21 20:29:13,598 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-21 20:29:13,598 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-21 20:29:13,598 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-21 20:29:13,599 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-21 20:29:13,602 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-21 20:29:13,602 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-21 20:29:13,602 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-21 20:29:13,603 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-21 20:29:13,604 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-21 20:29:13,604 INFO L153 SettingsManager]: * Use SBE=true [2024-06-21 20:29:13,604 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-21 20:29:13,604 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-21 20:29:13,605 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-21 20:29:13,605 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-21 20:29:13,605 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-21 20:29:13,605 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-21 20:29:13,605 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-21 20:29:13,606 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-21 20:29:13,606 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-21 20:29:13,606 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-21 20:29:13,606 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-21 20:29:13,606 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-21 20:29:13,607 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-21 20:29:13,607 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-21 20:29:13,607 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-21 20:29:13,608 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-21 20:29:13,608 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-21 20:29:13,608 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-21 20:29:13,608 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-21 20:29:13,609 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-21 20:29:13,609 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-21 20:29:13,609 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-21 20:29:13,609 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-21 20:29:13,610 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-21 20:29:13,610 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-21 20:29:13,610 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-21 20:29:13,610 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-21 20:29:13,610 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-21 20:29:13,610 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-21 20:29:13,842 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-21 20:29:13,858 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-21 20:29:13,861 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-21 20:29:13,862 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-21 20:29:13,862 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-21 20:29:13,863 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-06-19_11-23-25.files/mutex-meet-nonrel/read_write_lock-2.yml/witness.yml [2024-06-21 20:29:13,960 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-21 20:29:13,961 INFO L274 PluginConnector]: CDTParser initialized [2024-06-21 20:29:13,961 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-21 20:29:14,874 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-21 20:29:15,089 INFO L384 CDTParser]: Found 1 translation units. [2024-06-21 20:29:15,091 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/read_write_lock-2.i [2024-06-21 20:29:15,099 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9259832e/7816e75b69854b6dbfae2106fac0c8f8/FLAG1800bffa9 [2024-06-21 20:29:15,108 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9259832e/7816e75b69854b6dbfae2106fac0c8f8 [2024-06-21 20:29:15,108 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-21 20:29:15,109 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-21 20:29:15,110 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-21 20:29:15,110 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-21 20:29:15,114 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-21 20:29:15,114 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 21.06 08:29:13" (1/2) ... [2024-06-21 20:29:15,115 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11b3fb84 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 21.06 08:29:15, skipping insertion in model container [2024-06-21 20:29:15,115 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 21.06 08:29:13" (1/2) ... [2024-06-21 20:29:15,116 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@65fa61a9 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 21.06 08:29:15, skipping insertion in model container [2024-06-21 20:29:15,116 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.06 08:29:15" (2/2) ... [2024-06-21 20:29:15,116 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11b3fb84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.06 08:29:15, skipping insertion in model container [2024-06-21 20:29:15,116 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.06 08:29:15" (2/2) ... [2024-06-21 20:29:15,117 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-21 20:29:15,145 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-21 20:29:15,146 INFO L97 edCorrectnessWitness]: Location invariant before [L753-L753] (((! multithreaded || (x == 0 || x == 3)) && (! multithreaded || (y == 0 || y == 3))) && (! multithreaded || (((w == 0 || w == 1) && (x == 0 || x == 3)) && (y == 0 || y == 3)))) && (! multithreaded || (w == 0 || w == 1)) [2024-06-21 20:29:15,146 INFO L97 edCorrectnessWitness]: Location invariant before [L751-L751] (((! multithreaded || (x == 0 || x == 3)) && (! multithreaded || (y == 0 || y == 3))) && (! multithreaded || (((w == 0 || w == 1) && (x == 0 || x == 3)) && (y == 0 || y == 3)))) && (! multithreaded || (w == 0 || w == 1)) [2024-06-21 20:29:15,147 INFO L97 edCorrectnessWitness]: Location invariant before [L750-L750] (((! multithreaded || (x == 0 || x == 3)) && (! multithreaded || (y == 0 || y == 3))) && (! multithreaded || (((w == 0 || w == 1) && (x == 0 || x == 3)) && (y == 0 || y == 3)))) && (! multithreaded || (w == 0 || w == 1)) [2024-06-21 20:29:15,147 INFO L97 edCorrectnessWitness]: Location invariant before [L752-L752] (((! multithreaded || (x == 0 || x == 3)) && (! multithreaded || (y == 0 || y == 3))) && (! multithreaded || (((w == 0 || w == 1) && (x == 0 || x == 3)) && (y == 0 || y == 3)))) && (! multithreaded || (w == 0 || w == 1)) [2024-06-21 20:29:15,147 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-21 20:29:15,147 INFO L106 edCorrectnessWitness]: ghost_update [L749-L749] multithreaded = 1; [2024-06-21 20:29:15,168 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-21 20:29:15,406 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-21 20:29:15,412 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-21 20:29:15,513 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-21 20:29:15,546 INFO L206 MainTranslator]: Completed translation [2024-06-21 20:29:15,546 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.06 08:29:15 WrapperNode [2024-06-21 20:29:15,547 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-21 20:29:15,548 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-21 20:29:15,548 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-21 20:29:15,548 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-21 20:29:15,553 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.06 08:29:15" (1/1) ... [2024-06-21 20:29:15,576 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.06 08:29:15" (1/1) ... [2024-06-21 20:29:15,607 INFO L138 Inliner]: procedures = 172, calls = 31, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 103 [2024-06-21 20:29:15,607 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-21 20:29:15,608 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-21 20:29:15,608 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-21 20:29:15,609 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-21 20:29:15,616 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.06 08:29:15" (1/1) ... [2024-06-21 20:29:15,617 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.06 08:29:15" (1/1) ... [2024-06-21 20:29:15,621 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.06 08:29:15" (1/1) ... [2024-06-21 20:29:15,630 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-21 20:29:15,630 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.06 08:29:15" (1/1) ... [2024-06-21 20:29:15,630 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.06 08:29:15" (1/1) ... [2024-06-21 20:29:15,634 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.06 08:29:15" (1/1) ... [2024-06-21 20:29:15,643 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.06 08:29:15" (1/1) ... [2024-06-21 20:29:15,644 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.06 08:29:15" (1/1) ... [2024-06-21 20:29:15,658 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.06 08:29:15" (1/1) ... [2024-06-21 20:29:15,662 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-21 20:29:15,662 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-21 20:29:15,663 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-21 20:29:15,663 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-21 20:29:15,663 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.06 08:29:15" (1/1) ... [2024-06-21 20:29:15,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-21 20:29:15,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-21 20:29:15,714 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-21 20:29:15,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-21 20:29:15,740 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-21 20:29:15,740 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-21 20:29:15,740 INFO L130 BoogieDeclarations]: Found specification of procedure reader [2024-06-21 20:29:15,741 INFO L138 BoogieDeclarations]: Found implementation of procedure reader [2024-06-21 20:29:15,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-21 20:29:15,752 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-21 20:29:15,753 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-21 20:29:15,753 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-21 20:29:15,753 INFO L130 BoogieDeclarations]: Found specification of procedure writer [2024-06-21 20:29:15,753 INFO L138 BoogieDeclarations]: Found implementation of procedure writer [2024-06-21 20:29:15,754 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-21 20:29:15,839 INFO L244 CfgBuilder]: Building ICFG [2024-06-21 20:29:15,840 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-21 20:29:15,986 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-21 20:29:15,986 INFO L293 CfgBuilder]: Performing block encoding [2024-06-21 20:29:16,045 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-21 20:29:16,045 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-21 20:29:16,045 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.06 08:29:16 BoogieIcfgContainer [2024-06-21 20:29:16,045 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-21 20:29:16,047 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-21 20:29:16,047 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-21 20:29:16,049 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-21 20:29:16,049 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 21.06 08:29:13" (1/4) ... [2024-06-21 20:29:16,050 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1356f175 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 21.06 08:29:16, skipping insertion in model container [2024-06-21 20:29:16,050 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.06 08:29:15" (2/4) ... [2024-06-21 20:29:16,050 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1356f175 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.06 08:29:16, skipping insertion in model container [2024-06-21 20:29:16,050 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.06 08:29:15" (3/4) ... [2024-06-21 20:29:16,050 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1356f175 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.06 08:29:16, skipping insertion in model container [2024-06-21 20:29:16,051 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.06 08:29:16" (4/4) ... [2024-06-21 20:29:16,051 INFO L112 eAbstractionObserver]: Analyzing ICFG read_write_lock-2.i [2024-06-21 20:29:16,063 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-21 20:29:16,064 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-06-21 20:29:16,064 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-21 20:29:16,117 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-06-21 20:29:16,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 70 places, 57 transitions, 142 flow [2024-06-21 20:29:16,186 INFO L124 PetriNetUnfolderBase]: 0/53 cut-off events. [2024-06-21 20:29:16,187 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-06-21 20:29:16,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70 conditions, 53 events. 0/53 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 97 event pairs, 0 based on Foata normal form. 0/49 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2024-06-21 20:29:16,188 INFO L82 GeneralOperation]: Start removeDead. Operand has 70 places, 57 transitions, 142 flow [2024-06-21 20:29:16,193 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 60 places, 47 transitions, 106 flow [2024-06-21 20:29:16,204 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-21 20:29:16,210 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;@1495057b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-21 20:29:16,211 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-06-21 20:29:16,214 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-21 20:29:16,214 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-06-21 20:29:16,214 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-21 20:29:16,214 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 20:29:16,215 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-21 20:29:16,216 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-21 20:29:16,220 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 20:29:16,220 INFO L85 PathProgramCache]: Analyzing trace with hash 234022191, now seen corresponding path program 1 times [2024-06-21 20:29:16,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 20:29:16,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129351219] [2024-06-21 20:29:16,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 20:29:16,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 20:29:16,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 20:29:16,466 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-21 20:29:16,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 20:29:16,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129351219] [2024-06-21 20:29:16,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129351219] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 20:29:16,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 20:29:16,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-21 20:29:16,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919717336] [2024-06-21 20:29:16,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 20:29:16,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-21 20:29:16,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 20:29:16,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-21 20:29:16,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-21 20:29:16,541 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 57 [2024-06-21 20:29:16,543 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 47 transitions, 106 flow. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-21 20:29:16,544 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 20:29:16,544 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 57 [2024-06-21 20:29:16,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 20:29:17,408 INFO L124 PetriNetUnfolderBase]: 5905/9727 cut-off events. [2024-06-21 20:29:17,409 INFO L125 PetriNetUnfolderBase]: For 119/119 co-relation queries the response was YES. [2024-06-21 20:29:17,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18097 conditions, 9727 events. 5905/9727 cut-off events. For 119/119 co-relation queries the response was YES. Maximal size of possible extension queue 398. Compared 66787 event pairs, 3124 based on Foata normal form. 9/9477 useless extension candidates. Maximal degree in co-relation 18084. Up to 8047 conditions per place. [2024-06-21 20:29:17,462 INFO L140 encePairwiseOnDemand]: 48/57 looper letters, 45 selfloop transitions, 5 changer transitions 0/65 dead transitions. [2024-06-21 20:29:17,463 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 65 transitions, 251 flow [2024-06-21 20:29:17,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-21 20:29:17,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-21 20:29:17,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions. [2024-06-21 20:29:17,472 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2024-06-21 20:29:17,474 INFO L175 Difference]: Start difference. First operand has 60 places, 47 transitions, 106 flow. Second operand 3 states and 114 transitions. [2024-06-21 20:29:17,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 65 transitions, 251 flow [2024-06-21 20:29:17,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 65 transitions, 244 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-06-21 20:29:17,478 INFO L231 Difference]: Finished difference. Result has 59 places, 51 transitions, 141 flow [2024-06-21 20:29:17,480 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=141, PETRI_PLACES=59, PETRI_TRANSITIONS=51} [2024-06-21 20:29:17,482 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -1 predicate places. [2024-06-21 20:29:17,482 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 51 transitions, 141 flow [2024-06-21 20:29:17,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-21 20:29:17,483 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 20:29:17,483 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-21 20:29:17,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-21 20:29:17,483 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-21 20:29:17,484 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 20:29:17,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1557093582, now seen corresponding path program 1 times [2024-06-21 20:29:17,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 20:29:17,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195945138] [2024-06-21 20:29:17,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 20:29:17,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 20:29:17,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 20:29:17,564 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-21 20:29:17,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 20:29:17,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195945138] [2024-06-21 20:29:17,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195945138] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 20:29:17,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 20:29:17,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-21 20:29:17,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162417868] [2024-06-21 20:29:17,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 20:29:17,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-21 20:29:17,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 20:29:17,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-21 20:29:17,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-21 20:29:17,611 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 57 [2024-06-21 20:29:17,611 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 51 transitions, 141 flow. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-21 20:29:17,612 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 20:29:17,612 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 57 [2024-06-21 20:29:17,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 20:29:18,535 INFO L124 PetriNetUnfolderBase]: 9222/14466 cut-off events. [2024-06-21 20:29:18,536 INFO L125 PetriNetUnfolderBase]: For 2061/2061 co-relation queries the response was YES. [2024-06-21 20:29:18,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30747 conditions, 14466 events. 9222/14466 cut-off events. For 2061/2061 co-relation queries the response was YES. Maximal size of possible extension queue 569. Compared 97234 event pairs, 4632 based on Foata normal form. 115/14412 useless extension candidates. Maximal degree in co-relation 30735. Up to 12366 conditions per place. [2024-06-21 20:29:18,705 INFO L140 encePairwiseOnDemand]: 44/57 looper letters, 59 selfloop transitions, 9 changer transitions 0/81 dead transitions. [2024-06-21 20:29:18,705 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 81 transitions, 353 flow [2024-06-21 20:29:18,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-21 20:29:18,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-21 20:29:18,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 148 transitions. [2024-06-21 20:29:18,711 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6491228070175439 [2024-06-21 20:29:18,711 INFO L175 Difference]: Start difference. First operand has 59 places, 51 transitions, 141 flow. Second operand 4 states and 148 transitions. [2024-06-21 20:29:18,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 81 transitions, 353 flow [2024-06-21 20:29:18,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 81 transitions, 348 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-21 20:29:18,714 INFO L231 Difference]: Finished difference. Result has 62 places, 55 transitions, 196 flow [2024-06-21 20:29:18,714 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=196, PETRI_PLACES=62, PETRI_TRANSITIONS=55} [2024-06-21 20:29:18,715 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 2 predicate places. [2024-06-21 20:29:18,715 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 55 transitions, 196 flow [2024-06-21 20:29:18,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-21 20:29:18,716 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 20:29:18,716 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 20:29:18,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-21 20:29:18,719 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-21 20:29:18,719 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 20:29:18,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1025262954, now seen corresponding path program 1 times [2024-06-21 20:29:18,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 20:29:18,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132916659] [2024-06-21 20:29:18,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 20:29:18,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 20:29:18,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 20:29:18,784 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-21 20:29:18,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 20:29:18,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132916659] [2024-06-21 20:29:18,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132916659] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 20:29:18,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 20:29:18,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-21 20:29:18,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946562901] [2024-06-21 20:29:18,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 20:29:18,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-21 20:29:18,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 20:29:18,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-21 20:29:18,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-21 20:29:18,808 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 57 [2024-06-21 20:29:18,809 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 55 transitions, 196 flow. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-21 20:29:18,809 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 20:29:18,809 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 57 [2024-06-21 20:29:18,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 20:29:19,676 INFO L124 PetriNetUnfolderBase]: 8409/13367 cut-off events. [2024-06-21 20:29:19,677 INFO L125 PetriNetUnfolderBase]: For 5918/5918 co-relation queries the response was YES. [2024-06-21 20:29:19,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33209 conditions, 13367 events. 8409/13367 cut-off events. For 5918/5918 co-relation queries the response was YES. Maximal size of possible extension queue 552. Compared 90932 event pairs, 2749 based on Foata normal form. 339/13395 useless extension candidates. Maximal degree in co-relation 33195. Up to 9313 conditions per place. [2024-06-21 20:29:19,749 INFO L140 encePairwiseOnDemand]: 42/57 looper letters, 79 selfloop transitions, 21 changer transitions 0/113 dead transitions. [2024-06-21 20:29:19,749 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 113 transitions, 588 flow [2024-06-21 20:29:19,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-21 20:29:19,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-21 20:29:19,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 192 transitions. [2024-06-21 20:29:19,750 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6736842105263158 [2024-06-21 20:29:19,751 INFO L175 Difference]: Start difference. First operand has 62 places, 55 transitions, 196 flow. Second operand 5 states and 192 transitions. [2024-06-21 20:29:19,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 113 transitions, 588 flow [2024-06-21 20:29:19,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 113 transitions, 572 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-06-21 20:29:19,754 INFO L231 Difference]: Finished difference. Result has 67 places, 67 transitions, 349 flow [2024-06-21 20:29:19,754 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=349, PETRI_PLACES=67, PETRI_TRANSITIONS=67} [2024-06-21 20:29:19,755 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 7 predicate places. [2024-06-21 20:29:19,755 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 67 transitions, 349 flow [2024-06-21 20:29:19,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-21 20:29:19,755 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 20:29:19,755 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 20:29:19,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-21 20:29:19,756 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-21 20:29:19,756 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 20:29:19,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1086916175, now seen corresponding path program 1 times [2024-06-21 20:29:19,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 20:29:19,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733170819] [2024-06-21 20:29:19,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 20:29:19,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 20:29:19,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 20:29:19,817 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-21 20:29:19,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 20:29:19,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733170819] [2024-06-21 20:29:19,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733170819] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 20:29:19,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 20:29:19,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-21 20:29:19,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489640627] [2024-06-21 20:29:19,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 20:29:19,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-21 20:29:19,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 20:29:19,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-21 20:29:19,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-21 20:29:19,858 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 57 [2024-06-21 20:29:19,858 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 67 transitions, 349 flow. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-21 20:29:19,859 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 20:29:19,859 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 57 [2024-06-21 20:29:19,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 20:29:20,758 INFO L124 PetriNetUnfolderBase]: 8195/12989 cut-off events. [2024-06-21 20:29:20,758 INFO L125 PetriNetUnfolderBase]: For 17383/17392 co-relation queries the response was YES. [2024-06-21 20:29:20,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40359 conditions, 12989 events. 8195/12989 cut-off events. For 17383/17392 co-relation queries the response was YES. Maximal size of possible extension queue 545. Compared 88090 event pairs, 2416 based on Foata normal form. 110/12776 useless extension candidates. Maximal degree in co-relation 40342. Up to 9283 conditions per place. [2024-06-21 20:29:20,831 INFO L140 encePairwiseOnDemand]: 44/57 looper letters, 79 selfloop transitions, 17 changer transitions 0/109 dead transitions. [2024-06-21 20:29:20,831 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 109 transitions, 671 flow [2024-06-21 20:29:20,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-21 20:29:20,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-21 20:29:20,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 186 transitions. [2024-06-21 20:29:20,832 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6526315789473685 [2024-06-21 20:29:20,832 INFO L175 Difference]: Start difference. First operand has 67 places, 67 transitions, 349 flow. Second operand 5 states and 186 transitions. [2024-06-21 20:29:20,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 109 transitions, 671 flow [2024-06-21 20:29:20,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 109 transitions, 663 flow, removed 4 selfloop flow, removed 0 redundant places. [2024-06-21 20:29:20,851 INFO L231 Difference]: Finished difference. Result has 71 places, 66 transitions, 379 flow [2024-06-21 20:29:20,852 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=333, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=379, PETRI_PLACES=71, PETRI_TRANSITIONS=66} [2024-06-21 20:29:20,853 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 11 predicate places. [2024-06-21 20:29:20,853 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 66 transitions, 379 flow [2024-06-21 20:29:20,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-21 20:29:20,853 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 20:29:20,853 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 20:29:20,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-21 20:29:20,854 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-21 20:29:20,854 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 20:29:20,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1003026236, now seen corresponding path program 1 times [2024-06-21 20:29:20,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 20:29:20,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610950481] [2024-06-21 20:29:20,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 20:29:20,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 20:29:20,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 20:29:20,985 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-21 20:29:20,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 20:29:20,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610950481] [2024-06-21 20:29:20,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610950481] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 20:29:20,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 20:29:20,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-21 20:29:20,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979413505] [2024-06-21 20:29:20,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 20:29:20,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-21 20:29:20,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 20:29:20,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-21 20:29:20,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-06-21 20:29:21,024 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 57 [2024-06-21 20:29:21,024 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 66 transitions, 379 flow. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-21 20:29:21,024 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 20:29:21,024 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 57 [2024-06-21 20:29:21,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 20:29:22,005 INFO L124 PetriNetUnfolderBase]: 10109/16326 cut-off events. [2024-06-21 20:29:22,005 INFO L125 PetriNetUnfolderBase]: For 29329/29343 co-relation queries the response was YES. [2024-06-21 20:29:22,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51911 conditions, 16326 events. 10109/16326 cut-off events. For 29329/29343 co-relation queries the response was YES. Maximal size of possible extension queue 636. Compared 115596 event pairs, 3953 based on Foata normal form. 46/15979 useless extension candidates. Maximal degree in co-relation 51891. Up to 12984 conditions per place. [2024-06-21 20:29:22,118 INFO L140 encePairwiseOnDemand]: 47/57 looper letters, 88 selfloop transitions, 22 changer transitions 0/125 dead transitions. [2024-06-21 20:29:22,118 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 125 transitions, 872 flow [2024-06-21 20:29:22,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-21 20:29:22,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-21 20:29:22,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 204 transitions. [2024-06-21 20:29:22,119 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5964912280701754 [2024-06-21 20:29:22,120 INFO L175 Difference]: Start difference. First operand has 71 places, 66 transitions, 379 flow. Second operand 6 states and 204 transitions. [2024-06-21 20:29:22,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 125 transitions, 872 flow [2024-06-21 20:29:22,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 125 transitions, 830 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-06-21 20:29:22,138 INFO L231 Difference]: Finished difference. Result has 76 places, 84 transitions, 571 flow [2024-06-21 20:29:22,138 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=342, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=571, PETRI_PLACES=76, PETRI_TRANSITIONS=84} [2024-06-21 20:29:22,139 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 16 predicate places. [2024-06-21 20:29:22,139 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 84 transitions, 571 flow [2024-06-21 20:29:22,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-21 20:29:22,139 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 20:29:22,139 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 20:29:22,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-21 20:29:22,140 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-21 20:29:22,140 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 20:29:22,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1857488155, now seen corresponding path program 1 times [2024-06-21 20:29:22,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 20:29:22,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401387649] [2024-06-21 20:29:22,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 20:29:22,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 20:29:22,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 20:29:22,214 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-21 20:29:22,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 20:29:22,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401387649] [2024-06-21 20:29:22,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401387649] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 20:29:22,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 20:29:22,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-21 20:29:22,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253997933] [2024-06-21 20:29:22,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 20:29:22,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-21 20:29:22,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 20:29:22,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-21 20:29:22,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-06-21 20:29:22,242 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 57 [2024-06-21 20:29:22,242 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 84 transitions, 571 flow. Second operand has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 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-21 20:29:22,243 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 20:29:22,243 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 57 [2024-06-21 20:29:22,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 20:29:23,556 INFO L124 PetriNetUnfolderBase]: 10960/17300 cut-off events. [2024-06-21 20:29:23,556 INFO L125 PetriNetUnfolderBase]: For 44446/44453 co-relation queries the response was YES. [2024-06-21 20:29:23,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58206 conditions, 17300 events. 10960/17300 cut-off events. For 44446/44453 co-relation queries the response was YES. Maximal size of possible extension queue 673. Compared 118639 event pairs, 3742 based on Foata normal form. 564/17592 useless extension candidates. Maximal degree in co-relation 58184. Up to 13327 conditions per place. [2024-06-21 20:29:23,694 INFO L140 encePairwiseOnDemand]: 43/57 looper letters, 134 selfloop transitions, 32 changer transitions 0/177 dead transitions. [2024-06-21 20:29:23,694 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 177 transitions, 1289 flow [2024-06-21 20:29:23,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-21 20:29:23,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-21 20:29:23,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 261 transitions. [2024-06-21 20:29:23,695 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6541353383458647 [2024-06-21 20:29:23,696 INFO L175 Difference]: Start difference. First operand has 76 places, 84 transitions, 571 flow. Second operand 7 states and 261 transitions. [2024-06-21 20:29:23,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 177 transitions, 1289 flow [2024-06-21 20:29:23,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 177 transitions, 1279 flow, removed 5 selfloop flow, removed 0 redundant places. [2024-06-21 20:29:23,762 INFO L231 Difference]: Finished difference. Result has 86 places, 101 transitions, 832 flow [2024-06-21 20:29:23,762 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=561, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=832, PETRI_PLACES=86, PETRI_TRANSITIONS=101} [2024-06-21 20:29:23,764 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 26 predicate places. [2024-06-21 20:29:23,764 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 101 transitions, 832 flow [2024-06-21 20:29:23,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 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-21 20:29:23,765 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 20:29:23,765 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 20:29:23,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-21 20:29:23,765 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-21 20:29:23,766 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 20:29:23,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1836240445, now seen corresponding path program 2 times [2024-06-21 20:29:23,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 20:29:23,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801016614] [2024-06-21 20:29:23,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 20:29:23,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 20:29:23,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 20:29:23,881 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-21 20:29:23,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 20:29:23,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801016614] [2024-06-21 20:29:23,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801016614] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 20:29:23,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 20:29:23,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-21 20:29:23,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205385440] [2024-06-21 20:29:23,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 20:29:23,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-21 20:29:23,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 20:29:23,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-21 20:29:23,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-21 20:29:23,925 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 57 [2024-06-21 20:29:23,925 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 101 transitions, 832 flow. Second operand has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 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-21 20:29:23,925 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 20:29:23,925 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 57 [2024-06-21 20:29:23,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 20:29:25,351 INFO L124 PetriNetUnfolderBase]: 11241/17803 cut-off events. [2024-06-21 20:29:25,352 INFO L125 PetriNetUnfolderBase]: For 84883/84899 co-relation queries the response was YES. [2024-06-21 20:29:25,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71097 conditions, 17803 events. 11241/17803 cut-off events. For 84883/84899 co-relation queries the response was YES. Maximal size of possible extension queue 694. Compared 123493 event pairs, 3942 based on Foata normal form. 72/17576 useless extension candidates. Maximal degree in co-relation 71069. Up to 13483 conditions per place. [2024-06-21 20:29:25,540 INFO L140 encePairwiseOnDemand]: 45/57 looper letters, 136 selfloop transitions, 40 changer transitions 0/187 dead transitions. [2024-06-21 20:29:25,541 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 187 transitions, 1664 flow [2024-06-21 20:29:25,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-21 20:29:25,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-21 20:29:25,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 247 transitions. [2024-06-21 20:29:25,545 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6190476190476191 [2024-06-21 20:29:25,545 INFO L175 Difference]: Start difference. First operand has 86 places, 101 transitions, 832 flow. Second operand 7 states and 247 transitions. [2024-06-21 20:29:25,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 187 transitions, 1664 flow [2024-06-21 20:29:25,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 187 transitions, 1613 flow, removed 19 selfloop flow, removed 1 redundant places. [2024-06-21 20:29:25,650 INFO L231 Difference]: Finished difference. Result has 94 places, 114 transitions, 1039 flow [2024-06-21 20:29:25,650 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=781, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1039, PETRI_PLACES=94, PETRI_TRANSITIONS=114} [2024-06-21 20:29:25,651 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 34 predicate places. [2024-06-21 20:29:25,651 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 114 transitions, 1039 flow [2024-06-21 20:29:25,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 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-21 20:29:25,651 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 20:29:25,651 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 20:29:25,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-21 20:29:25,652 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-21 20:29:25,652 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 20:29:25,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1835584795, now seen corresponding path program 3 times [2024-06-21 20:29:25,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 20:29:25,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788370228] [2024-06-21 20:29:25,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 20:29:25,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 20:29:25,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 20:29:25,728 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-21 20:29:25,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 20:29:25,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788370228] [2024-06-21 20:29:25,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788370228] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 20:29:25,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 20:29:25,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-21 20:29:25,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99511352] [2024-06-21 20:29:25,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 20:29:25,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-21 20:29:25,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 20:29:25,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-21 20:29:25,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-21 20:29:25,770 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 57 [2024-06-21 20:29:25,770 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 114 transitions, 1039 flow. Second operand has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 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-21 20:29:25,771 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 20:29:25,771 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 57 [2024-06-21 20:29:25,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 20:29:27,371 INFO L124 PetriNetUnfolderBase]: 11288/18070 cut-off events. [2024-06-21 20:29:27,372 INFO L125 PetriNetUnfolderBase]: For 105435/105442 co-relation queries the response was YES. [2024-06-21 20:29:27,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75731 conditions, 18070 events. 11288/18070 cut-off events. For 105435/105442 co-relation queries the response was YES. Maximal size of possible extension queue 707. Compared 127408 event pairs, 3681 based on Foata normal form. 66/17859 useless extension candidates. Maximal degree in co-relation 75699. Up to 13519 conditions per place. [2024-06-21 20:29:27,510 INFO L140 encePairwiseOnDemand]: 45/57 looper letters, 120 selfloop transitions, 69 changer transitions 0/200 dead transitions. [2024-06-21 20:29:27,510 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 200 transitions, 1857 flow [2024-06-21 20:29:27,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-21 20:29:27,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-21 20:29:27,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 269 transitions. [2024-06-21 20:29:27,511 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5899122807017544 [2024-06-21 20:29:27,511 INFO L175 Difference]: Start difference. First operand has 94 places, 114 transitions, 1039 flow. Second operand 8 states and 269 transitions. [2024-06-21 20:29:27,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 200 transitions, 1857 flow [2024-06-21 20:29:27,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 200 transitions, 1756 flow, removed 39 selfloop flow, removed 1 redundant places. [2024-06-21 20:29:27,671 INFO L231 Difference]: Finished difference. Result has 102 places, 133 transitions, 1338 flow [2024-06-21 20:29:27,671 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=966, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1338, PETRI_PLACES=102, PETRI_TRANSITIONS=133} [2024-06-21 20:29:27,672 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 42 predicate places. [2024-06-21 20:29:27,672 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 133 transitions, 1338 flow [2024-06-21 20:29:27,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 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-21 20:29:27,672 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 20:29:27,672 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 20:29:27,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-21 20:29:27,673 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-21 20:29:27,673 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 20:29:27,673 INFO L85 PathProgramCache]: Analyzing trace with hash 133064919, now seen corresponding path program 1 times [2024-06-21 20:29:27,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 20:29:27,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88109376] [2024-06-21 20:29:27,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 20:29:27,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 20:29:27,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 20:29:27,705 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-21 20:29:27,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 20:29:27,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88109376] [2024-06-21 20:29:27,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88109376] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 20:29:27,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 20:29:27,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-21 20:29:27,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946851302] [2024-06-21 20:29:27,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 20:29:27,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-21 20:29:27,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 20:29:27,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-21 20:29:27,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-21 20:29:27,714 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 57 [2024-06-21 20:29:27,715 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 133 transitions, 1338 flow. Second operand has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-21 20:29:27,715 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 20:29:27,715 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 57 [2024-06-21 20:29:27,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 20:29:28,678 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([242] L714-->L714-1: Formula: (and (= v_~w~0_78 1) (not (= (ite (and (= v_~r~0_57 0) (= v_~w~0_79 0)) 1 0) 0))) InVars {~w~0=v_~w~0_79, ~r~0=v_~r~0_57} OutVars{~w~0=v_~w~0_78, writerThread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_writerThread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~r~0=v_~r~0_57, writerThread1of1ForFork3_assume_abort_if_not_~cond#1=|v_writerThread1of1ForFork3_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork3_assume_abort_if_not_~cond#1, writerThread1of1ForFork3_assume_abort_if_not_#in~cond#1][92], [Black: 125#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1) (= ~y~0 0)), writerThread1of1ForFork3InUse, writerThread1of1ForFork2InUse, readerThread1of1ForFork0InUse, readerThread1of1ForFork1InUse, Black: 138#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1) (= ~y~0 0)), Black: 134#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 118#true, Black: 75#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), Black: 80#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 106#true, 15#L720true, Black: 85#(and (= ~w~0 1) (= ~y~0 0)), 96#true, Black: 86#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), Black: 84#(= ~y~0 0), 58#L744true, 82#true, Black: 94#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0)), Black: 99#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 0)), Black: 102#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), Black: 100#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), 10#L744true, 27#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, Black: 113#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1) (= ~y~0 0)), Black: 111#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), Black: 110#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1)), Black: 109#(and (= ~x~0 0) (= ~w~0 1)), 143#(= ~r~0 0), 11#L714-1true, 129#true, Black: 122#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1)), Black: 123#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0))]) [2024-06-21 20:29:28,678 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-06-21 20:29:28,678 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-06-21 20:29:28,678 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-06-21 20:29:28,678 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-06-21 20:29:28,688 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([247] L714-->L714-1: Formula: (and (= v_~w~0_78 1) (not (= (ite (and (= v_~r~0_57 0) (= v_~w~0_79 0)) 1 0) 0))) InVars {~w~0=v_~w~0_79, ~r~0=v_~r~0_57} OutVars{~w~0=v_~w~0_78, writerThread1of1ForFork2_assume_abort_if_not_~cond#1=|v_writerThread1of1ForFork2_assume_abort_if_not_~cond#1_1|, writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~r~0=v_~r~0_57} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork2_assume_abort_if_not_~cond#1, writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1][96], [Black: 125#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1) (= ~y~0 0)), writerThread1of1ForFork3InUse, writerThread1of1ForFork2InUse, readerThread1of1ForFork0InUse, readerThread1of1ForFork1InUse, Black: 138#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1) (= ~y~0 0)), Black: 75#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), 118#true, Black: 134#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), Black: 80#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 106#true, Black: 85#(and (= ~w~0 1) (= ~y~0 0)), 96#true, Black: 86#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), Black: 84#(= ~y~0 0), 58#L744true, 82#true, Black: 94#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0)), Black: 99#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 0)), Black: 102#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), Black: 100#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), 10#L744true, 5#L720true, Black: 113#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1) (= ~y~0 0)), 27#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, Black: 111#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), Black: 110#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1)), Black: 109#(and (= ~x~0 0) (= ~w~0 1)), 143#(= ~r~0 0), 28#L714-1true, 129#true, Black: 122#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1)), Black: 123#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0))]) [2024-06-21 20:29:28,689 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-06-21 20:29:28,689 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-06-21 20:29:28,689 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-06-21 20:29:28,689 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-06-21 20:29:28,717 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([242] L714-->L714-1: Formula: (and (= v_~w~0_78 1) (not (= (ite (and (= v_~r~0_57 0) (= v_~w~0_79 0)) 1 0) 0))) InVars {~w~0=v_~w~0_79, ~r~0=v_~r~0_57} OutVars{~w~0=v_~w~0_78, writerThread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_writerThread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~r~0=v_~r~0_57, writerThread1of1ForFork3_assume_abort_if_not_~cond#1=|v_writerThread1of1ForFork3_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork3_assume_abort_if_not_~cond#1, writerThread1of1ForFork3_assume_abort_if_not_#in~cond#1][92], [Black: 125#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1) (= ~y~0 0)), writerThread1of1ForFork3InUse, writerThread1of1ForFork2InUse, readerThread1of1ForFork0InUse, readerThread1of1ForFork1InUse, Black: 138#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1) (= ~y~0 0)), Black: 134#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 118#true, Black: 75#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), Black: 80#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 106#true, 15#L720true, Black: 85#(and (= ~w~0 1) (= ~y~0 0)), 96#true, Black: 86#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), Black: 84#(= ~y~0 0), 82#true, Black: 94#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0)), 26#readerEXITtrue, Black: 99#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 0)), Black: 102#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), Black: 100#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), 10#L744true, 27#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, Black: 113#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1) (= ~y~0 0)), Black: 111#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), Black: 110#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1)), Black: 109#(and (= ~x~0 0) (= ~w~0 1)), 143#(= ~r~0 0), 11#L714-1true, 129#true, Black: 122#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1)), Black: 123#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0))]) [2024-06-21 20:29:28,717 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-06-21 20:29:28,717 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-06-21 20:29:28,717 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-06-21 20:29:28,717 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-06-21 20:29:28,718 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([242] L714-->L714-1: Formula: (and (= v_~w~0_78 1) (not (= (ite (and (= v_~r~0_57 0) (= v_~w~0_79 0)) 1 0) 0))) InVars {~w~0=v_~w~0_79, ~r~0=v_~r~0_57} OutVars{~w~0=v_~w~0_78, writerThread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_writerThread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~r~0=v_~r~0_57, writerThread1of1ForFork3_assume_abort_if_not_~cond#1=|v_writerThread1of1ForFork3_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork3_assume_abort_if_not_~cond#1, writerThread1of1ForFork3_assume_abort_if_not_#in~cond#1][92], [Black: 125#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1) (= ~y~0 0)), writerThread1of1ForFork3InUse, writerThread1of1ForFork2InUse, readerThread1of1ForFork0InUse, readerThread1of1ForFork1InUse, Black: 138#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1) (= ~y~0 0)), Black: 75#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), Black: 134#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 118#true, Black: 80#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 106#true, 15#L720true, Black: 85#(and (= ~w~0 1) (= ~y~0 0)), 96#true, Black: 86#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), Black: 84#(= ~y~0 0), 58#L744true, 45#readerEXITtrue, 82#true, Black: 94#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0)), Black: 99#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 0)), Black: 102#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), Black: 100#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), Black: 113#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1) (= ~y~0 0)), 27#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, Black: 111#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), Black: 110#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1)), Black: 109#(and (= ~x~0 0) (= ~w~0 1)), 143#(= ~r~0 0), 11#L714-1true, 129#true, Black: 122#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1)), Black: 123#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0))]) [2024-06-21 20:29:28,718 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-06-21 20:29:28,718 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-06-21 20:29:28,718 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-06-21 20:29:28,718 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-06-21 20:29:28,726 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([247] L714-->L714-1: Formula: (and (= v_~w~0_78 1) (not (= (ite (and (= v_~r~0_57 0) (= v_~w~0_79 0)) 1 0) 0))) InVars {~w~0=v_~w~0_79, ~r~0=v_~r~0_57} OutVars{~w~0=v_~w~0_78, writerThread1of1ForFork2_assume_abort_if_not_~cond#1=|v_writerThread1of1ForFork2_assume_abort_if_not_~cond#1_1|, writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~r~0=v_~r~0_57} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork2_assume_abort_if_not_~cond#1, writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1][96], [Black: 125#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1) (= ~y~0 0)), writerThread1of1ForFork3InUse, writerThread1of1ForFork2InUse, readerThread1of1ForFork0InUse, readerThread1of1ForFork1InUse, Black: 138#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1) (= ~y~0 0)), 118#true, Black: 134#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), Black: 75#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), Black: 80#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 106#true, Black: 85#(and (= ~w~0 1) (= ~y~0 0)), 96#true, Black: 86#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), Black: 84#(= ~y~0 0), 82#true, Black: 94#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0)), 26#readerEXITtrue, Black: 99#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 0)), Black: 102#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), Black: 100#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), 10#L744true, 5#L720true, 27#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, Black: 113#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1) (= ~y~0 0)), Black: 111#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), Black: 110#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1)), Black: 109#(and (= ~x~0 0) (= ~w~0 1)), 143#(= ~r~0 0), 28#L714-1true, 129#true, Black: 122#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1)), Black: 123#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0))]) [2024-06-21 20:29:28,726 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-06-21 20:29:28,726 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-06-21 20:29:28,726 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-06-21 20:29:28,726 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-06-21 20:29:28,727 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([247] L714-->L714-1: Formula: (and (= v_~w~0_78 1) (not (= (ite (and (= v_~r~0_57 0) (= v_~w~0_79 0)) 1 0) 0))) InVars {~w~0=v_~w~0_79, ~r~0=v_~r~0_57} OutVars{~w~0=v_~w~0_78, writerThread1of1ForFork2_assume_abort_if_not_~cond#1=|v_writerThread1of1ForFork2_assume_abort_if_not_~cond#1_1|, writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~r~0=v_~r~0_57} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork2_assume_abort_if_not_~cond#1, writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1][96], [Black: 125#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1) (= ~y~0 0)), writerThread1of1ForFork3InUse, writerThread1of1ForFork2InUse, readerThread1of1ForFork0InUse, readerThread1of1ForFork1InUse, Black: 138#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1) (= ~y~0 0)), Black: 75#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), 118#true, Black: 134#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), Black: 80#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 106#true, Black: 85#(and (= ~w~0 1) (= ~y~0 0)), 96#true, Black: 86#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), Black: 84#(= ~y~0 0), 58#L744true, 45#readerEXITtrue, 82#true, Black: 94#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0)), Black: 99#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 0)), Black: 102#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), Black: 100#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), 5#L720true, Black: 113#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1) (= ~y~0 0)), 27#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, Black: 111#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), Black: 110#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1)), Black: 109#(and (= ~x~0 0) (= ~w~0 1)), 143#(= ~r~0 0), 28#L714-1true, 129#true, Black: 122#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1)), Black: 123#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0))]) [2024-06-21 20:29:28,727 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-06-21 20:29:28,727 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-06-21 20:29:28,727 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-06-21 20:29:28,727 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-06-21 20:29:28,747 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([242] L714-->L714-1: Formula: (and (= v_~w~0_78 1) (not (= (ite (and (= v_~r~0_57 0) (= v_~w~0_79 0)) 1 0) 0))) InVars {~w~0=v_~w~0_79, ~r~0=v_~r~0_57} OutVars{~w~0=v_~w~0_78, writerThread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_writerThread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~r~0=v_~r~0_57, writerThread1of1ForFork3_assume_abort_if_not_~cond#1=|v_writerThread1of1ForFork3_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork3_assume_abort_if_not_~cond#1, writerThread1of1ForFork3_assume_abort_if_not_#in~cond#1][92], [Black: 125#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1) (= ~y~0 0)), writerThread1of1ForFork3InUse, writerThread1of1ForFork2InUse, readerThread1of1ForFork0InUse, readerThread1of1ForFork1InUse, Black: 138#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1) (= ~y~0 0)), Black: 134#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 118#true, Black: 75#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), Black: 80#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 106#true, 15#L720true, Black: 85#(and (= ~w~0 1) (= ~y~0 0)), 96#true, Black: 86#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), Black: 84#(= ~y~0 0), 45#readerEXITtrue, 82#true, Black: 94#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0)), 26#readerEXITtrue, Black: 99#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 0)), Black: 102#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), Black: 100#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), 27#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, Black: 113#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1) (= ~y~0 0)), Black: 111#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), Black: 110#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1)), Black: 109#(and (= ~x~0 0) (= ~w~0 1)), 143#(= ~r~0 0), 11#L714-1true, 129#true, Black: 122#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1)), Black: 123#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0))]) [2024-06-21 20:29:28,747 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2024-06-21 20:29:28,747 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-21 20:29:28,747 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-21 20:29:28,747 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-21 20:29:28,754 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([247] L714-->L714-1: Formula: (and (= v_~w~0_78 1) (not (= (ite (and (= v_~r~0_57 0) (= v_~w~0_79 0)) 1 0) 0))) InVars {~w~0=v_~w~0_79, ~r~0=v_~r~0_57} OutVars{~w~0=v_~w~0_78, writerThread1of1ForFork2_assume_abort_if_not_~cond#1=|v_writerThread1of1ForFork2_assume_abort_if_not_~cond#1_1|, writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~r~0=v_~r~0_57} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork2_assume_abort_if_not_~cond#1, writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1][96], [Black: 125#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1) (= ~y~0 0)), writerThread1of1ForFork3InUse, writerThread1of1ForFork2InUse, readerThread1of1ForFork0InUse, readerThread1of1ForFork1InUse, Black: 138#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1) (= ~y~0 0)), 118#true, Black: 134#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), Black: 75#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), Black: 80#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 106#true, Black: 85#(and (= ~w~0 1) (= ~y~0 0)), 96#true, Black: 86#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), Black: 84#(= ~y~0 0), 45#readerEXITtrue, 82#true, Black: 94#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0)), 26#readerEXITtrue, Black: 99#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 0)), Black: 102#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), Black: 100#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), 5#L720true, Black: 113#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1) (= ~y~0 0)), 27#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, Black: 111#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), Black: 110#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1)), Black: 109#(and (= ~x~0 0) (= ~w~0 1)), 143#(= ~r~0 0), 28#L714-1true, 129#true, Black: 122#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1)), Black: 123#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0))]) [2024-06-21 20:29:28,755 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2024-06-21 20:29:28,755 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-21 20:29:28,755 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-21 20:29:28,755 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-21 20:29:28,787 INFO L124 PetriNetUnfolderBase]: 7403/13598 cut-off events. [2024-06-21 20:29:28,788 INFO L125 PetriNetUnfolderBase]: For 163181/166015 co-relation queries the response was YES. [2024-06-21 20:29:28,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60308 conditions, 13598 events. 7403/13598 cut-off events. For 163181/166015 co-relation queries the response was YES. Maximal size of possible extension queue 702. Compared 113622 event pairs, 2652 based on Foata normal form. 855/13671 useless extension candidates. Maximal degree in co-relation 60272. Up to 4501 conditions per place. [2024-06-21 20:29:28,913 INFO L140 encePairwiseOnDemand]: 50/57 looper letters, 61 selfloop transitions, 17 changer transitions 0/142 dead transitions. [2024-06-21 20:29:28,914 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 142 transitions, 1297 flow [2024-06-21 20:29:28,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-21 20:29:28,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-21 20:29:28,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 172 transitions. [2024-06-21 20:29:28,914 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7543859649122807 [2024-06-21 20:29:28,915 INFO L175 Difference]: Start difference. First operand has 102 places, 133 transitions, 1338 flow. Second operand 4 states and 172 transitions. [2024-06-21 20:29:28,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 142 transitions, 1297 flow [2024-06-21 20:29:29,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 142 transitions, 1192 flow, removed 26 selfloop flow, removed 4 redundant places. [2024-06-21 20:29:29,225 INFO L231 Difference]: Finished difference. Result has 104 places, 110 transitions, 1036 flow [2024-06-21 20:29:29,226 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=872, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1036, PETRI_PLACES=104, PETRI_TRANSITIONS=110} [2024-06-21 20:29:29,226 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 44 predicate places. [2024-06-21 20:29:29,226 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 110 transitions, 1036 flow [2024-06-21 20:29:29,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-21 20:29:29,227 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 20:29:29,227 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 20:29:29,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-21 20:29:29,227 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-21 20:29:29,227 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 20:29:29,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1844004672, now seen corresponding path program 1 times [2024-06-21 20:29:29,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 20:29:29,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687078895] [2024-06-21 20:29:29,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 20:29:29,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 20:29:29,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 20:29:29,290 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-21 20:29:29,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 20:29:29,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687078895] [2024-06-21 20:29:29,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687078895] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 20:29:29,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 20:29:29,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-21 20:29:29,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092010038] [2024-06-21 20:29:29,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 20:29:29,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-21 20:29:29,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 20:29:29,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-21 20:29:29,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-06-21 20:29:29,344 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 57 [2024-06-21 20:29:29,345 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 110 transitions, 1036 flow. Second operand has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 6 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-21 20:29:29,345 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 20:29:29,345 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 57 [2024-06-21 20:29:29,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 20:29:31,255 INFO L124 PetriNetUnfolderBase]: 15619/25241 cut-off events. [2024-06-21 20:29:31,256 INFO L125 PetriNetUnfolderBase]: For 256057/256927 co-relation queries the response was YES. [2024-06-21 20:29:31,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108747 conditions, 25241 events. 15619/25241 cut-off events. For 256057/256927 co-relation queries the response was YES. Maximal size of possible extension queue 1021. Compared 188044 event pairs, 2153 based on Foata normal form. 554/25520 useless extension candidates. Maximal degree in co-relation 108708. Up to 9355 conditions per place. [2024-06-21 20:29:31,529 INFO L140 encePairwiseOnDemand]: 42/57 looper letters, 173 selfloop transitions, 51 changer transitions 0/239 dead transitions. [2024-06-21 20:29:31,529 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 239 transitions, 2522 flow [2024-06-21 20:29:31,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-21 20:29:31,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-21 20:29:31,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 280 transitions. [2024-06-21 20:29:31,530 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7017543859649122 [2024-06-21 20:29:31,530 INFO L175 Difference]: Start difference. First operand has 104 places, 110 transitions, 1036 flow. Second operand 7 states and 280 transitions. [2024-06-21 20:29:31,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 239 transitions, 2522 flow [2024-06-21 20:29:32,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 239 transitions, 2492 flow, removed 15 selfloop flow, removed 0 redundant places. [2024-06-21 20:29:32,137 INFO L231 Difference]: Finished difference. Result has 115 places, 136 transitions, 1734 flow [2024-06-21 20:29:32,138 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=1022, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1734, PETRI_PLACES=115, PETRI_TRANSITIONS=136} [2024-06-21 20:29:32,139 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 55 predicate places. [2024-06-21 20:29:32,139 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 136 transitions, 1734 flow [2024-06-21 20:29:32,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 6 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-21 20:29:32,139 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 20:29:32,139 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 20:29:32,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-21 20:29:32,140 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-21 20:29:32,140 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 20:29:32,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1218198454, now seen corresponding path program 1 times [2024-06-21 20:29:32,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 20:29:32,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719808167] [2024-06-21 20:29:32,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 20:29:32,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 20:29:32,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 20:29:32,185 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-21 20:29:32,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 20:29:32,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719808167] [2024-06-21 20:29:32,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719808167] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 20:29:32,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 20:29:32,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-21 20:29:32,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676475344] [2024-06-21 20:29:32,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 20:29:32,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-21 20:29:32,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 20:29:32,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-21 20:29:32,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-21 20:29:32,220 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 57 [2024-06-21 20:29:32,221 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 136 transitions, 1734 flow. Second operand has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 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-21 20:29:32,221 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 20:29:32,221 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 57 [2024-06-21 20:29:32,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 20:29:34,560 INFO L124 PetriNetUnfolderBase]: 13651/23082 cut-off events. [2024-06-21 20:29:34,560 INFO L125 PetriNetUnfolderBase]: For 278038/279238 co-relation queries the response was YES. [2024-06-21 20:29:34,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110944 conditions, 23082 events. 13651/23082 cut-off events. For 278038/279238 co-relation queries the response was YES. Maximal size of possible extension queue 993. Compared 180203 event pairs, 5590 based on Foata normal form. 154/22796 useless extension candidates. Maximal degree in co-relation 110899. Up to 17774 conditions per place. [2024-06-21 20:29:34,950 INFO L140 encePairwiseOnDemand]: 46/57 looper letters, 136 selfloop transitions, 12 changer transitions 0/177 dead transitions. [2024-06-21 20:29:34,950 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 177 transitions, 2254 flow [2024-06-21 20:29:34,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-21 20:29:34,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-21 20:29:34,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 176 transitions. [2024-06-21 20:29:34,953 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6175438596491228 [2024-06-21 20:29:34,953 INFO L175 Difference]: Start difference. First operand has 115 places, 136 transitions, 1734 flow. Second operand 5 states and 176 transitions. [2024-06-21 20:29:34,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 177 transitions, 2254 flow [2024-06-21 20:29:35,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 177 transitions, 2112 flow, removed 61 selfloop flow, removed 1 redundant places. [2024-06-21 20:29:35,717 INFO L231 Difference]: Finished difference. Result has 119 places, 138 transitions, 1650 flow [2024-06-21 20:29:35,717 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=1592, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1650, PETRI_PLACES=119, PETRI_TRANSITIONS=138} [2024-06-21 20:29:35,718 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 59 predicate places. [2024-06-21 20:29:35,718 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 138 transitions, 1650 flow [2024-06-21 20:29:35,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 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-21 20:29:35,718 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 20:29:35,718 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-21 20:29:35,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-21 20:29:35,718 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-21 20:29:35,719 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 20:29:35,719 INFO L85 PathProgramCache]: Analyzing trace with hash -15221941, now seen corresponding path program 1 times [2024-06-21 20:29:35,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 20:29:35,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399128742] [2024-06-21 20:29:35,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 20:29:35,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 20:29:35,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 20:29:35,777 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-21 20:29:35,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 20:29:35,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399128742] [2024-06-21 20:29:35,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399128742] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 20:29:35,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 20:29:35,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-21 20:29:35,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385982849] [2024-06-21 20:29:35,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 20:29:35,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-21 20:29:35,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 20:29:35,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-21 20:29:35,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-06-21 20:29:35,810 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 57 [2024-06-21 20:29:35,811 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 138 transitions, 1650 flow. Second operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-21 20:29:35,811 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 20:29:35,811 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 57 [2024-06-21 20:29:35,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 20:29:38,178 INFO L124 PetriNetUnfolderBase]: 13799/23152 cut-off events. [2024-06-21 20:29:38,179 INFO L125 PetriNetUnfolderBase]: For 308697/309280 co-relation queries the response was YES. [2024-06-21 20:29:38,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111681 conditions, 23152 events. 13799/23152 cut-off events. For 308697/309280 co-relation queries the response was YES. Maximal size of possible extension queue 988. Compared 180935 event pairs, 6153 based on Foata normal form. 170/22847 useless extension candidates. Maximal degree in co-relation 111634. Up to 18442 conditions per place. [2024-06-21 20:29:38,375 INFO L140 encePairwiseOnDemand]: 49/57 looper letters, 129 selfloop transitions, 25 changer transitions 0/189 dead transitions. [2024-06-21 20:29:38,376 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 189 transitions, 2227 flow [2024-06-21 20:29:38,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-21 20:29:38,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-21 20:29:38,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 198 transitions. [2024-06-21 20:29:38,377 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5789473684210527 [2024-06-21 20:29:38,377 INFO L175 Difference]: Start difference. First operand has 119 places, 138 transitions, 1650 flow. Second operand 6 states and 198 transitions. [2024-06-21 20:29:38,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 189 transitions, 2227 flow [2024-06-21 20:29:38,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 189 transitions, 2169 flow, removed 18 selfloop flow, removed 3 redundant places. [2024-06-21 20:29:38,988 INFO L231 Difference]: Finished difference. Result has 123 places, 148 transitions, 1766 flow [2024-06-21 20:29:38,988 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=1602, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1766, PETRI_PLACES=123, PETRI_TRANSITIONS=148} [2024-06-21 20:29:38,988 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 63 predicate places. [2024-06-21 20:29:38,988 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 148 transitions, 1766 flow [2024-06-21 20:29:38,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-21 20:29:38,989 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 20:29:38,989 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-21 20:29:38,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-21 20:29:38,989 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-21 20:29:38,989 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 20:29:38,989 INFO L85 PathProgramCache]: Analyzing trace with hash 162614918, now seen corresponding path program 1 times [2024-06-21 20:29:38,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 20:29:38,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588131693] [2024-06-21 20:29:38,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 20:29:38,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 20:29:38,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 20:29:39,044 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-21 20:29:39,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 20:29:39,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588131693] [2024-06-21 20:29:39,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588131693] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 20:29:39,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 20:29:39,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-21 20:29:39,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283651340] [2024-06-21 20:29:39,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 20:29:39,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-21 20:29:39,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 20:29:39,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-21 20:29:39,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-21 20:29:39,079 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 57 [2024-06-21 20:29:39,080 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 148 transitions, 1766 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-21 20:29:39,080 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 20:29:39,080 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 57 [2024-06-21 20:29:39,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 20:29:42,442 INFO L124 PetriNetUnfolderBase]: 19872/31580 cut-off events. [2024-06-21 20:29:42,442 INFO L125 PetriNetUnfolderBase]: For 438977/439719 co-relation queries the response was YES. [2024-06-21 20:29:42,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153362 conditions, 31580 events. 19872/31580 cut-off events. For 438977/439719 co-relation queries the response was YES. Maximal size of possible extension queue 1405. Compared 239495 event pairs, 4542 based on Foata normal form. 488/31673 useless extension candidates. Maximal degree in co-relation 153313. Up to 16784 conditions per place. [2024-06-21 20:29:42,776 INFO L140 encePairwiseOnDemand]: 42/57 looper letters, 229 selfloop transitions, 89 changer transitions 0/337 dead transitions. [2024-06-21 20:29:42,776 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 337 transitions, 3894 flow [2024-06-21 20:29:42,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-06-21 20:29:42,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2024-06-21 20:29:42,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 485 transitions. [2024-06-21 20:29:42,778 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5672514619883041 [2024-06-21 20:29:42,778 INFO L175 Difference]: Start difference. First operand has 123 places, 148 transitions, 1766 flow. Second operand 15 states and 485 transitions. [2024-06-21 20:29:42,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 337 transitions, 3894 flow [2024-06-21 20:29:43,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 337 transitions, 3862 flow, removed 16 selfloop flow, removed 0 redundant places. [2024-06-21 20:29:43,711 INFO L231 Difference]: Finished difference. Result has 144 places, 180 transitions, 2618 flow [2024-06-21 20:29:43,711 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=1734, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=2618, PETRI_PLACES=144, PETRI_TRANSITIONS=180} [2024-06-21 20:29:43,711 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 84 predicate places. [2024-06-21 20:29:43,711 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 180 transitions, 2618 flow [2024-06-21 20:29:43,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.142857142857142) internal successors, (127), 7 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-21 20:29:43,712 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 20:29:43,712 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-21 20:29:43,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-21 20:29:43,712 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-21 20:29:43,712 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 20:29:43,713 INFO L85 PathProgramCache]: Analyzing trace with hash -673783741, now seen corresponding path program 1 times [2024-06-21 20:29:43,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 20:29:43,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661706847] [2024-06-21 20:29:43,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 20:29:43,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 20:29:43,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 20:29:43,899 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-21 20:29:43,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 20:29:43,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661706847] [2024-06-21 20:29:43,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661706847] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 20:29:43,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 20:29:43,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-21 20:29:43,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422546325] [2024-06-21 20:29:43,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 20:29:43,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-21 20:29:43,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 20:29:43,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-21 20:29:43,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-21 20:29:43,945 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 57 [2024-06-21 20:29:43,945 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 180 transitions, 2618 flow. Second operand has 7 states, 7 states have (on average 18.285714285714285) internal successors, (128), 7 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-21 20:29:43,945 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 20:29:43,945 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 57 [2024-06-21 20:29:43,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 20:29:47,991 INFO L124 PetriNetUnfolderBase]: 21766/34764 cut-off events. [2024-06-21 20:29:47,992 INFO L125 PetriNetUnfolderBase]: For 617403/618171 co-relation queries the response was YES. [2024-06-21 20:29:48,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 186189 conditions, 34764 events. 21766/34764 cut-off events. For 617403/618171 co-relation queries the response was YES. Maximal size of possible extension queue 1560. Compared 269484 event pairs, 4597 based on Foata normal form. 522/34831 useless extension candidates. Maximal degree in co-relation 186131. Up to 16768 conditions per place. [2024-06-21 20:29:48,371 INFO L140 encePairwiseOnDemand]: 43/57 looper letters, 243 selfloop transitions, 88 changer transitions 0/350 dead transitions. [2024-06-21 20:29:48,371 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 350 transitions, 4910 flow [2024-06-21 20:29:48,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-21 20:29:48,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-21 20:29:48,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 426 transitions. [2024-06-21 20:29:48,373 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5748987854251012 [2024-06-21 20:29:48,373 INFO L175 Difference]: Start difference. First operand has 144 places, 180 transitions, 2618 flow. Second operand 13 states and 426 transitions. [2024-06-21 20:29:48,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 350 transitions, 4910 flow [2024-06-21 20:29:50,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 350 transitions, 4577 flow, removed 109 selfloop flow, removed 8 redundant places. [2024-06-21 20:29:50,832 INFO L231 Difference]: Finished difference. Result has 153 places, 208 transitions, 3089 flow [2024-06-21 20:29:50,832 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=2345, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=3089, PETRI_PLACES=153, PETRI_TRANSITIONS=208} [2024-06-21 20:29:50,833 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 93 predicate places. [2024-06-21 20:29:50,833 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 208 transitions, 3089 flow [2024-06-21 20:29:50,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.285714285714285) internal successors, (128), 7 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-21 20:29:50,833 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 20:29:50,833 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-21 20:29:50,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-21 20:29:50,833 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-21 20:29:50,833 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 20:29:50,833 INFO L85 PathProgramCache]: Analyzing trace with hash 296144875, now seen corresponding path program 1 times [2024-06-21 20:29:50,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 20:29:50,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842650894] [2024-06-21 20:29:50,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 20:29:50,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 20:29:50,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 20:29:50,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-21 20:29:50,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 20:29:50,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842650894] [2024-06-21 20:29:50,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842650894] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 20:29:50,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 20:29:50,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-21 20:29:50,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520379764] [2024-06-21 20:29:50,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 20:29:50,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-21 20:29:50,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 20:29:50,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-21 20:29:50,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-06-21 20:29:50,922 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 57 [2024-06-21 20:29:50,922 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 208 transitions, 3089 flow. Second operand has 6 states, 6 states have (on average 19.333333333333332) internal successors, (116), 6 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-21 20:29:50,922 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 20:29:50,922 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 57 [2024-06-21 20:29:50,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 20:29:54,982 INFO L124 PetriNetUnfolderBase]: 21352/33763 cut-off events. [2024-06-21 20:29:54,983 INFO L125 PetriNetUnfolderBase]: For 735212/735573 co-relation queries the response was YES. [2024-06-21 20:29:55,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 191495 conditions, 33763 events. 21352/33763 cut-off events. For 735212/735573 co-relation queries the response was YES. Maximal size of possible extension queue 1546. Compared 259371 event pairs, 2952 based on Foata normal form. 594/33760 useless extension candidates. Maximal degree in co-relation 191432. Up to 14870 conditions per place. [2024-06-21 20:29:55,342 INFO L140 encePairwiseOnDemand]: 44/57 looper letters, 186 selfloop transitions, 92 changer transitions 6/318 dead transitions. [2024-06-21 20:29:55,342 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 318 transitions, 4808 flow [2024-06-21 20:29:55,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-21 20:29:55,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-21 20:29:55,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 256 transitions. [2024-06-21 20:29:55,343 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6416040100250626 [2024-06-21 20:29:55,343 INFO L175 Difference]: Start difference. First operand has 153 places, 208 transitions, 3089 flow. Second operand 7 states and 256 transitions. [2024-06-21 20:29:55,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 318 transitions, 4808 flow [2024-06-21 20:29:57,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 318 transitions, 4620 flow, removed 52 selfloop flow, removed 7 redundant places. [2024-06-21 20:29:57,889 INFO L231 Difference]: Finished difference. Result has 156 places, 221 transitions, 3526 flow [2024-06-21 20:29:57,890 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=2943, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3526, PETRI_PLACES=156, PETRI_TRANSITIONS=221} [2024-06-21 20:29:57,890 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 96 predicate places. [2024-06-21 20:29:57,890 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 221 transitions, 3526 flow [2024-06-21 20:29:57,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.333333333333332) internal successors, (116), 6 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-21 20:29:57,890 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 20:29:57,891 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 20:29:57,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-21 20:29:57,891 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-21 20:29:57,891 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 20:29:57,891 INFO L85 PathProgramCache]: Analyzing trace with hash -9036653, now seen corresponding path program 1 times [2024-06-21 20:29:57,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 20:29:57,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680044487] [2024-06-21 20:29:57,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 20:29:57,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 20:29:57,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 20:29:57,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-21 20:29:57,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 20:29:57,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680044487] [2024-06-21 20:29:57,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680044487] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 20:29:57,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 20:29:57,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-21 20:29:57,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808374338] [2024-06-21 20:29:57,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 20:29:57,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-21 20:29:57,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 20:29:57,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-21 20:29:57,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-21 20:29:57,980 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 57 [2024-06-21 20:29:57,980 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 221 transitions, 3526 flow. Second operand has 6 states, 6 states have (on average 19.333333333333332) internal successors, (116), 6 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-21 20:29:57,980 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 20:29:57,981 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 57 [2024-06-21 20:29:57,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 20:30:01,926 INFO L124 PetriNetUnfolderBase]: 19713/31556 cut-off events. [2024-06-21 20:30:01,926 INFO L125 PetriNetUnfolderBase]: For 697016/697533 co-relation queries the response was YES. [2024-06-21 20:30:02,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 189499 conditions, 31556 events. 19713/31556 cut-off events. For 697016/697533 co-relation queries the response was YES. Maximal size of possible extension queue 1456. Compared 243499 event pairs, 7518 based on Foata normal form. 233/31354 useless extension candidates. Maximal degree in co-relation 189434. Up to 26639 conditions per place. [2024-06-21 20:30:02,283 INFO L140 encePairwiseOnDemand]: 47/57 looper letters, 206 selfloop transitions, 54 changer transitions 0/294 dead transitions. [2024-06-21 20:30:02,284 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 294 transitions, 4510 flow [2024-06-21 20:30:02,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-21 20:30:02,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-21 20:30:02,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 253 transitions. [2024-06-21 20:30:02,285 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5548245614035088 [2024-06-21 20:30:02,285 INFO L175 Difference]: Start difference. First operand has 156 places, 221 transitions, 3526 flow. Second operand 8 states and 253 transitions. [2024-06-21 20:30:02,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 294 transitions, 4510 flow [2024-06-21 20:30:04,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 294 transitions, 4204 flow, removed 90 selfloop flow, removed 5 redundant places. [2024-06-21 20:30:04,940 INFO L231 Difference]: Finished difference. Result has 160 places, 233 transitions, 3552 flow [2024-06-21 20:30:04,940 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=3268, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3552, PETRI_PLACES=160, PETRI_TRANSITIONS=233} [2024-06-21 20:30:04,941 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 100 predicate places. [2024-06-21 20:30:04,941 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 233 transitions, 3552 flow [2024-06-21 20:30:04,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.333333333333332) internal successors, (116), 6 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-21 20:30:04,941 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 20:30:04,941 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-21 20:30:04,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-21 20:30:04,941 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-21 20:30:04,941 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 20:30:04,942 INFO L85 PathProgramCache]: Analyzing trace with hash 561287243, now seen corresponding path program 1 times [2024-06-21 20:30:04,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 20:30:04,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636297135] [2024-06-21 20:30:04,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 20:30:04,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 20:30:04,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 20:30:04,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-21 20:30:04,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 20:30:04,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636297135] [2024-06-21 20:30:04,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636297135] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 20:30:04,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 20:30:04,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-21 20:30:04,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760646971] [2024-06-21 20:30:04,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 20:30:04,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-21 20:30:04,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 20:30:04,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-21 20:30:04,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-21 20:30:05,021 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 57 [2024-06-21 20:30:05,021 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 233 transitions, 3552 flow. Second operand has 6 states, 6 states have (on average 19.333333333333332) internal successors, (116), 6 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-21 20:30:05,021 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 20:30:05,021 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 57 [2024-06-21 20:30:05,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 20:30:09,625 INFO L124 PetriNetUnfolderBase]: 22513/35266 cut-off events. [2024-06-21 20:30:09,625 INFO L125 PetriNetUnfolderBase]: For 830670/830840 co-relation queries the response was YES. [2024-06-21 20:30:09,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 209525 conditions, 35266 events. 22513/35266 cut-off events. For 830670/830840 co-relation queries the response was YES. Maximal size of possible extension queue 1635. Compared 268312 event pairs, 5442 based on Foata normal form. 424/35271 useless extension candidates. Maximal degree in co-relation 209458. Up to 19757 conditions per place. [2024-06-21 20:30:10,020 INFO L140 encePairwiseOnDemand]: 44/57 looper letters, 264 selfloop transitions, 71 changer transitions 0/361 dead transitions. [2024-06-21 20:30:10,021 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 361 transitions, 5672 flow [2024-06-21 20:30:10,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-21 20:30:10,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-21 20:30:10,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 288 transitions. [2024-06-21 20:30:10,022 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.631578947368421 [2024-06-21 20:30:10,022 INFO L175 Difference]: Start difference. First operand has 160 places, 233 transitions, 3552 flow. Second operand 8 states and 288 transitions. [2024-06-21 20:30:10,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 361 transitions, 5672 flow [2024-06-21 20:30:13,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 361 transitions, 5646 flow, removed 13 selfloop flow, removed 0 redundant places. [2024-06-21 20:30:13,331 INFO L231 Difference]: Finished difference. Result has 171 places, 251 transitions, 4254 flow [2024-06-21 20:30:13,331 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=3500, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4254, PETRI_PLACES=171, PETRI_TRANSITIONS=251} [2024-06-21 20:30:13,332 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 111 predicate places. [2024-06-21 20:30:13,332 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 251 transitions, 4254 flow [2024-06-21 20:30:13,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.333333333333332) internal successors, (116), 6 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-21 20:30:13,332 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 20:30:13,332 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-21 20:30:13,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-21 20:30:13,332 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-21 20:30:13,332 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 20:30:13,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1421688615, now seen corresponding path program 2 times [2024-06-21 20:30:13,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 20:30:13,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506738780] [2024-06-21 20:30:13,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 20:30:13,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 20:30:13,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 20:30:13,394 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-21 20:30:13,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 20:30:13,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506738780] [2024-06-21 20:30:13,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506738780] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 20:30:13,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 20:30:13,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-21 20:30:13,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457693236] [2024-06-21 20:30:13,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 20:30:13,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-21 20:30:13,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 20:30:13,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-21 20:30:13,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-21 20:30:13,440 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 57 [2024-06-21 20:30:13,441 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 251 transitions, 4254 flow. Second operand has 7 states, 7 states have (on average 18.857142857142858) internal successors, (132), 7 states have internal predecessors, (132), 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-21 20:30:13,441 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 20:30:13,441 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 57 [2024-06-21 20:30:13,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand