./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-atomic/szymanski.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --validate ./goblint.2024-05-21_14-57-05.files/mutex-meet/szymanski.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version bcb38a6f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-atomic/szymanski.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/szymanski.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-bcb38a6-m [2024-06-04 16:00:19,433 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-04 16:00:19,508 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-04 16:00:19,514 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-04 16:00:19,514 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-04 16:00:19,564 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-04 16:00:19,565 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-04 16:00:19,565 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-04 16:00:19,566 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-04 16:00:19,569 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-04 16:00:19,570 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-04 16:00:19,570 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-04 16:00:19,571 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-04 16:00:19,572 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-04 16:00:19,573 INFO L153 SettingsManager]: * Use SBE=true [2024-06-04 16:00:19,573 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-04 16:00:19,573 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-04 16:00:19,573 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-04 16:00:19,574 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-04 16:00:19,574 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-04 16:00:19,574 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-04 16:00:19,575 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-04 16:00:19,575 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-04 16:00:19,575 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-04 16:00:19,575 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-04 16:00:19,575 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-04 16:00:19,576 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-04 16:00:19,576 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-04 16:00:19,577 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-04 16:00:19,577 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-04 16:00:19,578 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-04 16:00:19,578 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-04 16:00:19,578 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-04 16:00:19,578 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-04 16:00:19,579 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-04 16:00:19,579 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-04 16:00:19,579 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-04 16:00:19,579 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-04 16:00:19,579 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-04 16:00:19,580 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-04 16:00:19,580 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-04 16:00:19,580 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-04 16:00:19,580 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-04 16:00:19,581 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2024-06-04 16:00:19,875 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-04 16:00:19,902 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-04 16:00:19,905 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-04 16:00:19,906 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-04 16:00:19,906 INFO L274 PluginConnector]: CDTParser initialized [2024-06-04 16:00:19,907 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-atomic/szymanski.i [2024-06-04 16:00:21,059 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-04 16:00:21,360 INFO L384 CDTParser]: Found 1 translation units. [2024-06-04 16:00:21,367 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/szymanski.i [2024-06-04 16:00:21,380 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/484e2ad43/8d3c57e6c0c6475a801c63eeab30b387/FLAG9717fc131 [2024-06-04 16:00:21,392 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/484e2ad43/8d3c57e6c0c6475a801c63eeab30b387 [2024-06-04 16:00:21,394 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-04 16:00:21,395 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-04 16:00:21,395 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-05-21_14-57-05.files/mutex-meet/szymanski.yml/witness.yml [2024-06-04 16:00:21,496 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-04 16:00:21,498 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-04 16:00:21,499 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-04 16:00:21,499 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-04 16:00:21,503 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-04 16:00:21,504 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 04:00:21" (1/2) ... [2024-06-04 16:00:21,505 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a85dd09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 04:00:21, skipping insertion in model container [2024-06-04 16:00:21,505 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 04:00:21" (1/2) ... [2024-06-04 16:00:21,507 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@755b19db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 04:00:21, skipping insertion in model container [2024-06-04 16:00:21,507 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 04:00:21" (2/2) ... [2024-06-04 16:00:21,509 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a85dd09 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:00:21, skipping insertion in model container [2024-06-04 16:00:21,509 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 04:00:21" (2/2) ... [2024-06-04 16:00:21,510 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-04 16:00:21,546 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-04 16:00:21,548 INFO L97 edCorrectnessWitness]: Location invariant before [L819-L819] ((((! multithreaded || ((4LL - (long long )flag1) + (long long )flag2 >= 0LL && (long long )flag1 + (long long )flag2 >= 0LL)) && (! multithreaded || (((((((0 <= flag1 && 0 <= flag2) && flag1 <= 4) && flag1 <= 127) && flag2 <= 4) && flag2 <= 127) && ((((flag1 == 0 || flag1 == 1) || flag1 == 2) || flag1 == 3) || flag1 == 4)) && ((((flag2 == 0 || flag2 == 1) || flag2 == 2) || flag2 == 3) || flag2 == 4)))) && (! multithreaded || (((0 <= flag1 && flag1 <= 4) && flag1 <= 127) && ((((flag1 == 0 || flag1 == 1) || flag1 == 2) || flag1 == 3) || flag1 == 4)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || (((0 <= flag2 && flag2 <= 4) && flag2 <= 127) && ((((flag2 == 0 || flag2 == 1) || flag2 == 2) || flag2 == 3) || flag2 == 4))) [2024-06-04 16:00:21,548 INFO L97 edCorrectnessWitness]: Location invariant before [L820-L820] ((((! multithreaded || ((4LL - (long long )flag1) + (long long )flag2 >= 0LL && (long long )flag1 + (long long )flag2 >= 0LL)) && (! multithreaded || (((((((0 <= flag1 && 0 <= flag2) && flag1 <= 4) && flag1 <= 127) && flag2 <= 4) && flag2 <= 127) && ((((flag1 == 0 || flag1 == 1) || flag1 == 2) || flag1 == 3) || flag1 == 4)) && ((((flag2 == 0 || flag2 == 1) || flag2 == 2) || flag2 == 3) || flag2 == 4)))) && (! multithreaded || (((0 <= flag1 && flag1 <= 4) && flag1 <= 127) && ((((flag1 == 0 || flag1 == 1) || flag1 == 2) || flag1 == 3) || flag1 == 4)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || (((0 <= flag2 && flag2 <= 4) && flag2 <= 127) && ((((flag2 == 0 || flag2 == 1) || flag2 == 2) || flag2 == 3) || flag2 == 4))) [2024-06-04 16:00:21,548 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-04 16:00:21,548 INFO L106 edCorrectnessWitness]: ghost_update [L818-L818] multithreaded = 1; [2024-06-04 16:00:21,598 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-04 16:00:22,037 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-04 16:00:22,046 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-04 16:00:22,136 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-04 16:00:22,169 INFO L206 MainTranslator]: Completed translation [2024-06-04 16:00:22,170 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:00:22 WrapperNode [2024-06-04 16:00:22,170 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-04 16:00:22,172 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-04 16:00:22,172 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-04 16:00:22,172 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-04 16:00:22,178 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:00:22" (1/1) ... [2024-06-04 16:00:22,209 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:00:22" (1/1) ... [2024-06-04 16:00:22,253 INFO L138 Inliner]: procedures = 169, calls = 66, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 170 [2024-06-04 16:00:22,254 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-04 16:00:22,255 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-04 16:00:22,255 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-04 16:00:22,255 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-04 16:00:22,266 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:00:22" (1/1) ... [2024-06-04 16:00:22,267 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:00:22" (1/1) ... [2024-06-04 16:00:22,278 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:00:22" (1/1) ... [2024-06-04 16:00:22,302 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-06-04 16:00:22,302 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:00:22" (1/1) ... [2024-06-04 16:00:22,302 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:00:22" (1/1) ... [2024-06-04 16:00:22,316 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:00:22" (1/1) ... [2024-06-04 16:00:22,320 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:00:22" (1/1) ... [2024-06-04 16:00:22,326 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:00:22" (1/1) ... [2024-06-04 16:00:22,328 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:00:22" (1/1) ... [2024-06-04 16:00:22,335 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-04 16:00:22,336 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-04 16:00:22,336 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-04 16:00:22,336 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-04 16:00:22,337 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:00:22" (1/1) ... [2024-06-04 16:00:22,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-04 16:00:22,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-04 16:00:22,397 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-06-04 16:00:22,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-06-04 16:00:22,451 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2024-06-04 16:00:22,452 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2024-06-04 16:00:22,452 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-06-04 16:00:22,452 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-06-04 16:00:22,453 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-04 16:00:22,453 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-04 16:00:22,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-04 16:00:22,453 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-04 16:00:22,453 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-04 16:00:22,453 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-04 16:00:22,484 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-04 16:00:22,587 INFO L244 CfgBuilder]: Building ICFG [2024-06-04 16:00:22,589 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-04 16:00:22,845 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-04 16:00:22,845 INFO L293 CfgBuilder]: Performing block encoding [2024-06-04 16:00:22,909 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-04 16:00:22,909 INFO L320 CfgBuilder]: Removed 8 assume(true) statements. [2024-06-04 16:00:22,909 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 04:00:22 BoogieIcfgContainer [2024-06-04 16:00:22,909 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-04 16:00:22,911 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-04 16:00:22,912 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-04 16:00:22,914 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-04 16:00:22,915 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.06 04:00:21" (1/4) ... [2024-06-04 16:00:22,915 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32b2558b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.06 04:00:22, skipping insertion in model container [2024-06-04 16:00:22,915 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 04:00:21" (2/4) ... [2024-06-04 16:00:22,915 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32b2558b and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 04.06 04:00:22, skipping insertion in model container [2024-06-04 16:00:22,916 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:00:22" (3/4) ... [2024-06-04 16:00:22,916 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32b2558b and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 04.06 04:00:22, skipping insertion in model container [2024-06-04 16:00:22,916 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 04:00:22" (4/4) ... [2024-06-04 16:00:22,917 INFO L112 eAbstractionObserver]: Analyzing ICFG szymanski.i [2024-06-04 16:00:22,934 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-04 16:00:22,934 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-06-04 16:00:22,934 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-04 16:00:23,002 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-06-04 16:00:23,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 68 transitions, 150 flow [2024-06-04 16:00:23,082 INFO L124 PetriNetUnfolderBase]: 10/66 cut-off events. [2024-06-04 16:00:23,082 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-06-04 16:00:23,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75 conditions, 66 events. 10/66 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 116 event pairs, 0 based on Foata normal form. 0/54 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2024-06-04 16:00:23,087 INFO L82 GeneralOperation]: Start removeDead. Operand has 65 places, 68 transitions, 150 flow [2024-06-04 16:00:23,090 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 61 places, 64 transitions, 137 flow [2024-06-04 16:00:23,103 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-04 16:00:23,110 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;@73d97369, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-04 16:00:23,110 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-04 16:00:23,117 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-04 16:00:23,117 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-04 16:00:23,117 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-04 16:00:23,117 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:00:23,120 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-04 16:00:23,121 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:00:23,125 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:00:23,125 INFO L85 PathProgramCache]: Analyzing trace with hash 833335324, now seen corresponding path program 1 times [2024-06-04 16:00:23,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:00:23,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145810717] [2024-06-04 16:00:23,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:00:23,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:00:23,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:00:23,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:00:23,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:00:23,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145810717] [2024-06-04 16:00:23,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145810717] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:00:23,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:00:23,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-04 16:00:23,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431782453] [2024-06-04 16:00:23,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:00:23,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-04 16:00:23,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:00:23,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-04 16:00:23,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-04 16:00:23,759 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 68 [2024-06-04 16:00:23,762 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 64 transitions, 137 flow. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:00:23,762 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:00:23,762 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 68 [2024-06-04 16:00:23,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:00:24,037 INFO L124 PetriNetUnfolderBase]: 616/1313 cut-off events. [2024-06-04 16:00:24,038 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2024-06-04 16:00:24,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2158 conditions, 1313 events. 616/1313 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 7687 event pairs, 292 based on Foata normal form. 1/1260 useless extension candidates. Maximal degree in co-relation 2097. Up to 805 conditions per place. [2024-06-04 16:00:24,057 INFO L140 encePairwiseOnDemand]: 63/68 looper letters, 32 selfloop transitions, 3 changer transitions 0/70 dead transitions. [2024-06-04 16:00:24,058 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 70 transitions, 222 flow [2024-06-04 16:00:24,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-04 16:00:24,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-04 16:00:24,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 148 transitions. [2024-06-04 16:00:24,073 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7254901960784313 [2024-06-04 16:00:24,075 INFO L175 Difference]: Start difference. First operand has 61 places, 64 transitions, 137 flow. Second operand 3 states and 148 transitions. [2024-06-04 16:00:24,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 70 transitions, 222 flow [2024-06-04 16:00:24,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 70 transitions, 216 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-04 16:00:24,086 INFO L231 Difference]: Finished difference. Result has 61 places, 66 transitions, 153 flow [2024-06-04 16:00:24,088 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=153, PETRI_PLACES=61, PETRI_TRANSITIONS=66} [2024-06-04 16:00:24,092 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 0 predicate places. [2024-06-04 16:00:24,093 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 66 transitions, 153 flow [2024-06-04 16:00:24,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:00:24,093 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:00:24,094 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:00:24,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-04 16:00:24,094 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:00:24,095 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:00:24,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1973982471, now seen corresponding path program 1 times [2024-06-04 16:00:24,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:00:24,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708911675] [2024-06-04 16:00:24,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:00:24,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:00:24,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:00:24,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:00:24,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:00:24,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708911675] [2024-06-04 16:00:24,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708911675] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:00:24,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:00:24,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-04 16:00:24,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985631041] [2024-06-04 16:00:24,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:00:24,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-04 16:00:24,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:00:24,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-04 16:00:24,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-04 16:00:24,371 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 68 [2024-06-04 16:00:24,374 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 66 transitions, 153 flow. Second operand has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:00:24,374 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:00:24,375 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 68 [2024-06-04 16:00:24,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:00:24,646 INFO L124 PetriNetUnfolderBase]: 672/1436 cut-off events. [2024-06-04 16:00:24,646 INFO L125 PetriNetUnfolderBase]: For 142/142 co-relation queries the response was YES. [2024-06-04 16:00:24,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2520 conditions, 1436 events. 672/1436 cut-off events. For 142/142 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 8600 event pairs, 122 based on Foata normal form. 4/1395 useless extension candidates. Maximal degree in co-relation 1842. Up to 752 conditions per place. [2024-06-04 16:00:24,660 INFO L140 encePairwiseOnDemand]: 62/68 looper letters, 42 selfloop transitions, 6 changer transitions 1/83 dead transitions. [2024-06-04 16:00:24,660 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 83 transitions, 292 flow [2024-06-04 16:00:24,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-04 16:00:24,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-04 16:00:24,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 194 transitions. [2024-06-04 16:00:24,663 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7132352941176471 [2024-06-04 16:00:24,663 INFO L175 Difference]: Start difference. First operand has 61 places, 66 transitions, 153 flow. Second operand 4 states and 194 transitions. [2024-06-04 16:00:24,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 83 transitions, 292 flow [2024-06-04 16:00:24,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 83 transitions, 289 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-04 16:00:24,666 INFO L231 Difference]: Finished difference. Result has 64 places, 68 transitions, 177 flow [2024-06-04 16:00:24,666 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=177, PETRI_PLACES=64, PETRI_TRANSITIONS=68} [2024-06-04 16:00:24,667 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 3 predicate places. [2024-06-04 16:00:24,667 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 68 transitions, 177 flow [2024-06-04 16:00:24,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:00:24,668 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:00:24,668 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:00:24,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-04 16:00:24,669 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:00:24,669 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:00:24,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1467278947, now seen corresponding path program 1 times [2024-06-04 16:00:24,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:00:24,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390309652] [2024-06-04 16:00:24,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:00:24,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:00:24,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:00:24,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:00:24,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:00:24,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390309652] [2024-06-04 16:00:24,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390309652] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:00:24,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:00:24,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-04 16:00:24,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211504521] [2024-06-04 16:00:24,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:00:24,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-04 16:00:24,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:00:24,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-04 16:00:24,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-04 16:00:24,829 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 68 [2024-06-04 16:00:24,830 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 68 transitions, 177 flow. Second operand has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:00:24,830 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:00:24,830 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 68 [2024-06-04 16:00:24,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:00:25,003 INFO L124 PetriNetUnfolderBase]: 676/1461 cut-off events. [2024-06-04 16:00:25,003 INFO L125 PetriNetUnfolderBase]: For 442/442 co-relation queries the response was YES. [2024-06-04 16:00:25,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2707 conditions, 1461 events. 676/1461 cut-off events. For 442/442 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 8766 event pairs, 123 based on Foata normal form. 2/1421 useless extension candidates. Maximal degree in co-relation 2005. Up to 751 conditions per place. [2024-06-04 16:00:25,017 INFO L140 encePairwiseOnDemand]: 61/68 looper letters, 42 selfloop transitions, 8 changer transitions 1/85 dead transitions. [2024-06-04 16:00:25,017 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 85 transitions, 324 flow [2024-06-04 16:00:25,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-04 16:00:25,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-04 16:00:25,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 195 transitions. [2024-06-04 16:00:25,023 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7169117647058824 [2024-06-04 16:00:25,023 INFO L175 Difference]: Start difference. First operand has 64 places, 68 transitions, 177 flow. Second operand 4 states and 195 transitions. [2024-06-04 16:00:25,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 85 transitions, 324 flow [2024-06-04 16:00:25,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 85 transitions, 317 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-06-04 16:00:25,028 INFO L231 Difference]: Finished difference. Result has 67 places, 71 transitions, 208 flow [2024-06-04 16:00:25,029 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=208, PETRI_PLACES=67, PETRI_TRANSITIONS=71} [2024-06-04 16:00:25,030 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 6 predicate places. [2024-06-04 16:00:25,030 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 71 transitions, 208 flow [2024-06-04 16:00:25,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:00:25,031 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:00:25,031 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:00:25,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-04 16:00:25,031 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:00:25,032 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:00:25,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1117092599, now seen corresponding path program 1 times [2024-06-04 16:00:25,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:00:25,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932116699] [2024-06-04 16:00:25,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:00:25,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:00:25,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:00:25,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:00:25,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:00:25,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932116699] [2024-06-04 16:00:25,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932116699] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:00:25,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:00:25,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-04 16:00:25,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811032712] [2024-06-04 16:00:25,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:00:25,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-04 16:00:25,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:00:25,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-04 16:00:25,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-04 16:00:25,214 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 68 [2024-06-04 16:00:25,215 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 71 transitions, 208 flow. Second operand has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:00:25,215 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:00:25,215 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 68 [2024-06-04 16:00:25,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:00:25,371 INFO L124 PetriNetUnfolderBase]: 667/1385 cut-off events. [2024-06-04 16:00:25,371 INFO L125 PetriNetUnfolderBase]: For 855/863 co-relation queries the response was YES. [2024-06-04 16:00:25,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2843 conditions, 1385 events. 667/1385 cut-off events. For 855/863 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 8158 event pairs, 239 based on Foata normal form. 2/1338 useless extension candidates. Maximal degree in co-relation 2566. Up to 849 conditions per place. [2024-06-04 16:00:25,384 INFO L140 encePairwiseOnDemand]: 62/68 looper letters, 44 selfloop transitions, 7 changer transitions 0/85 dead transitions. [2024-06-04 16:00:25,384 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 85 transitions, 350 flow [2024-06-04 16:00:25,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-04 16:00:25,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-04 16:00:25,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 190 transitions. [2024-06-04 16:00:25,386 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6985294117647058 [2024-06-04 16:00:25,386 INFO L175 Difference]: Start difference. First operand has 67 places, 71 transitions, 208 flow. Second operand 4 states and 190 transitions. [2024-06-04 16:00:25,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 85 transitions, 350 flow [2024-06-04 16:00:25,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 85 transitions, 343 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-06-04 16:00:25,389 INFO L231 Difference]: Finished difference. Result has 71 places, 75 transitions, 244 flow [2024-06-04 16:00:25,390 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=244, PETRI_PLACES=71, PETRI_TRANSITIONS=75} [2024-06-04 16:00:25,391 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 10 predicate places. [2024-06-04 16:00:25,391 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 75 transitions, 244 flow [2024-06-04 16:00:25,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:00:25,391 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:00:25,391 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:00:25,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-04 16:00:25,392 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:00:25,392 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:00:25,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1767742354, now seen corresponding path program 1 times [2024-06-04 16:00:25,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:00:25,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944783998] [2024-06-04 16:00:25,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:00:25,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:00:25,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:00:25,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:00:25,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:00:25,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944783998] [2024-06-04 16:00:25,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944783998] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:00:25,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:00:25,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-04 16:00:25,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304737545] [2024-06-04 16:00:25,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:00:25,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-04 16:00:25,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:00:25,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-04 16:00:25,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-04 16:00:25,571 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 68 [2024-06-04 16:00:25,572 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 75 transitions, 244 flow. Second operand has 5 states, 5 states have (on average 37.2) internal successors, (186), 5 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:00:25,572 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:00:25,573 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 68 [2024-06-04 16:00:25,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:00:25,753 INFO L124 PetriNetUnfolderBase]: 786/1571 cut-off events. [2024-06-04 16:00:25,753 INFO L125 PetriNetUnfolderBase]: For 1611/1611 co-relation queries the response was YES. [2024-06-04 16:00:25,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3582 conditions, 1571 events. 786/1571 cut-off events. For 1611/1611 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 9187 event pairs, 264 based on Foata normal form. 4/1517 useless extension candidates. Maximal degree in co-relation 2634. Up to 648 conditions per place. [2024-06-04 16:00:25,769 INFO L140 encePairwiseOnDemand]: 60/68 looper letters, 60 selfloop transitions, 13 changer transitions 0/106 dead transitions. [2024-06-04 16:00:25,770 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 106 transitions, 485 flow [2024-06-04 16:00:25,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 16:00:25,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 16:00:25,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 240 transitions. [2024-06-04 16:00:25,771 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7058823529411765 [2024-06-04 16:00:25,771 INFO L175 Difference]: Start difference. First operand has 71 places, 75 transitions, 244 flow. Second operand 5 states and 240 transitions. [2024-06-04 16:00:25,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 106 transitions, 485 flow [2024-06-04 16:00:25,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 106 transitions, 483 flow, removed 1 selfloop flow, removed 0 redundant places. [2024-06-04 16:00:25,776 INFO L231 Difference]: Finished difference. Result has 77 places, 80 transitions, 302 flow [2024-06-04 16:00:25,776 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=302, PETRI_PLACES=77, PETRI_TRANSITIONS=80} [2024-06-04 16:00:25,777 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 16 predicate places. [2024-06-04 16:00:25,777 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 80 transitions, 302 flow [2024-06-04 16:00:25,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 37.2) internal successors, (186), 5 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:00:25,778 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:00:25,778 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:00:25,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-04 16:00:25,778 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:00:25,779 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:00:25,779 INFO L85 PathProgramCache]: Analyzing trace with hash 258813064, now seen corresponding path program 2 times [2024-06-04 16:00:25,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:00:25,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18267163] [2024-06-04 16:00:25,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:00:25,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:00:25,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:00:25,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:00:25,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:00:25,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18267163] [2024-06-04 16:00:25,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18267163] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:00:25,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:00:25,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-04 16:00:25,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547016993] [2024-06-04 16:00:25,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:00:25,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-04 16:00:25,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:00:25,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-04 16:00:25,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-04 16:00:25,922 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 68 [2024-06-04 16:00:25,922 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 80 transitions, 302 flow. Second operand has 5 states, 5 states have (on average 37.2) internal successors, (186), 5 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:00:25,923 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:00:25,923 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 68 [2024-06-04 16:00:25,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:00:26,141 INFO L124 PetriNetUnfolderBase]: 805/1615 cut-off events. [2024-06-04 16:00:26,142 INFO L125 PetriNetUnfolderBase]: For 2567/2575 co-relation queries the response was YES. [2024-06-04 16:00:26,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3926 conditions, 1615 events. 805/1615 cut-off events. For 2567/2575 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 9349 event pairs, 215 based on Foata normal form. 12/1570 useless extension candidates. Maximal degree in co-relation 3473. Up to 591 conditions per place. [2024-06-04 16:00:26,155 INFO L140 encePairwiseOnDemand]: 60/68 looper letters, 61 selfloop transitions, 15 changer transitions 0/109 dead transitions. [2024-06-04 16:00:26,155 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 109 transitions, 552 flow [2024-06-04 16:00:26,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 16:00:26,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 16:00:26,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 241 transitions. [2024-06-04 16:00:26,157 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7088235294117647 [2024-06-04 16:00:26,157 INFO L175 Difference]: Start difference. First operand has 77 places, 80 transitions, 302 flow. Second operand 5 states and 241 transitions. [2024-06-04 16:00:26,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 109 transitions, 552 flow [2024-06-04 16:00:26,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 109 transitions, 546 flow, removed 3 selfloop flow, removed 0 redundant places. [2024-06-04 16:00:26,164 INFO L231 Difference]: Finished difference. Result has 82 places, 82 transitions, 345 flow [2024-06-04 16:00:26,164 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=345, PETRI_PLACES=82, PETRI_TRANSITIONS=82} [2024-06-04 16:00:26,165 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 21 predicate places. [2024-06-04 16:00:26,165 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 82 transitions, 345 flow [2024-06-04 16:00:26,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 37.2) internal successors, (186), 5 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:00:26,166 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:00:26,166 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:00:26,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-04 16:00:26,166 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:00:26,167 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:00:26,167 INFO L85 PathProgramCache]: Analyzing trace with hash -187682116, now seen corresponding path program 1 times [2024-06-04 16:00:26,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:00:26,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037637101] [2024-06-04 16:00:26,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:00:26,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:00:26,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:00:26,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:00:26,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:00:26,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037637101] [2024-06-04 16:00:26,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037637101] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:00:26,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:00:26,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-04 16:00:26,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447840234] [2024-06-04 16:00:26,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:00:26,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-04 16:00:26,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:00:26,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-04 16:00:26,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-04 16:00:26,257 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 68 [2024-06-04 16:00:26,257 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 82 transitions, 345 flow. Second operand has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:00:26,258 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:00:26,258 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 68 [2024-06-04 16:00:26,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:00:26,559 INFO L124 PetriNetUnfolderBase]: 1309/2778 cut-off events. [2024-06-04 16:00:26,559 INFO L125 PetriNetUnfolderBase]: For 2498/2534 co-relation queries the response was YES. [2024-06-04 16:00:26,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5893 conditions, 2778 events. 1309/2778 cut-off events. For 2498/2534 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 18887 event pairs, 286 based on Foata normal form. 59/2653 useless extension candidates. Maximal degree in co-relation 5708. Up to 1007 conditions per place. [2024-06-04 16:00:26,578 INFO L140 encePairwiseOnDemand]: 51/68 looper letters, 80 selfloop transitions, 20 changer transitions 2/137 dead transitions. [2024-06-04 16:00:26,578 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 137 transitions, 711 flow [2024-06-04 16:00:26,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 16:00:26,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 16:00:26,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 243 transitions. [2024-06-04 16:00:26,580 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7147058823529412 [2024-06-04 16:00:26,581 INFO L175 Difference]: Start difference. First operand has 82 places, 82 transitions, 345 flow. Second operand 5 states and 243 transitions. [2024-06-04 16:00:26,581 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 137 transitions, 711 flow [2024-06-04 16:00:26,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 137 transitions, 674 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-06-04 16:00:26,587 INFO L231 Difference]: Finished difference. Result has 87 places, 95 transitions, 466 flow [2024-06-04 16:00:26,588 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=466, PETRI_PLACES=87, PETRI_TRANSITIONS=95} [2024-06-04 16:00:26,589 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 26 predicate places. [2024-06-04 16:00:26,589 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 95 transitions, 466 flow [2024-06-04 16:00:26,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:00:26,590 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:00:26,590 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:00:26,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-04 16:00:26,590 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:00:26,591 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:00:26,591 INFO L85 PathProgramCache]: Analyzing trace with hash -696309160, now seen corresponding path program 1 times [2024-06-04 16:00:26,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:00:26,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852546295] [2024-06-04 16:00:26,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:00:26,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:00:26,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:00:26,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:00:26,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:00:26,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852546295] [2024-06-04 16:00:26,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852546295] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:00:26,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:00:26,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-04 16:00:26,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872911972] [2024-06-04 16:00:26,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:00:26,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-04 16:00:26,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:00:26,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-04 16:00:26,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-04 16:00:26,761 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 68 [2024-06-04 16:00:26,762 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 95 transitions, 466 flow. Second operand has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:00:26,762 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:00:26,762 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 68 [2024-06-04 16:00:26,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:00:27,059 INFO L124 PetriNetUnfolderBase]: 1253/2538 cut-off events. [2024-06-04 16:00:27,059 INFO L125 PetriNetUnfolderBase]: For 5722/5754 co-relation queries the response was YES. [2024-06-04 16:00:27,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6761 conditions, 2538 events. 1253/2538 cut-off events. For 5722/5754 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 16671 event pairs, 485 based on Foata normal form. 6/2433 useless extension candidates. Maximal degree in co-relation 6305. Up to 1634 conditions per place. [2024-06-04 16:00:27,082 INFO L140 encePairwiseOnDemand]: 62/68 looper letters, 52 selfloop transitions, 9 changer transitions 0/108 dead transitions. [2024-06-04 16:00:27,082 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 108 transitions, 640 flow [2024-06-04 16:00:27,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-04 16:00:27,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-04 16:00:27,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 192 transitions. [2024-06-04 16:00:27,086 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7058823529411765 [2024-06-04 16:00:27,086 INFO L175 Difference]: Start difference. First operand has 87 places, 95 transitions, 466 flow. Second operand 4 states and 192 transitions. [2024-06-04 16:00:27,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 108 transitions, 640 flow [2024-06-04 16:00:27,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 108 transitions, 640 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-06-04 16:00:27,095 INFO L231 Difference]: Finished difference. Result has 91 places, 97 transitions, 506 flow [2024-06-04 16:00:27,097 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=466, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=506, PETRI_PLACES=91, PETRI_TRANSITIONS=97} [2024-06-04 16:00:27,099 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 30 predicate places. [2024-06-04 16:00:27,100 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 97 transitions, 506 flow [2024-06-04 16:00:27,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:00:27,100 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:00:27,100 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:00:27,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-04 16:00:27,101 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:00:27,101 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:00:27,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1897335129, now seen corresponding path program 1 times [2024-06-04 16:00:27,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:00:27,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637762901] [2024-06-04 16:00:27,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:00:27,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:00:27,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:00:27,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:00:27,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:00:27,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637762901] [2024-06-04 16:00:27,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637762901] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:00:27,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:00:27,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-04 16:00:27,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085396270] [2024-06-04 16:00:27,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:00:27,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-04 16:00:27,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:00:27,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-04 16:00:27,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-04 16:00:27,262 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 68 [2024-06-04 16:00:27,263 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 97 transitions, 506 flow. Second operand has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:00:27,263 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:00:27,263 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 68 [2024-06-04 16:00:27,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:00:27,529 INFO L124 PetriNetUnfolderBase]: 1299/2656 cut-off events. [2024-06-04 16:00:27,529 INFO L125 PetriNetUnfolderBase]: For 7782/7820 co-relation queries the response was YES. [2024-06-04 16:00:27,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7430 conditions, 2656 events. 1299/2656 cut-off events. For 7782/7820 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 17401 event pairs, 542 based on Foata normal form. 1/2526 useless extension candidates. Maximal degree in co-relation 7189. Up to 1743 conditions per place. [2024-06-04 16:00:27,552 INFO L140 encePairwiseOnDemand]: 61/68 looper letters, 53 selfloop transitions, 9 changer transitions 0/109 dead transitions. [2024-06-04 16:00:27,552 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 109 transitions, 677 flow [2024-06-04 16:00:27,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-04 16:00:27,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-04 16:00:27,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 191 transitions. [2024-06-04 16:00:27,554 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7022058823529411 [2024-06-04 16:00:27,554 INFO L175 Difference]: Start difference. First operand has 91 places, 97 transitions, 506 flow. Second operand 4 states and 191 transitions. [2024-06-04 16:00:27,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 109 transitions, 677 flow [2024-06-04 16:00:27,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 109 transitions, 668 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-06-04 16:00:27,564 INFO L231 Difference]: Finished difference. Result has 94 places, 100 transitions, 538 flow [2024-06-04 16:00:27,564 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=497, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=538, PETRI_PLACES=94, PETRI_TRANSITIONS=100} [2024-06-04 16:00:27,565 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 33 predicate places. [2024-06-04 16:00:27,565 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 100 transitions, 538 flow [2024-06-04 16:00:27,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:00:27,565 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:00:27,566 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:00:27,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-04 16:00:27,566 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:00:27,566 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:00:27,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1387491418, now seen corresponding path program 1 times [2024-06-04 16:00:27,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:00:27,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958032627] [2024-06-04 16:00:27,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:00:27,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:00:27,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:00:27,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:00:27,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:00:27,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958032627] [2024-06-04 16:00:27,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958032627] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:00:27,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:00:27,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-04 16:00:27,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131933830] [2024-06-04 16:00:27,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:00:27,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-04 16:00:27,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:00:27,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-04 16:00:27,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-04 16:00:27,735 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 68 [2024-06-04 16:00:27,736 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 100 transitions, 538 flow. Second operand has 5 states, 5 states have (on average 37.6) internal successors, (188), 5 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:00:27,736 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:00:27,736 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 68 [2024-06-04 16:00:27,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:00:28,066 INFO L124 PetriNetUnfolderBase]: 1373/2782 cut-off events. [2024-06-04 16:00:28,067 INFO L125 PetriNetUnfolderBase]: For 9946/9999 co-relation queries the response was YES. [2024-06-04 16:00:28,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8177 conditions, 2782 events. 1373/2782 cut-off events. For 9946/9999 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 18204 event pairs, 462 based on Foata normal form. 4/2674 useless extension candidates. Maximal degree in co-relation 7627. Up to 1093 conditions per place. [2024-06-04 16:00:28,094 INFO L140 encePairwiseOnDemand]: 59/68 looper letters, 69 selfloop transitions, 17 changer transitions 0/131 dead transitions. [2024-06-04 16:00:28,095 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 131 transitions, 847 flow [2024-06-04 16:00:28,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 16:00:28,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 16:00:28,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 241 transitions. [2024-06-04 16:00:28,096 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7088235294117647 [2024-06-04 16:00:28,096 INFO L175 Difference]: Start difference. First operand has 94 places, 100 transitions, 538 flow. Second operand 5 states and 241 transitions. [2024-06-04 16:00:28,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 131 transitions, 847 flow [2024-06-04 16:00:28,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 131 transitions, 839 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-06-04 16:00:28,110 INFO L231 Difference]: Finished difference. Result has 99 places, 106 transitions, 618 flow [2024-06-04 16:00:28,111 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=530, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=618, PETRI_PLACES=99, PETRI_TRANSITIONS=106} [2024-06-04 16:00:28,112 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 38 predicate places. [2024-06-04 16:00:28,115 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 106 transitions, 618 flow [2024-06-04 16:00:28,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 37.6) internal successors, (188), 5 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:00:28,115 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:00:28,115 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:00:28,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-04 16:00:28,116 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:00:28,116 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:00:28,116 INFO L85 PathProgramCache]: Analyzing trace with hash -57058194, now seen corresponding path program 2 times [2024-06-04 16:00:28,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:00:28,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926371090] [2024-06-04 16:00:28,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:00:28,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:00:28,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:00:28,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:00:28,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:00:28,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926371090] [2024-06-04 16:00:28,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926371090] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:00:28,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:00:28,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-04 16:00:28,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365494348] [2024-06-04 16:00:28,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:00:28,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-04 16:00:28,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:00:28,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-04 16:00:28,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-04 16:00:28,260 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 68 [2024-06-04 16:00:28,260 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 106 transitions, 618 flow. Second operand has 5 states, 5 states have (on average 37.6) internal successors, (188), 5 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:00:28,260 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:00:28,261 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 68 [2024-06-04 16:00:28,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:00:28,570 INFO L124 PetriNetUnfolderBase]: 1404/2719 cut-off events. [2024-06-04 16:00:28,571 INFO L125 PetriNetUnfolderBase]: For 13416/13492 co-relation queries the response was YES. [2024-06-04 16:00:28,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9109 conditions, 2719 events. 1404/2719 cut-off events. For 13416/13492 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 17166 event pairs, 424 based on Foata normal form. 4/2617 useless extension candidates. Maximal degree in co-relation 8571. Up to 1004 conditions per place. [2024-06-04 16:00:28,600 INFO L140 encePairwiseOnDemand]: 59/68 looper letters, 67 selfloop transitions, 22 changer transitions 0/134 dead transitions. [2024-06-04 16:00:28,600 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 134 transitions, 936 flow [2024-06-04 16:00:28,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 16:00:28,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 16:00:28,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 241 transitions. [2024-06-04 16:00:28,603 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7088235294117647 [2024-06-04 16:00:28,603 INFO L175 Difference]: Start difference. First operand has 99 places, 106 transitions, 618 flow. Second operand 5 states and 241 transitions. [2024-06-04 16:00:28,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 134 transitions, 936 flow [2024-06-04 16:00:28,615 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 134 transitions, 926 flow, removed 5 selfloop flow, removed 0 redundant places. [2024-06-04 16:00:28,617 INFO L231 Difference]: Finished difference. Result has 104 places, 109 transitions, 686 flow [2024-06-04 16:00:28,617 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=608, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=686, PETRI_PLACES=104, PETRI_TRANSITIONS=109} [2024-06-04 16:00:28,618 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 43 predicate places. [2024-06-04 16:00:28,618 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 109 transitions, 686 flow [2024-06-04 16:00:28,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 37.6) internal successors, (188), 5 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:00:28,618 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:00:28,619 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:00:28,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-04 16:00:28,619 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:00:28,619 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:00:28,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1917078450, now seen corresponding path program 1 times [2024-06-04 16:00:28,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:00:28,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275075545] [2024-06-04 16:00:28,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:00:28,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:00:28,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:00:28,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:00:28,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:00:28,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275075545] [2024-06-04 16:00:28,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275075545] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:00:28,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:00:28,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-04 16:00:28,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193536779] [2024-06-04 16:00:28,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:00:28,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-04 16:00:28,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:00:28,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-04 16:00:28,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-04 16:00:28,766 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 68 [2024-06-04 16:00:28,767 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 109 transitions, 686 flow. Second operand has 5 states, 5 states have (on average 37.6) internal successors, (188), 5 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:00:28,767 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:00:28,767 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 68 [2024-06-04 16:00:28,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:00:29,065 INFO L124 PetriNetUnfolderBase]: 1368/2742 cut-off events. [2024-06-04 16:00:29,065 INFO L125 PetriNetUnfolderBase]: For 15708/15749 co-relation queries the response was YES. [2024-06-04 16:00:29,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9172 conditions, 2742 events. 1368/2742 cut-off events. For 15708/15749 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 17905 event pairs, 456 based on Foata normal form. 12/2646 useless extension candidates. Maximal degree in co-relation 6798. Up to 1056 conditions per place. [2024-06-04 16:00:29,086 INFO L140 encePairwiseOnDemand]: 59/68 looper letters, 72 selfloop transitions, 19 changer transitions 0/136 dead transitions. [2024-06-04 16:00:29,086 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 136 transitions, 999 flow [2024-06-04 16:00:29,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 16:00:29,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 16:00:29,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 240 transitions. [2024-06-04 16:00:29,088 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7058823529411765 [2024-06-04 16:00:29,088 INFO L175 Difference]: Start difference. First operand has 104 places, 109 transitions, 686 flow. Second operand 5 states and 240 transitions. [2024-06-04 16:00:29,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 136 transitions, 999 flow [2024-06-04 16:00:29,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 136 transitions, 965 flow, removed 5 selfloop flow, removed 2 redundant places. [2024-06-04 16:00:29,102 INFO L231 Difference]: Finished difference. Result has 107 places, 112 transitions, 720 flow [2024-06-04 16:00:29,102 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=652, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=720, PETRI_PLACES=107, PETRI_TRANSITIONS=112} [2024-06-04 16:00:29,103 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 46 predicate places. [2024-06-04 16:00:29,103 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 112 transitions, 720 flow [2024-06-04 16:00:29,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 37.6) internal successors, (188), 5 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:00:29,104 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:00:29,104 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:00:29,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-04 16:00:29,104 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:00:29,104 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:00:29,105 INFO L85 PathProgramCache]: Analyzing trace with hash 675332066, now seen corresponding path program 2 times [2024-06-04 16:00:29,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:00:29,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375802298] [2024-06-04 16:00:29,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:00:29,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:00:29,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:00:29,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:00:29,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:00:29,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375802298] [2024-06-04 16:00:29,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375802298] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:00:29,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:00:29,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-04 16:00:29,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779499095] [2024-06-04 16:00:29,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:00:29,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-04 16:00:29,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:00:29,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-04 16:00:29,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-04 16:00:29,266 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 68 [2024-06-04 16:00:29,267 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 112 transitions, 720 flow. Second operand has 5 states, 5 states have (on average 37.6) internal successors, (188), 5 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:00:29,267 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:00:29,267 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 68 [2024-06-04 16:00:29,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:00:29,592 INFO L124 PetriNetUnfolderBase]: 1432/2891 cut-off events. [2024-06-04 16:00:29,593 INFO L125 PetriNetUnfolderBase]: For 19279/19332 co-relation queries the response was YES. [2024-06-04 16:00:29,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10127 conditions, 2891 events. 1432/2891 cut-off events. For 19279/19332 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 18989 event pairs, 458 based on Foata normal form. 10/2818 useless extension candidates. Maximal degree in co-relation 9459. Up to 1158 conditions per place. [2024-06-04 16:00:29,618 INFO L140 encePairwiseOnDemand]: 59/68 looper letters, 76 selfloop transitions, 22 changer transitions 0/143 dead transitions. [2024-06-04 16:00:29,618 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 143 transitions, 1090 flow [2024-06-04 16:00:29,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 16:00:29,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 16:00:29,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 242 transitions. [2024-06-04 16:00:29,620 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.711764705882353 [2024-06-04 16:00:29,620 INFO L175 Difference]: Start difference. First operand has 107 places, 112 transitions, 720 flow. Second operand 5 states and 242 transitions. [2024-06-04 16:00:29,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 143 transitions, 1090 flow [2024-06-04 16:00:29,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 143 transitions, 1061 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-06-04 16:00:29,639 INFO L231 Difference]: Finished difference. Result has 110 places, 116 transitions, 776 flow [2024-06-04 16:00:29,639 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=692, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=776, PETRI_PLACES=110, PETRI_TRANSITIONS=116} [2024-06-04 16:00:29,640 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 49 predicate places. [2024-06-04 16:00:29,640 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 116 transitions, 776 flow [2024-06-04 16:00:29,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 37.6) internal successors, (188), 5 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:00:29,641 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:00:29,641 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:00:29,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-04 16:00:29,642 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:00:29,642 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:00:29,642 INFO L85 PathProgramCache]: Analyzing trace with hash -540124792, now seen corresponding path program 1 times [2024-06-04 16:00:29,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:00:29,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496195594] [2024-06-04 16:00:29,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:00:29,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:00:29,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:00:29,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:00:29,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:00:29,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496195594] [2024-06-04 16:00:29,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496195594] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:00:29,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:00:29,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-04 16:00:29,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722310500] [2024-06-04 16:00:29,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:00:29,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-04 16:00:29,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:00:29,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-04 16:00:29,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-04 16:00:29,707 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 68 [2024-06-04 16:00:29,707 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 116 transitions, 776 flow. Second operand has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 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-04 16:00:29,707 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:00:29,708 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 68 [2024-06-04 16:00:29,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:00:30,223 INFO L124 PetriNetUnfolderBase]: 2235/4439 cut-off events. [2024-06-04 16:00:30,223 INFO L125 PetriNetUnfolderBase]: For 16062/16390 co-relation queries the response was YES. [2024-06-04 16:00:30,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13837 conditions, 4439 events. 2235/4439 cut-off events. For 16062/16390 co-relation queries the response was YES. Maximal size of possible extension queue 230. Compared 32320 event pairs, 544 based on Foata normal form. 80/4129 useless extension candidates. Maximal degree in co-relation 13535. Up to 1850 conditions per place. [2024-06-04 16:00:30,260 INFO L140 encePairwiseOnDemand]: 51/68 looper letters, 97 selfloop transitions, 22 changer transitions 1/176 dead transitions. [2024-06-04 16:00:30,261 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 176 transitions, 1284 flow [2024-06-04 16:00:30,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 16:00:30,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 16:00:30,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 241 transitions. [2024-06-04 16:00:30,262 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7088235294117647 [2024-06-04 16:00:30,262 INFO L175 Difference]: Start difference. First operand has 110 places, 116 transitions, 776 flow. Second operand 5 states and 241 transitions. [2024-06-04 16:00:30,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 176 transitions, 1284 flow [2024-06-04 16:00:30,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 176 transitions, 1256 flow, removed 8 selfloop flow, removed 1 redundant places. [2024-06-04 16:00:30,289 INFO L231 Difference]: Finished difference. Result has 116 places, 129 transitions, 913 flow [2024-06-04 16:00:30,289 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=751, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=913, PETRI_PLACES=116, PETRI_TRANSITIONS=129} [2024-06-04 16:00:30,289 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 55 predicate places. [2024-06-04 16:00:30,290 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 129 transitions, 913 flow [2024-06-04 16:00:30,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 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-04 16:00:30,290 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:00:30,290 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:00:30,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-04 16:00:30,290 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:00:30,291 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:00:30,291 INFO L85 PathProgramCache]: Analyzing trace with hash -353404956, now seen corresponding path program 1 times [2024-06-04 16:00:30,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:00:30,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328293059] [2024-06-04 16:00:30,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:00:30,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:00:30,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:00:30,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:00:30,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:00:30,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328293059] [2024-06-04 16:00:30,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328293059] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:00:30,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:00:30,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-04 16:00:30,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471580921] [2024-06-04 16:00:30,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:00:30,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-04 16:00:30,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:00:30,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-04 16:00:30,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-04 16:00:30,429 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 68 [2024-06-04 16:00:30,429 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 129 transitions, 913 flow. Second operand has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:00:30,429 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:00:30,429 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 68 [2024-06-04 16:00:30,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:00:30,882 INFO L124 PetriNetUnfolderBase]: 2095/4271 cut-off events. [2024-06-04 16:00:30,883 INFO L125 PetriNetUnfolderBase]: For 36454/36559 co-relation queries the response was YES. [2024-06-04 16:00:30,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17253 conditions, 4271 events. 2095/4271 cut-off events. For 36454/36559 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 31055 event pairs, 852 based on Foata normal form. 3/4190 useless extension candidates. Maximal degree in co-relation 16977. Up to 2873 conditions per place. [2024-06-04 16:00:30,928 INFO L140 encePairwiseOnDemand]: 63/68 looper letters, 67 selfloop transitions, 8 changer transitions 0/135 dead transitions. [2024-06-04 16:00:30,928 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 135 transitions, 1077 flow [2024-06-04 16:00:30,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-04 16:00:30,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-04 16:00:30,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 187 transitions. [2024-06-04 16:00:30,930 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6875 [2024-06-04 16:00:30,930 INFO L175 Difference]: Start difference. First operand has 116 places, 129 transitions, 913 flow. Second operand 4 states and 187 transitions. [2024-06-04 16:00:30,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 135 transitions, 1077 flow [2024-06-04 16:00:30,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 135 transitions, 1077 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-06-04 16:00:30,964 INFO L231 Difference]: Finished difference. Result has 120 places, 129 transitions, 934 flow [2024-06-04 16:00:30,964 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=913, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=934, PETRI_PLACES=120, PETRI_TRANSITIONS=129} [2024-06-04 16:00:30,965 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 59 predicate places. [2024-06-04 16:00:30,965 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 129 transitions, 934 flow [2024-06-04 16:00:30,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:00:30,965 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:00:30,965 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:00:30,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-04 16:00:30,966 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:00:30,966 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:00:30,966 INFO L85 PathProgramCache]: Analyzing trace with hash -739200223, now seen corresponding path program 1 times [2024-06-04 16:00:30,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:00:30,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322838737] [2024-06-04 16:00:30,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:00:30,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:00:30,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:00:31,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:00:31,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:00:31,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322838737] [2024-06-04 16:00:31,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322838737] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:00:31,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:00:31,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-04 16:00:31,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248464593] [2024-06-04 16:00:31,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:00:31,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-04 16:00:31,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:00:31,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-04 16:00:31,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-04 16:00:31,117 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 68 [2024-06-04 16:00:31,118 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 129 transitions, 934 flow. Second operand has 5 states, 5 states have (on average 37.8) internal successors, (189), 5 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:00:31,118 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:00:31,118 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 68 [2024-06-04 16:00:31,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:00:31,660 INFO L124 PetriNetUnfolderBase]: 2203/4397 cut-off events. [2024-06-04 16:00:31,661 INFO L125 PetriNetUnfolderBase]: For 42346/42466 co-relation queries the response was YES. [2024-06-04 16:00:31,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18137 conditions, 4397 events. 2203/4397 cut-off events. For 42346/42466 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 31106 event pairs, 710 based on Foata normal form. 16/4339 useless extension candidates. Maximal degree in co-relation 12813. Up to 1454 conditions per place. [2024-06-04 16:00:31,705 INFO L140 encePairwiseOnDemand]: 60/68 looper letters, 89 selfloop transitions, 18 changer transitions 0/164 dead transitions. [2024-06-04 16:00:31,705 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 164 transitions, 1365 flow [2024-06-04 16:00:31,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 16:00:31,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 16:00:31,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 243 transitions. [2024-06-04 16:00:31,707 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7147058823529412 [2024-06-04 16:00:31,707 INFO L175 Difference]: Start difference. First operand has 120 places, 129 transitions, 934 flow. Second operand 5 states and 243 transitions. [2024-06-04 16:00:31,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 164 transitions, 1365 flow [2024-06-04 16:00:31,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 164 transitions, 1335 flow, removed 1 selfloop flow, removed 4 redundant places. [2024-06-04 16:00:31,750 INFO L231 Difference]: Finished difference. Result has 123 places, 135 transitions, 1033 flow [2024-06-04 16:00:31,751 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=904, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1033, PETRI_PLACES=123, PETRI_TRANSITIONS=135} [2024-06-04 16:00:31,751 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 62 predicate places. [2024-06-04 16:00:31,751 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 135 transitions, 1033 flow [2024-06-04 16:00:31,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 37.8) internal successors, (189), 5 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:00:31,752 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:00:31,752 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:00:31,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-04 16:00:31,753 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:00:31,753 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:00:31,753 INFO L85 PathProgramCache]: Analyzing trace with hash -525305469, now seen corresponding path program 2 times [2024-06-04 16:00:31,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:00:31,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553741418] [2024-06-04 16:00:31,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:00:31,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:00:31,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:00:31,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:00:31,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:00:31,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553741418] [2024-06-04 16:00:31,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553741418] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:00:31,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:00:31,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-04 16:00:31,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640704344] [2024-06-04 16:00:31,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:00:31,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-04 16:00:31,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:00:31,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-04 16:00:31,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-04 16:00:31,905 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 68 [2024-06-04 16:00:31,905 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 135 transitions, 1033 flow. Second operand has 5 states, 5 states have (on average 37.8) internal successors, (189), 5 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:00:31,906 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:00:31,906 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 68 [2024-06-04 16:00:31,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:00:32,468 INFO L124 PetriNetUnfolderBase]: 2228/4368 cut-off events. [2024-06-04 16:00:32,468 INFO L125 PetriNetUnfolderBase]: For 50582/50731 co-relation queries the response was YES. [2024-06-04 16:00:32,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19469 conditions, 4368 events. 2228/4368 cut-off events. For 50582/50731 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 30598 event pairs, 772 based on Foata normal form. 16/4266 useless extension candidates. Maximal degree in co-relation 13695. Up to 1596 conditions per place. [2024-06-04 16:00:32,527 INFO L140 encePairwiseOnDemand]: 60/68 looper letters, 81 selfloop transitions, 26 changer transitions 0/164 dead transitions. [2024-06-04 16:00:32,527 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 164 transitions, 1436 flow [2024-06-04 16:00:32,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 16:00:32,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 16:00:32,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 242 transitions. [2024-06-04 16:00:32,529 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.711764705882353 [2024-06-04 16:00:32,529 INFO L175 Difference]: Start difference. First operand has 123 places, 135 transitions, 1033 flow. Second operand 5 states and 242 transitions. [2024-06-04 16:00:32,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 164 transitions, 1436 flow [2024-06-04 16:00:32,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 164 transitions, 1417 flow, removed 6 selfloop flow, removed 1 redundant places. [2024-06-04 16:00:32,587 INFO L231 Difference]: Finished difference. Result has 128 places, 139 transitions, 1147 flow [2024-06-04 16:00:32,587 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=1014, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1147, PETRI_PLACES=128, PETRI_TRANSITIONS=139} [2024-06-04 16:00:32,588 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 67 predicate places. [2024-06-04 16:00:32,588 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 139 transitions, 1147 flow [2024-06-04 16:00:32,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 37.8) internal successors, (189), 5 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:00:32,588 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:00:32,589 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:00:32,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-04 16:00:32,589 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:00:32,589 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:00:32,589 INFO L85 PathProgramCache]: Analyzing trace with hash -554859102, now seen corresponding path program 1 times [2024-06-04 16:00:32,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:00:32,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270917210] [2024-06-04 16:00:32,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:00:32,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:00:32,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:00:32,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:00:32,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:00:32,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270917210] [2024-06-04 16:00:32,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270917210] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:00:32,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:00:32,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-04 16:00:32,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326126360] [2024-06-04 16:00:32,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:00:32,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-04 16:00:32,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:00:32,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-04 16:00:32,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-04 16:00:32,657 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 68 [2024-06-04 16:00:32,658 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 139 transitions, 1147 flow. Second operand has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:00:32,658 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:00:32,658 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 68 [2024-06-04 16:00:32,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:00:33,243 INFO L124 PetriNetUnfolderBase]: 2082/4285 cut-off events. [2024-06-04 16:00:33,244 INFO L125 PetriNetUnfolderBase]: For 26698/27055 co-relation queries the response was YES. [2024-06-04 16:00:33,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16285 conditions, 4285 events. 2082/4285 cut-off events. For 26698/27055 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 31340 event pairs, 569 based on Foata normal form. 107/4168 useless extension candidates. Maximal degree in co-relation 11945. Up to 1277 conditions per place. [2024-06-04 16:00:33,290 INFO L140 encePairwiseOnDemand]: 50/68 looper letters, 88 selfloop transitions, 61 changer transitions 0/207 dead transitions. [2024-06-04 16:00:33,291 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 207 transitions, 1841 flow [2024-06-04 16:00:33,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 16:00:33,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 16:00:33,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 246 transitions. [2024-06-04 16:00:33,292 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7235294117647059 [2024-06-04 16:00:33,293 INFO L175 Difference]: Start difference. First operand has 128 places, 139 transitions, 1147 flow. Second operand 5 states and 246 transitions. [2024-06-04 16:00:33,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 207 transitions, 1841 flow [2024-06-04 16:00:33,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 207 transitions, 1799 flow, removed 7 selfloop flow, removed 2 redundant places. [2024-06-04 16:00:33,361 INFO L231 Difference]: Finished difference. Result has 134 places, 176 transitions, 1672 flow [2024-06-04 16:00:33,362 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=1083, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1672, PETRI_PLACES=134, PETRI_TRANSITIONS=176} [2024-06-04 16:00:33,363 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 73 predicate places. [2024-06-04 16:00:33,363 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 176 transitions, 1672 flow [2024-06-04 16:00:33,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:00:33,364 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:00:33,364 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:00:33,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-04 16:00:33,364 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:00:33,365 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:00:33,365 INFO L85 PathProgramCache]: Analyzing trace with hash -553905821, now seen corresponding path program 1 times [2024-06-04 16:00:33,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:00:33,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883547221] [2024-06-04 16:00:33,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:00:33,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:00:33,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:00:33,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:00:33,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:00:33,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883547221] [2024-06-04 16:00:33,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883547221] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:00:33,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:00:33,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-04 16:00:33,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514115141] [2024-06-04 16:00:33,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:00:33,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-04 16:00:33,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:00:33,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-04 16:00:33,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-04 16:00:33,552 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 68 [2024-06-04 16:00:33,553 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 176 transitions, 1672 flow. Second operand has 5 states, 5 states have (on average 37.8) internal successors, (189), 5 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:00:33,553 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:00:33,553 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 68 [2024-06-04 16:00:33,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:00:34,244 INFO L124 PetriNetUnfolderBase]: 2411/4810 cut-off events. [2024-06-04 16:00:34,244 INFO L125 PetriNetUnfolderBase]: For 67465/67693 co-relation queries the response was YES. [2024-06-04 16:00:34,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23693 conditions, 4810 events. 2411/4810 cut-off events. For 67465/67693 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 34789 event pairs, 853 based on Foata normal form. 29/4692 useless extension candidates. Maximal degree in co-relation 17469. Up to 1802 conditions per place. [2024-06-04 16:00:34,295 INFO L140 encePairwiseOnDemand]: 60/68 looper letters, 95 selfloop transitions, 26 changer transitions 0/200 dead transitions. [2024-06-04 16:00:34,295 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 200 transitions, 2089 flow [2024-06-04 16:00:34,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 16:00:34,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 16:00:34,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 240 transitions. [2024-06-04 16:00:34,297 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7058823529411765 [2024-06-04 16:00:34,298 INFO L175 Difference]: Start difference. First operand has 134 places, 176 transitions, 1672 flow. Second operand 5 states and 240 transitions. [2024-06-04 16:00:34,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 200 transitions, 2089 flow [2024-06-04 16:00:34,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 200 transitions, 2047 flow, removed 12 selfloop flow, removed 1 redundant places. [2024-06-04 16:00:34,395 INFO L231 Difference]: Finished difference. Result has 138 places, 177 transitions, 1707 flow [2024-06-04 16:00:34,395 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=1630, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1707, PETRI_PLACES=138, PETRI_TRANSITIONS=177} [2024-06-04 16:00:34,396 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 77 predicate places. [2024-06-04 16:00:34,396 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 177 transitions, 1707 flow [2024-06-04 16:00:34,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 37.8) internal successors, (189), 5 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:00:34,396 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:00:34,397 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:00:34,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-04 16:00:34,397 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:00:34,397 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:00:34,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1929039442, now seen corresponding path program 2 times [2024-06-04 16:00:34,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:00:34,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874999672] [2024-06-04 16:00:34,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:00:34,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:00:34,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:00:34,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:00:34,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:00:34,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874999672] [2024-06-04 16:00:34,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874999672] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:00:34,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:00:34,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-04 16:00:34,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578361789] [2024-06-04 16:00:34,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:00:34,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-04 16:00:34,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:00:34,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-04 16:00:34,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-04 16:00:34,534 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 68 [2024-06-04 16:00:34,535 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 177 transitions, 1707 flow. Second operand has 5 states, 5 states have (on average 38.0) internal successors, (190), 5 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:00:34,535 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:00:34,535 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 68 [2024-06-04 16:00:34,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:00:35,152 INFO L124 PetriNetUnfolderBase]: 2445/4920 cut-off events. [2024-06-04 16:00:35,153 INFO L125 PetriNetUnfolderBase]: For 73197/73415 co-relation queries the response was YES. [2024-06-04 16:00:35,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24377 conditions, 4920 events. 2445/4920 cut-off events. For 73197/73415 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 35697 event pairs, 777 based on Foata normal form. 56/4880 useless extension candidates. Maximal degree in co-relation 17994. Up to 1985 conditions per place. [2024-06-04 16:00:35,201 INFO L140 encePairwiseOnDemand]: 59/68 looper letters, 96 selfloop transitions, 31 changer transitions 0/206 dead transitions. [2024-06-04 16:00:35,201 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 206 transitions, 2199 flow [2024-06-04 16:00:35,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 16:00:35,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 16:00:35,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 240 transitions. [2024-06-04 16:00:35,203 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7058823529411765 [2024-06-04 16:00:35,203 INFO L175 Difference]: Start difference. First operand has 138 places, 177 transitions, 1707 flow. Second operand 5 states and 240 transitions. [2024-06-04 16:00:35,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 206 transitions, 2199 flow [2024-06-04 16:00:35,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 206 transitions, 2156 flow, removed 8 selfloop flow, removed 2 redundant places. [2024-06-04 16:00:35,293 INFO L231 Difference]: Finished difference. Result has 141 places, 181 transitions, 1779 flow [2024-06-04 16:00:35,293 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=1664, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1779, PETRI_PLACES=141, PETRI_TRANSITIONS=181} [2024-06-04 16:00:35,294 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 80 predicate places. [2024-06-04 16:00:35,294 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 181 transitions, 1779 flow [2024-06-04 16:00:35,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.0) internal successors, (190), 5 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:00:35,295 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:00:35,295 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:00:35,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-04 16:00:35,295 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:00:35,296 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:00:35,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1931390482, now seen corresponding path program 3 times [2024-06-04 16:00:35,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:00:35,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697222950] [2024-06-04 16:00:35,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:00:35,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:00:35,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:00:35,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:00:35,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:00:35,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697222950] [2024-06-04 16:00:35,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697222950] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:00:35,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:00:35,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-04 16:00:35,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622699926] [2024-06-04 16:00:35,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:00:35,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-04 16:00:35,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:00:35,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-04 16:00:35,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-04 16:00:35,427 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 68 [2024-06-04 16:00:35,428 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 181 transitions, 1779 flow. Second operand has 5 states, 5 states have (on average 38.0) internal successors, (190), 5 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:00:35,428 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:00:35,428 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 68 [2024-06-04 16:00:35,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:00:35,968 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([380] L749-1-->L756: Formula: (= v_~flag1~0_13 0) InVars {} OutVars{~flag1~0=v_~flag1~0_13} AuxVars[] AssignedVars[~flag1~0][182], [thr2Thread1of1ForFork1InUse, Black: 131#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 3)), Black: 195#(and (= ~x~0 0) (= ~flag2~0 3) (= ~flag1~0 3)), 161#(= ~x~0 0), Black: 70#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 0)), Black: 137#(and (= ~x~0 0) (= ~flag1~0 1) (= ~flag2~0 3)), Black: 75#(and (= ~x~0 0) (= ~flag1~0 1) (= ~flag2~0 0)), Black: 143#(and (= ~x~0 0) (= ~flag1~0 1) (= ~flag2~0 3)), Black: 80#(and (= ~x~0 0) (= ~flag1~0 3) (= ~flag2~0 0)), 177#(<= 3 |thr2Thread1of1ForFork1_~f12~0#1|), 101#true, 147#(<= ~flag1~0 0), Black: 85#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 1)), Black: 84#(and (= ~flag1~0 0) (= ~x~0 0)), Black: 148#(<= |thr2Thread1of1ForFork1_~f12~0#1| 0), Black: 150#(and (<= ~flag1~0 0) (<= |thr2Thread1of1ForFork1_~f12~0#1| 0)), 82#true, Black: 88#true, Black: 92#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 157#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 4)), Black: 99#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1)), 193#(= ~x~0 0), Black: 162#(and (= ~x~0 0) (= ~flag1~0 4)), 29#L799true, Black: 163#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 4)), 122#(= ~x~0 0), Black: 106#(and (= |thr1Thread1of1ForFork0_~f21~0#1| 0) (= ~flag2~0 0)), Black: 104#(= |thr1Thread1of1ForFork0_~f21~0#1| 0), Black: 171#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 4)), Black: 170#(and (= ~x~0 0) (= ~flag2~0 1)), Black: 103#(= ~flag2~0 0), 27#ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANTtrue, Black: 113#(and (= ~x~0 0) (= ~flag1~0 4) (= ~flag2~0 0)), 141#(= ~x~0 0), Black: 179#(and (<= 3 |thr2Thread1of1ForFork1_~f12~0#1|) (<= 3 ~flag1~0)), Black: 176#(<= 3 ~flag1~0), Black: 118#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 3)), 199#(= ~x~0 0), Black: 174#true, 135#(= ~x~0 0), 13#L756true, Black: 124#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 3)), Black: 189#(and (= ~x~0 0) (= ~flag2~0 1) (= 2 ~flag1~0))]) [2024-06-04 16:00:35,968 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2024-06-04 16:00:35,968 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-04 16:00:35,969 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-04 16:00:35,969 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-04 16:00:36,027 INFO L124 PetriNetUnfolderBase]: 2389/4801 cut-off events. [2024-06-04 16:00:36,028 INFO L125 PetriNetUnfolderBase]: For 80083/80292 co-relation queries the response was YES. [2024-06-04 16:00:36,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24500 conditions, 4801 events. 2389/4801 cut-off events. For 80083/80292 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 34664 event pairs, 837 based on Foata normal form. 77/4781 useless extension candidates. Maximal degree in co-relation 18019. Up to 1870 conditions per place. [2024-06-04 16:00:36,149 INFO L140 encePairwiseOnDemand]: 58/68 looper letters, 105 selfloop transitions, 29 changer transitions 0/213 dead transitions. [2024-06-04 16:00:36,149 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 213 transitions, 2352 flow [2024-06-04 16:00:36,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 16:00:36,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 16:00:36,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 242 transitions. [2024-06-04 16:00:36,151 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.711764705882353 [2024-06-04 16:00:36,151 INFO L175 Difference]: Start difference. First operand has 141 places, 181 transitions, 1779 flow. Second operand 5 states and 242 transitions. [2024-06-04 16:00:36,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 213 transitions, 2352 flow [2024-06-04 16:00:36,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 213 transitions, 2298 flow, removed 8 selfloop flow, removed 2 redundant places. [2024-06-04 16:00:36,239 INFO L231 Difference]: Finished difference. Result has 144 places, 186 transitions, 1858 flow [2024-06-04 16:00:36,239 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=1728, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1858, PETRI_PLACES=144, PETRI_TRANSITIONS=186} [2024-06-04 16:00:36,240 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 83 predicate places. [2024-06-04 16:00:36,240 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 186 transitions, 1858 flow [2024-06-04 16:00:36,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.0) internal successors, (190), 5 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:00:36,240 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:00:36,240 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:00:36,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-04 16:00:36,241 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:00:36,241 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:00:36,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1324426055, now seen corresponding path program 1 times [2024-06-04 16:00:36,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:00:36,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794031357] [2024-06-04 16:00:36,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:00:36,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:00:36,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:00:36,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:00:36,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:00:36,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794031357] [2024-06-04 16:00:36,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794031357] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:00:36,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:00:36,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-04 16:00:36,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015770142] [2024-06-04 16:00:36,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:00:36,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-04 16:00:36,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:00:36,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-04 16:00:36,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-04 16:00:36,293 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 68 [2024-06-04 16:00:36,293 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 186 transitions, 1858 flow. Second operand has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:00:36,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:00:36,294 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 68 [2024-06-04 16:00:36,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:00:36,908 INFO L124 PetriNetUnfolderBase]: 2454/4993 cut-off events. [2024-06-04 16:00:36,908 INFO L125 PetriNetUnfolderBase]: For 48071/48480 co-relation queries the response was YES. [2024-06-04 16:00:36,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22069 conditions, 4993 events. 2454/4993 cut-off events. For 48071/48480 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 37568 event pairs, 1040 based on Foata normal form. 146/4831 useless extension candidates. Maximal degree in co-relation 15524. Up to 2653 conditions per place. [2024-06-04 16:00:36,950 INFO L140 encePairwiseOnDemand]: 54/68 looper letters, 156 selfloop transitions, 36 changer transitions 0/250 dead transitions. [2024-06-04 16:00:36,950 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 250 transitions, 2782 flow [2024-06-04 16:00:36,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 16:00:36,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 16:00:36,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 230 transitions. [2024-06-04 16:00:36,952 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6764705882352942 [2024-06-04 16:00:36,952 INFO L175 Difference]: Start difference. First operand has 144 places, 186 transitions, 1858 flow. Second operand 5 states and 230 transitions. [2024-06-04 16:00:36,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 250 transitions, 2782 flow [2024-06-04 16:00:37,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 250 transitions, 2712 flow, removed 15 selfloop flow, removed 2 redundant places. [2024-06-04 16:00:37,059 INFO L231 Difference]: Finished difference. Result has 150 places, 203 transitions, 2148 flow [2024-06-04 16:00:37,059 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=1745, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2148, PETRI_PLACES=150, PETRI_TRANSITIONS=203} [2024-06-04 16:00:37,059 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 89 predicate places. [2024-06-04 16:00:37,059 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 203 transitions, 2148 flow [2024-06-04 16:00:37,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:00:37,060 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:00:37,060 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:00:37,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-04 16:00:37,060 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:00:37,061 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:00:37,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1909772417, now seen corresponding path program 1 times [2024-06-04 16:00:37,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:00:37,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288799976] [2024-06-04 16:00:37,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:00:37,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:00:37,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:00:37,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:00:37,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:00:37,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288799976] [2024-06-04 16:00:37,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288799976] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:00:37,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:00:37,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-04 16:00:37,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655270354] [2024-06-04 16:00:37,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:00:37,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-04 16:00:37,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:00:37,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-04 16:00:37,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-04 16:00:37,191 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 68 [2024-06-04 16:00:37,192 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 203 transitions, 2148 flow. Second operand has 5 states, 5 states have (on average 37.8) internal successors, (189), 5 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:00:37,192 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:00:37,192 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 68 [2024-06-04 16:00:37,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:00:37,867 INFO L124 PetriNetUnfolderBase]: 2569/5237 cut-off events. [2024-06-04 16:00:37,867 INFO L125 PetriNetUnfolderBase]: For 98508/98709 co-relation queries the response was YES. [2024-06-04 16:00:37,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27462 conditions, 5237 events. 2569/5237 cut-off events. For 98508/98709 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 39004 event pairs, 942 based on Foata normal form. 41/5159 useless extension candidates. Maximal degree in co-relation 19432. Up to 2292 conditions per place. [2024-06-04 16:00:37,915 INFO L140 encePairwiseOnDemand]: 61/68 looper letters, 105 selfloop transitions, 26 changer transitions 0/225 dead transitions. [2024-06-04 16:00:37,916 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 225 transitions, 2596 flow [2024-06-04 16:00:37,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 16:00:37,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 16:00:37,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 237 transitions. [2024-06-04 16:00:37,917 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6970588235294117 [2024-06-04 16:00:37,917 INFO L175 Difference]: Start difference. First operand has 150 places, 203 transitions, 2148 flow. Second operand 5 states and 237 transitions. [2024-06-04 16:00:37,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 225 transitions, 2596 flow [2024-06-04 16:00:38,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 225 transitions, 2584 flow, removed 6 selfloop flow, removed 0 redundant places. [2024-06-04 16:00:38,020 INFO L231 Difference]: Finished difference. Result has 155 places, 204 transitions, 2215 flow [2024-06-04 16:00:38,020 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=2136, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2215, PETRI_PLACES=155, PETRI_TRANSITIONS=204} [2024-06-04 16:00:38,021 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 94 predicate places. [2024-06-04 16:00:38,021 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 204 transitions, 2215 flow [2024-06-04 16:00:38,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 37.8) internal successors, (189), 5 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:00:38,021 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:00:38,022 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:00:38,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-04 16:00:38,022 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:00:38,022 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:00:38,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1174715329, now seen corresponding path program 2 times [2024-06-04 16:00:38,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:00:38,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762987163] [2024-06-04 16:00:38,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:00:38,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:00:38,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:00:38,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:00:38,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:00:38,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762987163] [2024-06-04 16:00:38,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762987163] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:00:38,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:00:38,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-04 16:00:38,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621712088] [2024-06-04 16:00:38,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:00:38,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-04 16:00:38,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:00:38,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-04 16:00:38,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-04 16:00:38,163 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 68 [2024-06-04 16:00:38,163 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 204 transitions, 2215 flow. Second operand has 5 states, 5 states have (on average 37.8) internal successors, (189), 5 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:00:38,164 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:00:38,164 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 68 [2024-06-04 16:00:38,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:00:38,825 INFO L124 PetriNetUnfolderBase]: 2562/5209 cut-off events. [2024-06-04 16:00:38,825 INFO L125 PetriNetUnfolderBase]: For 107982/108199 co-relation queries the response was YES. [2024-06-04 16:00:38,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28081 conditions, 5209 events. 2562/5209 cut-off events. For 107982/108199 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 38680 event pairs, 1039 based on Foata normal form. 35/5116 useless extension candidates. Maximal degree in co-relation 19859. Up to 2293 conditions per place. [2024-06-04 16:00:38,868 INFO L140 encePairwiseOnDemand]: 61/68 looper letters, 106 selfloop transitions, 28 changer transitions 0/228 dead transitions. [2024-06-04 16:00:38,869 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 228 transitions, 2712 flow [2024-06-04 16:00:38,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 16:00:38,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 16:00:38,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 238 transitions. [2024-06-04 16:00:38,870 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7 [2024-06-04 16:00:38,870 INFO L175 Difference]: Start difference. First operand has 155 places, 204 transitions, 2215 flow. Second operand 5 states and 238 transitions. [2024-06-04 16:00:38,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 228 transitions, 2712 flow [2024-06-04 16:00:38,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 228 transitions, 2673 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-06-04 16:00:38,974 INFO L231 Difference]: Finished difference. Result has 158 places, 207 transitions, 2299 flow [2024-06-04 16:00:38,975 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=2179, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2299, PETRI_PLACES=158, PETRI_TRANSITIONS=207} [2024-06-04 16:00:38,975 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 97 predicate places. [2024-06-04 16:00:38,975 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 207 transitions, 2299 flow [2024-06-04 16:00:38,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 37.8) internal successors, (189), 5 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:00:38,976 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:00:38,976 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:00:38,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-04 16:00:38,976 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:00:38,977 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:00:38,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1562890865, now seen corresponding path program 3 times [2024-06-04 16:00:38,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:00:38,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733671863] [2024-06-04 16:00:38,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:00:38,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:00:38,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:00:39,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:00:39,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:00:39,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733671863] [2024-06-04 16:00:39,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733671863] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:00:39,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:00:39,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-04 16:00:39,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707354935] [2024-06-04 16:00:39,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:00:39,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-04 16:00:39,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:00:39,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-04 16:00:39,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-04 16:00:39,119 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 68 [2024-06-04 16:00:39,119 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 207 transitions, 2299 flow. Second operand has 5 states, 5 states have (on average 37.8) internal successors, (189), 5 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:00:39,120 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:00:39,120 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 68 [2024-06-04 16:00:39,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:00:39,759 INFO L124 PetriNetUnfolderBase]: 2598/5270 cut-off events. [2024-06-04 16:00:39,760 INFO L125 PetriNetUnfolderBase]: For 116393/116613 co-relation queries the response was YES. [2024-06-04 16:00:39,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28691 conditions, 5270 events. 2598/5270 cut-off events. For 116393/116613 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 38656 event pairs, 974 based on Foata normal form. 40/5222 useless extension candidates. Maximal degree in co-relation 15203. Up to 2045 conditions per place. [2024-06-04 16:00:39,803 INFO L140 encePairwiseOnDemand]: 61/68 looper letters, 127 selfloop transitions, 17 changer transitions 0/238 dead transitions. [2024-06-04 16:00:39,803 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 238 transitions, 2891 flow [2024-06-04 16:00:39,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 16:00:39,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 16:00:39,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 240 transitions. [2024-06-04 16:00:39,805 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7058823529411765 [2024-06-04 16:00:39,805 INFO L175 Difference]: Start difference. First operand has 158 places, 207 transitions, 2299 flow. Second operand 5 states and 240 transitions. [2024-06-04 16:00:39,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 238 transitions, 2891 flow [2024-06-04 16:00:39,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 238 transitions, 2846 flow, removed 6 selfloop flow, removed 2 redundant places. [2024-06-04 16:00:39,903 INFO L231 Difference]: Finished difference. Result has 161 places, 207 transitions, 2294 flow [2024-06-04 16:00:39,904 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=2254, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2294, PETRI_PLACES=161, PETRI_TRANSITIONS=207} [2024-06-04 16:00:39,904 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 100 predicate places. [2024-06-04 16:00:39,904 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 207 transitions, 2294 flow [2024-06-04 16:00:39,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 37.8) internal successors, (189), 5 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:00:39,904 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:00:39,905 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:00:39,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-04 16:00:39,905 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:00:39,905 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:00:39,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1008395796, now seen corresponding path program 1 times [2024-06-04 16:00:39,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:00:39,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621273052] [2024-06-04 16:00:39,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:00:39,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:00:39,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:00:39,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:00:39,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:00:39,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621273052] [2024-06-04 16:00:39,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621273052] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:00:39,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:00:39,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-04 16:00:39,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945647569] [2024-06-04 16:00:39,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:00:39,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-04 16:00:39,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:00:39,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-04 16:00:39,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-04 16:00:40,056 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 68 [2024-06-04 16:00:40,057 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 207 transitions, 2294 flow. Second operand has 5 states, 5 states have (on average 37.6) internal successors, (188), 5 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:00:40,057 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:00:40,057 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 68 [2024-06-04 16:00:40,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:00:40,757 INFO L124 PetriNetUnfolderBase]: 2661/5465 cut-off events. [2024-06-04 16:00:40,757 INFO L125 PetriNetUnfolderBase]: For 133767/133991 co-relation queries the response was YES. [2024-06-04 16:00:40,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30017 conditions, 5465 events. 2661/5465 cut-off events. For 133767/133991 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 40816 event pairs, 608 based on Foata normal form. 58/5425 useless extension candidates. Maximal degree in co-relation 29625. Up to 2372 conditions per place. [2024-06-04 16:00:40,808 INFO L140 encePairwiseOnDemand]: 60/68 looper letters, 130 selfloop transitions, 15 changer transitions 2/241 dead transitions. [2024-06-04 16:00:40,808 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 241 transitions, 2908 flow [2024-06-04 16:00:40,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 16:00:40,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 16:00:40,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 238 transitions. [2024-06-04 16:00:40,809 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7 [2024-06-04 16:00:40,810 INFO L175 Difference]: Start difference. First operand has 161 places, 207 transitions, 2294 flow. Second operand 5 states and 238 transitions. [2024-06-04 16:00:40,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 241 transitions, 2908 flow [2024-06-04 16:00:40,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 241 transitions, 2793 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-06-04 16:00:40,917 INFO L231 Difference]: Finished difference. Result has 161 places, 210 transitions, 2286 flow [2024-06-04 16:00:40,917 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=2171, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2286, PETRI_PLACES=161, PETRI_TRANSITIONS=210} [2024-06-04 16:00:40,918 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 100 predicate places. [2024-06-04 16:00:40,918 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 210 transitions, 2286 flow [2024-06-04 16:00:40,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 37.6) internal successors, (188), 5 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:00:40,918 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:00:40,918 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:00:40,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-04 16:00:40,919 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:00:40,919 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:00:40,919 INFO L85 PathProgramCache]: Analyzing trace with hash -808075808, now seen corresponding path program 1 times [2024-06-04 16:00:40,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:00:40,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882477304] [2024-06-04 16:00:40,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:00:40,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:00:40,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:00:40,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:00:40,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:00:40,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882477304] [2024-06-04 16:00:40,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882477304] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:00:40,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:00:40,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-04 16:00:40,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222821475] [2024-06-04 16:00:40,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:00:40,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-04 16:00:40,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:00:40,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-04 16:00:40,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-04 16:00:41,072 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 68 [2024-06-04 16:00:41,072 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 210 transitions, 2286 flow. Second operand has 5 states, 5 states have (on average 37.8) internal successors, (189), 5 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:00:41,072 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:00:41,072 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 68 [2024-06-04 16:00:41,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:00:41,674 INFO L124 PetriNetUnfolderBase]: 2678/5520 cut-off events. [2024-06-04 16:00:41,674 INFO L125 PetriNetUnfolderBase]: For 142899/143135 co-relation queries the response was YES. [2024-06-04 16:00:41,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30997 conditions, 5520 events. 2678/5520 cut-off events. For 142899/143135 co-relation queries the response was YES. Maximal size of possible extension queue 230. Compared 41663 event pairs, 965 based on Foata normal form. 49/5467 useless extension candidates. Maximal degree in co-relation 30592. Up to 2606 conditions per place. [2024-06-04 16:00:41,724 INFO L140 encePairwiseOnDemand]: 61/68 looper letters, 111 selfloop transitions, 30 changer transitions 1/236 dead transitions. [2024-06-04 16:00:41,724 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 236 transitions, 2808 flow [2024-06-04 16:00:41,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 16:00:41,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 16:00:41,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 233 transitions. [2024-06-04 16:00:41,726 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6852941176470588 [2024-06-04 16:00:41,726 INFO L175 Difference]: Start difference. First operand has 161 places, 210 transitions, 2286 flow. Second operand 5 states and 233 transitions. [2024-06-04 16:00:41,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 236 transitions, 2808 flow [2024-06-04 16:00:41,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 236 transitions, 2797 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-04 16:00:41,844 INFO L231 Difference]: Finished difference. Result has 167 places, 215 transitions, 2441 flow [2024-06-04 16:00:41,844 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=2277, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2441, PETRI_PLACES=167, PETRI_TRANSITIONS=215} [2024-06-04 16:00:41,844 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 106 predicate places. [2024-06-04 16:00:41,845 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 215 transitions, 2441 flow [2024-06-04 16:00:41,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 37.8) internal successors, (189), 5 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:00:41,845 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:00:41,845 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:00:41,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-04 16:00:41,845 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:00:41,845 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:00:41,845 INFO L85 PathProgramCache]: Analyzing trace with hash 254139939, now seen corresponding path program 1 times [2024-06-04 16:00:41,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:00:41,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172943273] [2024-06-04 16:00:41,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:00:41,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:00:41,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:00:41,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:00:41,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:00:41,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172943273] [2024-06-04 16:00:41,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172943273] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:00:41,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:00:41,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-04 16:00:41,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384461024] [2024-06-04 16:00:41,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:00:41,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-04 16:00:41,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:00:41,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-04 16:00:41,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-04 16:00:42,011 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 68 [2024-06-04 16:00:42,012 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 215 transitions, 2441 flow. Second operand has 5 states, 5 states have (on average 38.0) internal successors, (190), 5 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:00:42,012 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:00:42,012 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 68 [2024-06-04 16:00:42,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:00:42,472 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([352] L809-->L806-1: Formula: (or (< 3 |v_thr2Thread1of1ForFork1_~f12~0#1_35|) (< |v_thr2Thread1of1ForFork1_~f12~0#1_35| 2)) InVars {thr2Thread1of1ForFork1_~f12~0#1=|v_thr2Thread1of1ForFork1_~f12~0#1_35|} OutVars{thr2Thread1of1ForFork1_~f12~0#1=|v_thr2Thread1of1ForFork1_~f12~0#1_35|} AuxVars[] AssignedVars[][101], [18#L735true, Black: 131#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 3)), Black: 137#(and (= ~x~0 0) (= ~flag1~0 1) (= ~flag2~0 3)), 239#true, Black: 143#(and (= ~x~0 0) (= ~flag1~0 1) (= ~flag2~0 3)), 101#true, Black: 147#(<= ~flag1~0 0), Black: 148#(<= |thr2Thread1of1ForFork1_~f12~0#1| 0), Black: 150#(and (<= ~flag1~0 0) (<= |thr2Thread1of1ForFork1_~f12~0#1| 0)), Black: 157#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 4)), 26#L806-1true, Black: 161#(= ~x~0 0), Black: 162#(and (= ~x~0 0) (= ~flag1~0 4)), Black: 163#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 4)), Black: 171#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 4)), Black: 170#(and (= ~x~0 0) (= ~flag2~0 1)), 27#ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 179#(and (<= 3 |thr2Thread1of1ForFork1_~f12~0#1|) (<= 3 ~flag1~0)), Black: 177#(<= 3 |thr2Thread1of1ForFork1_~f12~0#1|), Black: 176#(<= 3 ~flag1~0), Black: 174#true, Black: 189#(and (= ~x~0 0) (= ~flag2~0 1) (= 2 ~flag1~0)), thr2Thread1of1ForFork1InUse, Black: 195#(and (= ~x~0 0) (= ~flag2~0 3) (= ~flag1~0 3)), 247#true, Black: 70#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 0)), 88#true, 145#true, Black: 201#(and (= ~x~0 0) (= ~flag2~0 3) (= ~flag1~0 3)), Black: 75#(and (= ~x~0 0) (= ~flag1~0 1) (= ~flag2~0 0)), Black: 80#(and (= ~x~0 0) (= ~flag1~0 3) (= ~flag2~0 0)), Black: 208#(and (= |thr2Thread1of1ForFork1_~f12~0#1| 1) (= ~flag1~0 1)), Black: 205#(= ~flag1~0 1), Black: 206#(= |thr2Thread1of1ForFork1_~f12~0#1| 1), Black: 85#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 1)), Black: 84#(and (= ~flag1~0 0) (= ~x~0 0)), Black: 217#(and (= ~x~0 0) (= ~flag1~0 1) (= 2 ~flag2~0)), 82#true, Black: 92#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 223#(and (= ~x~0 0) (= ~flag2~0 4) (= ~flag1~0 1)), 120#true, Black: 99#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 229#(and (= ~x~0 0) (= ~flag2~0 4) (= ~flag1~0 1)), Black: 106#(and (= |thr1Thread1of1ForFork0_~f21~0#1| 0) (= ~flag2~0 0)), Black: 235#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 0)), Black: 104#(= |thr1Thread1of1ForFork0_~f21~0#1| 0), Black: 233#(= ~flag2~0 0), Black: 103#(= ~flag2~0 0), 203#true, Black: 234#(and (= ~x~0 0) (= ~flag2~0 0)), Black: 113#(and (= ~x~0 0) (= ~flag1~0 4) (= ~flag2~0 0)), Black: 241#(= ~flag1~0 0), Black: 243#(and (= ~flag1~0 0) (= ~flag2~0 4) (= ~x~0 1)), Black: 242#(and (= ~flag1~0 0) (= ~flag2~0 4)), Black: 118#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 3)), Black: 124#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 3))]) [2024-06-04 16:00:42,472 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-06-04 16:00:42,473 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-04 16:00:42,473 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-04 16:00:42,473 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-04 16:00:42,473 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([352] L809-->L806-1: Formula: (or (< 3 |v_thr2Thread1of1ForFork1_~f12~0#1_35|) (< |v_thr2Thread1of1ForFork1_~f12~0#1_35| 2)) InVars {thr2Thread1of1ForFork1_~f12~0#1=|v_thr2Thread1of1ForFork1_~f12~0#1_35|} OutVars{thr2Thread1of1ForFork1_~f12~0#1=|v_thr2Thread1of1ForFork1_~f12~0#1_35|} AuxVars[] AssignedVars[][101], [Black: 131#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 3)), 161#(= ~x~0 0), Black: 137#(and (= ~x~0 0) (= ~flag1~0 1) (= ~flag2~0 3)), 239#true, Black: 143#(and (= ~x~0 0) (= ~flag1~0 1) (= ~flag2~0 3)), 101#true, 15#L745-3true, Black: 147#(<= ~flag1~0 0), Black: 148#(<= |thr2Thread1of1ForFork1_~f12~0#1| 0), Black: 150#(and (<= ~flag1~0 0) (<= |thr2Thread1of1ForFork1_~f12~0#1| 0)), Black: 157#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 4)), 26#L806-1true, Black: 162#(and (= ~x~0 0) (= ~flag1~0 4)), Black: 163#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 4)), Black: 171#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 4)), 215#(= ~x~0 0), Black: 170#(and (= ~x~0 0) (= ~flag2~0 1)), 27#ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 179#(and (<= 3 |thr2Thread1of1ForFork1_~f12~0#1|) (<= 3 ~flag1~0)), Black: 177#(<= 3 |thr2Thread1of1ForFork1_~f12~0#1|), 141#(= ~x~0 0), Black: 176#(<= 3 ~flag1~0), Black: 174#true, Black: 189#(and (= ~x~0 0) (= ~flag2~0 1) (= 2 ~flag1~0)), thr2Thread1of1ForFork1InUse, Black: 195#(and (= ~x~0 0) (= ~flag2~0 3) (= ~flag1~0 3)), 247#true, Black: 70#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 0)), 145#true, Black: 201#(and (= ~x~0 0) (= ~flag2~0 3) (= ~flag1~0 3)), Black: 75#(and (= ~x~0 0) (= ~flag1~0 1) (= ~flag2~0 0)), Black: 80#(and (= ~x~0 0) (= ~flag1~0 3) (= ~flag2~0 0)), Black: 208#(and (= |thr2Thread1of1ForFork1_~f12~0#1| 1) (= ~flag1~0 1)), Black: 205#(= ~flag1~0 1), Black: 206#(= |thr2Thread1of1ForFork1_~f12~0#1| 1), Black: 85#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 1)), Black: 84#(and (= ~flag1~0 0) (= ~x~0 0)), Black: 217#(and (= ~x~0 0) (= ~flag1~0 1) (= 2 ~flag2~0)), 82#true, Black: 88#true, Black: 92#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 223#(and (= ~x~0 0) (= ~flag2~0 4) (= ~flag1~0 1)), Black: 99#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 229#(and (= ~x~0 0) (= ~flag2~0 4) (= ~flag1~0 1)), 122#(= ~x~0 0), Black: 106#(and (= |thr1Thread1of1ForFork0_~f21~0#1| 0) (= ~flag2~0 0)), Black: 104#(= |thr1Thread1of1ForFork0_~f21~0#1| 0), Black: 235#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 0)), Black: 103#(= ~flag2~0 0), Black: 233#(= ~flag2~0 0), 203#true, Black: 234#(and (= ~x~0 0) (= ~flag2~0 0)), Black: 113#(and (= ~x~0 0) (= ~flag1~0 4) (= ~flag2~0 0)), Black: 241#(= ~flag1~0 0), Black: 243#(and (= ~flag1~0 0) (= ~flag2~0 4) (= ~x~0 1)), Black: 242#(and (= ~flag1~0 0) (= ~flag2~0 4)), Black: 118#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 3)), Black: 124#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 3))]) [2024-06-04 16:00:42,473 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-06-04 16:00:42,473 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-04 16:00:42,473 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-06-04 16:00:42,473 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-04 16:00:42,550 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([352] L809-->L806-1: Formula: (or (< 3 |v_thr2Thread1of1ForFork1_~f12~0#1_35|) (< |v_thr2Thread1of1ForFork1_~f12~0#1_35| 2)) InVars {thr2Thread1of1ForFork1_~f12~0#1=|v_thr2Thread1of1ForFork1_~f12~0#1_35|} OutVars{thr2Thread1of1ForFork1_~f12~0#1=|v_thr2Thread1of1ForFork1_~f12~0#1_35|} AuxVars[] AssignedVars[][101], [161#(= ~x~0 0), Black: 131#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 3)), Black: 137#(and (= ~x~0 0) (= ~flag1~0 1) (= ~flag2~0 3)), 239#true, Black: 143#(and (= ~x~0 0) (= ~flag1~0 1) (= ~flag2~0 3)), 101#true, Black: 147#(<= ~flag1~0 0), Black: 148#(<= |thr2Thread1of1ForFork1_~f12~0#1| 0), Black: 150#(and (<= ~flag1~0 0) (<= |thr2Thread1of1ForFork1_~f12~0#1| 0)), Black: 157#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 4)), 26#L806-1true, Black: 162#(and (= ~x~0 0) (= ~flag1~0 4)), Black: 163#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 4)), 215#(= ~x~0 0), Black: 171#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 4)), Black: 170#(and (= ~x~0 0) (= ~flag2~0 1)), 27#ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 179#(and (<= 3 |thr2Thread1of1ForFork1_~f12~0#1|) (<= 3 ~flag1~0)), 141#(= ~x~0 0), Black: 177#(<= 3 |thr2Thread1of1ForFork1_~f12~0#1|), Black: 176#(<= 3 ~flag1~0), Black: 174#true, Black: 189#(and (= ~x~0 0) (= ~flag2~0 1) (= 2 ~flag1~0)), thr2Thread1of1ForFork1InUse, 247#true, Black: 195#(and (= ~x~0 0) (= ~flag2~0 3) (= ~flag1~0 3)), Black: 70#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 0)), 145#true, Black: 201#(and (= ~x~0 0) (= ~flag2~0 3) (= ~flag1~0 3)), Black: 75#(and (= ~x~0 0) (= ~flag1~0 1) (= ~flag2~0 0)), Black: 80#(and (= ~x~0 0) (= ~flag1~0 3) (= ~flag2~0 0)), Black: 208#(and (= |thr2Thread1of1ForFork1_~f12~0#1| 1) (= ~flag1~0 1)), Black: 205#(= ~flag1~0 1), Black: 206#(= |thr2Thread1of1ForFork1_~f12~0#1| 1), Black: 85#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 1)), 49#L749-1true, Black: 84#(and (= ~flag1~0 0) (= ~x~0 0)), Black: 217#(and (= ~x~0 0) (= ~flag1~0 1) (= 2 ~flag2~0)), 82#true, Black: 88#true, Black: 92#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 223#(and (= ~x~0 0) (= ~flag2~0 4) (= ~flag1~0 1)), Black: 99#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 229#(and (= ~x~0 0) (= ~flag2~0 4) (= ~flag1~0 1)), 122#(= ~x~0 0), Black: 106#(and (= |thr1Thread1of1ForFork0_~f21~0#1| 0) (= ~flag2~0 0)), Black: 235#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 0)), Black: 104#(= |thr1Thread1of1ForFork0_~f21~0#1| 0), Black: 233#(= ~flag2~0 0), Black: 103#(= ~flag2~0 0), Black: 234#(and (= ~x~0 0) (= ~flag2~0 0)), 203#true, Black: 113#(and (= ~x~0 0) (= ~flag1~0 4) (= ~flag2~0 0)), Black: 241#(= ~flag1~0 0), Black: 243#(and (= ~flag1~0 0) (= ~flag2~0 4) (= ~x~0 1)), Black: 242#(and (= ~flag1~0 0) (= ~flag2~0 4)), Black: 118#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 3)), Black: 124#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 3))]) [2024-06-04 16:00:42,550 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-06-04 16:00:42,550 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-06-04 16:00:42,550 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-06-04 16:00:42,550 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-06-04 16:00:42,592 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([380] L749-1-->L756: Formula: (= v_~flag1~0_13 0) InVars {} OutVars{~flag1~0=v_~flag1~0_13} AuxVars[] AssignedVars[~flag1~0][214], [161#(= ~x~0 0), Black: 131#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 3)), Black: 137#(and (= ~x~0 0) (= ~flag1~0 1) (= ~flag2~0 3)), 56#L809true, Black: 143#(and (= ~x~0 0) (= ~flag1~0 1) (= ~flag2~0 3)), 177#(<= 3 |thr2Thread1of1ForFork1_~f12~0#1|), 147#(<= ~flag1~0 0), 101#true, Black: 148#(<= |thr2Thread1of1ForFork1_~f12~0#1| 0), Black: 150#(and (<= ~flag1~0 0) (<= |thr2Thread1of1ForFork1_~f12~0#1| 0)), Black: 157#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 4)), Black: 162#(and (= ~x~0 0) (= ~flag1~0 4)), Black: 163#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 4)), 215#(= ~x~0 0), Black: 171#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 4)), Black: 170#(and (= ~x~0 0) (= ~flag2~0 1)), 27#ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 141#(= ~x~0 0), 241#(= ~flag1~0 0), Black: 179#(and (<= 3 |thr2Thread1of1ForFork1_~f12~0#1|) (<= 3 ~flag1~0)), Black: 176#(<= 3 ~flag1~0), Black: 174#true, Black: 189#(and (= ~x~0 0) (= ~flag2~0 1) (= 2 ~flag1~0)), thr2Thread1of1ForFork1InUse, 247#true, Black: 195#(and (= ~x~0 0) (= ~flag2~0 3) (= ~flag1~0 3)), Black: 70#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 0)), Black: 201#(and (= ~x~0 0) (= ~flag2~0 3) (= ~flag1~0 3)), Black: 75#(and (= ~x~0 0) (= ~flag1~0 1) (= ~flag2~0 0)), Black: 80#(and (= ~x~0 0) (= ~flag1~0 3) (= ~flag2~0 0)), Black: 208#(and (= |thr2Thread1of1ForFork1_~f12~0#1| 1) (= ~flag1~0 1)), Black: 205#(= ~flag1~0 1), Black: 206#(= |thr2Thread1of1ForFork1_~f12~0#1| 1), Black: 85#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 1)), Black: 84#(and (= ~flag1~0 0) (= ~x~0 0)), Black: 217#(and (= ~x~0 0) (= ~flag1~0 1) (= 2 ~flag2~0)), 82#true, Black: 88#true, Black: 92#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 223#(and (= ~x~0 0) (= ~flag2~0 4) (= ~flag1~0 1)), Black: 99#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 229#(and (= ~x~0 0) (= ~flag2~0 4) (= ~flag1~0 1)), 122#(= ~x~0 0), Black: 106#(and (= |thr1Thread1of1ForFork0_~f21~0#1| 0) (= ~flag2~0 0)), Black: 235#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 0)), Black: 104#(= |thr1Thread1of1ForFork0_~f21~0#1| 0), Black: 233#(= ~flag2~0 0), Black: 103#(= ~flag2~0 0), Black: 234#(and (= ~x~0 0) (= ~flag2~0 0)), 203#true, Black: 113#(and (= ~x~0 0) (= ~flag1~0 4) (= ~flag2~0 0)), Black: 243#(and (= ~flag1~0 0) (= ~flag2~0 4) (= ~x~0 1)), Black: 242#(and (= ~flag1~0 0) (= ~flag2~0 4)), Black: 118#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 3)), 13#L756true, Black: 124#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 3))]) [2024-06-04 16:00:42,592 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is not cut-off event [2024-06-04 16:00:42,592 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is not cut-off event [2024-06-04 16:00:42,592 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is not cut-off event [2024-06-04 16:00:42,592 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is not cut-off event [2024-06-04 16:00:42,694 INFO L124 PetriNetUnfolderBase]: 2635/5346 cut-off events. [2024-06-04 16:00:42,694 INFO L125 PetriNetUnfolderBase]: For 154646/154884 co-relation queries the response was YES. [2024-06-04 16:00:42,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31622 conditions, 5346 events. 2635/5346 cut-off events. For 154646/154884 co-relation queries the response was YES. Maximal size of possible extension queue 232. Compared 40098 event pairs, 1515 based on Foata normal form. 38/5189 useless extension candidates. Maximal degree in co-relation 22436. Up to 3616 conditions per place. [2024-06-04 16:00:42,742 INFO L140 encePairwiseOnDemand]: 62/68 looper letters, 110 selfloop transitions, 27 changer transitions 0/231 dead transitions. [2024-06-04 16:00:42,742 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 231 transitions, 2825 flow [2024-06-04 16:00:42,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 16:00:42,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 16:00:42,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 229 transitions. [2024-06-04 16:00:42,744 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6735294117647059 [2024-06-04 16:00:42,744 INFO L175 Difference]: Start difference. First operand has 167 places, 215 transitions, 2441 flow. Second operand 5 states and 229 transitions. [2024-06-04 16:00:42,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 231 transitions, 2825 flow [2024-06-04 16:00:42,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 231 transitions, 2798 flow, removed 2 selfloop flow, removed 1 redundant places. [2024-06-04 16:00:42,981 INFO L231 Difference]: Finished difference. Result has 171 places, 217 transitions, 2498 flow [2024-06-04 16:00:42,981 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=2414, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2498, PETRI_PLACES=171, PETRI_TRANSITIONS=217} [2024-06-04 16:00:42,982 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 110 predicate places. [2024-06-04 16:00:42,982 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 217 transitions, 2498 flow [2024-06-04 16:00:42,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.0) internal successors, (190), 5 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:00:42,982 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:00:42,982 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:00:42,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-04 16:00:42,983 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:00:42,983 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:00:42,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1892534533, now seen corresponding path program 2 times [2024-06-04 16:00:42,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:00:42,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892330257] [2024-06-04 16:00:42,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:00:42,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:00:42,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:00:43,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:00:43,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:00:43,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892330257] [2024-06-04 16:00:43,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892330257] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:00:43,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:00:43,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-04 16:00:43,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501443839] [2024-06-04 16:00:43,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:00:43,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-04 16:00:43,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:00:43,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-04 16:00:43,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-04 16:00:43,131 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 68 [2024-06-04 16:00:43,132 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 217 transitions, 2498 flow. Second operand has 5 states, 5 states have (on average 38.0) internal successors, (190), 5 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:00:43,132 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:00:43,132 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 68 [2024-06-04 16:00:43,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:00:43,807 INFO L124 PetriNetUnfolderBase]: 2676/5459 cut-off events. [2024-06-04 16:00:43,807 INFO L125 PetriNetUnfolderBase]: For 163578/163814 co-relation queries the response was YES. [2024-06-04 16:00:43,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32789 conditions, 5459 events. 2676/5459 cut-off events. For 163578/163814 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 40668 event pairs, 1188 based on Foata normal form. 45/5367 useless extension candidates. Maximal degree in co-relation 22503. Up to 2671 conditions per place. [2024-06-04 16:00:43,856 INFO L140 encePairwiseOnDemand]: 62/68 looper letters, 137 selfloop transitions, 23 changer transitions 0/254 dead transitions. [2024-06-04 16:00:43,857 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 254 transitions, 3282 flow [2024-06-04 16:00:43,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 16:00:43,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 16:00:43,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 231 transitions. [2024-06-04 16:00:43,858 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6794117647058824 [2024-06-04 16:00:43,858 INFO L175 Difference]: Start difference. First operand has 171 places, 217 transitions, 2498 flow. Second operand 5 states and 231 transitions. [2024-06-04 16:00:43,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 254 transitions, 3282 flow [2024-06-04 16:00:43,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 254 transitions, 3244 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-06-04 16:00:43,986 INFO L231 Difference]: Finished difference. Result has 174 places, 223 transitions, 2602 flow [2024-06-04 16:00:43,986 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=2464, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2602, PETRI_PLACES=174, PETRI_TRANSITIONS=223} [2024-06-04 16:00:43,987 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 113 predicate places. [2024-06-04 16:00:43,987 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 223 transitions, 2602 flow [2024-06-04 16:00:43,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.0) internal successors, (190), 5 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:00:43,988 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:00:43,988 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:00:43,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-04 16:00:43,988 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:00:43,988 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:00:43,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1892265763, now seen corresponding path program 3 times [2024-06-04 16:00:43,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:00:43,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492127047] [2024-06-04 16:00:43,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:00:43,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:00:43,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:00:44,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:00:44,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:00:44,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492127047] [2024-06-04 16:00:44,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492127047] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:00:44,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:00:44,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-04 16:00:44,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202937675] [2024-06-04 16:00:44,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:00:44,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-04 16:00:44,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:00:44,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-04 16:00:44,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-04 16:00:44,120 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 68 [2024-06-04 16:00:44,120 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 223 transitions, 2602 flow. Second operand has 5 states, 5 states have (on average 38.0) internal successors, (190), 5 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:00:44,121 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:00:44,121 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 68 [2024-06-04 16:00:44,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:00:44,851 INFO L124 PetriNetUnfolderBase]: 2660/5434 cut-off events. [2024-06-04 16:00:44,852 INFO L125 PetriNetUnfolderBase]: For 174596/174839 co-relation queries the response was YES. [2024-06-04 16:00:44,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33245 conditions, 5434 events. 2660/5434 cut-off events. For 174596/174839 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 40504 event pairs, 1135 based on Foata normal form. 48/5354 useless extension candidates. Maximal degree in co-relation 22926. Up to 2665 conditions per place. [2024-06-04 16:00:44,895 INFO L140 encePairwiseOnDemand]: 61/68 looper letters, 142 selfloop transitions, 26 changer transitions 0/262 dead transitions. [2024-06-04 16:00:44,895 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 262 transitions, 3400 flow [2024-06-04 16:00:44,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 16:00:44,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 16:00:44,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 239 transitions. [2024-06-04 16:00:44,897 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7029411764705882 [2024-06-04 16:00:44,897 INFO L175 Difference]: Start difference. First operand has 174 places, 223 transitions, 2602 flow. Second operand 5 states and 239 transitions. [2024-06-04 16:00:44,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 262 transitions, 3400 flow [2024-06-04 16:00:45,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 262 transitions, 3380 flow, removed 10 selfloop flow, removed 0 redundant places. [2024-06-04 16:00:45,057 INFO L231 Difference]: Finished difference. Result has 179 places, 224 transitions, 2653 flow [2024-06-04 16:00:45,057 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=2582, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2653, PETRI_PLACES=179, PETRI_TRANSITIONS=224} [2024-06-04 16:00:45,058 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 118 predicate places. [2024-06-04 16:00:45,058 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 224 transitions, 2653 flow [2024-06-04 16:00:45,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.0) internal successors, (190), 5 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:00:45,058 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:00:45,059 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-04 16:00:45,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-04 16:00:45,059 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:00:45,059 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:00:45,059 INFO L85 PathProgramCache]: Analyzing trace with hash -142289907, now seen corresponding path program 1 times [2024-06-04 16:00:45,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:00:45,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740752309] [2024-06-04 16:00:45,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:00:45,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:00:45,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:00:45,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:00:45,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:00:45,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740752309] [2024-06-04 16:00:45,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740752309] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:00:45,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:00:45,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-04 16:00:45,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277674830] [2024-06-04 16:00:45,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:00:45,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-04 16:00:45,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:00:45,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-04 16:00:45,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-04 16:00:45,195 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 68 [2024-06-04 16:00:45,196 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 224 transitions, 2653 flow. Second operand has 5 states, 5 states have (on average 38.2) internal successors, (191), 5 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:00:45,196 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:00:45,196 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 68 [2024-06-04 16:00:45,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:00:45,954 INFO L124 PetriNetUnfolderBase]: 2687/5489 cut-off events. [2024-06-04 16:00:45,955 INFO L125 PetriNetUnfolderBase]: For 188372/188629 co-relation queries the response was YES. [2024-06-04 16:00:45,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34357 conditions, 5489 events. 2687/5489 cut-off events. For 188372/188629 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 40993 event pairs, 1114 based on Foata normal form. 42/5397 useless extension candidates. Maximal degree in co-relation 23865. Up to 2390 conditions per place. [2024-06-04 16:00:46,006 INFO L140 encePairwiseOnDemand]: 59/68 looper letters, 127 selfloop transitions, 29 changer transitions 0/250 dead transitions. [2024-06-04 16:00:46,007 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 250 transitions, 3286 flow [2024-06-04 16:00:46,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 16:00:46,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 16:00:46,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 236 transitions. [2024-06-04 16:00:46,008 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6941176470588235 [2024-06-04 16:00:46,008 INFO L175 Difference]: Start difference. First operand has 179 places, 224 transitions, 2653 flow. Second operand 5 states and 236 transitions. [2024-06-04 16:00:46,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 250 transitions, 3286 flow [2024-06-04 16:00:46,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 250 transitions, 3246 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-06-04 16:00:46,197 INFO L231 Difference]: Finished difference. Result has 181 places, 228 transitions, 2745 flow [2024-06-04 16:00:46,198 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=2616, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2745, PETRI_PLACES=181, PETRI_TRANSITIONS=228} [2024-06-04 16:00:46,198 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 120 predicate places. [2024-06-04 16:00:46,198 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 228 transitions, 2745 flow [2024-06-04 16:00:46,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.2) internal successors, (191), 5 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:00:46,198 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:00:46,198 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-04 16:00:46,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-04 16:00:46,199 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:00:46,199 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:00:46,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1924012341, now seen corresponding path program 1 times [2024-06-04 16:00:46,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:00:46,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156266476] [2024-06-04 16:00:46,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:00:46,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:00:46,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:00:46,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:00:46,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:00:46,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156266476] [2024-06-04 16:00:46,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156266476] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:00:46,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:00:46,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-04 16:00:46,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703479159] [2024-06-04 16:00:46,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:00:46,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-04 16:00:46,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:00:46,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-04 16:00:46,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-04 16:00:46,263 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 68 [2024-06-04 16:00:46,263 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 228 transitions, 2745 flow. Second operand has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 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-04 16:00:46,264 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:00:46,264 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 68 [2024-06-04 16:00:46,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:00:46,969 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([380] L749-1-->L756: Formula: (= v_~flag1~0_13 0) InVars {} OutVars{~flag1~0=v_~flag1~0_13} AuxVars[] AssignedVars[~flag1~0][256], [Black: 257#(and (= ~flag2~0 4) (= ~flag1~0 1) (= ~x~0 1)), Black: 131#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 3)), 161#(= ~x~0 0), Black: 263#(and (= ~flag2~0 4) (= ~flag1~0 1) (= ~x~0 1)), Black: 137#(and (= ~x~0 0) (= ~flag1~0 1) (= ~flag2~0 3)), 56#L809true, Black: 269#(and (= ~x~0 0) (= 2 ~flag1~0) (= ~flag2~0 3)), Black: 143#(and (= ~x~0 0) (= ~flag1~0 1) (= ~flag2~0 3)), 177#(<= 3 |thr2Thread1of1ForFork1_~f12~0#1|), 101#true, 147#(<= ~flag1~0 0), Black: 148#(<= |thr2Thread1of1ForFork1_~f12~0#1| 0), Black: 150#(and (<= ~flag1~0 0) (<= |thr2Thread1of1ForFork1_~f12~0#1| 0)), Black: 157#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 4)), 261#(= ~flag2~0 4), Black: 162#(and (= ~x~0 0) (= ~flag1~0 4)), Black: 163#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 4)), Black: 171#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 4)), 215#(= ~x~0 0), Black: 170#(and (= ~x~0 0) (= ~flag2~0 1)), 27#ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 141#(= ~x~0 0), 241#(= ~flag1~0 0), Black: 179#(and (<= 3 |thr2Thread1of1ForFork1_~f12~0#1|) (<= 3 ~flag1~0)), Black: 176#(<= 3 ~flag1~0), Black: 174#true, Black: 189#(and (= ~x~0 0) (= ~flag2~0 1) (= 2 ~flag1~0)), thr2Thread1of1ForFork1InUse, Black: 195#(and (= ~x~0 0) (= ~flag2~0 3) (= ~flag1~0 3)), Black: 70#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 0)), Black: 201#(and (= ~x~0 0) (= ~flag2~0 3) (= ~flag1~0 3)), Black: 75#(and (= ~x~0 0) (= ~flag1~0 1) (= ~flag2~0 0)), Black: 80#(and (= ~x~0 0) (= ~flag1~0 3) (= ~flag2~0 0)), Black: 208#(and (= |thr2Thread1of1ForFork1_~f12~0#1| 1) (= ~flag1~0 1)), 271#true, Black: 205#(= ~flag1~0 1), Black: 206#(= |thr2Thread1of1ForFork1_~f12~0#1| 1), Black: 85#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 1)), Black: 84#(and (= ~flag1~0 0) (= ~x~0 0)), Black: 217#(and (= ~x~0 0) (= ~flag1~0 1) (= 2 ~flag2~0)), 82#true, Black: 88#true, Black: 92#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 223#(and (= ~x~0 0) (= ~flag2~0 4) (= ~flag1~0 1)), Black: 99#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 229#(and (= ~x~0 0) (= ~flag2~0 4) (= ~flag1~0 1)), 122#(= ~x~0 0), Black: 106#(and (= |thr1Thread1of1ForFork0_~f21~0#1| 0) (= ~flag2~0 0)), Black: 235#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 0)), Black: 104#(= |thr1Thread1of1ForFork0_~f21~0#1| 0), 267#(= ~x~0 0), Black: 103#(= ~flag2~0 0), Black: 234#(and (= ~x~0 0) (= ~flag2~0 0)), 203#true, Black: 113#(and (= ~x~0 0) (= ~flag1~0 4) (= ~flag2~0 0)), Black: 243#(and (= ~flag1~0 0) (= ~flag2~0 4) (= ~x~0 1)), Black: 242#(and (= ~flag1~0 0) (= ~flag2~0 4)), Black: 118#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 3)), 255#(= ~flag2~0 4), 13#L756true, Black: 251#(and (= ~flag2~0 4) (= ~flag1~0 1) (= ~x~0 1)), Black: 124#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 3))]) [2024-06-04 16:00:46,969 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-06-04 16:00:46,969 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-06-04 16:00:46,969 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-06-04 16:00:46,969 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-06-04 16:00:47,035 INFO L124 PetriNetUnfolderBase]: 2952/5814 cut-off events. [2024-06-04 16:00:47,036 INFO L125 PetriNetUnfolderBase]: For 116499/117327 co-relation queries the response was YES. [2024-06-04 16:00:47,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30932 conditions, 5814 events. 2952/5814 cut-off events. For 116499/117327 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 43111 event pairs, 1438 based on Foata normal form. 132/5556 useless extension candidates. Maximal degree in co-relation 21722. Up to 3663 conditions per place. [2024-06-04 16:00:47,087 INFO L140 encePairwiseOnDemand]: 54/68 looper letters, 114 selfloop transitions, 26 changer transitions 1/274 dead transitions. [2024-06-04 16:00:47,087 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 274 transitions, 3338 flow [2024-06-04 16:00:47,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 16:00:47,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 16:00:47,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 224 transitions. [2024-06-04 16:00:47,088 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6588235294117647 [2024-06-04 16:00:47,088 INFO L175 Difference]: Start difference. First operand has 181 places, 228 transitions, 2745 flow. Second operand 5 states and 224 transitions. [2024-06-04 16:00:47,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 274 transitions, 3338 flow [2024-06-04 16:00:47,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 274 transitions, 3267 flow, removed 19 selfloop flow, removed 2 redundant places. [2024-06-04 16:00:47,322 INFO L231 Difference]: Finished difference. Result has 187 places, 233 transitions, 2825 flow [2024-06-04 16:00:47,322 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=2601, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2825, PETRI_PLACES=187, PETRI_TRANSITIONS=233} [2024-06-04 16:00:47,323 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 126 predicate places. [2024-06-04 16:00:47,324 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 233 transitions, 2825 flow [2024-06-04 16:00:47,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 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-04 16:00:47,324 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:00:47,324 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-04 16:00:47,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-04 16:00:47,325 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:00:47,325 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:00:47,325 INFO L85 PathProgramCache]: Analyzing trace with hash 828603239, now seen corresponding path program 2 times [2024-06-04 16:00:47,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:00:47,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577714244] [2024-06-04 16:00:47,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:00:47,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:00:47,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:00:47,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:00:47,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:00:47,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577714244] [2024-06-04 16:00:47,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577714244] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:00:47,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:00:47,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-04 16:00:47,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771399292] [2024-06-04 16:00:47,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:00:47,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-04 16:00:47,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:00:47,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-04 16:00:47,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-04 16:00:47,490 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 68 [2024-06-04 16:00:47,490 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 233 transitions, 2825 flow. Second operand has 5 states, 5 states have (on average 38.2) internal successors, (191), 5 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:00:47,490 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:00:47,490 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 68 [2024-06-04 16:00:47,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:00:48,199 INFO L124 PetriNetUnfolderBase]: 2610/5446 cut-off events. [2024-06-04 16:00:48,199 INFO L125 PetriNetUnfolderBase]: For 204745/204999 co-relation queries the response was YES. [2024-06-04 16:00:48,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35522 conditions, 5446 events. 2610/5446 cut-off events. For 204745/204999 co-relation queries the response was YES. Maximal size of possible extension queue 239. Compared 41447 event pairs, 987 based on Foata normal form. 49/5354 useless extension candidates. Maximal degree in co-relation 27426. Up to 2171 conditions per place. [2024-06-04 16:00:48,254 INFO L140 encePairwiseOnDemand]: 59/68 looper letters, 118 selfloop transitions, 43 changer transitions 0/261 dead transitions. [2024-06-04 16:00:48,254 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 261 transitions, 3487 flow [2024-06-04 16:00:48,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 16:00:48,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 16:00:48,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 239 transitions. [2024-06-04 16:00:48,256 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7029411764705882 [2024-06-04 16:00:48,256 INFO L175 Difference]: Start difference. First operand has 187 places, 233 transitions, 2825 flow. Second operand 5 states and 239 transitions. [2024-06-04 16:00:48,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 261 transitions, 3487 flow [2024-06-04 16:00:48,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 261 transitions, 3483 flow, removed 2 selfloop flow, removed 0 redundant places. [2024-06-04 16:00:48,563 INFO L231 Difference]: Finished difference. Result has 193 places, 240 transitions, 3083 flow [2024-06-04 16:00:48,563 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=2821, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3083, PETRI_PLACES=193, PETRI_TRANSITIONS=240} [2024-06-04 16:00:48,563 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 132 predicate places. [2024-06-04 16:00:48,563 INFO L495 AbstractCegarLoop]: Abstraction has has 193 places, 240 transitions, 3083 flow [2024-06-04 16:00:48,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.2) internal successors, (191), 5 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:00:48,564 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:00:48,564 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-04 16:00:48,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-04 16:00:48,564 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:00:48,565 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:00:48,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1602497195, now seen corresponding path program 1 times [2024-06-04 16:00:48,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:00:48,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982117424] [2024-06-04 16:00:48,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:00:48,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:00:48,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:00:48,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:00:48,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:00:48,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982117424] [2024-06-04 16:00:48,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982117424] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:00:48,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:00:48,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-04 16:00:48,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689464000] [2024-06-04 16:00:48,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:00:48,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-04 16:00:48,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:00:48,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-04 16:00:48,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-04 16:00:48,691 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 68 [2024-06-04 16:00:48,692 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 240 transitions, 3083 flow. Second operand has 5 states, 5 states have (on average 38.2) internal successors, (191), 5 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:00:48,692 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:00:48,692 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 68 [2024-06-04 16:00:48,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:00:49,480 INFO L124 PetriNetUnfolderBase]: 2673/5587 cut-off events. [2024-06-04 16:00:49,481 INFO L125 PetriNetUnfolderBase]: For 217221/217472 co-relation queries the response was YES. [2024-06-04 16:00:49,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37330 conditions, 5587 events. 2673/5587 cut-off events. For 217221/217472 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 42647 event pairs, 1024 based on Foata normal form. 39/5485 useless extension candidates. Maximal degree in co-relation 28828. Up to 2361 conditions per place. [2024-06-04 16:00:49,538 INFO L140 encePairwiseOnDemand]: 59/68 looper letters, 121 selfloop transitions, 45 changer transitions 0/266 dead transitions. [2024-06-04 16:00:49,538 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 266 transitions, 3721 flow [2024-06-04 16:00:49,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 16:00:49,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 16:00:49,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 240 transitions. [2024-06-04 16:00:49,539 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7058823529411765 [2024-06-04 16:00:49,539 INFO L175 Difference]: Start difference. First operand has 193 places, 240 transitions, 3083 flow. Second operand 5 states and 240 transitions. [2024-06-04 16:00:49,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 266 transitions, 3721 flow [2024-06-04 16:00:49,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 266 transitions, 3643 flow, removed 16 selfloop flow, removed 2 redundant places. [2024-06-04 16:00:49,774 INFO L231 Difference]: Finished difference. Result has 196 places, 244 transitions, 3167 flow [2024-06-04 16:00:49,774 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=3005, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3167, PETRI_PLACES=196, PETRI_TRANSITIONS=244} [2024-06-04 16:00:49,775 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 135 predicate places. [2024-06-04 16:00:49,775 INFO L495 AbstractCegarLoop]: Abstraction has has 196 places, 244 transitions, 3167 flow [2024-06-04 16:00:49,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.2) internal successors, (191), 5 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:00:49,775 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:00:49,775 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-04 16:00:49,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-04 16:00:49,775 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:00:49,775 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:00:49,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1601784815, now seen corresponding path program 2 times [2024-06-04 16:00:49,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:00:49,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256077262] [2024-06-04 16:00:49,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:00:49,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:00:49,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:00:49,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:00:49,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:00:49,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256077262] [2024-06-04 16:00:49,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256077262] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:00:49,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:00:49,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-04 16:00:49,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681754326] [2024-06-04 16:00:49,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:00:49,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-04 16:00:49,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:00:49,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-04 16:00:49,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-04 16:00:49,902 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 68 [2024-06-04 16:00:49,903 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 244 transitions, 3167 flow. Second operand has 5 states, 5 states have (on average 38.2) internal successors, (191), 5 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:00:49,903 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:00:49,903 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 68 [2024-06-04 16:00:49,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:00:50,712 INFO L124 PetriNetUnfolderBase]: 2626/5498 cut-off events. [2024-06-04 16:00:50,712 INFO L125 PetriNetUnfolderBase]: For 225747/225957 co-relation queries the response was YES. [2024-06-04 16:00:50,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36856 conditions, 5498 events. 2626/5498 cut-off events. For 225747/225957 co-relation queries the response was YES. Maximal size of possible extension queue 238. Compared 41898 event pairs, 1040 based on Foata normal form. 36/5404 useless extension candidates. Maximal degree in co-relation 28304. Up to 2175 conditions per place. [2024-06-04 16:00:50,771 INFO L140 encePairwiseOnDemand]: 59/68 looper letters, 149 selfloop transitions, 25 changer transitions 0/274 dead transitions. [2024-06-04 16:00:50,772 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 274 transitions, 3900 flow [2024-06-04 16:00:50,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 16:00:50,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 16:00:50,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 240 transitions. [2024-06-04 16:00:50,773 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7058823529411765 [2024-06-04 16:00:50,773 INFO L175 Difference]: Start difference. First operand has 196 places, 244 transitions, 3167 flow. Second operand 5 states and 240 transitions. [2024-06-04 16:00:50,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 274 transitions, 3900 flow [2024-06-04 16:00:51,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 274 transitions, 3818 flow, removed 13 selfloop flow, removed 2 redundant places. [2024-06-04 16:00:51,016 INFO L231 Difference]: Finished difference. Result has 199 places, 248 transitions, 3219 flow [2024-06-04 16:00:51,016 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=3088, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3219, PETRI_PLACES=199, PETRI_TRANSITIONS=248} [2024-06-04 16:00:51,017 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 138 predicate places. [2024-06-04 16:00:51,017 INFO L495 AbstractCegarLoop]: Abstraction has has 199 places, 248 transitions, 3219 flow [2024-06-04 16:00:51,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.2) internal successors, (191), 5 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:00:51,017 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:00:51,017 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-04 16:00:51,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-04 16:00:51,017 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:00:51,018 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:00:51,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1949779479, now seen corresponding path program 1 times [2024-06-04 16:00:51,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:00:51,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31246027] [2024-06-04 16:00:51,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:00:51,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:00:51,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:00:51,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:00:51,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:00:51,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31246027] [2024-06-04 16:00:51,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31246027] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:00:51,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:00:51,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-04 16:00:51,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61228479] [2024-06-04 16:00:51,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:00:51,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-04 16:00:51,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:00:51,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-04 16:00:51,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-04 16:00:51,153 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 68 [2024-06-04 16:00:51,153 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 248 transitions, 3219 flow. Second operand has 5 states, 5 states have (on average 38.2) internal successors, (191), 5 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:00:51,153 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:00:51,154 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 68 [2024-06-04 16:00:51,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:00:51,988 INFO L124 PetriNetUnfolderBase]: 2642/5517 cut-off events. [2024-06-04 16:00:51,989 INFO L125 PetriNetUnfolderBase]: For 236961/237216 co-relation queries the response was YES. [2024-06-04 16:00:52,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37359 conditions, 5517 events. 2642/5517 cut-off events. For 236961/237216 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 41917 event pairs, 1041 based on Foata normal form. 46/5429 useless extension candidates. Maximal degree in co-relation 28697. Up to 2355 conditions per place. [2024-06-04 16:00:52,048 INFO L140 encePairwiseOnDemand]: 60/68 looper letters, 118 selfloop transitions, 53 changer transitions 0/271 dead transitions. [2024-06-04 16:00:52,049 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 271 transitions, 3848 flow [2024-06-04 16:00:52,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 16:00:52,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 16:00:52,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 238 transitions. [2024-06-04 16:00:52,050 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7 [2024-06-04 16:00:52,050 INFO L175 Difference]: Start difference. First operand has 199 places, 248 transitions, 3219 flow. Second operand 5 states and 238 transitions. [2024-06-04 16:00:52,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 271 transitions, 3848 flow [2024-06-04 16:00:52,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 271 transitions, 3749 flow, removed 16 selfloop flow, removed 3 redundant places. [2024-06-04 16:00:52,282 INFO L231 Difference]: Finished difference. Result has 201 places, 251 transitions, 3293 flow [2024-06-04 16:00:52,282 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=3120, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3293, PETRI_PLACES=201, PETRI_TRANSITIONS=251} [2024-06-04 16:00:52,283 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 140 predicate places. [2024-06-04 16:00:52,283 INFO L495 AbstractCegarLoop]: Abstraction has has 201 places, 251 transitions, 3293 flow [2024-06-04 16:00:52,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.2) internal successors, (191), 5 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:00:52,283 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:00:52,283 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-04 16:00:52,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-04 16:00:52,284 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:00:52,284 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:00:52,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1924849403, now seen corresponding path program 2 times [2024-06-04 16:00:52,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:00:52,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553876050] [2024-06-04 16:00:52,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:00:52,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:00:52,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:00:52,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:00:52,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:00:52,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553876050] [2024-06-04 16:00:52,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553876050] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:00:52,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:00:52,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-04 16:00:52,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409828161] [2024-06-04 16:00:52,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:00:52,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-04 16:00:52,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:00:52,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-04 16:00:52,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-04 16:00:52,416 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 68 [2024-06-04 16:00:52,416 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 251 transitions, 3293 flow. Second operand has 5 states, 5 states have (on average 38.2) internal successors, (191), 5 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:00:52,416 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:00:52,416 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 68 [2024-06-04 16:00:52,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:00:53,246 INFO L124 PetriNetUnfolderBase]: 2565/5369 cut-off events. [2024-06-04 16:00:53,246 INFO L125 PetriNetUnfolderBase]: For 245604/245848 co-relation queries the response was YES. [2024-06-04 16:00:53,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36587 conditions, 5369 events. 2565/5369 cut-off events. For 245604/245848 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 40700 event pairs, 979 based on Foata normal form. 55/5293 useless extension candidates. Maximal degree in co-relation 28006. Up to 2137 conditions per place. [2024-06-04 16:00:53,290 INFO L140 encePairwiseOnDemand]: 59/68 looper letters, 132 selfloop transitions, 42 changer transitions 0/274 dead transitions. [2024-06-04 16:00:53,290 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 274 transitions, 3894 flow [2024-06-04 16:00:53,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 16:00:53,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 16:00:53,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 241 transitions. [2024-06-04 16:00:53,291 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7088235294117647 [2024-06-04 16:00:53,292 INFO L175 Difference]: Start difference. First operand has 201 places, 251 transitions, 3293 flow. Second operand 5 states and 241 transitions. [2024-06-04 16:00:53,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 274 transitions, 3894 flow [2024-06-04 16:00:53,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 274 transitions, 3811 flow, removed 12 selfloop flow, removed 2 redundant places. [2024-06-04 16:00:53,517 INFO L231 Difference]: Finished difference. Result has 204 places, 252 transitions, 3317 flow [2024-06-04 16:00:53,517 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=3210, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3317, PETRI_PLACES=204, PETRI_TRANSITIONS=252} [2024-06-04 16:00:53,518 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 143 predicate places. [2024-06-04 16:00:53,518 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 252 transitions, 3317 flow [2024-06-04 16:00:53,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.2) internal successors, (191), 5 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:00:53,518 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:00:53,518 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-04 16:00:53,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-04 16:00:53,519 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:00:53,519 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:00:53,519 INFO L85 PathProgramCache]: Analyzing trace with hash -646318099, now seen corresponding path program 2 times [2024-06-04 16:00:53,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:00:53,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599603003] [2024-06-04 16:00:53,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:00:53,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:00:53,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:00:53,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:00:53,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:00:53,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599603003] [2024-06-04 16:00:53,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599603003] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:00:53,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:00:53,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-04 16:00:53,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434014242] [2024-06-04 16:00:53,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:00:53,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-04 16:00:53,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:00:53,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-04 16:00:53,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-04 16:00:53,569 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 68 [2024-06-04 16:00:53,570 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 252 transitions, 3317 flow. Second operand has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:00:53,570 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:00:53,570 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 68 [2024-06-04 16:00:53,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:00:54,132 INFO L124 PetriNetUnfolderBase]: 1792/3888 cut-off events. [2024-06-04 16:00:54,132 INFO L125 PetriNetUnfolderBase]: For 94468/94859 co-relation queries the response was YES. [2024-06-04 16:00:54,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22308 conditions, 3888 events. 1792/3888 cut-off events. For 94468/94859 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 28568 event pairs, 600 based on Foata normal form. 153/3883 useless extension candidates. Maximal degree in co-relation 18765. Up to 1566 conditions per place. [2024-06-04 16:00:54,167 INFO L140 encePairwiseOnDemand]: 52/68 looper letters, 111 selfloop transitions, 45 changer transitions 1/284 dead transitions. [2024-06-04 16:00:54,167 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 284 transitions, 3749 flow [2024-06-04 16:00:54,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 16:00:54,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 16:00:54,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 239 transitions. [2024-06-04 16:00:54,169 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7029411764705882 [2024-06-04 16:00:54,169 INFO L175 Difference]: Start difference. First operand has 204 places, 252 transitions, 3317 flow. Second operand 5 states and 239 transitions. [2024-06-04 16:00:54,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 284 transitions, 3749 flow [2024-06-04 16:00:54,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 284 transitions, 3582 flow, removed 26 selfloop flow, removed 5 redundant places. [2024-06-04 16:00:54,344 INFO L231 Difference]: Finished difference. Result has 207 places, 250 transitions, 3278 flow [2024-06-04 16:00:54,344 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=2849, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3278, PETRI_PLACES=207, PETRI_TRANSITIONS=250} [2024-06-04 16:00:54,344 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 146 predicate places. [2024-06-04 16:00:54,344 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 250 transitions, 3278 flow [2024-06-04 16:00:54,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:00:54,345 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:00:54,345 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-04 16:00:54,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-04 16:00:54,345 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:00:54,345 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:00:54,345 INFO L85 PathProgramCache]: Analyzing trace with hash -150218033, now seen corresponding path program 3 times [2024-06-04 16:00:54,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:00:54,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490142940] [2024-06-04 16:00:54,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:00:54,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:00:54,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:00:54,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:00:54,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:00:54,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490142940] [2024-06-04 16:00:54,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490142940] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:00:54,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:00:54,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-04 16:00:54,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494021684] [2024-06-04 16:00:54,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:00:54,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-04 16:00:54,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:00:54,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-04 16:00:54,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-04 16:00:54,400 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 68 [2024-06-04 16:00:54,401 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 250 transitions, 3278 flow. Second operand has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:00:54,401 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:00:54,401 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 68 [2024-06-04 16:00:54,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:00:54,865 INFO L124 PetriNetUnfolderBase]: 1490/3287 cut-off events. [2024-06-04 16:00:54,865 INFO L125 PetriNetUnfolderBase]: For 74186/74488 co-relation queries the response was YES. [2024-06-04 16:00:54,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18959 conditions, 3287 events. 1490/3287 cut-off events. For 74186/74488 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 23011 event pairs, 450 based on Foata normal form. 98/3274 useless extension candidates. Maximal degree in co-relation 15635. Up to 1046 conditions per place. [2024-06-04 16:00:54,900 INFO L140 encePairwiseOnDemand]: 50/68 looper letters, 110 selfloop transitions, 70 changer transitions 1/289 dead transitions. [2024-06-04 16:00:54,900 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 289 transitions, 3880 flow [2024-06-04 16:00:54,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 16:00:54,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 16:00:54,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 239 transitions. [2024-06-04 16:00:54,901 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7029411764705882 [2024-06-04 16:00:54,901 INFO L175 Difference]: Start difference. First operand has 207 places, 250 transitions, 3278 flow. Second operand 5 states and 239 transitions. [2024-06-04 16:00:54,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 289 transitions, 3880 flow [2024-06-04 16:00:55,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 289 transitions, 3658 flow, removed 28 selfloop flow, removed 6 redundant places. [2024-06-04 16:00:55,061 INFO L231 Difference]: Finished difference. Result has 209 places, 254 transitions, 3339 flow [2024-06-04 16:00:55,061 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=2746, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3339, PETRI_PLACES=209, PETRI_TRANSITIONS=254} [2024-06-04 16:00:55,061 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 148 predicate places. [2024-06-04 16:00:55,062 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 254 transitions, 3339 flow [2024-06-04 16:00:55,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:00:55,062 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:00:55,062 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-04 16:00:55,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-04 16:00:55,062 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:00:55,063 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:00:55,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1469484678, now seen corresponding path program 1 times [2024-06-04 16:00:55,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:00:55,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761176680] [2024-06-04 16:00:55,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:00:55,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:00:55,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:00:55,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:00:55,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:00:55,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761176680] [2024-06-04 16:00:55,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761176680] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:00:55,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:00:55,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-04 16:00:55,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066613466] [2024-06-04 16:00:55,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:00:55,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-04 16:00:55,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:00:55,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-04 16:00:55,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-04 16:00:55,197 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 68 [2024-06-04 16:00:55,198 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 254 transitions, 3339 flow. Second operand has 5 states, 5 states have (on average 38.2) internal successors, (191), 5 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:00:55,198 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:00:55,198 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 68 [2024-06-04 16:00:55,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:00:55,657 INFO L124 PetriNetUnfolderBase]: 1410/3265 cut-off events. [2024-06-04 16:00:55,657 INFO L125 PetriNetUnfolderBase]: For 127844/128013 co-relation queries the response was YES. [2024-06-04 16:00:55,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21754 conditions, 3265 events. 1410/3265 cut-off events. For 127844/128013 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 23461 event pairs, 321 based on Foata normal form. 83/3294 useless extension candidates. Maximal degree in co-relation 21291. Up to 1376 conditions per place. [2024-06-04 16:00:55,690 INFO L140 encePairwiseOnDemand]: 62/68 looper letters, 135 selfloop transitions, 25 changer transitions 2/274 dead transitions. [2024-06-04 16:00:55,690 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 274 transitions, 3891 flow [2024-06-04 16:00:55,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 16:00:55,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 16:00:55,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 230 transitions. [2024-06-04 16:00:55,691 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6764705882352942 [2024-06-04 16:00:55,691 INFO L175 Difference]: Start difference. First operand has 209 places, 254 transitions, 3339 flow. Second operand 5 states and 230 transitions. [2024-06-04 16:00:55,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 274 transitions, 3891 flow [2024-06-04 16:00:55,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 274 transitions, 3881 flow, removed 5 selfloop flow, removed 0 redundant places. [2024-06-04 16:00:55,868 INFO L231 Difference]: Finished difference. Result has 215 places, 256 transitions, 3438 flow [2024-06-04 16:00:55,869 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=3329, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=229, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3438, PETRI_PLACES=215, PETRI_TRANSITIONS=256} [2024-06-04 16:00:55,869 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 154 predicate places. [2024-06-04 16:00:55,869 INFO L495 AbstractCegarLoop]: Abstraction has has 215 places, 256 transitions, 3438 flow [2024-06-04 16:00:55,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.2) internal successors, (191), 5 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:00:55,869 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:00:55,869 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] [2024-06-04 16:00:55,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-04 16:00:55,870 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:00:55,870 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:00:55,870 INFO L85 PathProgramCache]: Analyzing trace with hash 144859089, now seen corresponding path program 1 times [2024-06-04 16:00:55,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:00:55,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104388486] [2024-06-04 16:00:55,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:00:55,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:00:55,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:00:55,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:00:55,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:00:55,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104388486] [2024-06-04 16:00:55,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104388486] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:00:55,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:00:55,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-04 16:00:55,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385904808] [2024-06-04 16:00:55,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:00:55,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-04 16:00:55,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:00:55,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-04 16:00:55,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-04 16:00:56,011 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 68 [2024-06-04 16:00:56,012 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 256 transitions, 3438 flow. Second operand has 5 states, 5 states have (on average 38.4) internal successors, (192), 5 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:00:56,012 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:00:56,012 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 68 [2024-06-04 16:00:56,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:00:56,476 INFO L124 PetriNetUnfolderBase]: 1384/3191 cut-off events. [2024-06-04 16:00:56,476 INFO L125 PetriNetUnfolderBase]: For 128647/128843 co-relation queries the response was YES. [2024-06-04 16:00:56,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21508 conditions, 3191 events. 1384/3191 cut-off events. For 128647/128843 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 22996 event pairs, 431 based on Foata normal form. 74/3166 useless extension candidates. Maximal degree in co-relation 17855. Up to 1151 conditions per place. [2024-06-04 16:00:56,505 INFO L140 encePairwiseOnDemand]: 61/68 looper letters, 135 selfloop transitions, 30 changer transitions 2/279 dead transitions. [2024-06-04 16:00:56,505 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 279 transitions, 4068 flow [2024-06-04 16:00:56,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 16:00:56,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 16:00:56,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 234 transitions. [2024-06-04 16:00:56,506 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6882352941176471 [2024-06-04 16:00:56,506 INFO L175 Difference]: Start difference. First operand has 215 places, 256 transitions, 3438 flow. Second operand 5 states and 234 transitions. [2024-06-04 16:00:56,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 279 transitions, 4068 flow [2024-06-04 16:00:56,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 279 transitions, 3931 flow, removed 3 selfloop flow, removed 6 redundant places. [2024-06-04 16:00:56,682 INFO L231 Difference]: Finished difference. Result has 214 places, 257 transitions, 3396 flow [2024-06-04 16:00:56,682 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=3301, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=256, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=227, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3396, PETRI_PLACES=214, PETRI_TRANSITIONS=257} [2024-06-04 16:00:56,683 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 153 predicate places. [2024-06-04 16:00:56,683 INFO L495 AbstractCegarLoop]: Abstraction has has 214 places, 257 transitions, 3396 flow [2024-06-04 16:00:56,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.4) internal successors, (192), 5 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:00:56,683 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:00:56,683 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] [2024-06-04 16:00:56,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-04 16:00:56,683 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:00:56,684 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:00:56,684 INFO L85 PathProgramCache]: Analyzing trace with hash -449486491, now seen corresponding path program 2 times [2024-06-04 16:00:56,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:00:56,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167332581] [2024-06-04 16:00:56,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:00:56,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:00:56,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:00:56,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:00:56,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:00:56,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167332581] [2024-06-04 16:00:56,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167332581] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:00:56,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:00:56,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-04 16:00:56,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922076770] [2024-06-04 16:00:56,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:00:56,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-04 16:00:56,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:00:56,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-04 16:00:56,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-04 16:00:56,817 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 68 [2024-06-04 16:00:56,818 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 257 transitions, 3396 flow. Second operand has 5 states, 5 states have (on average 38.4) internal successors, (192), 5 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:00:56,818 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:00:56,818 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 68 [2024-06-04 16:00:56,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:00:57,351 INFO L124 PetriNetUnfolderBase]: 1408/3242 cut-off events. [2024-06-04 16:00:57,351 INFO L125 PetriNetUnfolderBase]: For 126222/126427 co-relation queries the response was YES. [2024-06-04 16:00:57,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21638 conditions, 3242 events. 1408/3242 cut-off events. For 126222/126427 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 23176 event pairs, 254 based on Foata normal form. 69/3246 useless extension candidates. Maximal degree in co-relation 20512. Up to 986 conditions per place. [2024-06-04 16:00:57,382 INFO L140 encePairwiseOnDemand]: 60/68 looper letters, 139 selfloop transitions, 28 changer transitions 2/281 dead transitions. [2024-06-04 16:00:57,383 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 281 transitions, 4016 flow [2024-06-04 16:00:57,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 16:00:57,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 16:00:57,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 235 transitions. [2024-06-04 16:00:57,384 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6911764705882353 [2024-06-04 16:00:57,384 INFO L175 Difference]: Start difference. First operand has 214 places, 257 transitions, 3396 flow. Second operand 5 states and 235 transitions. [2024-06-04 16:00:57,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 281 transitions, 4016 flow [2024-06-04 16:00:57,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 281 transitions, 3937 flow, removed 12 selfloop flow, removed 3 redundant places. [2024-06-04 16:00:57,536 INFO L231 Difference]: Finished difference. Result has 216 places, 257 transitions, 3385 flow [2024-06-04 16:00:57,537 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=3321, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=229, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3385, PETRI_PLACES=216, PETRI_TRANSITIONS=257} [2024-06-04 16:00:57,537 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 155 predicate places. [2024-06-04 16:00:57,537 INFO L495 AbstractCegarLoop]: Abstraction has has 216 places, 257 transitions, 3385 flow [2024-06-04 16:00:57,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.4) internal successors, (192), 5 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:00:57,537 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:00:57,537 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:00:57,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-04 16:00:57,538 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:00:57,538 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:00:57,538 INFO L85 PathProgramCache]: Analyzing trace with hash 434587141, now seen corresponding path program 1 times [2024-06-04 16:00:57,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:00:57,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415281800] [2024-06-04 16:00:57,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:00:57,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:00:57,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:00:57,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:00:57,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:00:57,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415281800] [2024-06-04 16:00:57,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415281800] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:00:57,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:00:57,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-04 16:00:57,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711964828] [2024-06-04 16:00:57,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:00:57,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-04 16:00:57,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:00:57,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-04 16:00:57,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-04 16:00:57,678 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 68 [2024-06-04 16:00:57,679 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 257 transitions, 3385 flow. Second operand has 5 states, 5 states have (on average 38.4) internal successors, (192), 5 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:00:57,679 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:00:57,679 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 68 [2024-06-04 16:00:57,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:00:58,096 INFO L124 PetriNetUnfolderBase]: 1383/3147 cut-off events. [2024-06-04 16:00:58,096 INFO L125 PetriNetUnfolderBase]: For 126978/127195 co-relation queries the response was YES. [2024-06-04 16:00:58,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21138 conditions, 3147 events. 1383/3147 cut-off events. For 126978/127195 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 22570 event pairs, 666 based on Foata normal form. 67/3102 useless extension candidates. Maximal degree in co-relation 16525. Up to 1766 conditions per place. [2024-06-04 16:00:58,126 INFO L140 encePairwiseOnDemand]: 63/68 looper letters, 134 selfloop transitions, 25 changer transitions 0/271 dead transitions. [2024-06-04 16:00:58,126 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 271 transitions, 3825 flow [2024-06-04 16:00:58,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 16:00:58,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 16:00:58,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 227 transitions. [2024-06-04 16:00:58,127 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6676470588235294 [2024-06-04 16:00:58,127 INFO L175 Difference]: Start difference. First operand has 216 places, 257 transitions, 3385 flow. Second operand 5 states and 227 transitions. [2024-06-04 16:00:58,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 271 transitions, 3825 flow [2024-06-04 16:00:58,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 271 transitions, 3707 flow, removed 4 selfloop flow, removed 7 redundant places. [2024-06-04 16:00:58,292 INFO L231 Difference]: Finished difference. Result has 214 places, 258 transitions, 3341 flow [2024-06-04 16:00:58,292 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=3269, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3341, PETRI_PLACES=214, PETRI_TRANSITIONS=258} [2024-06-04 16:00:58,293 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 153 predicate places. [2024-06-04 16:00:58,293 INFO L495 AbstractCegarLoop]: Abstraction has has 214 places, 258 transitions, 3341 flow [2024-06-04 16:00:58,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.4) internal successors, (192), 5 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:00:58,293 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:00:58,293 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] [2024-06-04 16:00:58,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-04 16:00:58,294 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:00:58,294 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:00:58,294 INFO L85 PathProgramCache]: Analyzing trace with hash 869602939, now seen corresponding path program 2 times [2024-06-04 16:00:58,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:00:58,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358555198] [2024-06-04 16:00:58,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:00:58,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:00:58,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:00:58,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:00:58,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:00:58,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358555198] [2024-06-04 16:00:58,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358555198] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:00:58,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:00:58,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-04 16:00:58,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846307444] [2024-06-04 16:00:58,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:00:58,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-04 16:00:58,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:00:58,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-04 16:00:58,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-04 16:00:58,437 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 68 [2024-06-04 16:00:58,437 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 258 transitions, 3341 flow. Second operand has 5 states, 5 states have (on average 38.4) internal successors, (192), 5 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:00:58,437 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:00:58,438 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 68 [2024-06-04 16:00:58,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:00:58,958 INFO L124 PetriNetUnfolderBase]: 1433/3273 cut-off events. [2024-06-04 16:00:58,958 INFO L125 PetriNetUnfolderBase]: For 122648/122876 co-relation queries the response was YES. [2024-06-04 16:00:58,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21301 conditions, 3273 events. 1433/3273 cut-off events. For 122648/122876 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 23321 event pairs, 476 based on Foata normal form. 74/3277 useless extension candidates. Maximal degree in co-relation 17511. Up to 1389 conditions per place. [2024-06-04 16:00:58,996 INFO L140 encePairwiseOnDemand]: 62/68 looper letters, 150 selfloop transitions, 15 changer transitions 1/278 dead transitions. [2024-06-04 16:00:58,996 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 278 transitions, 3950 flow [2024-06-04 16:00:58,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 16:00:58,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 16:00:58,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 228 transitions. [2024-06-04 16:00:58,997 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6705882352941176 [2024-06-04 16:00:58,997 INFO L175 Difference]: Start difference. First operand has 214 places, 258 transitions, 3341 flow. Second operand 5 states and 228 transitions. [2024-06-04 16:00:58,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 278 transitions, 3950 flow [2024-06-04 16:00:59,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 278 transitions, 3918 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-06-04 16:00:59,184 INFO L231 Difference]: Finished difference. Result has 217 places, 259 transitions, 3361 flow [2024-06-04 16:00:59,185 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=3310, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3361, PETRI_PLACES=217, PETRI_TRANSITIONS=259} [2024-06-04 16:00:59,185 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 156 predicate places. [2024-06-04 16:00:59,185 INFO L495 AbstractCegarLoop]: Abstraction has has 217 places, 259 transitions, 3361 flow [2024-06-04 16:00:59,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.4) internal successors, (192), 5 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:00:59,185 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:00:59,185 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] [2024-06-04 16:00:59,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-04 16:00:59,186 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:00:59,186 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:00:59,186 INFO L85 PathProgramCache]: Analyzing trace with hash -1208615487, now seen corresponding path program 3 times [2024-06-04 16:00:59,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:00:59,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070442626] [2024-06-04 16:00:59,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:00:59,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:00:59,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:00:59,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:00:59,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:00:59,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070442626] [2024-06-04 16:00:59,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070442626] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:00:59,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:00:59,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-04 16:00:59,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9691] [2024-06-04 16:00:59,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:00:59,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-04 16:00:59,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:00:59,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-04 16:00:59,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-04 16:00:59,306 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 68 [2024-06-04 16:00:59,307 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 259 transitions, 3361 flow. Second operand has 5 states, 5 states have (on average 38.4) internal successors, (192), 5 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:00:59,307 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:00:59,307 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 68 [2024-06-04 16:00:59,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:00:59,755 INFO L124 PetriNetUnfolderBase]: 1425/3260 cut-off events. [2024-06-04 16:00:59,756 INFO L125 PetriNetUnfolderBase]: For 120998/121228 co-relation queries the response was YES. [2024-06-04 16:00:59,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21288 conditions, 3260 events. 1425/3260 cut-off events. For 120998/121228 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 23242 event pairs, 472 based on Foata normal form. 68/3256 useless extension candidates. Maximal degree in co-relation 17592. Up to 1389 conditions per place. [2024-06-04 16:00:59,787 INFO L140 encePairwiseOnDemand]: 62/68 looper letters, 141 selfloop transitions, 24 changer transitions 2/279 dead transitions. [2024-06-04 16:00:59,787 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 279 transitions, 3975 flow [2024-06-04 16:00:59,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 16:00:59,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 16:00:59,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 228 transitions. [2024-06-04 16:00:59,788 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6705882352941176 [2024-06-04 16:00:59,788 INFO L175 Difference]: Start difference. First operand has 217 places, 259 transitions, 3361 flow. Second operand 5 states and 228 transitions. [2024-06-04 16:00:59,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 279 transitions, 3975 flow [2024-06-04 16:00:59,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 279 transitions, 3928 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-06-04 16:00:59,969 INFO L231 Difference]: Finished difference. Result has 219 places, 259 transitions, 3366 flow [2024-06-04 16:00:59,969 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=3314, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=235, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3366, PETRI_PLACES=219, PETRI_TRANSITIONS=259} [2024-06-04 16:00:59,969 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 158 predicate places. [2024-06-04 16:00:59,969 INFO L495 AbstractCegarLoop]: Abstraction has has 219 places, 259 transitions, 3366 flow [2024-06-04 16:00:59,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.4) internal successors, (192), 5 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:00:59,970 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:00:59,970 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:00:59,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-04 16:00:59,970 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:00:59,970 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:00:59,970 INFO L85 PathProgramCache]: Analyzing trace with hash 175927902, now seen corresponding path program 1 times [2024-06-04 16:00:59,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:00:59,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152423107] [2024-06-04 16:00:59,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:00:59,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:00:59,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:01:00,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:01:00,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:01:00,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152423107] [2024-06-04 16:01:00,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152423107] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:01:00,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:01:00,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-04 16:01:00,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435681159] [2024-06-04 16:01:00,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:01:00,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-04 16:01:00,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:01:00,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-04 16:01:00,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-04 16:01:00,112 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 68 [2024-06-04 16:01:00,112 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 259 transitions, 3366 flow. Second operand has 5 states, 5 states have (on average 38.4) internal successors, (192), 5 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:01:00,112 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:01:00,112 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 68 [2024-06-04 16:01:00,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:01:00,565 INFO L124 PetriNetUnfolderBase]: 1433/3276 cut-off events. [2024-06-04 16:01:00,565 INFO L125 PetriNetUnfolderBase]: For 125726/125950 co-relation queries the response was YES. [2024-06-04 16:01:00,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21381 conditions, 3276 events. 1433/3276 cut-off events. For 125726/125950 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 23335 event pairs, 440 based on Foata normal form. 71/3278 useless extension candidates. Maximal degree in co-relation 17636. Up to 1146 conditions per place. [2024-06-04 16:01:00,599 INFO L140 encePairwiseOnDemand]: 61/68 looper letters, 135 selfloop transitions, 35 changer transitions 1/283 dead transitions. [2024-06-04 16:01:00,599 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 283 transitions, 4100 flow [2024-06-04 16:01:00,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 16:01:00,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 16:01:00,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 230 transitions. [2024-06-04 16:01:00,601 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6764705882352942 [2024-06-04 16:01:00,601 INFO L175 Difference]: Start difference. First operand has 219 places, 259 transitions, 3366 flow. Second operand 5 states and 230 transitions. [2024-06-04 16:01:00,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 283 transitions, 4100 flow [2024-06-04 16:01:00,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 283 transitions, 4049 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-06-04 16:01:00,790 INFO L231 Difference]: Finished difference. Result has 221 places, 265 transitions, 3538 flow [2024-06-04 16:01:00,790 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=3317, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=227, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3538, PETRI_PLACES=221, PETRI_TRANSITIONS=265} [2024-06-04 16:01:00,791 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 160 predicate places. [2024-06-04 16:01:00,791 INFO L495 AbstractCegarLoop]: Abstraction has has 221 places, 265 transitions, 3538 flow [2024-06-04 16:01:00,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.4) internal successors, (192), 5 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:01:00,791 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:01:00,791 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:01:00,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-04 16:01:00,792 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:01:00,792 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:01:00,792 INFO L85 PathProgramCache]: Analyzing trace with hash 175926910, now seen corresponding path program 1 times [2024-06-04 16:01:00,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:01:00,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113308889] [2024-06-04 16:01:00,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:01:00,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:01:00,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:01:00,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:01:00,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:01:00,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113308889] [2024-06-04 16:01:00,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113308889] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:01:00,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:01:00,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-04 16:01:00,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027813037] [2024-06-04 16:01:00,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:01:00,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-04 16:01:00,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:01:00,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-04 16:01:00,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-04 16:01:00,838 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 68 [2024-06-04 16:01:00,838 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 265 transitions, 3538 flow. Second operand has 4 states, 4 states have (on average 35.0) internal successors, (140), 4 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:01:00,839 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:01:00,839 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 68 [2024-06-04 16:01:00,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:01:01,359 INFO L124 PetriNetUnfolderBase]: 1317/2929 cut-off events. [2024-06-04 16:01:01,359 INFO L125 PetriNetUnfolderBase]: For 56965/57209 co-relation queries the response was YES. [2024-06-04 16:01:01,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16599 conditions, 2929 events. 1317/2929 cut-off events. For 56965/57209 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 20182 event pairs, 647 based on Foata normal form. 82/2896 useless extension candidates. Maximal degree in co-relation 14276. Up to 1675 conditions per place. [2024-06-04 16:01:01,384 INFO L140 encePairwiseOnDemand]: 55/68 looper letters, 109 selfloop transitions, 35 changer transitions 1/259 dead transitions. [2024-06-04 16:01:01,384 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 259 transitions, 3663 flow [2024-06-04 16:01:01,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 16:01:01,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 16:01:01,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 226 transitions. [2024-06-04 16:01:01,385 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6647058823529411 [2024-06-04 16:01:01,385 INFO L175 Difference]: Start difference. First operand has 221 places, 265 transitions, 3538 flow. Second operand 5 states and 226 transitions. [2024-06-04 16:01:01,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 259 transitions, 3663 flow [2024-06-04 16:01:01,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 259 transitions, 3485 flow, removed 35 selfloop flow, removed 6 redundant places. [2024-06-04 16:01:01,531 INFO L231 Difference]: Finished difference. Result has 218 places, 238 transitions, 3093 flow [2024-06-04 16:01:01,531 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=2967, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3093, PETRI_PLACES=218, PETRI_TRANSITIONS=238} [2024-06-04 16:01:01,532 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 157 predicate places. [2024-06-04 16:01:01,532 INFO L495 AbstractCegarLoop]: Abstraction has has 218 places, 238 transitions, 3093 flow [2024-06-04 16:01:01,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.0) internal successors, (140), 4 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:01:01,532 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:01:01,532 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:01:01,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-04 16:01:01,533 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:01:01,533 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:01:01,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1958798206, now seen corresponding path program 1 times [2024-06-04 16:01:01,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:01:01,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673013129] [2024-06-04 16:01:01,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:01:01,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:01:01,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:01:01,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:01:01,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:01:01,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673013129] [2024-06-04 16:01:01,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673013129] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:01:01,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:01:01,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-04 16:01:01,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537150385] [2024-06-04 16:01:01,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:01:01,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-04 16:01:01,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:01:01,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-04 16:01:01,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-04 16:01:01,652 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 68 [2024-06-04 16:01:01,654 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 238 transitions, 3093 flow. Second operand has 5 states, 5 states have (on average 38.4) internal successors, (192), 5 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:01:01,654 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:01:01,655 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 68 [2024-06-04 16:01:01,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:01:02,042 INFO L124 PetriNetUnfolderBase]: 1171/2776 cut-off events. [2024-06-04 16:01:02,042 INFO L125 PetriNetUnfolderBase]: For 91749/91921 co-relation queries the response was YES. [2024-06-04 16:01:02,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16950 conditions, 2776 events. 1171/2776 cut-off events. For 91749/91921 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 19686 event pairs, 351 based on Foata normal form. 47/2771 useless extension candidates. Maximal degree in co-relation 13453. Up to 919 conditions per place. [2024-06-04 16:01:02,068 INFO L140 encePairwiseOnDemand]: 60/68 looper letters, 125 selfloop transitions, 36 changer transitions 1/259 dead transitions. [2024-06-04 16:01:02,068 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 259 transitions, 3716 flow [2024-06-04 16:01:02,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 16:01:02,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 16:01:02,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 233 transitions. [2024-06-04 16:01:02,069 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6852941176470588 [2024-06-04 16:01:02,070 INFO L175 Difference]: Start difference. First operand has 218 places, 238 transitions, 3093 flow. Second operand 5 states and 233 transitions. [2024-06-04 16:01:02,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 259 transitions, 3716 flow [2024-06-04 16:01:02,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 259 transitions, 3657 flow, removed 10 selfloop flow, removed 2 redundant places. [2024-06-04 16:01:02,241 INFO L231 Difference]: Finished difference. Result has 221 places, 242 transitions, 3203 flow [2024-06-04 16:01:02,241 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=3034, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3203, PETRI_PLACES=221, PETRI_TRANSITIONS=242} [2024-06-04 16:01:02,241 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 160 predicate places. [2024-06-04 16:01:02,242 INFO L495 AbstractCegarLoop]: Abstraction has has 221 places, 242 transitions, 3203 flow [2024-06-04 16:01:02,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.4) internal successors, (192), 5 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:01:02,242 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:01:02,242 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:01:02,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-04 16:01:02,242 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:01:02,242 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:01:02,242 INFO L85 PathProgramCache]: Analyzing trace with hash -2146703006, now seen corresponding path program 2 times [2024-06-04 16:01:02,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:01:02,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180632144] [2024-06-04 16:01:02,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:01:02,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:01:02,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:01:02,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:01:02,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:01:02,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180632144] [2024-06-04 16:01:02,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180632144] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:01:02,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:01:02,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-04 16:01:02,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781684134] [2024-06-04 16:01:02,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:01:02,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-04 16:01:02,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:01:02,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-04 16:01:02,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-04 16:01:02,361 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 68 [2024-06-04 16:01:02,362 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 242 transitions, 3203 flow. Second operand has 5 states, 5 states have (on average 38.4) internal successors, (192), 5 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:01:02,362 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:01:02,362 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 68 [2024-06-04 16:01:02,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:01:02,730 INFO L124 PetriNetUnfolderBase]: 1164/2768 cut-off events. [2024-06-04 16:01:02,730 INFO L125 PetriNetUnfolderBase]: For 93347/93525 co-relation queries the response was YES. [2024-06-04 16:01:02,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16484 conditions, 2768 events. 1164/2768 cut-off events. For 93347/93525 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 19580 event pairs, 342 based on Foata normal form. 57/2769 useless extension candidates. Maximal degree in co-relation 12957. Up to 921 conditions per place. [2024-06-04 16:01:02,755 INFO L140 encePairwiseOnDemand]: 60/68 looper letters, 132 selfloop transitions, 32 changer transitions 1/262 dead transitions. [2024-06-04 16:01:02,755 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 262 transitions, 3829 flow [2024-06-04 16:01:02,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 16:01:02,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 16:01:02,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 235 transitions. [2024-06-04 16:01:02,756 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6911764705882353 [2024-06-04 16:01:02,757 INFO L175 Difference]: Start difference. First operand has 221 places, 242 transitions, 3203 flow. Second operand 5 states and 235 transitions. [2024-06-04 16:01:02,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 262 transitions, 3829 flow [2024-06-04 16:01:02,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 262 transitions, 3754 flow, removed 16 selfloop flow, removed 2 redundant places. [2024-06-04 16:01:02,941 INFO L231 Difference]: Finished difference. Result has 225 places, 245 transitions, 3302 flow [2024-06-04 16:01:02,941 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=3131, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3302, PETRI_PLACES=225, PETRI_TRANSITIONS=245} [2024-06-04 16:01:02,941 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 164 predicate places. [2024-06-04 16:01:02,941 INFO L495 AbstractCegarLoop]: Abstraction has has 225 places, 245 transitions, 3302 flow [2024-06-04 16:01:02,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.4) internal successors, (192), 5 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:01:02,942 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:01:02,942 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:01:02,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-04 16:01:02,942 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:01:02,942 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:01:02,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1627707100, now seen corresponding path program 1 times [2024-06-04 16:01:02,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:01:02,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161401937] [2024-06-04 16:01:02,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:01:02,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:01:02,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:01:03,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:01:03,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:01:03,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161401937] [2024-06-04 16:01:03,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161401937] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:01:03,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:01:03,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-04 16:01:03,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077954634] [2024-06-04 16:01:03,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:01:03,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-04 16:01:03,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:01:03,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-04 16:01:03,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-04 16:01:03,085 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 68 [2024-06-04 16:01:03,086 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 245 transitions, 3302 flow. Second operand has 5 states, 5 states have (on average 38.4) internal successors, (192), 5 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:01:03,086 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:01:03,086 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 68 [2024-06-04 16:01:03,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:01:03,513 INFO L124 PetriNetUnfolderBase]: 1174/2817 cut-off events. [2024-06-04 16:01:03,513 INFO L125 PetriNetUnfolderBase]: For 84818/84982 co-relation queries the response was YES. [2024-06-04 16:01:03,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16652 conditions, 2817 events. 1174/2817 cut-off events. For 84818/84982 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 20085 event pairs, 343 based on Foata normal form. 47/2813 useless extension candidates. Maximal degree in co-relation 13062. Up to 920 conditions per place. [2024-06-04 16:01:03,537 INFO L140 encePairwiseOnDemand]: 61/68 looper letters, 120 selfloop transitions, 36 changer transitions 10/261 dead transitions. [2024-06-04 16:01:03,537 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 261 transitions, 3843 flow [2024-06-04 16:01:03,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 16:01:03,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 16:01:03,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 231 transitions. [2024-06-04 16:01:03,538 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6794117647058824 [2024-06-04 16:01:03,538 INFO L175 Difference]: Start difference. First operand has 225 places, 245 transitions, 3302 flow. Second operand 5 states and 231 transitions. [2024-06-04 16:01:03,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 261 transitions, 3843 flow [2024-06-04 16:01:03,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 261 transitions, 3726 flow, removed 29 selfloop flow, removed 3 redundant places. [2024-06-04 16:01:03,727 INFO L231 Difference]: Finished difference. Result has 227 places, 236 transitions, 3129 flow [2024-06-04 16:01:03,728 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=3185, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3129, PETRI_PLACES=227, PETRI_TRANSITIONS=236} [2024-06-04 16:01:03,728 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 166 predicate places. [2024-06-04 16:01:03,728 INFO L495 AbstractCegarLoop]: Abstraction has has 227 places, 236 transitions, 3129 flow [2024-06-04 16:01:03,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.4) internal successors, (192), 5 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:01:03,729 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:01:03,729 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:01:03,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-04 16:01:03,729 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:01:03,730 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:01:03,731 INFO L85 PathProgramCache]: Analyzing trace with hash 800377240, now seen corresponding path program 2 times [2024-06-04 16:01:03,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:01:03,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75903216] [2024-06-04 16:01:03,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:01:03,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:01:03,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:01:03,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:01:03,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:01:03,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75903216] [2024-06-04 16:01:03,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75903216] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:01:03,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:01:03,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-04 16:01:03,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727845772] [2024-06-04 16:01:03,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:01:03,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-04 16:01:03,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:01:03,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-04 16:01:03,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-04 16:01:03,853 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 68 [2024-06-04 16:01:03,853 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 236 transitions, 3129 flow. Second operand has 5 states, 5 states have (on average 38.4) internal successors, (192), 5 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:01:03,853 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:01:03,854 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 68 [2024-06-04 16:01:03,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:01:04,220 INFO L124 PetriNetUnfolderBase]: 1134/2746 cut-off events. [2024-06-04 16:01:04,221 INFO L125 PetriNetUnfolderBase]: For 78773/78935 co-relation queries the response was YES. [2024-06-04 16:01:04,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15999 conditions, 2746 events. 1134/2746 cut-off events. For 78773/78935 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 19518 event pairs, 357 based on Foata normal form. 39/2732 useless extension candidates. Maximal degree in co-relation 12374. Up to 919 conditions per place. [2024-06-04 16:01:04,248 INFO L140 encePairwiseOnDemand]: 62/68 looper letters, 108 selfloop transitions, 24 changer transitions 37/249 dead transitions. [2024-06-04 16:01:04,248 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 249 transitions, 3641 flow [2024-06-04 16:01:04,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 16:01:04,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 16:01:04,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 228 transitions. [2024-06-04 16:01:04,251 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6705882352941176 [2024-06-04 16:01:04,251 INFO L175 Difference]: Start difference. First operand has 227 places, 236 transitions, 3129 flow. Second operand 5 states and 228 transitions. [2024-06-04 16:01:04,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 249 transitions, 3641 flow [2024-06-04 16:01:04,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 249 transitions, 3487 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-06-04 16:01:04,417 INFO L231 Difference]: Finished difference. Result has 226 places, 200 transitions, 2557 flow [2024-06-04 16:01:04,417 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=2975, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2557, PETRI_PLACES=226, PETRI_TRANSITIONS=200} [2024-06-04 16:01:04,417 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 165 predicate places. [2024-06-04 16:01:04,418 INFO L495 AbstractCegarLoop]: Abstraction has has 226 places, 200 transitions, 2557 flow [2024-06-04 16:01:04,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.4) internal successors, (192), 5 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:01:04,418 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:01:04,418 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:01:04,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-04 16:01:04,418 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:01:04,418 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:01:04,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1435066758, now seen corresponding path program 2 times [2024-06-04 16:01:04,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:01:04,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175070320] [2024-06-04 16:01:04,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:01:04,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:01:04,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:01:04,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:01:04,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:01:04,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175070320] [2024-06-04 16:01:04,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175070320] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:01:04,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:01:04,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-04 16:01:04,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755618790] [2024-06-04 16:01:04,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:01:04,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-04 16:01:04,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:01:04,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-04 16:01:04,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-04 16:01:04,471 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 68 [2024-06-04 16:01:04,472 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 200 transitions, 2557 flow. Second operand has 4 states, 4 states have (on average 35.0) internal successors, (140), 4 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:01:04,472 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:01:04,472 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 68 [2024-06-04 16:01:04,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:01:04,751 INFO L124 PetriNetUnfolderBase]: 777/1860 cut-off events. [2024-06-04 16:01:04,751 INFO L125 PetriNetUnfolderBase]: For 28187/28314 co-relation queries the response was YES. [2024-06-04 16:01:04,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9527 conditions, 1860 events. 777/1860 cut-off events. For 28187/28314 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 12378 event pairs, 461 based on Foata normal form. 57/1868 useless extension candidates. Maximal degree in co-relation 8542. Up to 1123 conditions per place. [2024-06-04 16:01:04,765 INFO L140 encePairwiseOnDemand]: 58/68 looper letters, 65 selfloop transitions, 0 changer transitions 49/170 dead transitions. [2024-06-04 16:01:04,765 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 170 transitions, 2289 flow [2024-06-04 16:01:04,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 16:01:04,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 16:01:04,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 213 transitions. [2024-06-04 16:01:04,766 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6264705882352941 [2024-06-04 16:01:04,766 INFO L175 Difference]: Start difference. First operand has 226 places, 200 transitions, 2557 flow. Second operand 5 states and 213 transitions. [2024-06-04 16:01:04,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 170 transitions, 2289 flow [2024-06-04 16:01:04,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 170 transitions, 1959 flow, removed 37 selfloop flow, removed 24 redundant places. [2024-06-04 16:01:04,844 INFO L231 Difference]: Finished difference. Result has 203 places, 121 transitions, 1278 flow [2024-06-04 16:01:04,845 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=1671, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1278, PETRI_PLACES=203, PETRI_TRANSITIONS=121} [2024-06-04 16:01:04,845 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 142 predicate places. [2024-06-04 16:01:04,845 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 121 transitions, 1278 flow [2024-06-04 16:01:04,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.0) internal successors, (140), 4 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:01:04,846 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:01:04,846 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:01:04,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-04 16:01:04,846 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:01:04,847 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:01:04,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1596110998, now seen corresponding path program 2 times [2024-06-04 16:01:04,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:01:04,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093536256] [2024-06-04 16:01:04,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:01:04,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:01:04,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:01:04,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:01:04,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:01:04,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093536256] [2024-06-04 16:01:04,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093536256] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:01:04,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:01:04,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-04 16:01:04,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416928282] [2024-06-04 16:01:04,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:01:04,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-04 16:01:04,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:01:04,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-04 16:01:04,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-04 16:01:04,964 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 68 [2024-06-04 16:01:04,964 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 121 transitions, 1278 flow. Second operand has 5 states, 5 states have (on average 38.4) internal successors, (192), 5 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:01:04,965 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:01:04,965 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 68 [2024-06-04 16:01:04,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:01:05,118 INFO L124 PetriNetUnfolderBase]: 443/1190 cut-off events. [2024-06-04 16:01:05,119 INFO L125 PetriNetUnfolderBase]: For 24832/24946 co-relation queries the response was YES. [2024-06-04 16:01:05,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5724 conditions, 1190 events. 443/1190 cut-off events. For 24832/24946 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 7306 event pairs, 188 based on Foata normal form. 34/1206 useless extension candidates. Maximal degree in co-relation 5656. Up to 444 conditions per place. [2024-06-04 16:01:05,126 INFO L140 encePairwiseOnDemand]: 61/68 looper letters, 61 selfloop transitions, 9 changer transitions 34/132 dead transitions. [2024-06-04 16:01:05,126 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 132 transitions, 1626 flow [2024-06-04 16:01:05,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 16:01:05,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 16:01:05,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 221 transitions. [2024-06-04 16:01:05,127 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.65 [2024-06-04 16:01:05,127 INFO L175 Difference]: Start difference. First operand has 203 places, 121 transitions, 1278 flow. Second operand 5 states and 221 transitions. [2024-06-04 16:01:05,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 132 transitions, 1626 flow [2024-06-04 16:01:05,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 132 transitions, 1483 flow, removed 42 selfloop flow, removed 17 redundant places. [2024-06-04 16:01:05,171 INFO L231 Difference]: Finished difference. Result has 176 places, 90 transitions, 923 flow [2024-06-04 16:01:05,171 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=1171, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=923, PETRI_PLACES=176, PETRI_TRANSITIONS=90} [2024-06-04 16:01:05,172 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 115 predicate places. [2024-06-04 16:01:05,172 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 90 transitions, 923 flow [2024-06-04 16:01:05,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.4) internal successors, (192), 5 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:01:05,172 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:01:05,172 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, 1] [2024-06-04 16:01:05,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-04 16:01:05,173 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:01:05,173 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:01:05,173 INFO L85 PathProgramCache]: Analyzing trace with hash -8001809, now seen corresponding path program 1 times [2024-06-04 16:01:05,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:01:05,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529400951] [2024-06-04 16:01:05,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:01:05,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:01:05,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:01:05,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:01:05,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:01:05,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529400951] [2024-06-04 16:01:05,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529400951] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:01:05,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:01:05,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-04 16:01:05,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871854379] [2024-06-04 16:01:05,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:01:05,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-04 16:01:05,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:01:05,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-04 16:01:05,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-04 16:01:05,293 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 68 [2024-06-04 16:01:05,294 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 90 transitions, 923 flow. Second operand has 5 states, 5 states have (on average 38.8) internal successors, (194), 5 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:01:05,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:01:05,294 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 68 [2024-06-04 16:01:05,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:01:05,402 INFO L124 PetriNetUnfolderBase]: 344/927 cut-off events. [2024-06-04 16:01:05,402 INFO L125 PetriNetUnfolderBase]: For 14147/14237 co-relation queries the response was YES. [2024-06-04 16:01:05,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4125 conditions, 927 events. 344/927 cut-off events. For 14147/14237 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 5292 event pairs, 91 based on Foata normal form. 34/952 useless extension candidates. Maximal degree in co-relation 4069. Up to 294 conditions per place. [2024-06-04 16:01:05,407 INFO L140 encePairwiseOnDemand]: 60/68 looper letters, 53 selfloop transitions, 22 changer transitions 2/105 dead transitions. [2024-06-04 16:01:05,407 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 105 transitions, 1231 flow [2024-06-04 16:01:05,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 16:01:05,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 16:01:05,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 225 transitions. [2024-06-04 16:01:05,408 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6617647058823529 [2024-06-04 16:01:05,408 INFO L175 Difference]: Start difference. First operand has 176 places, 90 transitions, 923 flow. Second operand 5 states and 225 transitions. [2024-06-04 16:01:05,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 105 transitions, 1231 flow [2024-06-04 16:01:05,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 105 transitions, 1072 flow, removed 38 selfloop flow, removed 19 redundant places. [2024-06-04 16:01:05,430 INFO L231 Difference]: Finished difference. Result has 145 places, 90 transitions, 845 flow [2024-06-04 16:01:05,430 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=792, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=845, PETRI_PLACES=145, PETRI_TRANSITIONS=90} [2024-06-04 16:01:05,431 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 84 predicate places. [2024-06-04 16:01:05,431 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 90 transitions, 845 flow [2024-06-04 16:01:05,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.8) internal successors, (194), 5 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:01:05,431 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:01:05,431 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, 1] [2024-06-04 16:01:05,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-04 16:01:05,431 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:01:05,431 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:01:05,431 INFO L85 PathProgramCache]: Analyzing trace with hash -1279747813, now seen corresponding path program 1 times [2024-06-04 16:01:05,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:01:05,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730879587] [2024-06-04 16:01:05,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:01:05,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:01:05,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:01:05,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:01:05,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:01:05,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730879587] [2024-06-04 16:01:05,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730879587] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:01:05,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:01:05,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-04 16:01:05,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721944817] [2024-06-04 16:01:05,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:01:05,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-04 16:01:05,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:01:05,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-04 16:01:05,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-04 16:01:05,554 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 68 [2024-06-04 16:01:05,554 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 90 transitions, 845 flow. Second operand has 5 states, 5 states have (on average 38.8) internal successors, (194), 5 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:01:05,554 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:01:05,555 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 68 [2024-06-04 16:01:05,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:01:05,673 INFO L124 PetriNetUnfolderBase]: 340/910 cut-off events. [2024-06-04 16:01:05,674 INFO L125 PetriNetUnfolderBase]: For 8854/8908 co-relation queries the response was YES. [2024-06-04 16:01:05,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3536 conditions, 910 events. 340/910 cut-off events. For 8854/8908 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 5125 event pairs, 146 based on Foata normal form. 34/941 useless extension candidates. Maximal degree in co-relation 3491. Up to 377 conditions per place. [2024-06-04 16:01:05,678 INFO L140 encePairwiseOnDemand]: 62/68 looper letters, 52 selfloop transitions, 19 changer transitions 2/101 dead transitions. [2024-06-04 16:01:05,678 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 101 transitions, 1065 flow [2024-06-04 16:01:05,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 16:01:05,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 16:01:05,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 218 transitions. [2024-06-04 16:01:05,679 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6411764705882353 [2024-06-04 16:01:05,679 INFO L175 Difference]: Start difference. First operand has 145 places, 90 transitions, 845 flow. Second operand 5 states and 218 transitions. [2024-06-04 16:01:05,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 101 transitions, 1065 flow [2024-06-04 16:01:05,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 101 transitions, 1010 flow, removed 2 selfloop flow, removed 6 redundant places. [2024-06-04 16:01:05,701 INFO L231 Difference]: Finished difference. Result has 144 places, 90 transitions, 837 flow [2024-06-04 16:01:05,701 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=792, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=837, PETRI_PLACES=144, PETRI_TRANSITIONS=90} [2024-06-04 16:01:05,701 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 83 predicate places. [2024-06-04 16:01:05,701 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 90 transitions, 837 flow [2024-06-04 16:01:05,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.8) internal successors, (194), 5 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:01:05,702 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:01:05,702 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, 1, 1, 1, 1] [2024-06-04 16:01:05,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-04 16:01:05,702 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:01:05,702 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:01:05,702 INFO L85 PathProgramCache]: Analyzing trace with hash 541357216, now seen corresponding path program 1 times [2024-06-04 16:01:05,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:01:05,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337432394] [2024-06-04 16:01:05,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:01:05,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:01:05,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:01:05,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-04 16:01:05,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:01:05,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337432394] [2024-06-04 16:01:05,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337432394] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:01:05,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:01:05,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-04 16:01:05,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075432048] [2024-06-04 16:01:05,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:01:05,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-04 16:01:05,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:01:05,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-04 16:01:05,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-04 16:01:05,838 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 68 [2024-06-04 16:01:05,838 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 90 transitions, 837 flow. Second operand has 5 states, 5 states have (on average 39.0) internal successors, (195), 5 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:01:05,838 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:01:05,838 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 68 [2024-06-04 16:01:05,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:01:05,932 INFO L124 PetriNetUnfolderBase]: 328/883 cut-off events. [2024-06-04 16:01:05,932 INFO L125 PetriNetUnfolderBase]: For 7775/7823 co-relation queries the response was YES. [2024-06-04 16:01:05,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3320 conditions, 883 events. 328/883 cut-off events. For 7775/7823 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 4947 event pairs, 83 based on Foata normal form. 32/910 useless extension candidates. Maximal degree in co-relation 3276. Up to 260 conditions per place. [2024-06-04 16:01:05,936 INFO L140 encePairwiseOnDemand]: 61/68 looper letters, 38 selfloop transitions, 10 changer transitions 34/104 dead transitions. [2024-06-04 16:01:05,936 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 104 transitions, 1071 flow [2024-06-04 16:01:05,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 16:01:05,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 16:01:05,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 224 transitions. [2024-06-04 16:01:05,937 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6588235294117647 [2024-06-04 16:01:05,937 INFO L175 Difference]: Start difference. First operand has 144 places, 90 transitions, 837 flow. Second operand 5 states and 224 transitions. [2024-06-04 16:01:05,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 104 transitions, 1071 flow [2024-06-04 16:01:05,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 104 transitions, 1030 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-06-04 16:01:05,951 INFO L231 Difference]: Finished difference. Result has 146 places, 64 transitions, 571 flow [2024-06-04 16:01:05,951 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=796, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=571, PETRI_PLACES=146, PETRI_TRANSITIONS=64} [2024-06-04 16:01:05,951 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 85 predicate places. [2024-06-04 16:01:05,951 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 64 transitions, 571 flow [2024-06-04 16:01:05,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 39.0) internal successors, (195), 5 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:01:05,951 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:01:05,951 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, 1, 1, 1, 1] [2024-06-04 16:01:05,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-04 16:01:05,952 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:01:05,952 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:01:05,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1460216054, now seen corresponding path program 1 times [2024-06-04 16:01:05,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:01:05,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056831962] [2024-06-04 16:01:05,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:01:05,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:01:05,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:01:06,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:01:06,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:01:06,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056831962] [2024-06-04 16:01:06,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056831962] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:01:06,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:01:06,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-04 16:01:06,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195105071] [2024-06-04 16:01:06,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:01:06,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-04 16:01:06,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:01:06,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-04 16:01:06,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-04 16:01:06,077 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 68 [2024-06-04 16:01:06,078 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 64 transitions, 571 flow. Second operand has 5 states, 5 states have (on average 39.0) internal successors, (195), 5 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:01:06,078 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:01:06,078 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 68 [2024-06-04 16:01:06,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:01:06,132 INFO L124 PetriNetUnfolderBase]: 159/427 cut-off events. [2024-06-04 16:01:06,132 INFO L125 PetriNetUnfolderBase]: For 5212/5242 co-relation queries the response was YES. [2024-06-04 16:01:06,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1749 conditions, 427 events. 159/427 cut-off events. For 5212/5242 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1806 event pairs, 46 based on Foata normal form. 20/440 useless extension candidates. Maximal degree in co-relation 1705. Up to 131 conditions per place. [2024-06-04 16:01:06,135 INFO L140 encePairwiseOnDemand]: 63/68 looper letters, 34 selfloop transitions, 13 changer transitions 0/69 dead transitions. [2024-06-04 16:01:06,135 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 69 transitions, 675 flow [2024-06-04 16:01:06,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 16:01:06,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 16:01:06,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 208 transitions. [2024-06-04 16:01:06,135 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.611764705882353 [2024-06-04 16:01:06,135 INFO L175 Difference]: Start difference. First operand has 146 places, 64 transitions, 571 flow. Second operand 5 states and 208 transitions. [2024-06-04 16:01:06,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 69 transitions, 675 flow [2024-06-04 16:01:06,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 69 transitions, 508 flow, removed 17 selfloop flow, removed 40 redundant places. [2024-06-04 16:01:06,142 INFO L231 Difference]: Finished difference. Result has 98 places, 64 transitions, 434 flow [2024-06-04 16:01:06,142 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=404, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=434, PETRI_PLACES=98, PETRI_TRANSITIONS=64} [2024-06-04 16:01:06,142 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 37 predicate places. [2024-06-04 16:01:06,143 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 64 transitions, 434 flow [2024-06-04 16:01:06,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 39.0) internal successors, (195), 5 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:01:06,143 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:01:06,143 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, 1, 1, 1, 1, 1, 1] [2024-06-04 16:01:06,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-04 16:01:06,143 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:01:06,143 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:01:06,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1712821912, now seen corresponding path program 1 times [2024-06-04 16:01:06,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:01:06,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297882974] [2024-06-04 16:01:06,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:01:06,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:01:06,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:01:06,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:01:06,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:01:06,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297882974] [2024-06-04 16:01:06,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297882974] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:01:06,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:01:06,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-04 16:01:06,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242114318] [2024-06-04 16:01:06,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:01:06,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-04 16:01:06,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:01:06,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-04 16:01:06,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-04 16:01:06,278 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 68 [2024-06-04 16:01:06,279 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 64 transitions, 434 flow. Second operand has 5 states, 5 states have (on average 39.2) internal successors, (196), 5 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:01:06,279 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:01:06,279 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 68 [2024-06-04 16:01:06,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:01:06,332 INFO L124 PetriNetUnfolderBase]: 143/402 cut-off events. [2024-06-04 16:01:06,332 INFO L125 PetriNetUnfolderBase]: For 2174/2200 co-relation queries the response was YES. [2024-06-04 16:01:06,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1223 conditions, 402 events. 143/402 cut-off events. For 2174/2200 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1757 event pairs, 62 based on Foata normal form. 24/420 useless extension candidates. Maximal degree in co-relation 1195. Up to 156 conditions per place. [2024-06-04 16:01:06,333 INFO L140 encePairwiseOnDemand]: 61/68 looper letters, 0 selfloop transitions, 0 changer transitions 68/68 dead transitions. [2024-06-04 16:01:06,333 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 68 transitions, 500 flow [2024-06-04 16:01:06,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 16:01:06,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 16:01:06,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 206 transitions. [2024-06-04 16:01:06,335 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6058823529411764 [2024-06-04 16:01:06,335 INFO L175 Difference]: Start difference. First operand has 98 places, 64 transitions, 434 flow. Second operand 5 states and 206 transitions. [2024-06-04 16:01:06,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 68 transitions, 500 flow [2024-06-04 16:01:06,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 68 transitions, 422 flow, removed 0 selfloop flow, removed 21 redundant places. [2024-06-04 16:01:06,338 INFO L231 Difference]: Finished difference. Result has 80 places, 0 transitions, 0 flow [2024-06-04 16:01:06,338 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=0, PETRI_PLACES=80, PETRI_TRANSITIONS=0} [2024-06-04 16:01:06,338 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 19 predicate places. [2024-06-04 16:01:06,338 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 0 transitions, 0 flow [2024-06-04 16:01:06,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 39.2) internal successors, (196), 5 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:01:06,341 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 4 remaining) [2024-06-04 16:01:06,342 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 4 remaining) [2024-06-04 16:01:06,342 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2024-06-04 16:01:06,343 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2024-06-04 16:01:06,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-04 16:01:06,343 INFO L445 BasicCegarLoop]: Path program histogram: [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:01:06,346 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-06-04 16:01:06,346 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-06-04 16:01:06,350 INFO L507 ceAbstractionStarter]: Automizer considered 2 witness invariants [2024-06-04 16:01:06,350 INFO L508 ceAbstractionStarter]: WitnessConsidered=2 [2024-06-04 16:01:06,351 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.06 04:01:06 BasicIcfg [2024-06-04 16:01:06,351 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-06-04 16:01:06,352 INFO L158 Benchmark]: Toolchain (without parser) took 44853.88ms. Allocated memory was 144.7MB in the beginning and 2.2GB in the end (delta: 2.0GB). Free memory was 104.3MB in the beginning and 1.9GB in the end (delta: -1.8GB). Peak memory consumption was 253.2MB. Max. memory is 16.1GB. [2024-06-04 16:01:06,352 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 144.7MB. Free memory is still 112.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-04 16:01:06,352 INFO L158 Benchmark]: Witness Parser took 4.50ms. Allocated memory is still 144.7MB. Free memory is still 107.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-04 16:01:06,352 INFO L158 Benchmark]: CACSL2BoogieTranslator took 671.46ms. Allocated memory is still 144.7MB. Free memory was 104.3MB in the beginning and 77.6MB in the end (delta: 26.7MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-06-04 16:01:06,353 INFO L158 Benchmark]: Boogie Procedure Inliner took 82.89ms. Allocated memory is still 144.7MB. Free memory was 77.6MB in the beginning and 75.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-06-04 16:01:06,353 INFO L158 Benchmark]: Boogie Preprocessor took 80.30ms. Allocated memory is still 144.7MB. Free memory was 75.5MB in the beginning and 72.8MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-06-04 16:01:06,353 INFO L158 Benchmark]: RCFGBuilder took 573.55ms. Allocated memory is still 144.7MB. Free memory was 72.8MB in the beginning and 90.1MB in the end (delta: -17.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-06-04 16:01:06,353 INFO L158 Benchmark]: TraceAbstraction took 43439.69ms. Allocated memory was 144.7MB in the beginning and 2.2GB in the end (delta: 2.0GB). Free memory was 89.2MB in the beginning and 1.9GB in the end (delta: -1.8GB). Peak memory consumption was 240.8MB. Max. memory is 16.1GB. [2024-06-04 16:01:06,355 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 144.7MB. Free memory is still 112.5MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 4.50ms. Allocated memory is still 144.7MB. Free memory is still 107.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 671.46ms. Allocated memory is still 144.7MB. Free memory was 104.3MB in the beginning and 77.6MB in the end (delta: 26.7MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 82.89ms. Allocated memory is still 144.7MB. Free memory was 77.6MB in the beginning and 75.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 80.30ms. Allocated memory is still 144.7MB. Free memory was 75.5MB in the beginning and 72.8MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 573.55ms. Allocated memory is still 144.7MB. Free memory was 72.8MB in the beginning and 90.1MB in the end (delta: -17.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * TraceAbstraction took 43439.69ms. Allocated memory was 144.7MB in the beginning and 2.2GB in the end (delta: 2.0GB). Free memory was 89.2MB in the beginning and 1.9GB in the end (delta: -1.8GB). Peak memory consumption was 240.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 819]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 820]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 105 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 43.3s, OverallIterations: 58, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 38.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6821 SdHoareTripleChecker+Valid, 6.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4314 mSDsluCounter, 2629 SdHoareTripleChecker+Invalid, 4.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1766 mSDsCounter, 309 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8989 IncrementalHoareTripleChecker+Invalid, 9298 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 309 mSolverCounterUnsat, 863 mSDtfsCounter, 8989 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 201 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3538occurred in iteration=46, InterpolantAutomatonStates: 282, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 1179 NumberOfCodeBlocks, 1179 NumberOfCodeBlocksAsserted, 58 NumberOfCheckSat, 1121 ConstructedInterpolants, 0 QuantifiedInterpolants, 3790 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 58 InterpolantComputations, 58 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-06-04 16:01:06,385 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE