./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-atomic/dekker.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --validate ./goblint.2024-05-21_14-57-05.files/protection/dekker.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cde23df1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-atomic/dekker.i ./goblint.2024-05-21_14-57-05.files/protection/dekker.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-cde23df-m [2024-06-14 11:17:59,238 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-14 11:17:59,294 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-14 11:17:59,298 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-14 11:17:59,299 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-14 11:17:59,325 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-14 11:17:59,327 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-14 11:17:59,327 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-14 11:17:59,328 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-14 11:17:59,331 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-14 11:17:59,331 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-14 11:17:59,331 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-14 11:17:59,332 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-14 11:17:59,333 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-14 11:17:59,333 INFO L153 SettingsManager]: * Use SBE=true [2024-06-14 11:17:59,333 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-14 11:17:59,333 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-14 11:17:59,334 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-14 11:17:59,334 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-14 11:17:59,334 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-14 11:17:59,334 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-14 11:17:59,335 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-14 11:17:59,335 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-14 11:17:59,335 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-14 11:17:59,335 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-14 11:17:59,335 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-14 11:17:59,336 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-14 11:17:59,336 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-14 11:17:59,336 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-14 11:17:59,337 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-14 11:17:59,337 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-14 11:17:59,338 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-14 11:17:59,338 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-14 11:17:59,338 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-14 11:17:59,338 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-14 11:17:59,338 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-14 11:17:59,338 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-14 11:17:59,339 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-14 11:17:59,339 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-14 11:17:59,339 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-14 11:17:59,339 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-14 11:17:59,339 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-14 11:17:59,340 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-14 11:17:59,340 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2024-06-14 11:17:59,527 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-14 11:17:59,570 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-14 11:17:59,572 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-14 11:17:59,573 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-14 11:17:59,573 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-14 11:17:59,574 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-05-21_14-57-05.files/protection/dekker.yml/witness.yml [2024-06-14 11:17:59,685 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-14 11:17:59,685 INFO L274 PluginConnector]: CDTParser initialized [2024-06-14 11:17:59,685 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-atomic/dekker.i [2024-06-14 11:18:00,643 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-14 11:18:00,892 INFO L384 CDTParser]: Found 1 translation units. [2024-06-14 11:18:00,893 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/dekker.i [2024-06-14 11:18:00,915 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4cfaa995d/8c085579a9c24e318e6901fd9448d2ca/FLAG13033ea92 [2024-06-14 11:18:00,930 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4cfaa995d/8c085579a9c24e318e6901fd9448d2ca [2024-06-14 11:18:00,932 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-14 11:18:00,933 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-14 11:18:00,936 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-14 11:18:00,937 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-14 11:18:00,941 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-14 11:18:00,941 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 11:17:59" (1/2) ... [2024-06-14 11:18:00,942 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@174f57ba and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 11:18:00, skipping insertion in model container [2024-06-14 11:18:00,942 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 11:17:59" (1/2) ... [2024-06-14 11:18:00,943 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@465b4094 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 11:18:00, skipping insertion in model container [2024-06-14 11:18:00,944 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 11:18:00" (2/2) ... [2024-06-14 11:18:00,944 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@174f57ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 11:18:00, skipping insertion in model container [2024-06-14 11:18:00,945 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 11:18:00" (2/2) ... [2024-06-14 11:18:00,945 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-14 11:18:00,983 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-14 11:18:00,984 INFO L97 edCorrectnessWitness]: Location invariant before [L793-L793] (((! multithreaded || ((0 <= flag1 && flag1 <= 1) && (flag1 == 0 || flag1 == 1))) && (! multithreaded || ((0 <= turn && turn <= 1) && (turn == 0 || turn == 1)))) && (! multithreaded || ((0 <= flag2 && flag2 <= 1) && (flag2 == 0 || flag2 == 1)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1))) [2024-06-14 11:18:00,984 INFO L97 edCorrectnessWitness]: Location invariant before [L794-L794] (((! multithreaded || ((0 <= flag1 && flag1 <= 1) && (flag1 == 0 || flag1 == 1))) && (! multithreaded || ((0 <= turn && turn <= 1) && (turn == 0 || turn == 1)))) && (! multithreaded || ((0 <= flag2 && flag2 <= 1) && (flag2 == 0 || flag2 == 1)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1))) [2024-06-14 11:18:00,984 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-14 11:18:00,985 INFO L106 edCorrectnessWitness]: ghost_update [L792-L792] multithreaded = 1; [2024-06-14 11:18:01,018 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-14 11:18:01,278 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-14 11:18:01,290 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-14 11:18:01,363 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-14 11:18:01,392 INFO L206 MainTranslator]: Completed translation [2024-06-14 11:18:01,394 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 11:18:01 WrapperNode [2024-06-14 11:18:01,394 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-14 11:18:01,395 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-14 11:18:01,395 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-14 11:18:01,395 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-14 11:18:01,400 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 11:18:01" (1/1) ... [2024-06-14 11:18:01,422 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 11:18:01" (1/1) ... [2024-06-14 11:18:01,441 INFO L138 Inliner]: procedures = 170, calls = 51, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 137 [2024-06-14 11:18:01,442 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-14 11:18:01,445 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-14 11:18:01,446 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-14 11:18:01,446 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-14 11:18:01,454 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 11:18:01" (1/1) ... [2024-06-14 11:18:01,454 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 11:18:01" (1/1) ... [2024-06-14 11:18:01,456 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 11:18:01" (1/1) ... [2024-06-14 11:18:01,466 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-06-14 11:18:01,466 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 11:18:01" (1/1) ... [2024-06-14 11:18:01,466 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 11:18:01" (1/1) ... [2024-06-14 11:18:01,469 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 11:18:01" (1/1) ... [2024-06-14 11:18:01,472 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 11:18:01" (1/1) ... [2024-06-14 11:18:01,473 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 11:18:01" (1/1) ... [2024-06-14 11:18:01,474 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 11:18:01" (1/1) ... [2024-06-14 11:18:01,475 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-14 11:18:01,476 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-14 11:18:01,476 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-14 11:18:01,476 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-14 11:18:01,477 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 11:18:01" (1/1) ... [2024-06-14 11:18:01,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-14 11:18:01,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-14 11:18:01,508 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-06-14 11:18:01,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-06-14 11:18:01,536 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2024-06-14 11:18:01,536 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2024-06-14 11:18:01,536 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-06-14 11:18:01,537 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-06-14 11:18:01,537 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-14 11:18:01,537 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-14 11:18:01,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-14 11:18:01,537 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-14 11:18:01,537 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-14 11:18:01,537 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-14 11:18:01,538 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-14 11:18:01,626 INFO L244 CfgBuilder]: Building ICFG [2024-06-14 11:18:01,628 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-14 11:18:01,762 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-14 11:18:01,763 INFO L293 CfgBuilder]: Performing block encoding [2024-06-14 11:18:01,869 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-14 11:18:01,872 INFO L320 CfgBuilder]: Removed 4 assume(true) statements. [2024-06-14 11:18:01,873 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 11:18:01 BoogieIcfgContainer [2024-06-14 11:18:01,874 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-14 11:18:01,876 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-14 11:18:01,876 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-14 11:18:01,878 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-14 11:18:01,878 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 11:17:59" (1/4) ... [2024-06-14 11:18:01,879 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@552da188 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 14.06 11:18:01, skipping insertion in model container [2024-06-14 11:18:01,879 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.06 11:18:00" (2/4) ... [2024-06-14 11:18:01,879 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@552da188 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.06 11:18:01, skipping insertion in model container [2024-06-14 11:18:01,879 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 11:18:01" (3/4) ... [2024-06-14 11:18:01,879 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@552da188 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.06 11:18:01, skipping insertion in model container [2024-06-14 11:18:01,880 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 11:18:01" (4/4) ... [2024-06-14 11:18:01,881 INFO L112 eAbstractionObserver]: Analyzing ICFG dekker.i [2024-06-14 11:18:01,893 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-14 11:18:01,893 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-06-14 11:18:01,894 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-14 11:18:01,936 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-06-14 11:18:01,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 54 transitions, 122 flow [2024-06-14 11:18:02,002 INFO L124 PetriNetUnfolderBase]: 6/52 cut-off events. [2024-06-14 11:18:02,003 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-06-14 11:18:02,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61 conditions, 52 events. 6/52 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 118 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 47. Up to 2 conditions per place. [2024-06-14 11:18:02,006 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 54 transitions, 122 flow [2024-06-14 11:18:02,008 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 51 places, 50 transitions, 109 flow [2024-06-14 11:18:02,015 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-14 11:18:02,023 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;@535fff33, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-14 11:18:02,023 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-14 11:18:02,026 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-14 11:18:02,026 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-14 11:18:02,026 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-14 11:18:02,026 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:18:02,026 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-14 11:18:02,027 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-14 11:18:02,031 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:18:02,031 INFO L85 PathProgramCache]: Analyzing trace with hash -404452067, now seen corresponding path program 1 times [2024-06-14 11:18:02,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:18:02,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557310941] [2024-06-14 11:18:02,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:18:02,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:18:02,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:18:02,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 11:18:02,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:18:02,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557310941] [2024-06-14 11:18:02,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557310941] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:18:02,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:18:02,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-14 11:18:02,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940078472] [2024-06-14 11:18:02,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:18:02,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-14 11:18:02,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:18:02,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-14 11:18:02,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-14 11:18:02,531 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 54 [2024-06-14 11:18:02,533 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 50 transitions, 109 flow. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:02,534 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:18:02,534 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 54 [2024-06-14 11:18:02,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:18:02,668 INFO L124 PetriNetUnfolderBase]: 363/925 cut-off events. [2024-06-14 11:18:02,668 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2024-06-14 11:18:02,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1390 conditions, 925 events. 363/925 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 5289 event pairs, 126 based on Foata normal form. 1/850 useless extension candidates. Maximal degree in co-relation 1332. Up to 434 conditions per place. [2024-06-14 11:18:02,678 INFO L140 encePairwiseOnDemand]: 49/54 looper letters, 26 selfloop transitions, 3 changer transitions 0/56 dead transitions. [2024-06-14 11:18:02,678 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 56 transitions, 182 flow [2024-06-14 11:18:02,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-14 11:18:02,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-14 11:18:02,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 118 transitions. [2024-06-14 11:18:02,688 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7283950617283951 [2024-06-14 11:18:02,689 INFO L175 Difference]: Start difference. First operand has 51 places, 50 transitions, 109 flow. Second operand 3 states and 118 transitions. [2024-06-14 11:18:02,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 56 transitions, 182 flow [2024-06-14 11:18:02,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 56 transitions, 176 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-14 11:18:02,696 INFO L231 Difference]: Finished difference. Result has 51 places, 52 transitions, 125 flow [2024-06-14 11:18:02,697 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=125, PETRI_PLACES=51, PETRI_TRANSITIONS=52} [2024-06-14 11:18:02,701 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 0 predicate places. [2024-06-14 11:18:02,701 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 52 transitions, 125 flow [2024-06-14 11:18:02,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:02,702 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:18:02,702 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:18:02,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-14 11:18:02,702 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-14 11:18:02,704 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:18:02,705 INFO L85 PathProgramCache]: Analyzing trace with hash -2129372268, now seen corresponding path program 1 times [2024-06-14 11:18:02,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:18:02,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015471460] [2024-06-14 11:18:02,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:18:02,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:18:02,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:18:02,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 11:18:02,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:18:02,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015471460] [2024-06-14 11:18:02,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015471460] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:18:02,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:18:02,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-14 11:18:02,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479897495] [2024-06-14 11:18:02,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:18:02,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-14 11:18:02,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:18:02,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-14 11:18:02,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-14 11:18:02,961 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 54 [2024-06-14 11:18:02,962 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 52 transitions, 125 flow. Second operand has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:02,962 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:18:02,962 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 54 [2024-06-14 11:18:02,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:18:03,070 INFO L124 PetriNetUnfolderBase]: 428/1027 cut-off events. [2024-06-14 11:18:03,070 INFO L125 PetriNetUnfolderBase]: For 89/89 co-relation queries the response was YES. [2024-06-14 11:18:03,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1717 conditions, 1027 events. 428/1027 cut-off events. For 89/89 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 5945 event pairs, 137 based on Foata normal form. 4/964 useless extension candidates. Maximal degree in co-relation 1464. Up to 498 conditions per place. [2024-06-14 11:18:03,077 INFO L140 encePairwiseOnDemand]: 46/54 looper letters, 36 selfloop transitions, 8 changer transitions 0/69 dead transitions. [2024-06-14 11:18:03,077 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 69 transitions, 259 flow [2024-06-14 11:18:03,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-14 11:18:03,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-14 11:18:03,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 153 transitions. [2024-06-14 11:18:03,082 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7083333333333334 [2024-06-14 11:18:03,083 INFO L175 Difference]: Start difference. First operand has 51 places, 52 transitions, 125 flow. Second operand 4 states and 153 transitions. [2024-06-14 11:18:03,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 69 transitions, 259 flow [2024-06-14 11:18:03,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 69 transitions, 256 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-14 11:18:03,086 INFO L231 Difference]: Finished difference. Result has 55 places, 57 transitions, 175 flow [2024-06-14 11:18:03,086 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=175, PETRI_PLACES=55, PETRI_TRANSITIONS=57} [2024-06-14 11:18:03,086 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 4 predicate places. [2024-06-14 11:18:03,087 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 57 transitions, 175 flow [2024-06-14 11:18:03,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:03,087 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:18:03,087 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:18:03,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-14 11:18:03,088 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-14 11:18:03,091 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:18:03,093 INFO L85 PathProgramCache]: Analyzing trace with hash 539248261, now seen corresponding path program 1 times [2024-06-14 11:18:03,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:18:03,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445651422] [2024-06-14 11:18:03,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:18:03,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:18:03,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:18:03,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 11:18:03,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:18:03,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445651422] [2024-06-14 11:18:03,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445651422] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:18:03,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:18:03,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 11:18:03,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826228372] [2024-06-14 11:18:03,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:18:03,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 11:18:03,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:18:03,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 11:18:03,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-14 11:18:03,312 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 54 [2024-06-14 11:18:03,313 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 57 transitions, 175 flow. Second operand has 6 states, 6 states have (on average 26.5) internal successors, (159), 6 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:03,313 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:18:03,313 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 54 [2024-06-14 11:18:03,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:18:03,451 INFO L124 PetriNetUnfolderBase]: 578/1249 cut-off events. [2024-06-14 11:18:03,452 INFO L125 PetriNetUnfolderBase]: For 403/411 co-relation queries the response was YES. [2024-06-14 11:18:03,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2506 conditions, 1249 events. 578/1249 cut-off events. For 403/411 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 7473 event pairs, 121 based on Foata normal form. 10/1172 useless extension candidates. Maximal degree in co-relation 1831. Up to 384 conditions per place. [2024-06-14 11:18:03,459 INFO L140 encePairwiseOnDemand]: 41/54 looper letters, 51 selfloop transitions, 23 changer transitions 0/97 dead transitions. [2024-06-14 11:18:03,459 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 97 transitions, 443 flow [2024-06-14 11:18:03,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 11:18:03,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 11:18:03,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 220 transitions. [2024-06-14 11:18:03,462 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6790123456790124 [2024-06-14 11:18:03,462 INFO L175 Difference]: Start difference. First operand has 55 places, 57 transitions, 175 flow. Second operand 6 states and 220 transitions. [2024-06-14 11:18:03,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 97 transitions, 443 flow [2024-06-14 11:18:03,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 97 transitions, 439 flow, removed 2 selfloop flow, removed 0 redundant places. [2024-06-14 11:18:03,467 INFO L231 Difference]: Finished difference. Result has 64 places, 68 transitions, 305 flow [2024-06-14 11:18:03,467 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=305, PETRI_PLACES=64, PETRI_TRANSITIONS=68} [2024-06-14 11:18:03,468 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 13 predicate places. [2024-06-14 11:18:03,469 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 68 transitions, 305 flow [2024-06-14 11:18:03,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.5) internal successors, (159), 6 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:03,469 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:18:03,469 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:18:03,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-14 11:18:03,470 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-14 11:18:03,470 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:18:03,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1193687446, now seen corresponding path program 1 times [2024-06-14 11:18:03,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:18:03,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678389908] [2024-06-14 11:18:03,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:18:03,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:18:03,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:18:03,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 11:18:03,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:18:03,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678389908] [2024-06-14 11:18:03,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678389908] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:18:03,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:18:03,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-14 11:18:03,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874485432] [2024-06-14 11:18:03,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:18:03,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-14 11:18:03,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:18:03,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-14 11:18:03,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-14 11:18:03,580 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 54 [2024-06-14 11:18:03,581 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 68 transitions, 305 flow. Second operand has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:03,581 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:18:03,581 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 54 [2024-06-14 11:18:03,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:18:03,664 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([249] L794-->ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT: Formula: (let ((.cse0 (not (= |v_#ghost~multithreaded_4| 0)))) (or (and .cse0 (or (< 1 v_~turn~0_13) (and (not (= v_~turn~0_13 0)) (not (= v_~turn~0_13 1))) (< v_~turn~0_13 0))) (and .cse0 (or (and (not (= v_~x~0_10 1)) (not (= v_~x~0_10 0))) (< 1 v_~x~0_10) (< v_~x~0_10 0))) (and .cse0 (or (< 1 v_~flag2~0_10) (and (not (= v_~flag2~0_10 0)) (not (= v_~flag2~0_10 1))) (< v_~flag2~0_10 0))) (and .cse0 (or (and (not (= v_~flag1~0_10 0)) (not (= v_~flag1~0_10 1))) (< 1 v_~flag1~0_10) (< v_~flag1~0_10 0))))) InVars {~flag1~0=v_~flag1~0_10, #ghost~multithreaded=|v_#ghost~multithreaded_4|, ~turn~0=v_~turn~0_13, ~x~0=v_~x~0_10, ~flag2~0=v_~flag2~0_10} OutVars{~flag1~0=v_~flag1~0_10, #ghost~multithreaded=|v_#ghost~multithreaded_4|, ~turn~0=v_~turn~0_13, ~x~0=v_~x~0_10, ~flag2~0=v_~flag2~0_10} AuxVars[] AssignedVars[][43], [Black: 65#(and (= ~x~0 0) (= ~flag1~0 1) (= ~turn~0 0) (= ~flag2~0 0)), Black: 64#(and (= ~x~0 0) (= ~turn~0 0) (= ~flag2~0 0)), 70#(= ~flag2~0 0), Black: 72#(and (= ~x~0 0) (= ~flag1~0 1) (= ~flag2~0 0)), 62#true, 36#thr2EXITtrue, Black: 73#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag1~0 1) (= ~flag2~0 0)), Black: 71#(and (= ~flag1~0 1) (= ~flag2~0 0)), 27#ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 78#true, 35#L721true, thr2Thread1of1ForFork0InUse, Black: 60#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 0) (= ~flag2~0 0))]) [2024-06-14 11:18:03,665 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-06-14 11:18:03,665 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-06-14 11:18:03,665 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-06-14 11:18:03,665 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-06-14 11:18:03,666 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([315] L728-->L725-1: Formula: (= |v_thr1Thread1of1ForFork1_~t~0#1_13| 0) InVars {thr1Thread1of1ForFork1_~t~0#1=|v_thr1Thread1of1ForFork1_~t~0#1_13|} OutVars{thr1Thread1of1ForFork1_~t~0#1=|v_thr1Thread1of1ForFork1_~t~0#1_13|} AuxVars[] AssignedVars[][49], [Black: 65#(and (= ~x~0 0) (= ~flag1~0 1) (= ~turn~0 0) (= ~flag2~0 0)), Black: 64#(and (= ~x~0 0) (= ~turn~0 0) (= ~flag2~0 0)), 44#L725-1true, 70#(= ~flag2~0 0), Black: 72#(and (= ~x~0 0) (= ~flag1~0 1) (= ~flag2~0 0)), 62#true, Black: 73#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag1~0 1) (= ~flag2~0 0)), 36#thr2EXITtrue, Black: 71#(and (= ~flag1~0 1) (= ~flag2~0 0)), 78#true, thr2Thread1of1ForFork0InUse, 31#L793-5true, Black: 60#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 0) (= ~flag2~0 0))]) [2024-06-14 11:18:03,666 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-06-14 11:18:03,666 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-06-14 11:18:03,666 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-06-14 11:18:03,666 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-06-14 11:18:03,667 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([315] L728-->L725-1: Formula: (= |v_thr1Thread1of1ForFork1_~t~0#1_13| 0) InVars {thr1Thread1of1ForFork1_~t~0#1=|v_thr1Thread1of1ForFork1_~t~0#1_13|} OutVars{thr1Thread1of1ForFork1_~t~0#1=|v_thr1Thread1of1ForFork1_~t~0#1_13|} AuxVars[] AssignedVars[][49], [Black: 65#(and (= ~x~0 0) (= ~flag1~0 1) (= ~turn~0 0) (= ~flag2~0 0)), 26#L794true, Black: 64#(and (= ~x~0 0) (= ~turn~0 0) (= ~flag2~0 0)), 44#L725-1true, 70#(= ~flag2~0 0), Black: 72#(and (= ~x~0 0) (= ~flag1~0 1) (= ~flag2~0 0)), 62#true, 36#thr2EXITtrue, Black: 73#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag1~0 1) (= ~flag2~0 0)), Black: 71#(and (= ~flag1~0 1) (= ~flag2~0 0)), 78#true, thr2Thread1of1ForFork0InUse, Black: 60#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 0) (= ~flag2~0 0))]) [2024-06-14 11:18:03,667 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-06-14 11:18:03,667 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-06-14 11:18:03,667 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-06-14 11:18:03,667 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-06-14 11:18:03,668 INFO L124 PetriNetUnfolderBase]: 550/1227 cut-off events. [2024-06-14 11:18:03,668 INFO L125 PetriNetUnfolderBase]: For 1317/1333 co-relation queries the response was YES. [2024-06-14 11:18:03,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2987 conditions, 1227 events. 550/1227 cut-off events. For 1317/1333 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 7196 event pairs, 130 based on Foata normal form. 4/1132 useless extension candidates. Maximal degree in co-relation 2727. Up to 680 conditions per place. [2024-06-14 11:18:03,675 INFO L140 encePairwiseOnDemand]: 47/54 looper letters, 44 selfloop transitions, 8 changer transitions 0/80 dead transitions. [2024-06-14 11:18:03,676 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 80 transitions, 457 flow [2024-06-14 11:18:03,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-14 11:18:03,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-14 11:18:03,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 147 transitions. [2024-06-14 11:18:03,677 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6805555555555556 [2024-06-14 11:18:03,677 INFO L175 Difference]: Start difference. First operand has 64 places, 68 transitions, 305 flow. Second operand 4 states and 147 transitions. [2024-06-14 11:18:03,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 80 transitions, 457 flow [2024-06-14 11:18:03,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 80 transitions, 436 flow, removed 3 selfloop flow, removed 1 redundant places. [2024-06-14 11:18:03,681 INFO L231 Difference]: Finished difference. Result has 68 places, 73 transitions, 349 flow [2024-06-14 11:18:03,681 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=349, PETRI_PLACES=68, PETRI_TRANSITIONS=73} [2024-06-14 11:18:03,682 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 17 predicate places. [2024-06-14 11:18:03,682 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 73 transitions, 349 flow [2024-06-14 11:18:03,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:03,682 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:18:03,682 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:18:03,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-14 11:18:03,683 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 11:18:03,683 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:18:03,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1505518327, now seen corresponding path program 1 times [2024-06-14 11:18:03,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:18:03,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682623844] [2024-06-14 11:18:03,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:18:03,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:18:03,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:18:03,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 11:18:03,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:18:03,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682623844] [2024-06-14 11:18:03,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682623844] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:18:03,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:18:03,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 11:18:03,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76782135] [2024-06-14 11:18:03,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:18:03,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 11:18:03,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:18:03,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 11:18:03,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-14 11:18:03,814 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 54 [2024-06-14 11:18:03,814 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 73 transitions, 349 flow. Second operand has 6 states, 6 states have (on average 26.666666666666668) internal successors, (160), 6 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:03,814 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:18:03,814 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 54 [2024-06-14 11:18:03,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:18:03,926 INFO L124 PetriNetUnfolderBase]: 631/1315 cut-off events. [2024-06-14 11:18:03,926 INFO L125 PetriNetUnfolderBase]: For 2053/2108 co-relation queries the response was YES. [2024-06-14 11:18:03,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3610 conditions, 1315 events. 631/1315 cut-off events. For 2053/2108 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 7908 event pairs, 75 based on Foata normal form. 24/1264 useless extension candidates. Maximal degree in co-relation 2821. Up to 327 conditions per place. [2024-06-14 11:18:03,934 INFO L140 encePairwiseOnDemand]: 44/54 looper letters, 60 selfloop transitions, 25 changer transitions 0/108 dead transitions. [2024-06-14 11:18:03,934 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 108 transitions, 653 flow [2024-06-14 11:18:03,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 11:18:03,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 11:18:03,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 221 transitions. [2024-06-14 11:18:03,935 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6820987654320988 [2024-06-14 11:18:03,935 INFO L175 Difference]: Start difference. First operand has 68 places, 73 transitions, 349 flow. Second operand 6 states and 221 transitions. [2024-06-14 11:18:03,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 108 transitions, 653 flow [2024-06-14 11:18:03,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 108 transitions, 644 flow, removed 2 selfloop flow, removed 1 redundant places. [2024-06-14 11:18:03,940 INFO L231 Difference]: Finished difference. Result has 76 places, 80 transitions, 472 flow [2024-06-14 11:18:03,940 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=340, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=472, PETRI_PLACES=76, PETRI_TRANSITIONS=80} [2024-06-14 11:18:03,940 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 25 predicate places. [2024-06-14 11:18:03,940 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 80 transitions, 472 flow [2024-06-14 11:18:03,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.666666666666668) internal successors, (160), 6 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:03,946 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:18:03,946 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:18:03,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-14 11:18:03,946 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-14 11:18:03,947 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:18:03,947 INFO L85 PathProgramCache]: Analyzing trace with hash 576388373, now seen corresponding path program 1 times [2024-06-14 11:18:03,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:18:03,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689745375] [2024-06-14 11:18:03,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:18:03,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:18:03,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:18:04,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-14 11:18:04,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:18:04,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689745375] [2024-06-14 11:18:04,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689745375] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:18:04,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:18:04,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-14 11:18:04,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987959754] [2024-06-14 11:18:04,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:18:04,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 11:18:04,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:18:04,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 11:18:04,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-14 11:18:04,061 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 54 [2024-06-14 11:18:04,061 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 80 transitions, 472 flow. Second operand has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:04,062 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:18:04,062 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 54 [2024-06-14 11:18:04,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:18:04,184 INFO L124 PetriNetUnfolderBase]: 666/1401 cut-off events. [2024-06-14 11:18:04,184 INFO L125 PetriNetUnfolderBase]: For 3602/3694 co-relation queries the response was YES. [2024-06-14 11:18:04,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4381 conditions, 1401 events. 666/1401 cut-off events. For 3602/3694 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 8127 event pairs, 157 based on Foata normal form. 25/1334 useless extension candidates. Maximal degree in co-relation 3808. Up to 633 conditions per place. [2024-06-14 11:18:04,208 INFO L140 encePairwiseOnDemand]: 44/54 looper letters, 65 selfloop transitions, 27 changer transitions 0/115 dead transitions. [2024-06-14 11:18:04,208 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 115 transitions, 865 flow [2024-06-14 11:18:04,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 11:18:04,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 11:18:04,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 185 transitions. [2024-06-14 11:18:04,209 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6851851851851852 [2024-06-14 11:18:04,209 INFO L175 Difference]: Start difference. First operand has 76 places, 80 transitions, 472 flow. Second operand 5 states and 185 transitions. [2024-06-14 11:18:04,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 115 transitions, 865 flow [2024-06-14 11:18:04,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 115 transitions, 822 flow, removed 7 selfloop flow, removed 2 redundant places. [2024-06-14 11:18:04,216 INFO L231 Difference]: Finished difference. Result has 81 places, 94 transitions, 652 flow [2024-06-14 11:18:04,216 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=438, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=652, PETRI_PLACES=81, PETRI_TRANSITIONS=94} [2024-06-14 11:18:04,217 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 30 predicate places. [2024-06-14 11:18:04,217 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 94 transitions, 652 flow [2024-06-14 11:18:04,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:04,217 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:18:04,217 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:18:04,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-14 11:18:04,218 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 11:18:04,218 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:18:04,218 INFO L85 PathProgramCache]: Analyzing trace with hash 978905463, now seen corresponding path program 2 times [2024-06-14 11:18:04,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:18:04,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367820887] [2024-06-14 11:18:04,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:18:04,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:18:04,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:18:04,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 11:18:04,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:18:04,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367820887] [2024-06-14 11:18:04,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367820887] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:18:04,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:18:04,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-14 11:18:04,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427878089] [2024-06-14 11:18:04,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:18:04,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 11:18:04,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:18:04,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 11:18:04,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-14 11:18:04,320 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 54 [2024-06-14 11:18:04,320 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 94 transitions, 652 flow. Second operand has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:04,320 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:18:04,321 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 54 [2024-06-14 11:18:04,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:18:04,470 INFO L124 PetriNetUnfolderBase]: 653/1364 cut-off events. [2024-06-14 11:18:04,470 INFO L125 PetriNetUnfolderBase]: For 5157/5282 co-relation queries the response was YES. [2024-06-14 11:18:04,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4774 conditions, 1364 events. 653/1364 cut-off events. For 5157/5282 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 8188 event pairs, 163 based on Foata normal form. 62/1343 useless extension candidates. Maximal degree in co-relation 3300. Up to 630 conditions per place. [2024-06-14 11:18:04,478 INFO L140 encePairwiseOnDemand]: 44/54 looper letters, 63 selfloop transitions, 28 changer transitions 0/114 dead transitions. [2024-06-14 11:18:04,478 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 114 transitions, 961 flow [2024-06-14 11:18:04,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 11:18:04,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 11:18:04,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 183 transitions. [2024-06-14 11:18:04,479 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6777777777777778 [2024-06-14 11:18:04,479 INFO L175 Difference]: Start difference. First operand has 81 places, 94 transitions, 652 flow. Second operand 5 states and 183 transitions. [2024-06-14 11:18:04,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 114 transitions, 961 flow [2024-06-14 11:18:04,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 114 transitions, 945 flow, removed 8 selfloop flow, removed 0 redundant places. [2024-06-14 11:18:04,487 INFO L231 Difference]: Finished difference. Result has 87 places, 99 transitions, 774 flow [2024-06-14 11:18:04,487 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=636, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=774, PETRI_PLACES=87, PETRI_TRANSITIONS=99} [2024-06-14 11:18:04,488 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 36 predicate places. [2024-06-14 11:18:04,488 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 99 transitions, 774 flow [2024-06-14 11:18:04,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:04,488 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:18:04,488 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:18:04,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-14 11:18:04,489 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-14 11:18:04,489 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:18:04,489 INFO L85 PathProgramCache]: Analyzing trace with hash -561494514, now seen corresponding path program 1 times [2024-06-14 11:18:04,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:18:04,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186911736] [2024-06-14 11:18:04,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:18:04,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:18:04,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:18:04,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 11:18:04,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:18:04,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186911736] [2024-06-14 11:18:04,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186911736] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:18:04,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:18:04,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-14 11:18:04,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015152539] [2024-06-14 11:18:04,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:18:04,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-14 11:18:04,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:18:04,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-14 11:18:04,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-14 11:18:04,524 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 54 [2024-06-14 11:18:04,524 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 99 transitions, 774 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-14 11:18:04,525 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:18:04,525 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 54 [2024-06-14 11:18:04,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:18:04,681 INFO L124 PetriNetUnfolderBase]: 674/1498 cut-off events. [2024-06-14 11:18:04,681 INFO L125 PetriNetUnfolderBase]: For 6339/6517 co-relation queries the response was YES. [2024-06-14 11:18:04,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5331 conditions, 1498 events. 674/1498 cut-off events. For 6339/6517 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 9885 event pairs, 129 based on Foata normal form. 51/1423 useless extension candidates. Maximal degree in co-relation 5189. Up to 271 conditions per place. [2024-06-14 11:18:04,692 INFO L140 encePairwiseOnDemand]: 46/54 looper letters, 44 selfloop transitions, 34 changer transitions 0/125 dead transitions. [2024-06-14 11:18:04,692 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 125 transitions, 1034 flow [2024-06-14 11:18:04,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 11:18:04,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 11:18:04,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 200 transitions. [2024-06-14 11:18:04,694 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7407407407407407 [2024-06-14 11:18:04,694 INFO L175 Difference]: Start difference. First operand has 87 places, 99 transitions, 774 flow. Second operand 5 states and 200 transitions. [2024-06-14 11:18:04,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 125 transitions, 1034 flow [2024-06-14 11:18:04,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 125 transitions, 1004 flow, removed 12 selfloop flow, removed 2 redundant places. [2024-06-14 11:18:04,705 INFO L231 Difference]: Finished difference. Result has 91 places, 105 transitions, 911 flow [2024-06-14 11:18:04,705 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=671, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=911, PETRI_PLACES=91, PETRI_TRANSITIONS=105} [2024-06-14 11:18:04,705 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 40 predicate places. [2024-06-14 11:18:04,706 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 105 transitions, 911 flow [2024-06-14 11:18:04,706 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-14 11:18:04,706 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:18:04,706 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:18:04,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-14 11:18:04,707 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-14 11:18:04,707 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:18:04,707 INFO L85 PathProgramCache]: Analyzing trace with hash 377408340, now seen corresponding path program 1 times [2024-06-14 11:18:04,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:18:04,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316578783] [2024-06-14 11:18:04,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:18:04,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:18:04,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:18:04,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 11:18:04,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:18:04,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316578783] [2024-06-14 11:18:04,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316578783] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:18:04,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:18:04,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-14 11:18:04,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517973609] [2024-06-14 11:18:04,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:18:04,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 11:18:04,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:18:04,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 11:18:04,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-14 11:18:04,822 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 54 [2024-06-14 11:18:04,823 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 105 transitions, 911 flow. Second operand has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:04,823 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:18:04,823 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 54 [2024-06-14 11:18:04,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:18:04,996 INFO L124 PetriNetUnfolderBase]: 849/1784 cut-off events. [2024-06-14 11:18:04,997 INFO L125 PetriNetUnfolderBase]: For 10881/11046 co-relation queries the response was YES. [2024-06-14 11:18:05,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7036 conditions, 1784 events. 849/1784 cut-off events. For 10881/11046 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 11274 event pairs, 255 based on Foata normal form. 24/1698 useless extension candidates. Maximal degree in co-relation 6850. Up to 1173 conditions per place. [2024-06-14 11:18:05,009 INFO L140 encePairwiseOnDemand]: 46/54 looper letters, 73 selfloop transitions, 10 changer transitions 0/115 dead transitions. [2024-06-14 11:18:05,009 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 115 transitions, 1119 flow [2024-06-14 11:18:05,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 11:18:05,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 11:18:05,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 176 transitions. [2024-06-14 11:18:05,010 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6518518518518519 [2024-06-14 11:18:05,010 INFO L175 Difference]: Start difference. First operand has 91 places, 105 transitions, 911 flow. Second operand 5 states and 176 transitions. [2024-06-14 11:18:05,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 115 transitions, 1119 flow [2024-06-14 11:18:05,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 115 transitions, 1117 flow, removed 1 selfloop flow, removed 0 redundant places. [2024-06-14 11:18:05,023 INFO L231 Difference]: Finished difference. Result has 96 places, 107 transitions, 948 flow [2024-06-14 11:18:05,023 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=909, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=948, PETRI_PLACES=96, PETRI_TRANSITIONS=107} [2024-06-14 11:18:05,023 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 45 predicate places. [2024-06-14 11:18:05,024 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 107 transitions, 948 flow [2024-06-14 11:18:05,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:05,024 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:18:05,024 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:18:05,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-14 11:18:05,024 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-14 11:18:05,025 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:18:05,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1185241952, now seen corresponding path program 1 times [2024-06-14 11:18:05,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:18:05,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333873796] [2024-06-14 11:18:05,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:18:05,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:18:05,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:18:05,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 11:18:05,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:18:05,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333873796] [2024-06-14 11:18:05,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333873796] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:18:05,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:18:05,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 11:18:05,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95410183] [2024-06-14 11:18:05,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:18:05,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 11:18:05,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:18:05,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 11:18:05,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-14 11:18:05,135 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 54 [2024-06-14 11:18:05,135 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 107 transitions, 948 flow. Second operand has 6 states, 6 states have (on average 27.0) internal successors, (162), 6 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:05,135 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:18:05,135 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 54 [2024-06-14 11:18:05,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:18:05,340 INFO L124 PetriNetUnfolderBase]: 1014/2058 cut-off events. [2024-06-14 11:18:05,341 INFO L125 PetriNetUnfolderBase]: For 13361/13550 co-relation queries the response was YES. [2024-06-14 11:18:05,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8298 conditions, 2058 events. 1014/2058 cut-off events. For 13361/13550 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 13182 event pairs, 234 based on Foata normal form. 32/1966 useless extension candidates. Maximal degree in co-relation 7530. Up to 754 conditions per place. [2024-06-14 11:18:05,353 INFO L140 encePairwiseOnDemand]: 42/54 looper letters, 80 selfloop transitions, 40 changer transitions 2/147 dead transitions. [2024-06-14 11:18:05,353 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 147 transitions, 1482 flow [2024-06-14 11:18:05,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 11:18:05,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 11:18:05,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 214 transitions. [2024-06-14 11:18:05,354 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6604938271604939 [2024-06-14 11:18:05,354 INFO L175 Difference]: Start difference. First operand has 96 places, 107 transitions, 948 flow. Second operand 6 states and 214 transitions. [2024-06-14 11:18:05,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 147 transitions, 1482 flow [2024-06-14 11:18:05,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 147 transitions, 1459 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-06-14 11:18:05,368 INFO L231 Difference]: Finished difference. Result has 102 places, 120 transitions, 1221 flow [2024-06-14 11:18:05,368 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=925, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1221, PETRI_PLACES=102, PETRI_TRANSITIONS=120} [2024-06-14 11:18:05,368 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 51 predicate places. [2024-06-14 11:18:05,369 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 120 transitions, 1221 flow [2024-06-14 11:18:05,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.0) internal successors, (162), 6 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:05,369 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:18:05,369 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:18:05,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-14 11:18:05,369 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-14 11:18:05,370 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:18:05,370 INFO L85 PathProgramCache]: Analyzing trace with hash 2136920851, now seen corresponding path program 1 times [2024-06-14 11:18:05,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:18:05,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814549604] [2024-06-14 11:18:05,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:18:05,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:18:05,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:18:05,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 11:18:05,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:18:05,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814549604] [2024-06-14 11:18:05,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814549604] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:18:05,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:18:05,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 11:18:05,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449726431] [2024-06-14 11:18:05,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:18:05,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-14 11:18:05,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:18:05,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-14 11:18:05,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-14 11:18:05,401 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 54 [2024-06-14 11:18:05,401 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 120 transitions, 1221 flow. Second operand has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:05,402 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:18:05,402 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 54 [2024-06-14 11:18:05,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:18:05,597 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([308] L742-->L745: Formula: (= v_~flag1~0_5 0) InVars {} OutVars{~flag1~0=v_~flag1~0_5} AuxVars[] AssignedVars[~flag1~0][56], [Black: 128#(and (= ~flag1~0 0) (= ~flag2~0 1) (= ~x~0 1)), Black: 65#(and (= ~x~0 0) (= ~flag1~0 1) (= ~turn~0 0) (= ~flag2~0 0)), Black: 129#(and (= ~flag1~0 0) (= ~turn~0 1) (= ~flag2~0 1) (= ~x~0 1)), Black: 127#(and (= ~flag1~0 0) (= ~flag2~0 1)), 137#(= |thr2Thread1of1ForFork0_~f1~0#1| 1), 102#true, Black: 72#(and (= ~x~0 0) (= ~flag1~0 1) (= ~flag2~0 0)), 109#true, Black: 73#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag1~0 1) (= ~flag2~0 0)), Black: 70#(= ~flag2~0 0), Black: 71#(and (= ~flag1~0 1) (= ~flag2~0 0)), 94#true, Black: 80#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 0)), Black: 81#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 1) (= ~turn~0 0)), Black: 88#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 0)), Black: 86#(= ~flag2~0 0), 19#L745true, Black: 87#(and (= ~x~0 0) (= ~flag2~0 0)), Black: 89#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 0)), 126#(= ~flag1~0 0), Black: 96#(and (= ~x~0 0) (= ~turn~0 0)), Black: 98#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), Black: 97#(and (= ~x~0 0) (= ~flag1~0 1) (= ~turn~0 0)), Black: 106#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), Black: 104#(and (= ~x~0 0) (= ~turn~0 0)), 17#L777true, 27#ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANTtrue, Black: 111#(= ~flag2~0 0), Black: 112#(= |thr1Thread1of1ForFork1_~f2~0#1| 0), Black: 114#(and (= |thr1Thread1of1ForFork1_~f2~0#1| 0) (= ~flag2~0 0)), thr2Thread1of1ForFork0InUse, Black: 122#(and (= ~flag1~0 0) (= ~flag2~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 60#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 0) (= ~flag2~0 0))]) [2024-06-14 11:18:05,597 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2024-06-14 11:18:05,597 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-06-14 11:18:05,597 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-06-14 11:18:05,597 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-06-14 11:18:05,648 INFO L124 PetriNetUnfolderBase]: 1099/2516 cut-off events. [2024-06-14 11:18:05,648 INFO L125 PetriNetUnfolderBase]: For 15022/15156 co-relation queries the response was YES. [2024-06-14 11:18:05,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9606 conditions, 2516 events. 1099/2516 cut-off events. For 15022/15156 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 18888 event pairs, 273 based on Foata normal form. 87/2367 useless extension candidates. Maximal degree in co-relation 9038. Up to 570 conditions per place. [2024-06-14 11:18:05,664 INFO L140 encePairwiseOnDemand]: 47/54 looper letters, 43 selfloop transitions, 32 changer transitions 0/149 dead transitions. [2024-06-14 11:18:05,664 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 149 transitions, 1537 flow [2024-06-14 11:18:05,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 11:18:05,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 11:18:05,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 200 transitions. [2024-06-14 11:18:05,666 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7407407407407407 [2024-06-14 11:18:05,666 INFO L175 Difference]: Start difference. First operand has 102 places, 120 transitions, 1221 flow. Second operand 5 states and 200 transitions. [2024-06-14 11:18:05,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 149 transitions, 1537 flow [2024-06-14 11:18:05,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 149 transitions, 1483 flow, removed 12 selfloop flow, removed 1 redundant places. [2024-06-14 11:18:05,689 INFO L231 Difference]: Finished difference. Result has 108 places, 131 transitions, 1391 flow [2024-06-14 11:18:05,690 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=1169, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1391, PETRI_PLACES=108, PETRI_TRANSITIONS=131} [2024-06-14 11:18:05,690 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 57 predicate places. [2024-06-14 11:18:05,690 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 131 transitions, 1391 flow [2024-06-14 11:18:05,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:05,690 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:18:05,691 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:18:05,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-14 11:18:05,691 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-14 11:18:05,691 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:18:05,691 INFO L85 PathProgramCache]: Analyzing trace with hash 751870025, now seen corresponding path program 2 times [2024-06-14 11:18:05,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:18:05,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373035671] [2024-06-14 11:18:05,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:18:05,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:18:05,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:18:05,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 11:18:05,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:18:05,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373035671] [2024-06-14 11:18:05,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373035671] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:18:05,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:18:05,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 11:18:05,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062254286] [2024-06-14 11:18:05,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:18:05,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 11:18:05,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:18:05,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 11:18:05,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-14 11:18:05,804 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 54 [2024-06-14 11:18:05,805 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 131 transitions, 1391 flow. Second operand has 6 states, 6 states have (on average 27.0) internal successors, (162), 6 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:05,805 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:18:05,805 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 54 [2024-06-14 11:18:05,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:18:06,107 INFO L124 PetriNetUnfolderBase]: 1352/2839 cut-off events. [2024-06-14 11:18:06,107 INFO L125 PetriNetUnfolderBase]: For 24258/24571 co-relation queries the response was YES. [2024-06-14 11:18:06,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12911 conditions, 2839 events. 1352/2839 cut-off events. For 24258/24571 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 20694 event pairs, 402 based on Foata normal form. 95/2752 useless extension candidates. Maximal degree in co-relation 10025. Up to 1275 conditions per place. [2024-06-14 11:18:06,132 INFO L140 encePairwiseOnDemand]: 42/54 looper letters, 83 selfloop transitions, 47 changer transitions 0/158 dead transitions. [2024-06-14 11:18:06,132 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 158 transitions, 1844 flow [2024-06-14 11:18:06,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 11:18:06,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 11:18:06,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 215 transitions. [2024-06-14 11:18:06,133 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6635802469135802 [2024-06-14 11:18:06,133 INFO L175 Difference]: Start difference. First operand has 108 places, 131 transitions, 1391 flow. Second operand 6 states and 215 transitions. [2024-06-14 11:18:06,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 158 transitions, 1844 flow [2024-06-14 11:18:06,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 158 transitions, 1844 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-06-14 11:18:06,170 INFO L231 Difference]: Finished difference. Result has 115 places, 141 transitions, 1619 flow [2024-06-14 11:18:06,171 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=1391, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1619, PETRI_PLACES=115, PETRI_TRANSITIONS=141} [2024-06-14 11:18:06,171 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 64 predicate places. [2024-06-14 11:18:06,171 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 141 transitions, 1619 flow [2024-06-14 11:18:06,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.0) internal successors, (162), 6 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:06,172 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:18:06,172 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:18:06,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-14 11:18:06,172 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-14 11:18:06,173 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:18:06,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1912219475, now seen corresponding path program 3 times [2024-06-14 11:18:06,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:18:06,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998370478] [2024-06-14 11:18:06,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:18:06,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:18:06,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:18:06,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 11:18:06,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:18:06,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998370478] [2024-06-14 11:18:06,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998370478] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:18:06,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:18:06,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 11:18:06,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17031154] [2024-06-14 11:18:06,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:18:06,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 11:18:06,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:18:06,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 11:18:06,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-14 11:18:06,292 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 54 [2024-06-14 11:18:06,293 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 141 transitions, 1619 flow. Second operand has 6 states, 6 states have (on average 27.0) internal successors, (162), 6 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:06,293 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:18:06,293 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 54 [2024-06-14 11:18:06,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:18:06,604 INFO L124 PetriNetUnfolderBase]: 1354/2839 cut-off events. [2024-06-14 11:18:06,604 INFO L125 PetriNetUnfolderBase]: For 29658/29994 co-relation queries the response was YES. [2024-06-14 11:18:06,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13769 conditions, 2839 events. 1354/2839 cut-off events. For 29658/29994 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 20627 event pairs, 395 based on Foata normal form. 105/2764 useless extension candidates. Maximal degree in co-relation 10716. Up to 1275 conditions per place. [2024-06-14 11:18:06,625 INFO L140 encePairwiseOnDemand]: 42/54 looper letters, 88 selfloop transitions, 44 changer transitions 0/160 dead transitions. [2024-06-14 11:18:06,626 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 160 transitions, 2015 flow [2024-06-14 11:18:06,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 11:18:06,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 11:18:06,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 215 transitions. [2024-06-14 11:18:06,627 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6635802469135802 [2024-06-14 11:18:06,627 INFO L175 Difference]: Start difference. First operand has 115 places, 141 transitions, 1619 flow. Second operand 6 states and 215 transitions. [2024-06-14 11:18:06,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 160 transitions, 2015 flow [2024-06-14 11:18:06,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 160 transitions, 1965 flow, removed 13 selfloop flow, removed 1 redundant places. [2024-06-14 11:18:06,669 INFO L231 Difference]: Finished difference. Result has 120 places, 143 transitions, 1683 flow [2024-06-14 11:18:06,669 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=1571, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1683, PETRI_PLACES=120, PETRI_TRANSITIONS=143} [2024-06-14 11:18:06,670 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 69 predicate places. [2024-06-14 11:18:06,670 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 143 transitions, 1683 flow [2024-06-14 11:18:06,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.0) internal successors, (162), 6 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:06,670 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:18:06,670 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:18:06,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-14 11:18:06,671 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-14 11:18:06,671 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:18:06,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1601190105, now seen corresponding path program 1 times [2024-06-14 11:18:06,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:18:06,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903297163] [2024-06-14 11:18:06,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:18:06,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:18:06,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:18:06,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 11:18:06,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:18:06,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903297163] [2024-06-14 11:18:06,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903297163] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:18:06,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:18:06,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 11:18:06,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947182113] [2024-06-14 11:18:06,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:18:06,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 11:18:06,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:18:06,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 11:18:06,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-14 11:18:06,782 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 54 [2024-06-14 11:18:06,782 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 143 transitions, 1683 flow. Second operand has 6 states, 6 states have (on average 27.166666666666668) internal successors, (163), 6 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:06,782 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:18:06,783 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 54 [2024-06-14 11:18:06,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:18:07,113 INFO L124 PetriNetUnfolderBase]: 1433/3023 cut-off events. [2024-06-14 11:18:07,114 INFO L125 PetriNetUnfolderBase]: For 35261/35582 co-relation queries the response was YES. [2024-06-14 11:18:07,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14995 conditions, 3023 events. 1433/3023 cut-off events. For 35261/35582 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 22392 event pairs, 334 based on Foata normal form. 45/2878 useless extension candidates. Maximal degree in co-relation 14013. Up to 945 conditions per place. [2024-06-14 11:18:07,137 INFO L140 encePairwiseOnDemand]: 45/54 looper letters, 95 selfloop transitions, 50 changer transitions 3/176 dead transitions. [2024-06-14 11:18:07,138 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 176 transitions, 2231 flow [2024-06-14 11:18:07,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 11:18:07,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 11:18:07,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 213 transitions. [2024-06-14 11:18:07,139 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6574074074074074 [2024-06-14 11:18:07,139 INFO L175 Difference]: Start difference. First operand has 120 places, 143 transitions, 1683 flow. Second operand 6 states and 213 transitions. [2024-06-14 11:18:07,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 176 transitions, 2231 flow [2024-06-14 11:18:07,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 176 transitions, 2175 flow, removed 8 selfloop flow, removed 2 redundant places. [2024-06-14 11:18:07,183 INFO L231 Difference]: Finished difference. Result has 127 places, 150 transitions, 1884 flow [2024-06-14 11:18:07,183 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=1630, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1884, PETRI_PLACES=127, PETRI_TRANSITIONS=150} [2024-06-14 11:18:07,183 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 76 predicate places. [2024-06-14 11:18:07,184 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 150 transitions, 1884 flow [2024-06-14 11:18:07,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.166666666666668) internal successors, (163), 6 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:07,184 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:18:07,184 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:18:07,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-14 11:18:07,184 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-14 11:18:07,185 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:18:07,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1852718132, now seen corresponding path program 1 times [2024-06-14 11:18:07,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:18:07,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553396579] [2024-06-14 11:18:07,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:18:07,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:18:07,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:18:07,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 11:18:07,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:18:07,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553396579] [2024-06-14 11:18:07,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553396579] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:18:07,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:18:07,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 11:18:07,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094739683] [2024-06-14 11:18:07,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:18:07,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 11:18:07,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:18:07,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 11:18:07,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-14 11:18:07,291 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 54 [2024-06-14 11:18:07,292 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 150 transitions, 1884 flow. Second operand has 6 states, 6 states have (on average 27.166666666666668) internal successors, (163), 6 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:07,292 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:18:07,292 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 54 [2024-06-14 11:18:07,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:18:07,616 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([308] L742-->L745: Formula: (= v_~flag1~0_5 0) InVars {} OutVars{~flag1~0=v_~flag1~0_5} AuxVars[] AssignedVars[~flag1~0][66], [Black: 128#(and (= ~flag1~0 0) (= ~flag2~0 1) (= ~x~0 1)), Black: 65#(and (= ~x~0 0) (= ~flag1~0 1) (= ~turn~0 0) (= ~flag2~0 0)), Black: 129#(and (= ~flag1~0 0) (= ~turn~0 1) (= ~flag2~0 1) (= ~x~0 1)), Black: 127#(and (= ~flag1~0 0) (= ~flag2~0 1)), 161#(= ~flag1~0 0), 137#(= |thr2Thread1of1ForFork0_~f1~0#1| 1), 102#true, Black: 72#(and (= ~x~0 0) (= ~flag1~0 1) (= ~flag2~0 0)), Black: 73#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag1~0 1) (= ~flag2~0 0)), 109#true, Black: 70#(= ~flag2~0 0), Black: 71#(and (= ~flag1~0 1) (= ~flag2~0 0)), Black: 136#(= ~flag1~0 1), Black: 139#(and (= |thr2Thread1of1ForFork0_~f1~0#1| 1) (= ~flag1~0 1)), 94#true, Black: 80#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 0)), Black: 81#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 1) (= ~turn~0 0)), Black: 147#(and (= ~flag2~0 1) (= ~turn~0 0)), Black: 149#(and (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 88#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 0)), Black: 86#(= ~flag2~0 0), 19#L745true, Black: 87#(and (= ~x~0 0) (= ~flag2~0 0)), Black: 89#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 0)), 126#(= ~flag1~0 0), Black: 157#(and (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 96#(and (= ~x~0 0) (= ~turn~0 0)), Black: 98#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), Black: 97#(and (= ~x~0 0) (= ~flag1~0 1) (= ~turn~0 0)), Black: 162#(and (= ~flag1~0 0) (= ~x~0 1)), Black: 164#(and (= ~flag1~0 0) (= ~turn~0 1) (= ~x~0 1) (= ~flag2~0 0)), Black: 163#(and (= ~flag1~0 0) (= ~turn~0 1) (= ~x~0 1)), Black: 106#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), Black: 104#(and (= ~x~0 0) (= ~turn~0 0)), 17#L777true, Black: 111#(= ~flag2~0 0), Black: 112#(= |thr1Thread1of1ForFork1_~f2~0#1| 0), Black: 114#(and (= |thr1Thread1of1ForFork1_~f2~0#1| 0) (= ~flag2~0 0)), thr2Thread1of1ForFork0InUse, 169#true, 31#L793-5true, Black: 122#(and (= ~flag1~0 0) (= ~flag2~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 60#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 0) (= ~flag2~0 0)), 144#true]) [2024-06-14 11:18:07,617 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-06-14 11:18:07,617 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-06-14 11:18:07,617 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-06-14 11:18:07,617 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-06-14 11:18:07,621 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([308] L742-->L745: Formula: (= v_~flag1~0_5 0) InVars {} OutVars{~flag1~0=v_~flag1~0_5} AuxVars[] AssignedVars[~flag1~0][66], [Black: 128#(and (= ~flag1~0 0) (= ~flag2~0 1) (= ~x~0 1)), Black: 65#(and (= ~x~0 0) (= ~flag1~0 1) (= ~turn~0 0) (= ~flag2~0 0)), Black: 129#(and (= ~flag1~0 0) (= ~turn~0 1) (= ~flag2~0 1) (= ~x~0 1)), Black: 127#(and (= ~flag1~0 0) (= ~flag2~0 1)), 161#(= ~flag1~0 0), 137#(= |thr2Thread1of1ForFork0_~f1~0#1| 1), 102#true, Black: 72#(and (= ~x~0 0) (= ~flag1~0 1) (= ~flag2~0 0)), Black: 73#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag1~0 1) (= ~flag2~0 0)), 109#true, Black: 70#(= ~flag2~0 0), Black: 71#(and (= ~flag1~0 1) (= ~flag2~0 0)), Black: 136#(= ~flag1~0 1), Black: 139#(and (= |thr2Thread1of1ForFork0_~f1~0#1| 1) (= ~flag1~0 1)), 94#true, Black: 80#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 0)), Black: 81#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 1) (= ~turn~0 0)), Black: 147#(and (= ~flag2~0 1) (= ~turn~0 0)), Black: 149#(and (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 88#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 0)), Black: 86#(= ~flag2~0 0), 19#L745true, Black: 87#(and (= ~x~0 0) (= ~flag2~0 0)), 126#(= ~flag1~0 0), Black: 89#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 0)), Black: 157#(and (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0) (= ~x~0 1)), 26#L794true, Black: 96#(and (= ~x~0 0) (= ~turn~0 0)), Black: 98#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), Black: 97#(and (= ~x~0 0) (= ~flag1~0 1) (= ~turn~0 0)), Black: 162#(and (= ~flag1~0 0) (= ~x~0 1)), Black: 164#(and (= ~flag1~0 0) (= ~turn~0 1) (= ~x~0 1) (= ~flag2~0 0)), Black: 163#(and (= ~flag1~0 0) (= ~turn~0 1) (= ~x~0 1)), Black: 106#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), Black: 104#(and (= ~x~0 0) (= ~turn~0 0)), 17#L777true, Black: 111#(= ~flag2~0 0), Black: 112#(= |thr1Thread1of1ForFork1_~f2~0#1| 0), Black: 114#(and (= |thr1Thread1of1ForFork1_~f2~0#1| 0) (= ~flag2~0 0)), thr2Thread1of1ForFork0InUse, 169#true, Black: 122#(and (= ~flag1~0 0) (= ~flag2~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 60#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 0) (= ~flag2~0 0)), 144#true]) [2024-06-14 11:18:07,621 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-06-14 11:18:07,621 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-06-14 11:18:07,621 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-06-14 11:18:07,621 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-06-14 11:18:07,626 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([308] L742-->L745: Formula: (= v_~flag1~0_5 0) InVars {} OutVars{~flag1~0=v_~flag1~0_5} AuxVars[] AssignedVars[~flag1~0][66], [Black: 128#(and (= ~flag1~0 0) (= ~flag2~0 1) (= ~x~0 1)), Black: 65#(and (= ~x~0 0) (= ~flag1~0 1) (= ~turn~0 0) (= ~flag2~0 0)), Black: 129#(and (= ~flag1~0 0) (= ~turn~0 1) (= ~flag2~0 1) (= ~x~0 1)), Black: 127#(and (= ~flag1~0 0) (= ~flag2~0 1)), 161#(= ~flag1~0 0), 137#(= |thr2Thread1of1ForFork0_~f1~0#1| 1), 102#true, Black: 72#(and (= ~x~0 0) (= ~flag1~0 1) (= ~flag2~0 0)), 109#true, Black: 73#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag1~0 1) (= ~flag2~0 0)), Black: 70#(= ~flag2~0 0), Black: 71#(and (= ~flag1~0 1) (= ~flag2~0 0)), Black: 136#(= ~flag1~0 1), Black: 139#(and (= |thr2Thread1of1ForFork0_~f1~0#1| 1) (= ~flag1~0 1)), 94#true, Black: 80#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 0)), Black: 81#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 1) (= ~turn~0 0)), Black: 147#(and (= ~flag2~0 1) (= ~turn~0 0)), Black: 149#(and (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 88#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 0)), Black: 86#(= ~flag2~0 0), 19#L745true, Black: 87#(and (= ~x~0 0) (= ~flag2~0 0)), Black: 89#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 0)), 126#(= ~flag1~0 0), Black: 157#(and (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 96#(and (= ~x~0 0) (= ~turn~0 0)), Black: 98#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), Black: 97#(and (= ~x~0 0) (= ~flag1~0 1) (= ~turn~0 0)), Black: 162#(and (= ~flag1~0 0) (= ~x~0 1)), Black: 164#(and (= ~flag1~0 0) (= ~turn~0 1) (= ~x~0 1) (= ~flag2~0 0)), Black: 163#(and (= ~flag1~0 0) (= ~turn~0 1) (= ~x~0 1)), Black: 106#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), Black: 104#(and (= ~x~0 0) (= ~turn~0 0)), 17#L777true, 27#ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANTtrue, Black: 111#(= ~flag2~0 0), Black: 112#(= |thr1Thread1of1ForFork1_~f2~0#1| 0), Black: 114#(and (= |thr1Thread1of1ForFork1_~f2~0#1| 0) (= ~flag2~0 0)), thr2Thread1of1ForFork0InUse, 169#true, Black: 122#(and (= ~flag1~0 0) (= ~flag2~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 60#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 0) (= ~flag2~0 0)), 144#true]) [2024-06-14 11:18:07,627 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-06-14 11:18:07,627 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-06-14 11:18:07,627 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-06-14 11:18:07,627 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-06-14 11:18:07,633 INFO L124 PetriNetUnfolderBase]: 1504/3132 cut-off events. [2024-06-14 11:18:07,633 INFO L125 PetriNetUnfolderBase]: For 43271/43697 co-relation queries the response was YES. [2024-06-14 11:18:07,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16537 conditions, 3132 events. 1504/3132 cut-off events. For 43271/43697 co-relation queries the response was YES. Maximal size of possible extension queue 232. Compared 23202 event pairs, 388 based on Foata normal form. 85/3033 useless extension candidates. Maximal degree in co-relation 15480. Up to 1238 conditions per place. [2024-06-14 11:18:07,656 INFO L140 encePairwiseOnDemand]: 42/54 looper letters, 99 selfloop transitions, 65 changer transitions 0/192 dead transitions. [2024-06-14 11:18:07,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 192 transitions, 2634 flow [2024-06-14 11:18:07,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 11:18:07,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 11:18:07,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 222 transitions. [2024-06-14 11:18:07,658 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6851851851851852 [2024-06-14 11:18:07,658 INFO L175 Difference]: Start difference. First operand has 127 places, 150 transitions, 1884 flow. Second operand 6 states and 222 transitions. [2024-06-14 11:18:07,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 192 transitions, 2634 flow [2024-06-14 11:18:07,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 192 transitions, 2573 flow, removed 11 selfloop flow, removed 1 redundant places. [2024-06-14 11:18:07,714 INFO L231 Difference]: Finished difference. Result has 133 places, 157 transitions, 2098 flow [2024-06-14 11:18:07,715 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=1830, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2098, PETRI_PLACES=133, PETRI_TRANSITIONS=157} [2024-06-14 11:18:07,715 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 82 predicate places. [2024-06-14 11:18:07,715 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 157 transitions, 2098 flow [2024-06-14 11:18:07,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.166666666666668) internal successors, (163), 6 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:07,716 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:18:07,716 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:18:07,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-14 11:18:07,716 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-14 11:18:07,716 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:18:07,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1853461202, now seen corresponding path program 2 times [2024-06-14 11:18:07,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:18:07,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136397424] [2024-06-14 11:18:07,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:18:07,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:18:07,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:18:07,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 11:18:07,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:18:07,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136397424] [2024-06-14 11:18:07,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136397424] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:18:07,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:18:07,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 11:18:07,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053683788] [2024-06-14 11:18:07,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:18:07,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 11:18:07,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:18:07,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 11:18:07,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-14 11:18:07,830 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 54 [2024-06-14 11:18:07,830 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 157 transitions, 2098 flow. Second operand has 6 states, 6 states have (on average 27.166666666666668) internal successors, (163), 6 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:07,830 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:18:07,830 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 54 [2024-06-14 11:18:07,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:18:08,174 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([308] L742-->L745: Formula: (= v_~flag1~0_5 0) InVars {} OutVars{~flag1~0=v_~flag1~0_5} AuxVars[] AssignedVars[~flag1~0][66], [Black: 128#(and (= ~flag1~0 0) (= ~flag2~0 1) (= ~x~0 1)), Black: 65#(and (= ~x~0 0) (= ~flag1~0 1) (= ~turn~0 0) (= ~flag2~0 0)), Black: 129#(and (= ~flag1~0 0) (= ~turn~0 1) (= ~flag2~0 1) (= ~x~0 1)), Black: 127#(and (= ~flag1~0 0) (= ~flag2~0 1)), 161#(= ~flag1~0 0), 137#(= |thr2Thread1of1ForFork0_~f1~0#1| 1), 102#true, Black: 72#(and (= ~x~0 0) (= ~flag1~0 1) (= ~flag2~0 0)), Black: 73#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag1~0 1) (= ~flag2~0 0)), 109#true, Black: 70#(= ~flag2~0 0), Black: 71#(and (= ~flag1~0 1) (= ~flag2~0 0)), Black: 136#(= ~flag1~0 1), Black: 139#(and (= |thr2Thread1of1ForFork0_~f1~0#1| 1) (= ~flag1~0 1)), 94#true, 177#true, Black: 80#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 0)), Black: 81#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 1) (= ~turn~0 0)), Black: 147#(and (= ~flag2~0 1) (= ~turn~0 0)), Black: 149#(and (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 88#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 0)), 19#L745true, Black: 86#(= ~flag2~0 0), Black: 87#(and (= ~x~0 0) (= ~flag2~0 0)), Black: 89#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 0)), 126#(= ~flag1~0 0), Black: 157#(and (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 96#(and (= ~x~0 0) (= ~turn~0 0)), Black: 98#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), Black: 97#(and (= ~x~0 0) (= ~flag1~0 1) (= ~turn~0 0)), Black: 162#(and (= ~flag1~0 0) (= ~x~0 1)), Black: 164#(and (= ~flag1~0 0) (= ~turn~0 1) (= ~x~0 1) (= ~flag2~0 0)), Black: 163#(and (= ~flag1~0 0) (= ~turn~0 1) (= ~x~0 1)), Black: 106#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), Black: 104#(and (= ~x~0 0) (= ~turn~0 0)), Black: 172#(and (= ~x~0 0) (= ~flag1~0 1)), Black: 174#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 1) (= ~flag1~0 1)), 17#L777true, Black: 111#(= ~flag2~0 0), Black: 112#(= |thr1Thread1of1ForFork1_~f2~0#1| 0), Black: 114#(and (= |thr1Thread1of1ForFork1_~f2~0#1| 0) (= ~flag2~0 0)), thr2Thread1of1ForFork0InUse, 169#true, 31#L793-5true, Black: 122#(and (= ~flag1~0 0) (= ~flag2~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 60#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 0) (= ~flag2~0 0)), 144#true]) [2024-06-14 11:18:08,174 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-06-14 11:18:08,175 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-06-14 11:18:08,175 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-06-14 11:18:08,175 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-06-14 11:18:08,180 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([308] L742-->L745: Formula: (= v_~flag1~0_5 0) InVars {} OutVars{~flag1~0=v_~flag1~0_5} AuxVars[] AssignedVars[~flag1~0][66], [Black: 128#(and (= ~flag1~0 0) (= ~flag2~0 1) (= ~x~0 1)), Black: 65#(and (= ~x~0 0) (= ~flag1~0 1) (= ~turn~0 0) (= ~flag2~0 0)), Black: 129#(and (= ~flag1~0 0) (= ~turn~0 1) (= ~flag2~0 1) (= ~x~0 1)), Black: 127#(and (= ~flag1~0 0) (= ~flag2~0 1)), 161#(= ~flag1~0 0), 137#(= |thr2Thread1of1ForFork0_~f1~0#1| 1), 102#true, Black: 72#(and (= ~x~0 0) (= ~flag1~0 1) (= ~flag2~0 0)), Black: 73#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag1~0 1) (= ~flag2~0 0)), 109#true, Black: 70#(= ~flag2~0 0), Black: 71#(and (= ~flag1~0 1) (= ~flag2~0 0)), Black: 136#(= ~flag1~0 1), Black: 139#(and (= |thr2Thread1of1ForFork0_~f1~0#1| 1) (= ~flag1~0 1)), 94#true, 177#true, Black: 80#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 0)), Black: 81#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 1) (= ~turn~0 0)), Black: 147#(and (= ~flag2~0 1) (= ~turn~0 0)), Black: 149#(and (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 88#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 0)), Black: 86#(= ~flag2~0 0), 19#L745true, Black: 87#(and (= ~x~0 0) (= ~flag2~0 0)), 126#(= ~flag1~0 0), Black: 89#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 0)), Black: 157#(and (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 96#(and (= ~x~0 0) (= ~turn~0 0)), 26#L794true, Black: 98#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), Black: 97#(and (= ~x~0 0) (= ~flag1~0 1) (= ~turn~0 0)), Black: 162#(and (= ~flag1~0 0) (= ~x~0 1)), Black: 164#(and (= ~flag1~0 0) (= ~turn~0 1) (= ~x~0 1) (= ~flag2~0 0)), Black: 163#(and (= ~flag1~0 0) (= ~turn~0 1) (= ~x~0 1)), Black: 106#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), Black: 104#(and (= ~x~0 0) (= ~turn~0 0)), Black: 172#(and (= ~x~0 0) (= ~flag1~0 1)), Black: 174#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 1) (= ~flag1~0 1)), 17#L777true, Black: 111#(= ~flag2~0 0), Black: 112#(= |thr1Thread1of1ForFork1_~f2~0#1| 0), Black: 114#(and (= |thr1Thread1of1ForFork1_~f2~0#1| 0) (= ~flag2~0 0)), thr2Thread1of1ForFork0InUse, 169#true, Black: 122#(and (= ~flag1~0 0) (= ~flag2~0 1) (= ~turn~0 0) (= ~x~0 1)), 144#true, Black: 60#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 0) (= ~flag2~0 0))]) [2024-06-14 11:18:08,180 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-06-14 11:18:08,181 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-06-14 11:18:08,181 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-06-14 11:18:08,181 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-06-14 11:18:08,188 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([308] L742-->L745: Formula: (= v_~flag1~0_5 0) InVars {} OutVars{~flag1~0=v_~flag1~0_5} AuxVars[] AssignedVars[~flag1~0][66], [Black: 128#(and (= ~flag1~0 0) (= ~flag2~0 1) (= ~x~0 1)), Black: 65#(and (= ~x~0 0) (= ~flag1~0 1) (= ~turn~0 0) (= ~flag2~0 0)), Black: 129#(and (= ~flag1~0 0) (= ~turn~0 1) (= ~flag2~0 1) (= ~x~0 1)), Black: 127#(and (= ~flag1~0 0) (= ~flag2~0 1)), 161#(= ~flag1~0 0), 137#(= |thr2Thread1of1ForFork0_~f1~0#1| 1), 102#true, Black: 72#(and (= ~x~0 0) (= ~flag1~0 1) (= ~flag2~0 0)), Black: 73#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag1~0 1) (= ~flag2~0 0)), 109#true, Black: 70#(= ~flag2~0 0), Black: 71#(and (= ~flag1~0 1) (= ~flag2~0 0)), Black: 136#(= ~flag1~0 1), Black: 139#(and (= |thr2Thread1of1ForFork0_~f1~0#1| 1) (= ~flag1~0 1)), 94#true, 177#true, Black: 80#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 0)), Black: 81#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 1) (= ~turn~0 0)), Black: 147#(and (= ~flag2~0 1) (= ~turn~0 0)), Black: 149#(and (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 88#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 0)), Black: 86#(= ~flag2~0 0), 19#L745true, Black: 87#(and (= ~x~0 0) (= ~flag2~0 0)), 126#(= ~flag1~0 0), Black: 89#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 0)), Black: 157#(and (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 96#(and (= ~x~0 0) (= ~turn~0 0)), Black: 98#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), Black: 97#(and (= ~x~0 0) (= ~flag1~0 1) (= ~turn~0 0)), Black: 162#(and (= ~flag1~0 0) (= ~x~0 1)), Black: 164#(and (= ~flag1~0 0) (= ~turn~0 1) (= ~x~0 1) (= ~flag2~0 0)), Black: 163#(and (= ~flag1~0 0) (= ~turn~0 1) (= ~x~0 1)), Black: 106#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), Black: 104#(and (= ~x~0 0) (= ~turn~0 0)), Black: 172#(and (= ~x~0 0) (= ~flag1~0 1)), Black: 174#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 1) (= ~flag1~0 1)), 17#L777true, 27#ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANTtrue, Black: 111#(= ~flag2~0 0), Black: 112#(= |thr1Thread1of1ForFork1_~f2~0#1| 0), Black: 114#(and (= |thr1Thread1of1ForFork1_~f2~0#1| 0) (= ~flag2~0 0)), thr2Thread1of1ForFork0InUse, 169#true, Black: 122#(and (= ~flag1~0 0) (= ~flag2~0 1) (= ~turn~0 0) (= ~x~0 1)), 144#true, Black: 60#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 0) (= ~flag2~0 0))]) [2024-06-14 11:18:08,188 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-06-14 11:18:08,188 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-06-14 11:18:08,188 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-06-14 11:18:08,189 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-06-14 11:18:08,197 INFO L124 PetriNetUnfolderBase]: 1544/3221 cut-off events. [2024-06-14 11:18:08,197 INFO L125 PetriNetUnfolderBase]: For 49129/49632 co-relation queries the response was YES. [2024-06-14 11:18:08,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17952 conditions, 3221 events. 1544/3221 cut-off events. For 49129/49632 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 23899 event pairs, 414 based on Foata normal form. 90/3123 useless extension candidates. Maximal degree in co-relation 16871. Up to 1259 conditions per place. [2024-06-14 11:18:08,223 INFO L140 encePairwiseOnDemand]: 43/54 looper letters, 97 selfloop transitions, 67 changer transitions 0/192 dead transitions. [2024-06-14 11:18:08,223 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 192 transitions, 2823 flow [2024-06-14 11:18:08,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 11:18:08,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 11:18:08,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 212 transitions. [2024-06-14 11:18:08,225 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.654320987654321 [2024-06-14 11:18:08,225 INFO L175 Difference]: Start difference. First operand has 133 places, 157 transitions, 2098 flow. Second operand 6 states and 212 transitions. [2024-06-14 11:18:08,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 192 transitions, 2823 flow [2024-06-14 11:18:08,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 192 transitions, 2655 flow, removed 21 selfloop flow, removed 3 redundant places. [2024-06-14 11:18:08,295 INFO L231 Difference]: Finished difference. Result has 138 places, 166 transitions, 2298 flow [2024-06-14 11:18:08,295 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=1936, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2298, PETRI_PLACES=138, PETRI_TRANSITIONS=166} [2024-06-14 11:18:08,296 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 87 predicate places. [2024-06-14 11:18:08,297 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 166 transitions, 2298 flow [2024-06-14 11:18:08,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.166666666666668) internal successors, (163), 6 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:08,297 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:18:08,297 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:18:08,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-14 11:18:08,297 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-14 11:18:08,298 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:18:08,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1423798920, now seen corresponding path program 3 times [2024-06-14 11:18:08,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:18:08,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309848248] [2024-06-14 11:18:08,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:18:08,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:18:08,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:18:08,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 11:18:08,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:18:08,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309848248] [2024-06-14 11:18:08,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309848248] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:18:08,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:18:08,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 11:18:08,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796648045] [2024-06-14 11:18:08,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:18:08,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 11:18:08,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:18:08,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 11:18:08,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-14 11:18:08,416 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 54 [2024-06-14 11:18:08,416 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 166 transitions, 2298 flow. Second operand has 6 states, 6 states have (on average 27.166666666666668) internal successors, (163), 6 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:08,417 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:18:08,417 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 54 [2024-06-14 11:18:08,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:18:08,862 INFO L124 PetriNetUnfolderBase]: 1550/3232 cut-off events. [2024-06-14 11:18:08,862 INFO L125 PetriNetUnfolderBase]: For 53263/53884 co-relation queries the response was YES. [2024-06-14 11:18:08,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18486 conditions, 3232 events. 1550/3232 cut-off events. For 53263/53884 co-relation queries the response was YES. Maximal size of possible extension queue 232. Compared 23957 event pairs, 494 based on Foata normal form. 107/3151 useless extension candidates. Maximal degree in co-relation 17416. Up to 1269 conditions per place. [2024-06-14 11:18:08,893 INFO L140 encePairwiseOnDemand]: 44/54 looper letters, 84 selfloop transitions, 74 changer transitions 0/186 dead transitions. [2024-06-14 11:18:08,893 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 186 transitions, 2839 flow [2024-06-14 11:18:08,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 11:18:08,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 11:18:08,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 202 transitions. [2024-06-14 11:18:08,894 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6234567901234568 [2024-06-14 11:18:08,894 INFO L175 Difference]: Start difference. First operand has 138 places, 166 transitions, 2298 flow. Second operand 6 states and 202 transitions. [2024-06-14 11:18:08,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 186 transitions, 2839 flow [2024-06-14 11:18:08,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 186 transitions, 2730 flow, removed 14 selfloop flow, removed 2 redundant places. [2024-06-14 11:18:08,982 INFO L231 Difference]: Finished difference. Result has 143 places, 173 transitions, 2516 flow [2024-06-14 11:18:08,983 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=2192, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2516, PETRI_PLACES=143, PETRI_TRANSITIONS=173} [2024-06-14 11:18:08,983 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 92 predicate places. [2024-06-14 11:18:08,983 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 173 transitions, 2516 flow [2024-06-14 11:18:08,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.166666666666668) internal successors, (163), 6 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:08,984 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:18:08,984 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:18:08,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-14 11:18:08,984 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-14 11:18:08,984 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:18:08,984 INFO L85 PathProgramCache]: Analyzing trace with hash -270113605, now seen corresponding path program 1 times [2024-06-14 11:18:08,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:18:08,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296899592] [2024-06-14 11:18:08,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:18:08,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:18:08,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:18:09,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 11:18:09,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:18:09,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296899592] [2024-06-14 11:18:09,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296899592] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:18:09,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:18:09,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 11:18:09,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171340591] [2024-06-14 11:18:09,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:18:09,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 11:18:09,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:18:09,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 11:18:09,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-14 11:18:09,128 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 54 [2024-06-14 11:18:09,129 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 173 transitions, 2516 flow. Second operand has 6 states, 6 states have (on average 27.166666666666668) internal successors, (163), 6 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:09,129 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:18:09,129 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 54 [2024-06-14 11:18:09,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:18:09,543 INFO L124 PetriNetUnfolderBase]: 1525/3193 cut-off events. [2024-06-14 11:18:09,544 INFO L125 PetriNetUnfolderBase]: For 59053/59761 co-relation queries the response was YES. [2024-06-14 11:18:09,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18690 conditions, 3193 events. 1525/3193 cut-off events. For 59053/59761 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 23785 event pairs, 493 based on Foata normal form. 132/3140 useless extension candidates. Maximal degree in co-relation 16340. Up to 1288 conditions per place. [2024-06-14 11:18:09,571 INFO L140 encePairwiseOnDemand]: 41/54 looper letters, 86 selfloop transitions, 85 changer transitions 0/199 dead transitions. [2024-06-14 11:18:09,571 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 199 transitions, 3185 flow [2024-06-14 11:18:09,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 11:18:09,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 11:18:09,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 212 transitions. [2024-06-14 11:18:09,572 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.654320987654321 [2024-06-14 11:18:09,572 INFO L175 Difference]: Start difference. First operand has 143 places, 173 transitions, 2516 flow. Second operand 6 states and 212 transitions. [2024-06-14 11:18:09,573 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 199 transitions, 3185 flow [2024-06-14 11:18:09,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 199 transitions, 3091 flow, removed 23 selfloop flow, removed 1 redundant places. [2024-06-14 11:18:09,660 INFO L231 Difference]: Finished difference. Result has 150 places, 184 transitions, 2812 flow [2024-06-14 11:18:09,660 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=2428, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2812, PETRI_PLACES=150, PETRI_TRANSITIONS=184} [2024-06-14 11:18:09,660 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 99 predicate places. [2024-06-14 11:18:09,661 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 184 transitions, 2812 flow [2024-06-14 11:18:09,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.166666666666668) internal successors, (163), 6 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:09,661 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:18:09,661 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:18:09,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-14 11:18:09,661 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-14 11:18:09,661 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:18:09,662 INFO L85 PathProgramCache]: Analyzing trace with hash -850737023, now seen corresponding path program 2 times [2024-06-14 11:18:09,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:18:09,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655506901] [2024-06-14 11:18:09,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:18:09,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:18:09,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:18:09,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 11:18:09,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:18:09,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655506901] [2024-06-14 11:18:09,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655506901] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:18:09,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:18:09,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 11:18:09,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330915731] [2024-06-14 11:18:09,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:18:09,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 11:18:09,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:18:09,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 11:18:09,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-14 11:18:09,783 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 54 [2024-06-14 11:18:09,783 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 184 transitions, 2812 flow. Second operand has 6 states, 6 states have (on average 27.166666666666668) internal successors, (163), 6 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:09,783 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:18:09,783 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 54 [2024-06-14 11:18:09,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:18:10,148 INFO L124 PetriNetUnfolderBase]: 1540/3228 cut-off events. [2024-06-14 11:18:10,148 INFO L125 PetriNetUnfolderBase]: For 68005/68619 co-relation queries the response was YES. [2024-06-14 11:18:10,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19553 conditions, 3228 events. 1540/3228 cut-off events. For 68005/68619 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 24043 event pairs, 448 based on Foata normal form. 108/3145 useless extension candidates. Maximal degree in co-relation 17059. Up to 1295 conditions per place. [2024-06-14 11:18:10,179 INFO L140 encePairwiseOnDemand]: 43/54 looper letters, 96 selfloop transitions, 82 changer transitions 1/207 dead transitions. [2024-06-14 11:18:10,180 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 207 transitions, 3444 flow [2024-06-14 11:18:10,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 11:18:10,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 11:18:10,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 211 transitions. [2024-06-14 11:18:10,181 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6512345679012346 [2024-06-14 11:18:10,181 INFO L175 Difference]: Start difference. First operand has 150 places, 184 transitions, 2812 flow. Second operand 6 states and 211 transitions. [2024-06-14 11:18:10,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 207 transitions, 3444 flow [2024-06-14 11:18:10,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 207 transitions, 3351 flow, removed 17 selfloop flow, removed 1 redundant places. [2024-06-14 11:18:10,280 INFO L231 Difference]: Finished difference. Result has 155 places, 190 transitions, 2994 flow [2024-06-14 11:18:10,281 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=2726, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2994, PETRI_PLACES=155, PETRI_TRANSITIONS=190} [2024-06-14 11:18:10,281 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 104 predicate places. [2024-06-14 11:18:10,281 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 190 transitions, 2994 flow [2024-06-14 11:18:10,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.166666666666668) internal successors, (163), 6 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:10,282 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:18:10,282 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:18:10,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-14 11:18:10,282 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-14 11:18:10,283 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:18:10,283 INFO L85 PathProgramCache]: Analyzing trace with hash -850750043, now seen corresponding path program 3 times [2024-06-14 11:18:10,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:18:10,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019138700] [2024-06-14 11:18:10,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:18:10,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:18:10,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:18:10,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 11:18:10,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:18:10,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019138700] [2024-06-14 11:18:10,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019138700] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:18:10,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:18:10,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 11:18:10,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446176499] [2024-06-14 11:18:10,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:18:10,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 11:18:10,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:18:10,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 11:18:10,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-14 11:18:10,414 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 54 [2024-06-14 11:18:10,415 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 190 transitions, 2994 flow. Second operand has 6 states, 6 states have (on average 27.166666666666668) internal successors, (163), 6 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:10,415 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:18:10,415 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 54 [2024-06-14 11:18:10,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:18:10,862 INFO L124 PetriNetUnfolderBase]: 1544/3239 cut-off events. [2024-06-14 11:18:10,862 INFO L125 PetriNetUnfolderBase]: For 72256/72879 co-relation queries the response was YES. [2024-06-14 11:18:10,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20073 conditions, 3239 events. 1544/3239 cut-off events. For 72256/72879 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 24178 event pairs, 449 based on Foata normal form. 147/3198 useless extension candidates. Maximal degree in co-relation 17877. Up to 1293 conditions per place. [2024-06-14 11:18:10,899 INFO L140 encePairwiseOnDemand]: 42/54 looper letters, 95 selfloop transitions, 86 changer transitions 2/211 dead transitions. [2024-06-14 11:18:10,899 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 211 transitions, 3554 flow [2024-06-14 11:18:10,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 11:18:10,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 11:18:10,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 217 transitions. [2024-06-14 11:18:10,901 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6697530864197531 [2024-06-14 11:18:10,901 INFO L175 Difference]: Start difference. First operand has 155 places, 190 transitions, 2994 flow. Second operand 6 states and 217 transitions. [2024-06-14 11:18:10,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 211 transitions, 3554 flow [2024-06-14 11:18:11,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 211 transitions, 3453 flow, removed 22 selfloop flow, removed 1 redundant places. [2024-06-14 11:18:11,014 INFO L231 Difference]: Finished difference. Result has 161 places, 191 transitions, 3107 flow [2024-06-14 11:18:11,014 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=2893, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=85, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3107, PETRI_PLACES=161, PETRI_TRANSITIONS=191} [2024-06-14 11:18:11,015 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 110 predicate places. [2024-06-14 11:18:11,015 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 191 transitions, 3107 flow [2024-06-14 11:18:11,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.166666666666668) internal successors, (163), 6 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:11,015 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:18:11,015 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:18:11,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-14 11:18:11,016 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-14 11:18:11,017 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:18:11,017 INFO L85 PathProgramCache]: Analyzing trace with hash -349202066, now seen corresponding path program 4 times [2024-06-14 11:18:11,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:18:11,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24158261] [2024-06-14 11:18:11,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:18:11,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:18:11,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:18:11,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 11:18:11,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:18:11,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24158261] [2024-06-14 11:18:11,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24158261] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:18:11,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:18:11,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 11:18:11,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667041336] [2024-06-14 11:18:11,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:18:11,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-14 11:18:11,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:18:11,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-14 11:18:11,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-14 11:18:11,055 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 54 [2024-06-14 11:18:11,055 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 191 transitions, 3107 flow. Second operand has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:11,055 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:18:11,055 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 54 [2024-06-14 11:18:11,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:18:11,274 INFO L124 PetriNetUnfolderBase]: 831/1980 cut-off events. [2024-06-14 11:18:11,275 INFO L125 PetriNetUnfolderBase]: For 41095/41301 co-relation queries the response was YES. [2024-06-14 11:18:11,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11329 conditions, 1980 events. 831/1980 cut-off events. For 41095/41301 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 14431 event pairs, 179 based on Foata normal form. 105/1912 useless extension candidates. Maximal degree in co-relation 10256. Up to 402 conditions per place. [2024-06-14 11:18:11,292 INFO L140 encePairwiseOnDemand]: 47/54 looper letters, 34 selfloop transitions, 51 changer transitions 0/169 dead transitions. [2024-06-14 11:18:11,292 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 169 transitions, 2780 flow [2024-06-14 11:18:11,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 11:18:11,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 11:18:11,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 193 transitions. [2024-06-14 11:18:11,296 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7148148148148148 [2024-06-14 11:18:11,296 INFO L175 Difference]: Start difference. First operand has 161 places, 191 transitions, 3107 flow. Second operand 5 states and 193 transitions. [2024-06-14 11:18:11,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 169 transitions, 2780 flow [2024-06-14 11:18:11,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 169 transitions, 2336 flow, removed 12 selfloop flow, removed 18 redundant places. [2024-06-14 11:18:11,358 INFO L231 Difference]: Finished difference. Result has 149 places, 160 transitions, 2270 flow [2024-06-14 11:18:11,359 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=2008, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2270, PETRI_PLACES=149, PETRI_TRANSITIONS=160} [2024-06-14 11:18:11,359 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 98 predicate places. [2024-06-14 11:18:11,359 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 160 transitions, 2270 flow [2024-06-14 11:18:11,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:11,359 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:18:11,360 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:18:11,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-14 11:18:11,360 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-14 11:18:11,360 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:18:11,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1788043629, now seen corresponding path program 1 times [2024-06-14 11:18:11,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:18:11,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732348860] [2024-06-14 11:18:11,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:18:11,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:18:11,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:18:11,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 11:18:11,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:18:11,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732348860] [2024-06-14 11:18:11,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732348860] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:18:11,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:18:11,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-14 11:18:11,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586111489] [2024-06-14 11:18:11,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:18:11,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-14 11:18:11,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:18:11,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-14 11:18:11,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-14 11:18:11,392 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 54 [2024-06-14 11:18:11,393 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 160 transitions, 2270 flow. Second operand has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:11,393 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:18:11,393 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 54 [2024-06-14 11:18:11,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:18:11,553 INFO L124 PetriNetUnfolderBase]: 642/1513 cut-off events. [2024-06-14 11:18:11,554 INFO L125 PetriNetUnfolderBase]: For 22623/22752 co-relation queries the response was YES. [2024-06-14 11:18:11,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7767 conditions, 1513 events. 642/1513 cut-off events. For 22623/22752 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 10096 event pairs, 91 based on Foata normal form. 71/1462 useless extension candidates. Maximal degree in co-relation 7213. Up to 245 conditions per place. [2024-06-14 11:18:11,565 INFO L140 encePairwiseOnDemand]: 46/54 looper letters, 39 selfloop transitions, 47 changer transitions 0/169 dead transitions. [2024-06-14 11:18:11,565 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 169 transitions, 2393 flow [2024-06-14 11:18:11,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 11:18:11,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 11:18:11,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 194 transitions. [2024-06-14 11:18:11,567 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7185185185185186 [2024-06-14 11:18:11,567 INFO L175 Difference]: Start difference. First operand has 149 places, 160 transitions, 2270 flow. Second operand 5 states and 194 transitions. [2024-06-14 11:18:11,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 169 transitions, 2393 flow [2024-06-14 11:18:11,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 169 transitions, 2363 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-06-14 11:18:11,607 INFO L231 Difference]: Finished difference. Result has 152 places, 155 transitions, 2286 flow [2024-06-14 11:18:11,607 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=2066, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2286, PETRI_PLACES=152, PETRI_TRANSITIONS=155} [2024-06-14 11:18:11,607 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 101 predicate places. [2024-06-14 11:18:11,608 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 155 transitions, 2286 flow [2024-06-14 11:18:11,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:11,608 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:18:11,608 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:18:11,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-14 11:18:11,608 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-14 11:18:11,609 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:18:11,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1495724142, now seen corresponding path program 1 times [2024-06-14 11:18:11,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:18:11,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226214136] [2024-06-14 11:18:11,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:18:11,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:18:11,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:18:11,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 11:18:11,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:18:11,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226214136] [2024-06-14 11:18:11,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226214136] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:18:11,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:18:11,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 11:18:11,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415989766] [2024-06-14 11:18:11,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:18:11,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 11:18:11,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:18:11,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 11:18:11,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-14 11:18:11,731 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 54 [2024-06-14 11:18:11,732 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 155 transitions, 2286 flow. Second operand has 6 states, 6 states have (on average 27.333333333333332) internal successors, (164), 6 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:11,732 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:18:11,732 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 54 [2024-06-14 11:18:11,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:18:11,929 INFO L124 PetriNetUnfolderBase]: 711/1584 cut-off events. [2024-06-14 11:18:11,929 INFO L125 PetriNetUnfolderBase]: For 34472/34743 co-relation queries the response was YES. [2024-06-14 11:18:11,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9377 conditions, 1584 events. 711/1584 cut-off events. For 34472/34743 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 10344 event pairs, 139 based on Foata normal form. 59/1546 useless extension candidates. Maximal degree in co-relation 7826. Up to 387 conditions per place. [2024-06-14 11:18:11,942 INFO L140 encePairwiseOnDemand]: 46/54 looper letters, 120 selfloop transitions, 32 changer transitions 1/180 dead transitions. [2024-06-14 11:18:11,942 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 180 transitions, 2776 flow [2024-06-14 11:18:11,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 11:18:11,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 11:18:11,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 212 transitions. [2024-06-14 11:18:11,943 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.654320987654321 [2024-06-14 11:18:11,943 INFO L175 Difference]: Start difference. First operand has 152 places, 155 transitions, 2286 flow. Second operand 6 states and 212 transitions. [2024-06-14 11:18:11,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 180 transitions, 2776 flow [2024-06-14 11:18:11,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 180 transitions, 2741 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-06-14 11:18:11,990 INFO L231 Difference]: Finished difference. Result has 158 places, 157 transitions, 2358 flow [2024-06-14 11:18:11,990 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=2251, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2358, PETRI_PLACES=158, PETRI_TRANSITIONS=157} [2024-06-14 11:18:11,991 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 107 predicate places. [2024-06-14 11:18:11,991 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 157 transitions, 2358 flow [2024-06-14 11:18:11,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.333333333333332) internal successors, (164), 6 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:11,992 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:18:11,992 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:18:11,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-14 11:18:11,993 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-14 11:18:11,993 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:18:11,993 INFO L85 PathProgramCache]: Analyzing trace with hash -475060654, now seen corresponding path program 2 times [2024-06-14 11:18:11,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:18:11,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087146164] [2024-06-14 11:18:11,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:18:11,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:18:12,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:18:12,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 11:18:12,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:18:12,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087146164] [2024-06-14 11:18:12,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087146164] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:18:12,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:18:12,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 11:18:12,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380756839] [2024-06-14 11:18:12,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:18:12,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 11:18:12,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:18:12,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 11:18:12,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-14 11:18:12,107 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 54 [2024-06-14 11:18:12,107 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 157 transitions, 2358 flow. Second operand has 6 states, 6 states have (on average 27.333333333333332) internal successors, (164), 6 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:12,107 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:18:12,108 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 54 [2024-06-14 11:18:12,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:18:12,308 INFO L124 PetriNetUnfolderBase]: 723/1619 cut-off events. [2024-06-14 11:18:12,308 INFO L125 PetriNetUnfolderBase]: For 37827/38084 co-relation queries the response was YES. [2024-06-14 11:18:12,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9797 conditions, 1619 events. 723/1619 cut-off events. For 37827/38084 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 10716 event pairs, 137 based on Foata normal form. 64/1583 useless extension candidates. Maximal degree in co-relation 8212. Up to 387 conditions per place. [2024-06-14 11:18:12,320 INFO L140 encePairwiseOnDemand]: 45/54 looper letters, 121 selfloop transitions, 29 changer transitions 1/178 dead transitions. [2024-06-14 11:18:12,320 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 178 transitions, 2820 flow [2024-06-14 11:18:12,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 11:18:12,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 11:18:12,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 209 transitions. [2024-06-14 11:18:12,322 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6450617283950617 [2024-06-14 11:18:12,323 INFO L175 Difference]: Start difference. First operand has 158 places, 157 transitions, 2358 flow. Second operand 6 states and 209 transitions. [2024-06-14 11:18:12,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 178 transitions, 2820 flow [2024-06-14 11:18:12,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 178 transitions, 2745 flow, removed 7 selfloop flow, removed 3 redundant places. [2024-06-14 11:18:12,375 INFO L231 Difference]: Finished difference. Result has 161 places, 159 transitions, 2390 flow [2024-06-14 11:18:12,376 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=2287, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2390, PETRI_PLACES=161, PETRI_TRANSITIONS=159} [2024-06-14 11:18:12,377 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 110 predicate places. [2024-06-14 11:18:12,377 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 159 transitions, 2390 flow [2024-06-14 11:18:12,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.333333333333332) internal successors, (164), 6 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:12,377 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:18:12,377 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:18:12,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-14 11:18:12,377 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-14 11:18:12,378 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:18:12,378 INFO L85 PathProgramCache]: Analyzing trace with hash 103384466, now seen corresponding path program 3 times [2024-06-14 11:18:12,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:18:12,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995000673] [2024-06-14 11:18:12,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:18:12,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:18:12,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:18:12,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 11:18:12,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:18:12,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995000673] [2024-06-14 11:18:12,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995000673] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:18:12,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:18:12,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 11:18:12,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431146547] [2024-06-14 11:18:12,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:18:12,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 11:18:12,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:18:12,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 11:18:12,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-14 11:18:12,504 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 54 [2024-06-14 11:18:12,505 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 159 transitions, 2390 flow. Second operand has 6 states, 6 states have (on average 27.333333333333332) internal successors, (164), 6 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:12,505 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:18:12,505 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 54 [2024-06-14 11:18:12,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:18:12,685 INFO L124 PetriNetUnfolderBase]: 703/1598 cut-off events. [2024-06-14 11:18:12,685 INFO L125 PetriNetUnfolderBase]: For 36676/36839 co-relation queries the response was YES. [2024-06-14 11:18:12,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9466 conditions, 1598 events. 703/1598 cut-off events. For 36676/36839 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 10487 event pairs, 145 based on Foata normal form. 70/1589 useless extension candidates. Maximal degree in co-relation 7870. Up to 417 conditions per place. [2024-06-14 11:18:12,697 INFO L140 encePairwiseOnDemand]: 45/54 looper letters, 97 selfloop transitions, 49 changer transitions 1/174 dead transitions. [2024-06-14 11:18:12,697 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 174 transitions, 2797 flow [2024-06-14 11:18:12,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 11:18:12,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 11:18:12,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 206 transitions. [2024-06-14 11:18:12,698 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6358024691358025 [2024-06-14 11:18:12,699 INFO L175 Difference]: Start difference. First operand has 161 places, 159 transitions, 2390 flow. Second operand 6 states and 206 transitions. [2024-06-14 11:18:12,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 174 transitions, 2797 flow [2024-06-14 11:18:12,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 174 transitions, 2734 flow, removed 8 selfloop flow, removed 4 redundant places. [2024-06-14 11:18:12,754 INFO L231 Difference]: Finished difference. Result has 163 places, 159 transitions, 2433 flow [2024-06-14 11:18:12,754 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=2327, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2433, PETRI_PLACES=163, PETRI_TRANSITIONS=159} [2024-06-14 11:18:12,754 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 112 predicate places. [2024-06-14 11:18:12,755 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 159 transitions, 2433 flow [2024-06-14 11:18:12,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.333333333333332) internal successors, (164), 6 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:12,755 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:18:12,755 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:18:12,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-14 11:18:12,755 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 11:18:12,756 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:18:12,756 INFO L85 PathProgramCache]: Analyzing trace with hash 195643194, now seen corresponding path program 1 times [2024-06-14 11:18:12,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:18:12,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743898578] [2024-06-14 11:18:12,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:18:12,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:18:12,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:18:12,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 11:18:12,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:18:12,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743898578] [2024-06-14 11:18:12,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743898578] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:18:12,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:18:12,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 11:18:12,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593614043] [2024-06-14 11:18:12,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:18:12,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 11:18:12,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:18:12,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 11:18:12,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-14 11:18:12,856 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 54 [2024-06-14 11:18:12,857 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 159 transitions, 2433 flow. Second operand has 6 states, 6 states have (on average 27.333333333333332) internal successors, (164), 6 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:12,857 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:18:12,857 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 54 [2024-06-14 11:18:12,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:18:13,061 INFO L124 PetriNetUnfolderBase]: 708/1625 cut-off events. [2024-06-14 11:18:13,061 INFO L125 PetriNetUnfolderBase]: For 39555/39708 co-relation queries the response was YES. [2024-06-14 11:18:13,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9727 conditions, 1625 events. 708/1625 cut-off events. For 39555/39708 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 10860 event pairs, 222 based on Foata normal form. 52/1591 useless extension candidates. Maximal degree in co-relation 9108. Up to 607 conditions per place. [2024-06-14 11:18:13,073 INFO L140 encePairwiseOnDemand]: 45/54 looper letters, 95 selfloop transitions, 50 changer transitions 0/172 dead transitions. [2024-06-14 11:18:13,074 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 172 transitions, 2822 flow [2024-06-14 11:18:13,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 11:18:13,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 11:18:13,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 200 transitions. [2024-06-14 11:18:13,075 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6172839506172839 [2024-06-14 11:18:13,075 INFO L175 Difference]: Start difference. First operand has 163 places, 159 transitions, 2433 flow. Second operand 6 states and 200 transitions. [2024-06-14 11:18:13,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 172 transitions, 2822 flow [2024-06-14 11:18:13,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 172 transitions, 2701 flow, removed 8 selfloop flow, removed 5 redundant places. [2024-06-14 11:18:13,131 INFO L231 Difference]: Finished difference. Result has 164 places, 161 transitions, 2453 flow [2024-06-14 11:18:13,131 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=2314, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2453, PETRI_PLACES=164, PETRI_TRANSITIONS=161} [2024-06-14 11:18:13,131 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 113 predicate places. [2024-06-14 11:18:13,131 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 161 transitions, 2453 flow [2024-06-14 11:18:13,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.333333333333332) internal successors, (164), 6 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:13,132 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:18:13,132 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:18:13,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-14 11:18:13,132 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-14 11:18:13,132 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:18:13,132 INFO L85 PathProgramCache]: Analyzing trace with hash 559775702, now seen corresponding path program 2 times [2024-06-14 11:18:13,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:18:13,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015610028] [2024-06-14 11:18:13,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:18:13,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:18:13,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:18:13,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 11:18:13,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:18:13,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015610028] [2024-06-14 11:18:13,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015610028] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:18:13,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:18:13,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 11:18:13,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341205323] [2024-06-14 11:18:13,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:18:13,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 11:18:13,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:18:13,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 11:18:13,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-14 11:18:13,230 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 54 [2024-06-14 11:18:13,230 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 161 transitions, 2453 flow. Second operand has 6 states, 6 states have (on average 27.333333333333332) internal successors, (164), 6 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:13,231 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:18:13,231 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 54 [2024-06-14 11:18:13,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:18:13,423 INFO L124 PetriNetUnfolderBase]: 737/1669 cut-off events. [2024-06-14 11:18:13,424 INFO L125 PetriNetUnfolderBase]: For 41482/41742 co-relation queries the response was YES. [2024-06-14 11:18:13,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10112 conditions, 1669 events. 737/1669 cut-off events. For 41482/41742 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 11188 event pairs, 200 based on Foata normal form. 48/1610 useless extension candidates. Maximal degree in co-relation 8179. Up to 719 conditions per place. [2024-06-14 11:18:13,437 INFO L140 encePairwiseOnDemand]: 46/54 looper letters, 117 selfloop transitions, 30 changer transitions 1/175 dead transitions. [2024-06-14 11:18:13,437 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 175 transitions, 2897 flow [2024-06-14 11:18:13,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 11:18:13,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 11:18:13,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 201 transitions. [2024-06-14 11:18:13,438 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6203703703703703 [2024-06-14 11:18:13,438 INFO L175 Difference]: Start difference. First operand has 164 places, 161 transitions, 2453 flow. Second operand 6 states and 201 transitions. [2024-06-14 11:18:13,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 175 transitions, 2897 flow [2024-06-14 11:18:13,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 175 transitions, 2836 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-06-14 11:18:13,506 INFO L231 Difference]: Finished difference. Result has 167 places, 163 transitions, 2493 flow [2024-06-14 11:18:13,506 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=2393, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2493, PETRI_PLACES=167, PETRI_TRANSITIONS=163} [2024-06-14 11:18:13,507 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 116 predicate places. [2024-06-14 11:18:13,507 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 163 transitions, 2493 flow [2024-06-14 11:18:13,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.333333333333332) internal successors, (164), 6 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:13,507 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:18:13,507 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:18:13,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-14 11:18:13,508 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-14 11:18:13,508 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:18:13,508 INFO L85 PathProgramCache]: Analyzing trace with hash 550726822, now seen corresponding path program 3 times [2024-06-14 11:18:13,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:18:13,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951421549] [2024-06-14 11:18:13,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:18:13,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:18:13,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:18:13,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 11:18:13,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:18:13,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951421549] [2024-06-14 11:18:13,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951421549] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:18:13,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:18:13,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 11:18:13,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838584213] [2024-06-14 11:18:13,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:18:13,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 11:18:13,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:18:13,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 11:18:13,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-14 11:18:13,631 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 54 [2024-06-14 11:18:13,631 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 163 transitions, 2493 flow. Second operand has 6 states, 6 states have (on average 27.333333333333332) internal successors, (164), 6 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:13,631 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:18:13,632 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 54 [2024-06-14 11:18:13,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:18:13,861 INFO L124 PetriNetUnfolderBase]: 731/1659 cut-off events. [2024-06-14 11:18:13,861 INFO L125 PetriNetUnfolderBase]: For 41804/42065 co-relation queries the response was YES. [2024-06-14 11:18:13,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9998 conditions, 1659 events. 731/1659 cut-off events. For 41804/42065 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 11068 event pairs, 195 based on Foata normal form. 62/1614 useless extension candidates. Maximal degree in co-relation 8196. Up to 717 conditions per place. [2024-06-14 11:18:13,874 INFO L140 encePairwiseOnDemand]: 46/54 looper letters, 120 selfloop transitions, 30 changer transitions 2/179 dead transitions. [2024-06-14 11:18:13,874 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 179 transitions, 2969 flow [2024-06-14 11:18:13,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 11:18:13,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 11:18:13,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 205 transitions. [2024-06-14 11:18:13,876 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6327160493827161 [2024-06-14 11:18:13,876 INFO L175 Difference]: Start difference. First operand has 167 places, 163 transitions, 2493 flow. Second operand 6 states and 205 transitions. [2024-06-14 11:18:13,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 179 transitions, 2969 flow [2024-06-14 11:18:13,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 179 transitions, 2866 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-06-14 11:18:13,937 INFO L231 Difference]: Finished difference. Result has 168 places, 163 transitions, 2456 flow [2024-06-14 11:18:13,937 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=2390, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2456, PETRI_PLACES=168, PETRI_TRANSITIONS=163} [2024-06-14 11:18:13,940 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 117 predicate places. [2024-06-14 11:18:13,940 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 163 transitions, 2456 flow [2024-06-14 11:18:13,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.333333333333332) internal successors, (164), 6 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:13,940 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:18:13,940 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:18:13,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-14 11:18:13,941 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-14 11:18:13,941 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:18:13,941 INFO L85 PathProgramCache]: Analyzing trace with hash 550428292, now seen corresponding path program 4 times [2024-06-14 11:18:13,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:18:13,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961553924] [2024-06-14 11:18:13,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:18:13,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:18:13,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:18:14,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 11:18:14,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:18:14,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961553924] [2024-06-14 11:18:14,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961553924] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:18:14,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:18:14,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 11:18:14,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700800023] [2024-06-14 11:18:14,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:18:14,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 11:18:14,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:18:14,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 11:18:14,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-14 11:18:14,047 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 54 [2024-06-14 11:18:14,049 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 163 transitions, 2456 flow. Second operand has 6 states, 6 states have (on average 27.333333333333332) internal successors, (164), 6 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:14,049 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:18:14,049 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 54 [2024-06-14 11:18:14,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:18:14,285 INFO L124 PetriNetUnfolderBase]: 728/1658 cut-off events. [2024-06-14 11:18:14,285 INFO L125 PetriNetUnfolderBase]: For 40686/40937 co-relation queries the response was YES. [2024-06-14 11:18:14,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9885 conditions, 1658 events. 728/1658 cut-off events. For 40686/40937 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 11100 event pairs, 195 based on Foata normal form. 67/1618 useless extension candidates. Maximal degree in co-relation 8111. Up to 717 conditions per place. [2024-06-14 11:18:14,300 INFO L140 encePairwiseOnDemand]: 47/54 looper letters, 117 selfloop transitions, 34 changer transitions 3/181 dead transitions. [2024-06-14 11:18:14,300 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 181 transitions, 2947 flow [2024-06-14 11:18:14,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 11:18:14,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 11:18:14,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 206 transitions. [2024-06-14 11:18:14,301 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6358024691358025 [2024-06-14 11:18:14,302 INFO L175 Difference]: Start difference. First operand has 168 places, 163 transitions, 2456 flow. Second operand 6 states and 206 transitions. [2024-06-14 11:18:14,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 181 transitions, 2947 flow [2024-06-14 11:18:14,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 181 transitions, 2849 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-06-14 11:18:14,376 INFO L231 Difference]: Finished difference. Result has 170 places, 163 transitions, 2432 flow [2024-06-14 11:18:14,376 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=2358, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2432, PETRI_PLACES=170, PETRI_TRANSITIONS=163} [2024-06-14 11:18:14,377 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 119 predicate places. [2024-06-14 11:18:14,378 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 163 transitions, 2432 flow [2024-06-14 11:18:14,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.333333333333332) internal successors, (164), 6 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:14,378 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:18:14,378 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:18:14,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-14 11:18:14,378 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-14 11:18:14,379 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:18:14,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1124619527, now seen corresponding path program 1 times [2024-06-14 11:18:14,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:18:14,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002830090] [2024-06-14 11:18:14,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:18:14,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:18:14,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:18:14,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 11:18:14,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:18:14,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002830090] [2024-06-14 11:18:14,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002830090] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:18:14,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:18:14,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-14 11:18:14,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623661326] [2024-06-14 11:18:14,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:18:14,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-14 11:18:14,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:18:14,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-14 11:18:14,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-14 11:18:14,416 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 54 [2024-06-14 11:18:14,416 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 163 transitions, 2432 flow. Second operand has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:14,416 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:18:14,416 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 54 [2024-06-14 11:18:14,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:18:14,572 INFO L124 PetriNetUnfolderBase]: 443/1102 cut-off events. [2024-06-14 11:18:14,572 INFO L125 PetriNetUnfolderBase]: For 16674/16696 co-relation queries the response was YES. [2024-06-14 11:18:14,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5513 conditions, 1102 events. 443/1102 cut-off events. For 16674/16696 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 7233 event pairs, 77 based on Foata normal form. 12/1015 useless extension candidates. Maximal degree in co-relation 4459. Up to 415 conditions per place. [2024-06-14 11:18:14,581 INFO L140 encePairwiseOnDemand]: 46/54 looper letters, 44 selfloop transitions, 16 changer transitions 0/143 dead transitions. [2024-06-14 11:18:14,581 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 143 transitions, 1921 flow [2024-06-14 11:18:14,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 11:18:14,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 11:18:14,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 185 transitions. [2024-06-14 11:18:14,583 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6851851851851852 [2024-06-14 11:18:14,583 INFO L175 Difference]: Start difference. First operand has 170 places, 163 transitions, 2432 flow. Second operand 5 states and 185 transitions. [2024-06-14 11:18:14,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 143 transitions, 1921 flow [2024-06-14 11:18:14,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 143 transitions, 1643 flow, removed 1 selfloop flow, removed 18 redundant places. [2024-06-14 11:18:14,626 INFO L231 Difference]: Finished difference. Result has 160 places, 132 transitions, 1562 flow [2024-06-14 11:18:14,626 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=1472, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1562, PETRI_PLACES=160, PETRI_TRANSITIONS=132} [2024-06-14 11:18:14,627 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 109 predicate places. [2024-06-14 11:18:14,627 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 132 transitions, 1562 flow [2024-06-14 11:18:14,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:14,627 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:18:14,628 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:18:14,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-14 11:18:14,628 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-14 11:18:14,628 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:18:14,628 INFO L85 PathProgramCache]: Analyzing trace with hash 879833716, now seen corresponding path program 1 times [2024-06-14 11:18:14,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:18:14,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256004798] [2024-06-14 11:18:14,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:18:14,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:18:14,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:18:14,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 11:18:14,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:18:14,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256004798] [2024-06-14 11:18:14,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256004798] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:18:14,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:18:14,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-14 11:18:14,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419974618] [2024-06-14 11:18:14,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:18:14,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 11:18:14,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:18:14,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 11:18:14,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-14 11:18:14,730 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 54 [2024-06-14 11:18:14,731 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 132 transitions, 1562 flow. Second operand has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 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-14 11:18:14,731 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:18:14,731 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 54 [2024-06-14 11:18:14,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:18:14,894 INFO L124 PetriNetUnfolderBase]: 433/1051 cut-off events. [2024-06-14 11:18:14,895 INFO L125 PetriNetUnfolderBase]: For 19091/19187 co-relation queries the response was YES. [2024-06-14 11:18:14,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5123 conditions, 1051 events. 433/1051 cut-off events. For 19091/19187 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 6616 event pairs, 84 based on Foata normal form. 40/1051 useless extension candidates. Maximal degree in co-relation 4884. Up to 592 conditions per place. [2024-06-14 11:18:14,903 INFO L140 encePairwiseOnDemand]: 47/54 looper letters, 89 selfloop transitions, 23 changer transitions 0/142 dead transitions. [2024-06-14 11:18:14,903 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 142 transitions, 1810 flow [2024-06-14 11:18:14,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 11:18:14,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 11:18:14,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 173 transitions. [2024-06-14 11:18:14,904 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6407407407407407 [2024-06-14 11:18:14,904 INFO L175 Difference]: Start difference. First operand has 160 places, 132 transitions, 1562 flow. Second operand 5 states and 173 transitions. [2024-06-14 11:18:14,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 142 transitions, 1810 flow [2024-06-14 11:18:14,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 142 transitions, 1810 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-06-14 11:18:14,948 INFO L231 Difference]: Finished difference. Result has 165 places, 132 transitions, 1624 flow [2024-06-14 11:18:14,948 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=1562, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1624, PETRI_PLACES=165, PETRI_TRANSITIONS=132} [2024-06-14 11:18:14,948 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 114 predicate places. [2024-06-14 11:18:14,948 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 132 transitions, 1624 flow [2024-06-14 11:18:14,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 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-14 11:18:14,949 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:18:14,949 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:18:14,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-14 11:18:14,949 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-14 11:18:14,950 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:18:14,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1100776558, now seen corresponding path program 1 times [2024-06-14 11:18:14,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:18:14,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475282942] [2024-06-14 11:18:14,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:18:14,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:18:14,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:18:15,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 11:18:15,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:18:15,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475282942] [2024-06-14 11:18:15,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475282942] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:18:15,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:18:15,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 11:18:15,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645240600] [2024-06-14 11:18:15,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:18:15,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 11:18:15,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:18:15,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 11:18:15,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-14 11:18:15,075 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 54 [2024-06-14 11:18:15,076 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 132 transitions, 1624 flow. Second operand has 6 states, 6 states have (on average 27.5) internal successors, (165), 6 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:15,076 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:18:15,076 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 54 [2024-06-14 11:18:15,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:18:15,233 INFO L124 PetriNetUnfolderBase]: 434/1053 cut-off events. [2024-06-14 11:18:15,233 INFO L125 PetriNetUnfolderBase]: For 18078/18229 co-relation queries the response was YES. [2024-06-14 11:18:15,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5253 conditions, 1053 events. 434/1053 cut-off events. For 18078/18229 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 6646 event pairs, 85 based on Foata normal form. 40/1033 useless extension candidates. Maximal degree in co-relation 4236. Up to 296 conditions per place. [2024-06-14 11:18:15,240 INFO L140 encePairwiseOnDemand]: 44/54 looper letters, 79 selfloop transitions, 32 changer transitions 9/150 dead transitions. [2024-06-14 11:18:15,241 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 150 transitions, 1958 flow [2024-06-14 11:18:15,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 11:18:15,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 11:18:15,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 210 transitions. [2024-06-14 11:18:15,242 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6481481481481481 [2024-06-14 11:18:15,242 INFO L175 Difference]: Start difference. First operand has 165 places, 132 transitions, 1624 flow. Second operand 6 states and 210 transitions. [2024-06-14 11:18:15,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 150 transitions, 1958 flow [2024-06-14 11:18:15,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 150 transitions, 1880 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-14 11:18:15,285 INFO L231 Difference]: Finished difference. Result has 166 places, 130 transitions, 1584 flow [2024-06-14 11:18:15,286 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=1546, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1584, PETRI_PLACES=166, PETRI_TRANSITIONS=130} [2024-06-14 11:18:15,287 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 115 predicate places. [2024-06-14 11:18:15,287 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 130 transitions, 1584 flow [2024-06-14 11:18:15,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.5) internal successors, (165), 6 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:15,287 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:18:15,287 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:18:15,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-14 11:18:15,288 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-14 11:18:15,288 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:18:15,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1266714352, now seen corresponding path program 2 times [2024-06-14 11:18:15,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:18:15,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610891756] [2024-06-14 11:18:15,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:18:15,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:18:15,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:18:15,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 11:18:15,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:18:15,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610891756] [2024-06-14 11:18:15,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610891756] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:18:15,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:18:15,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 11:18:15,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688270786] [2024-06-14 11:18:15,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:18:15,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 11:18:15,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:18:15,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 11:18:15,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-14 11:18:15,410 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 54 [2024-06-14 11:18:15,411 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 130 transitions, 1584 flow. Second operand has 6 states, 6 states have (on average 27.5) internal successors, (165), 6 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:15,411 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:18:15,411 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 54 [2024-06-14 11:18:15,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:18:15,557 INFO L124 PetriNetUnfolderBase]: 431/1056 cut-off events. [2024-06-14 11:18:15,557 INFO L125 PetriNetUnfolderBase]: For 19161/19312 co-relation queries the response was YES. [2024-06-14 11:18:15,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5342 conditions, 1056 events. 431/1056 cut-off events. For 19161/19312 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 6698 event pairs, 84 based on Foata normal form. 38/1037 useless extension candidates. Maximal degree in co-relation 4248. Up to 480 conditions per place. [2024-06-14 11:18:15,564 INFO L140 encePairwiseOnDemand]: 45/54 looper letters, 91 selfloop transitions, 21 changer transitions 4/146 dead transitions. [2024-06-14 11:18:15,565 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 146 transitions, 1876 flow [2024-06-14 11:18:15,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 11:18:15,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 11:18:15,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 208 transitions. [2024-06-14 11:18:15,566 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6419753086419753 [2024-06-14 11:18:15,566 INFO L175 Difference]: Start difference. First operand has 166 places, 130 transitions, 1584 flow. Second operand 6 states and 208 transitions. [2024-06-14 11:18:15,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 146 transitions, 1876 flow [2024-06-14 11:18:15,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 146 transitions, 1803 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-06-14 11:18:15,612 INFO L231 Difference]: Finished difference. Result has 167 places, 130 transitions, 1566 flow [2024-06-14 11:18:15,612 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=1511, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1566, PETRI_PLACES=167, PETRI_TRANSITIONS=130} [2024-06-14 11:18:15,613 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 116 predicate places. [2024-06-14 11:18:15,613 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 130 transitions, 1566 flow [2024-06-14 11:18:15,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.5) internal successors, (165), 6 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:15,613 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:18:15,613 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:18:15,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-14 11:18:15,614 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-14 11:18:15,614 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:18:15,614 INFO L85 PathProgramCache]: Analyzing trace with hash 568264784, now seen corresponding path program 3 times [2024-06-14 11:18:15,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:18:15,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256685877] [2024-06-14 11:18:15,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:18:15,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:18:15,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:18:15,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 11:18:15,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:18:15,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256685877] [2024-06-14 11:18:15,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256685877] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:18:15,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:18:15,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 11:18:15,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442422044] [2024-06-14 11:18:15,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:18:15,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 11:18:15,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:18:15,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 11:18:15,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-14 11:18:15,731 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 54 [2024-06-14 11:18:15,732 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 130 transitions, 1566 flow. Second operand has 6 states, 6 states have (on average 27.5) internal successors, (165), 6 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:15,732 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:18:15,732 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 54 [2024-06-14 11:18:15,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:18:15,865 INFO L124 PetriNetUnfolderBase]: 410/1033 cut-off events. [2024-06-14 11:18:15,865 INFO L125 PetriNetUnfolderBase]: For 17563/17645 co-relation queries the response was YES. [2024-06-14 11:18:15,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5015 conditions, 1033 events. 410/1033 cut-off events. For 17563/17645 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 6629 event pairs, 148 based on Foata normal form. 51/1036 useless extension candidates. Maximal degree in co-relation 3975. Up to 452 conditions per place. [2024-06-14 11:18:15,872 INFO L140 encePairwiseOnDemand]: 43/54 looper letters, 55 selfloop transitions, 51 changer transitions 9/145 dead transitions. [2024-06-14 11:18:15,872 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 145 transitions, 1897 flow [2024-06-14 11:18:15,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 11:18:15,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 11:18:15,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 205 transitions. [2024-06-14 11:18:15,873 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6327160493827161 [2024-06-14 11:18:15,873 INFO L175 Difference]: Start difference. First operand has 167 places, 130 transitions, 1566 flow. Second operand 6 states and 205 transitions. [2024-06-14 11:18:15,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 145 transitions, 1897 flow [2024-06-14 11:18:15,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 145 transitions, 1855 flow, removed 1 selfloop flow, removed 4 redundant places. [2024-06-14 11:18:15,918 INFO L231 Difference]: Finished difference. Result has 169 places, 126 transitions, 1577 flow [2024-06-14 11:18:15,918 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=1524, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1577, PETRI_PLACES=169, PETRI_TRANSITIONS=126} [2024-06-14 11:18:15,919 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 118 predicate places. [2024-06-14 11:18:15,919 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 126 transitions, 1577 flow [2024-06-14 11:18:15,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.5) internal successors, (165), 6 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:15,919 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:18:15,919 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:18:15,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-14 11:18:15,920 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-14 11:18:15,920 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:18:15,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1738609216, now seen corresponding path program 1 times [2024-06-14 11:18:15,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:18:15,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641662995] [2024-06-14 11:18:15,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:18:15,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:18:15,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:18:15,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 11:18:15,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:18:15,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641662995] [2024-06-14 11:18:15,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641662995] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:18:15,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:18:15,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 11:18:15,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634266602] [2024-06-14 11:18:15,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:18:15,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 11:18:15,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:18:15,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 11:18:15,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-14 11:18:16,035 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 54 [2024-06-14 11:18:16,036 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 126 transitions, 1577 flow. Second operand has 6 states, 6 states have (on average 27.5) internal successors, (165), 6 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:16,036 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:18:16,036 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 54 [2024-06-14 11:18:16,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:18:16,166 INFO L124 PetriNetUnfolderBase]: 411/1021 cut-off events. [2024-06-14 11:18:16,166 INFO L125 PetriNetUnfolderBase]: For 19459/19546 co-relation queries the response was YES. [2024-06-14 11:18:16,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5229 conditions, 1021 events. 411/1021 cut-off events. For 19459/19546 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 6393 event pairs, 105 based on Foata normal form. 54/1033 useless extension candidates. Maximal degree in co-relation 5039. Up to 326 conditions per place. [2024-06-14 11:18:16,172 INFO L140 encePairwiseOnDemand]: 43/54 looper letters, 73 selfloop transitions, 39 changer transitions 8/150 dead transitions. [2024-06-14 11:18:16,173 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 150 transitions, 2103 flow [2024-06-14 11:18:16,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 11:18:16,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 11:18:16,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 214 transitions. [2024-06-14 11:18:16,174 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6604938271604939 [2024-06-14 11:18:16,174 INFO L175 Difference]: Start difference. First operand has 169 places, 126 transitions, 1577 flow. Second operand 6 states and 214 transitions. [2024-06-14 11:18:16,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 150 transitions, 2103 flow [2024-06-14 11:18:16,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 150 transitions, 1962 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-14 11:18:16,218 INFO L231 Difference]: Finished difference. Result has 170 places, 124 transitions, 1514 flow [2024-06-14 11:18:16,218 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=1445, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1514, PETRI_PLACES=170, PETRI_TRANSITIONS=124} [2024-06-14 11:18:16,219 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 119 predicate places. [2024-06-14 11:18:16,219 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 124 transitions, 1514 flow [2024-06-14 11:18:16,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.5) internal successors, (165), 6 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:16,219 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:18:16,219 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:18:16,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-14 11:18:16,220 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-14 11:18:16,220 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:18:16,220 INFO L85 PathProgramCache]: Analyzing trace with hash 2118364084, now seen corresponding path program 2 times [2024-06-14 11:18:16,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:18:16,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213750108] [2024-06-14 11:18:16,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:18:16,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:18:16,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:18:16,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-14 11:18:16,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:18:16,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213750108] [2024-06-14 11:18:16,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213750108] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:18:16,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:18:16,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 11:18:16,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401873000] [2024-06-14 11:18:16,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:18:16,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 11:18:16,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:18:16,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 11:18:16,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-14 11:18:16,338 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 54 [2024-06-14 11:18:16,338 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 124 transitions, 1514 flow. Second operand has 6 states, 6 states have (on average 27.5) internal successors, (165), 6 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:16,339 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:18:16,339 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 54 [2024-06-14 11:18:16,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:18:16,487 INFO L124 PetriNetUnfolderBase]: 409/1021 cut-off events. [2024-06-14 11:18:16,487 INFO L125 PetriNetUnfolderBase]: For 19080/19230 co-relation queries the response was YES. [2024-06-14 11:18:16,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5227 conditions, 1021 events. 409/1021 cut-off events. For 19080/19230 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 6486 event pairs, 88 based on Foata normal form. 40/998 useless extension candidates. Maximal degree in co-relation 4096. Up to 261 conditions per place. [2024-06-14 11:18:16,494 INFO L140 encePairwiseOnDemand]: 44/54 looper letters, 79 selfloop transitions, 27 changer transitions 4/140 dead transitions. [2024-06-14 11:18:16,494 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 140 transitions, 1843 flow [2024-06-14 11:18:16,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 11:18:16,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 11:18:16,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 208 transitions. [2024-06-14 11:18:16,495 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6419753086419753 [2024-06-14 11:18:16,495 INFO L175 Difference]: Start difference. First operand has 170 places, 124 transitions, 1514 flow. Second operand 6 states and 208 transitions. [2024-06-14 11:18:16,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 140 transitions, 1843 flow [2024-06-14 11:18:16,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 140 transitions, 1794 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-06-14 11:18:16,536 INFO L231 Difference]: Finished difference. Result has 173 places, 123 transitions, 1526 flow [2024-06-14 11:18:16,537 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=1467, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1526, PETRI_PLACES=173, PETRI_TRANSITIONS=123} [2024-06-14 11:18:16,537 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 122 predicate places. [2024-06-14 11:18:16,537 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 123 transitions, 1526 flow [2024-06-14 11:18:16,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.5) internal successors, (165), 6 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:16,537 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:18:16,538 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:18:16,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-14 11:18:16,538 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-14 11:18:16,538 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:18:16,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1889715882, now seen corresponding path program 3 times [2024-06-14 11:18:16,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:18:16,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391757976] [2024-06-14 11:18:16,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:18:16,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:18:16,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:18:16,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 11:18:16,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:18:16,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391757976] [2024-06-14 11:18:16,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391757976] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:18:16,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:18:16,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 11:18:16,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198245250] [2024-06-14 11:18:16,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:18:16,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 11:18:16,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:18:16,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 11:18:16,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-14 11:18:16,712 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 54 [2024-06-14 11:18:16,712 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 123 transitions, 1526 flow. Second operand has 6 states, 6 states have (on average 27.5) internal successors, (165), 6 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:16,712 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:18:16,712 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 54 [2024-06-14 11:18:16,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:18:16,877 INFO L124 PetriNetUnfolderBase]: 394/1004 cut-off events. [2024-06-14 11:18:16,878 INFO L125 PetriNetUnfolderBase]: For 19197/19353 co-relation queries the response was YES. [2024-06-14 11:18:16,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5087 conditions, 1004 events. 394/1004 cut-off events. For 19197/19353 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 6346 event pairs, 83 based on Foata normal form. 34/979 useless extension candidates. Maximal degree in co-relation 4282. Up to 456 conditions per place. [2024-06-14 11:18:16,884 INFO L140 encePairwiseOnDemand]: 45/54 looper letters, 83 selfloop transitions, 19 changer transitions 2/134 dead transitions. [2024-06-14 11:18:16,884 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 134 transitions, 1758 flow [2024-06-14 11:18:16,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 11:18:16,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 11:18:16,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 203 transitions. [2024-06-14 11:18:16,886 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6265432098765432 [2024-06-14 11:18:16,886 INFO L175 Difference]: Start difference. First operand has 173 places, 123 transitions, 1526 flow. Second operand 6 states and 203 transitions. [2024-06-14 11:18:16,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 134 transitions, 1758 flow [2024-06-14 11:18:16,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 134 transitions, 1722 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-14 11:18:16,930 INFO L231 Difference]: Finished difference. Result has 176 places, 122 transitions, 1517 flow [2024-06-14 11:18:16,930 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=1490, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1517, PETRI_PLACES=176, PETRI_TRANSITIONS=122} [2024-06-14 11:18:16,931 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 125 predicate places. [2024-06-14 11:18:16,931 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 122 transitions, 1517 flow [2024-06-14 11:18:16,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.5) internal successors, (165), 6 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:16,931 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:18:16,931 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:18:16,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-14 11:18:16,932 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-14 11:18:16,932 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:18:16,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1714860935, now seen corresponding path program 1 times [2024-06-14 11:18:16,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:18:16,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729052919] [2024-06-14 11:18:16,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:18:16,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:18:16,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:18:16,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 11:18:16,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:18:16,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729052919] [2024-06-14 11:18:16,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729052919] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:18:16,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:18:16,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 11:18:16,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22581585] [2024-06-14 11:18:16,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:18:16,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-14 11:18:16,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:18:16,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-14 11:18:16,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-14 11:18:16,971 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 54 [2024-06-14 11:18:16,971 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 122 transitions, 1517 flow. Second operand has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:16,971 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:18:16,971 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 54 [2024-06-14 11:18:16,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:18:17,111 INFO L124 PetriNetUnfolderBase]: 470/1140 cut-off events. [2024-06-14 11:18:17,111 INFO L125 PetriNetUnfolderBase]: For 14627/14646 co-relation queries the response was YES. [2024-06-14 11:18:17,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5224 conditions, 1140 events. 470/1140 cut-off events. For 14627/14646 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 7285 event pairs, 102 based on Foata normal form. 10/1062 useless extension candidates. Maximal degree in co-relation 4628. Up to 338 conditions per place. [2024-06-14 11:18:17,120 INFO L140 encePairwiseOnDemand]: 44/54 looper letters, 39 selfloop transitions, 21 changer transitions 8/144 dead transitions. [2024-06-14 11:18:17,120 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 144 transitions, 1741 flow [2024-06-14 11:18:17,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 11:18:17,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 11:18:17,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 190 transitions. [2024-06-14 11:18:17,121 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7037037037037037 [2024-06-14 11:18:17,121 INFO L175 Difference]: Start difference. First operand has 176 places, 122 transitions, 1517 flow. Second operand 5 states and 190 transitions. [2024-06-14 11:18:17,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 144 transitions, 1741 flow [2024-06-14 11:18:17,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 144 transitions, 1682 flow, removed 1 selfloop flow, removed 5 redundant places. [2024-06-14 11:18:17,168 INFO L231 Difference]: Finished difference. Result has 177 places, 128 transitions, 1522 flow [2024-06-14 11:18:17,168 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=1426, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1522, PETRI_PLACES=177, PETRI_TRANSITIONS=128} [2024-06-14 11:18:17,168 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 126 predicate places. [2024-06-14 11:18:17,169 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 128 transitions, 1522 flow [2024-06-14 11:18:17,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:17,169 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:18:17,169 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:18:17,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-14 11:18:17,169 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-14 11:18:17,170 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:18:17,170 INFO L85 PathProgramCache]: Analyzing trace with hash -953227953, now seen corresponding path program 2 times [2024-06-14 11:18:17,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:18:17,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227192322] [2024-06-14 11:18:17,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:18:17,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:18:17,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:18:17,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 11:18:17,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:18:17,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227192322] [2024-06-14 11:18:17,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227192322] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:18:17,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:18:17,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 11:18:17,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032564597] [2024-06-14 11:18:17,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:18:17,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 11:18:17,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:18:17,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 11:18:17,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-14 11:18:17,281 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 54 [2024-06-14 11:18:17,282 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 128 transitions, 1522 flow. Second operand has 6 states, 6 states have (on average 27.333333333333332) internal successors, (164), 6 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:17,282 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:18:17,282 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 54 [2024-06-14 11:18:17,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:18:17,416 INFO L124 PetriNetUnfolderBase]: 393/1007 cut-off events. [2024-06-14 11:18:17,417 INFO L125 PetriNetUnfolderBase]: For 18259/18350 co-relation queries the response was YES. [2024-06-14 11:18:17,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5181 conditions, 1007 events. 393/1007 cut-off events. For 18259/18350 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 6273 event pairs, 91 based on Foata normal form. 35/1020 useless extension candidates. Maximal degree in co-relation 5030. Up to 341 conditions per place. [2024-06-14 11:18:17,423 INFO L140 encePairwiseOnDemand]: 45/54 looper letters, 72 selfloop transitions, 37 changer transitions 1/146 dead transitions. [2024-06-14 11:18:17,424 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 146 transitions, 1852 flow [2024-06-14 11:18:17,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 11:18:17,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 11:18:17,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 207 transitions. [2024-06-14 11:18:17,425 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6388888888888888 [2024-06-14 11:18:17,425 INFO L175 Difference]: Start difference. First operand has 177 places, 128 transitions, 1522 flow. Second operand 6 states and 207 transitions. [2024-06-14 11:18:17,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 146 transitions, 1852 flow [2024-06-14 11:18:17,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 146 transitions, 1848 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-06-14 11:18:17,471 INFO L231 Difference]: Finished difference. Result has 181 places, 127 transitions, 1572 flow [2024-06-14 11:18:17,471 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=1518, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1572, PETRI_PLACES=181, PETRI_TRANSITIONS=127} [2024-06-14 11:18:17,471 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 130 predicate places. [2024-06-14 11:18:17,471 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 127 transitions, 1572 flow [2024-06-14 11:18:17,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.333333333333332) internal successors, (164), 6 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:17,472 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:18:17,472 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:18:17,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-14 11:18:17,472 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-14 11:18:17,472 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:18:17,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1739310075, now seen corresponding path program 3 times [2024-06-14 11:18:17,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:18:17,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919442953] [2024-06-14 11:18:17,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:18:17,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:18:17,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:18:17,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 11:18:17,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:18:17,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919442953] [2024-06-14 11:18:17,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919442953] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:18:17,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:18:17,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 11:18:17,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378864819] [2024-06-14 11:18:17,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:18:17,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 11:18:17,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:18:17,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 11:18:17,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-14 11:18:17,569 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 54 [2024-06-14 11:18:17,570 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 127 transitions, 1572 flow. Second operand has 6 states, 6 states have (on average 27.333333333333332) internal successors, (164), 6 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:17,570 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:18:17,570 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 54 [2024-06-14 11:18:17,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:18:17,709 INFO L124 PetriNetUnfolderBase]: 385/996 cut-off events. [2024-06-14 11:18:17,710 INFO L125 PetriNetUnfolderBase]: For 18384/18473 co-relation queries the response was YES. [2024-06-14 11:18:17,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5182 conditions, 996 events. 385/996 cut-off events. For 18384/18473 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 6191 event pairs, 93 based on Foata normal form. 29/1003 useless extension candidates. Maximal degree in co-relation 5023. Up to 338 conditions per place. [2024-06-14 11:18:17,716 INFO L140 encePairwiseOnDemand]: 45/54 looper letters, 77 selfloop transitions, 33 changer transitions 1/147 dead transitions. [2024-06-14 11:18:17,716 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 147 transitions, 1918 flow [2024-06-14 11:18:17,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 11:18:17,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 11:18:17,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 207 transitions. [2024-06-14 11:18:17,717 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6388888888888888 [2024-06-14 11:18:17,717 INFO L175 Difference]: Start difference. First operand has 181 places, 127 transitions, 1572 flow. Second operand 6 states and 207 transitions. [2024-06-14 11:18:17,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 147 transitions, 1918 flow [2024-06-14 11:18:17,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 147 transitions, 1832 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-06-14 11:18:17,762 INFO L231 Difference]: Finished difference. Result has 182 places, 126 transitions, 1535 flow [2024-06-14 11:18:17,762 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=1486, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1535, PETRI_PLACES=182, PETRI_TRANSITIONS=126} [2024-06-14 11:18:17,764 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 131 predicate places. [2024-06-14 11:18:17,764 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 126 transitions, 1535 flow [2024-06-14 11:18:17,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.333333333333332) internal successors, (164), 6 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:17,764 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:18:17,764 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:18:17,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-14 11:18:17,764 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-14 11:18:17,765 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:18:17,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1282603387, now seen corresponding path program 4 times [2024-06-14 11:18:17,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:18:17,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593616417] [2024-06-14 11:18:17,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:18:17,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:18:17,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:18:17,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 11:18:17,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:18:17,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593616417] [2024-06-14 11:18:17,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593616417] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:18:17,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:18:17,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 11:18:17,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574813475] [2024-06-14 11:18:17,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:18:17,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 11:18:17,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:18:17,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 11:18:17,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-14 11:18:17,870 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 54 [2024-06-14 11:18:17,871 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 126 transitions, 1535 flow. Second operand has 6 states, 6 states have (on average 27.333333333333332) internal successors, (164), 6 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:17,871 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:18:17,871 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 54 [2024-06-14 11:18:17,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:18:18,007 INFO L124 PetriNetUnfolderBase]: 367/960 cut-off events. [2024-06-14 11:18:18,007 INFO L125 PetriNetUnfolderBase]: For 17120/17203 co-relation queries the response was YES. [2024-06-14 11:18:18,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4884 conditions, 960 events. 367/960 cut-off events. For 17120/17203 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 5958 event pairs, 88 based on Foata normal form. 33/972 useless extension candidates. Maximal degree in co-relation 4724. Up to 314 conditions per place. [2024-06-14 11:18:18,014 INFO L140 encePairwiseOnDemand]: 44/54 looper letters, 55 selfloop transitions, 39 changer transitions 12/142 dead transitions. [2024-06-14 11:18:18,014 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 142 transitions, 1795 flow [2024-06-14 11:18:18,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 11:18:18,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 11:18:18,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 204 transitions. [2024-06-14 11:18:18,015 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6296296296296297 [2024-06-14 11:18:18,015 INFO L175 Difference]: Start difference. First operand has 182 places, 126 transitions, 1535 flow. Second operand 6 states and 204 transitions. [2024-06-14 11:18:18,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 142 transitions, 1795 flow [2024-06-14 11:18:18,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 142 transitions, 1646 flow, removed 5 selfloop flow, removed 8 redundant places. [2024-06-14 11:18:18,055 INFO L231 Difference]: Finished difference. Result has 180 places, 117 transitions, 1340 flow [2024-06-14 11:18:18,056 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=1386, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1340, PETRI_PLACES=180, PETRI_TRANSITIONS=117} [2024-06-14 11:18:18,057 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 129 predicate places. [2024-06-14 11:18:18,057 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 117 transitions, 1340 flow [2024-06-14 11:18:18,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.333333333333332) internal successors, (164), 6 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:18,057 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:18:18,057 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:18:18,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-14 11:18:18,058 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-14 11:18:18,058 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:18:18,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1704050163, now seen corresponding path program 1 times [2024-06-14 11:18:18,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:18:18,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559689882] [2024-06-14 11:18:18,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:18:18,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:18:18,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:18:18,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 11:18:18,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:18:18,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559689882] [2024-06-14 11:18:18,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559689882] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:18:18,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:18:18,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 11:18:18,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274454817] [2024-06-14 11:18:18,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:18:18,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 11:18:18,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:18:18,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 11:18:18,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-14 11:18:18,163 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 54 [2024-06-14 11:18:18,163 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 117 transitions, 1340 flow. Second operand has 6 states, 6 states have (on average 27.333333333333332) internal successors, (164), 6 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:18,164 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:18:18,164 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 54 [2024-06-14 11:18:18,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:18:18,292 INFO L124 PetriNetUnfolderBase]: 306/832 cut-off events. [2024-06-14 11:18:18,293 INFO L125 PetriNetUnfolderBase]: For 15130/15191 co-relation queries the response was YES. [2024-06-14 11:18:18,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4111 conditions, 832 events. 306/832 cut-off events. For 15130/15191 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 5124 event pairs, 110 based on Foata normal form. 26/833 useless extension candidates. Maximal degree in co-relation 3306. Up to 352 conditions per place. [2024-06-14 11:18:18,298 INFO L140 encePairwiseOnDemand]: 45/54 looper letters, 47 selfloop transitions, 39 changer transitions 3/125 dead transitions. [2024-06-14 11:18:18,298 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 125 transitions, 1538 flow [2024-06-14 11:18:18,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 11:18:18,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 11:18:18,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 193 transitions. [2024-06-14 11:18:18,311 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.595679012345679 [2024-06-14 11:18:18,311 INFO L175 Difference]: Start difference. First operand has 180 places, 117 transitions, 1340 flow. Second operand 6 states and 193 transitions. [2024-06-14 11:18:18,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 125 transitions, 1538 flow [2024-06-14 11:18:18,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 125 transitions, 1380 flow, removed 9 selfloop flow, removed 19 redundant places. [2024-06-14 11:18:18,347 INFO L231 Difference]: Finished difference. Result has 164 places, 114 transitions, 1237 flow [2024-06-14 11:18:18,348 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=1182, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1237, PETRI_PLACES=164, PETRI_TRANSITIONS=114} [2024-06-14 11:18:18,349 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 113 predicate places. [2024-06-14 11:18:18,349 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 114 transitions, 1237 flow [2024-06-14 11:18:18,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.333333333333332) internal successors, (164), 6 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:18,349 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:18:18,349 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:18:18,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-14 11:18:18,349 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-14 11:18:18,351 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:18:18,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1850503737, now seen corresponding path program 1 times [2024-06-14 11:18:18,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:18:18,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536530879] [2024-06-14 11:18:18,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:18:18,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:18:18,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:18:18,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 11:18:18,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:18:18,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536530879] [2024-06-14 11:18:18,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536530879] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:18:18,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:18:18,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 11:18:18,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590536912] [2024-06-14 11:18:18,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:18:18,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 11:18:18,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:18:18,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 11:18:18,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-14 11:18:18,544 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 54 [2024-06-14 11:18:18,545 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 114 transitions, 1237 flow. Second operand has 6 states, 6 states have (on average 27.5) internal successors, (165), 6 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:18,545 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:18:18,545 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 54 [2024-06-14 11:18:18,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:18:18,636 INFO L124 PetriNetUnfolderBase]: 309/820 cut-off events. [2024-06-14 11:18:18,637 INFO L125 PetriNetUnfolderBase]: For 13799/13896 co-relation queries the response was YES. [2024-06-14 11:18:18,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3925 conditions, 820 events. 309/820 cut-off events. For 13799/13896 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 4920 event pairs, 52 based on Foata normal form. 22/810 useless extension candidates. Maximal degree in co-relation 3201. Up to 183 conditions per place. [2024-06-14 11:18:18,641 INFO L140 encePairwiseOnDemand]: 46/54 looper letters, 71 selfloop transitions, 16 changer transitions 5/128 dead transitions. [2024-06-14 11:18:18,641 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 128 transitions, 1530 flow [2024-06-14 11:18:18,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 11:18:18,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 11:18:18,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 196 transitions. [2024-06-14 11:18:18,644 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6049382716049383 [2024-06-14 11:18:18,644 INFO L175 Difference]: Start difference. First operand has 164 places, 114 transitions, 1237 flow. Second operand 6 states and 196 transitions. [2024-06-14 11:18:18,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 128 transitions, 1530 flow [2024-06-14 11:18:18,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 128 transitions, 1419 flow, removed 2 selfloop flow, removed 8 redundant places. [2024-06-14 11:18:18,670 INFO L231 Difference]: Finished difference. Result has 161 places, 113 transitions, 1152 flow [2024-06-14 11:18:18,671 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=1130, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1152, PETRI_PLACES=161, PETRI_TRANSITIONS=113} [2024-06-14 11:18:18,671 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 110 predicate places. [2024-06-14 11:18:18,671 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 113 transitions, 1152 flow [2024-06-14 11:18:18,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.5) internal successors, (165), 6 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:18,672 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:18:18,672 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:18:18,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-14 11:18:18,672 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-14 11:18:18,672 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:18:18,672 INFO L85 PathProgramCache]: Analyzing trace with hash 530793747, now seen corresponding path program 2 times [2024-06-14 11:18:18,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:18:18,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810132707] [2024-06-14 11:18:18,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:18:18,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:18:18,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:18:18,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 11:18:18,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:18:18,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810132707] [2024-06-14 11:18:18,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810132707] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:18:18,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:18:18,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 11:18:18,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395704798] [2024-06-14 11:18:18,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:18:18,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 11:18:18,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:18:18,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 11:18:18,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-14 11:18:18,782 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 54 [2024-06-14 11:18:18,783 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 113 transitions, 1152 flow. Second operand has 6 states, 6 states have (on average 27.5) internal successors, (165), 6 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:18,783 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:18:18,783 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 54 [2024-06-14 11:18:18,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:18:18,880 INFO L124 PetriNetUnfolderBase]: 293/789 cut-off events. [2024-06-14 11:18:18,881 INFO L125 PetriNetUnfolderBase]: For 11131/11222 co-relation queries the response was YES. [2024-06-14 11:18:18,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3582 conditions, 789 events. 293/789 cut-off events. For 11131/11222 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 4724 event pairs, 49 based on Foata normal form. 20/777 useless extension candidates. Maximal degree in co-relation 2950. Up to 183 conditions per place. [2024-06-14 11:18:18,885 INFO L140 encePairwiseOnDemand]: 46/54 looper letters, 66 selfloop transitions, 8 changer transitions 17/124 dead transitions. [2024-06-14 11:18:18,886 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 124 transitions, 1412 flow [2024-06-14 11:18:18,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 11:18:18,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 11:18:18,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 195 transitions. [2024-06-14 11:18:18,887 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6018518518518519 [2024-06-14 11:18:18,887 INFO L175 Difference]: Start difference. First operand has 161 places, 113 transitions, 1152 flow. Second operand 6 states and 195 transitions. [2024-06-14 11:18:18,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 124 transitions, 1412 flow [2024-06-14 11:18:18,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 124 transitions, 1374 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-14 11:18:18,911 INFO L231 Difference]: Finished difference. Result has 161 places, 101 transitions, 986 flow [2024-06-14 11:18:18,911 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=1116, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=986, PETRI_PLACES=161, PETRI_TRANSITIONS=101} [2024-06-14 11:18:18,912 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 110 predicate places. [2024-06-14 11:18:18,912 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 101 transitions, 986 flow [2024-06-14 11:18:18,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.5) internal successors, (165), 6 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:18,912 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:18:18,912 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:18:18,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-14 11:18:18,912 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-14 11:18:18,913 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:18:18,913 INFO L85 PathProgramCache]: Analyzing trace with hash 1317737427, now seen corresponding path program 3 times [2024-06-14 11:18:18,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:18:18,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783920475] [2024-06-14 11:18:18,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:18:18,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:18:18,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:18:18,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-14 11:18:18,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:18:18,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783920475] [2024-06-14 11:18:18,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783920475] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:18:18,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:18:18,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 11:18:18,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243793568] [2024-06-14 11:18:18,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:18:18,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 11:18:18,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:18:18,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 11:18:18,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-14 11:18:19,039 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 54 [2024-06-14 11:18:19,040 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 101 transitions, 986 flow. Second operand has 6 states, 6 states have (on average 27.5) internal successors, (165), 6 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:19,040 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:18:19,040 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 54 [2024-06-14 11:18:19,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:18:19,116 INFO L124 PetriNetUnfolderBase]: 234/659 cut-off events. [2024-06-14 11:18:19,117 INFO L125 PetriNetUnfolderBase]: For 8148/8191 co-relation queries the response was YES. [2024-06-14 11:18:19,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2756 conditions, 659 events. 234/659 cut-off events. For 8148/8191 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3751 event pairs, 33 based on Foata normal form. 12/655 useless extension candidates. Maximal degree in co-relation 2478. Up to 171 conditions per place. [2024-06-14 11:18:19,120 INFO L140 encePairwiseOnDemand]: 45/54 looper letters, 36 selfloop transitions, 5 changer transitions 51/110 dead transitions. [2024-06-14 11:18:19,120 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 110 transitions, 1164 flow [2024-06-14 11:18:19,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 11:18:19,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 11:18:19,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 192 transitions. [2024-06-14 11:18:19,121 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5925925925925926 [2024-06-14 11:18:19,121 INFO L175 Difference]: Start difference. First operand has 161 places, 101 transitions, 986 flow. Second operand 6 states and 192 transitions. [2024-06-14 11:18:19,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 110 transitions, 1164 flow [2024-06-14 11:18:19,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 110 transitions, 1096 flow, removed 8 selfloop flow, removed 13 redundant places. [2024-06-14 11:18:19,137 INFO L231 Difference]: Finished difference. Result has 148 places, 56 transitions, 465 flow [2024-06-14 11:18:19,137 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=918, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=465, PETRI_PLACES=148, PETRI_TRANSITIONS=56} [2024-06-14 11:18:19,137 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 97 predicate places. [2024-06-14 11:18:19,137 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 56 transitions, 465 flow [2024-06-14 11:18:19,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.5) internal successors, (165), 6 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:19,137 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:18:19,138 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:18:19,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-14 11:18:19,138 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-14 11:18:19,138 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:18:19,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1376193198, now seen corresponding path program 1 times [2024-06-14 11:18:19,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:18:19,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964636555] [2024-06-14 11:18:19,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:18:19,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:18:19,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:18:19,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-14 11:18:19,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:18:19,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964636555] [2024-06-14 11:18:19,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964636555] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:18:19,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:18:19,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 11:18:19,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677406364] [2024-06-14 11:18:19,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:18:19,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 11:18:19,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:18:19,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 11:18:19,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-14 11:18:19,238 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 54 [2024-06-14 11:18:19,239 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 56 transitions, 465 flow. Second operand has 6 states, 6 states have (on average 27.5) internal successors, (165), 6 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:19,239 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:18:19,239 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 54 [2024-06-14 11:18:19,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:18:19,289 INFO L124 PetriNetUnfolderBase]: 119/326 cut-off events. [2024-06-14 11:18:19,289 INFO L125 PetriNetUnfolderBase]: For 3744/3775 co-relation queries the response was YES. [2024-06-14 11:18:19,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1361 conditions, 326 events. 119/326 cut-off events. For 3744/3775 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1467 event pairs, 15 based on Foata normal form. 21/335 useless extension candidates. Maximal degree in co-relation 1310. Up to 91 conditions per place. [2024-06-14 11:18:19,291 INFO L140 encePairwiseOnDemand]: 47/54 looper letters, 28 selfloop transitions, 12 changer transitions 7/65 dead transitions. [2024-06-14 11:18:19,291 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 65 transitions, 593 flow [2024-06-14 11:18:19,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 11:18:19,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 11:18:19,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 186 transitions. [2024-06-14 11:18:19,295 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5740740740740741 [2024-06-14 11:18:19,295 INFO L175 Difference]: Start difference. First operand has 148 places, 56 transitions, 465 flow. Second operand 6 states and 186 transitions. [2024-06-14 11:18:19,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 65 transitions, 593 flow [2024-06-14 11:18:19,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 65 transitions, 444 flow, removed 12 selfloop flow, removed 35 redundant places. [2024-06-14 11:18:19,307 INFO L231 Difference]: Finished difference. Result has 93 places, 53 transitions, 333 flow [2024-06-14 11:18:19,307 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=333, PETRI_PLACES=93, PETRI_TRANSITIONS=53} [2024-06-14 11:18:19,320 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 42 predicate places. [2024-06-14 11:18:19,320 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 53 transitions, 333 flow [2024-06-14 11:18:19,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.5) internal successors, (165), 6 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:19,321 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:18:19,321 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:18:19,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-14 11:18:19,321 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-14 11:18:19,321 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:18:19,321 INFO L85 PathProgramCache]: Analyzing trace with hash -241453456, now seen corresponding path program 2 times [2024-06-14 11:18:19,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:18:19,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574716823] [2024-06-14 11:18:19,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:18:19,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:18:19,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:18:19,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 11:18:19,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:18:19,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574716823] [2024-06-14 11:18:19,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574716823] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:18:19,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:18:19,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 11:18:19,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370927826] [2024-06-14 11:18:19,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:18:19,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 11:18:19,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:18:19,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 11:18:19,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-14 11:18:19,458 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 54 [2024-06-14 11:18:19,459 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 53 transitions, 333 flow. Second operand has 6 states, 6 states have (on average 27.5) internal successors, (165), 6 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:19,459 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:18:19,459 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 54 [2024-06-14 11:18:19,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:18:19,520 INFO L124 PetriNetUnfolderBase]: 86/259 cut-off events. [2024-06-14 11:18:19,521 INFO L125 PetriNetUnfolderBase]: For 1073/1100 co-relation queries the response was YES. [2024-06-14 11:18:19,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 846 conditions, 259 events. 86/259 cut-off events. For 1073/1100 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1149 event pairs, 10 based on Foata normal form. 9/262 useless extension candidates. Maximal degree in co-relation 816. Up to 80 conditions per place. [2024-06-14 11:18:19,522 INFO L140 encePairwiseOnDemand]: 47/54 looper letters, 0 selfloop transitions, 0 changer transitions 59/59 dead transitions. [2024-06-14 11:18:19,522 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 59 transitions, 395 flow [2024-06-14 11:18:19,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 11:18:19,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 11:18:19,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 183 transitions. [2024-06-14 11:18:19,525 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5648148148148148 [2024-06-14 11:18:19,525 INFO L175 Difference]: Start difference. First operand has 93 places, 53 transitions, 333 flow. Second operand 6 states and 183 transitions. [2024-06-14 11:18:19,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 59 transitions, 395 flow [2024-06-14 11:18:19,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 59 transitions, 326 flow, removed 1 selfloop flow, removed 22 redundant places. [2024-06-14 11:18:19,527 INFO L231 Difference]: Finished difference. Result has 74 places, 0 transitions, 0 flow [2024-06-14 11:18:19,527 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=74, PETRI_TRANSITIONS=0} [2024-06-14 11:18:19,527 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 23 predicate places. [2024-06-14 11:18:19,527 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 0 transitions, 0 flow [2024-06-14 11:18:19,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.5) internal successors, (165), 6 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:19,530 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 4 remaining) [2024-06-14 11:18:19,530 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 4 remaining) [2024-06-14 11:18:19,530 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2024-06-14 11:18:19,531 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2024-06-14 11:18:19,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-14 11:18:19,531 INFO L445 BasicCegarLoop]: Path program histogram: [4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:18:19,533 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-06-14 11:18:19,533 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-06-14 11:18:19,536 INFO L507 ceAbstractionStarter]: Automizer considered 2 witness invariants [2024-06-14 11:18:19,536 INFO L508 ceAbstractionStarter]: WitnessConsidered=2 [2024-06-14 11:18:19,537 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.06 11:18:19 BasicIcfg [2024-06-14 11:18:19,537 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-06-14 11:18:19,537 INFO L158 Benchmark]: Toolchain (without parser) took 18604.62ms. Allocated memory was 138.4MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 64.2MB in the beginning and 1.0GB in the end (delta: -968.7MB). Peak memory consumption was 241.2MB. Max. memory is 16.1GB. [2024-06-14 11:18:19,538 INFO L158 Benchmark]: Witness Parser took 0.15ms. Allocated memory is still 138.4MB. Free memory is still 94.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-14 11:18:19,538 INFO L158 Benchmark]: CDTParser took 0.07ms. Allocated memory is still 138.4MB. Free memory is still 111.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-14 11:18:19,538 INFO L158 Benchmark]: CACSL2BoogieTranslator took 457.78ms. Allocated memory is still 138.4MB. Free memory was 64.0MB in the beginning and 87.8MB in the end (delta: -23.8MB). Peak memory consumption was 6.5MB. Max. memory is 16.1GB. [2024-06-14 11:18:19,538 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.38ms. Allocated memory is still 138.4MB. Free memory was 87.8MB in the beginning and 85.6MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-06-14 11:18:19,538 INFO L158 Benchmark]: Boogie Preprocessor took 30.24ms. Allocated memory is still 138.4MB. Free memory was 85.6MB in the beginning and 83.2MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-06-14 11:18:19,539 INFO L158 Benchmark]: RCFGBuilder took 398.32ms. Allocated memory is still 138.4MB. Free memory was 83.2MB in the beginning and 58.9MB in the end (delta: 24.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-06-14 11:18:19,539 INFO L158 Benchmark]: TraceAbstraction took 17661.58ms. Allocated memory was 138.4MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 58.0MB in the beginning and 1.0GB in the end (delta: -974.9MB). Peak memory consumption was 232.6MB. Max. memory is 16.1GB. [2024-06-14 11:18:19,544 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.15ms. Allocated memory is still 138.4MB. Free memory is still 94.5MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.07ms. Allocated memory is still 138.4MB. Free memory is still 111.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 457.78ms. Allocated memory is still 138.4MB. Free memory was 64.0MB in the beginning and 87.8MB in the end (delta: -23.8MB). Peak memory consumption was 6.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.38ms. Allocated memory is still 138.4MB. Free memory was 87.8MB in the beginning and 85.6MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.24ms. Allocated memory is still 138.4MB. Free memory was 85.6MB in the beginning and 83.2MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 398.32ms. Allocated memory is still 138.4MB. Free memory was 83.2MB in the beginning and 58.9MB in the end (delta: 24.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 17661.58ms. Allocated memory was 138.4MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 58.0MB in the beginning and 1.0GB in the end (delta: -974.9MB). Peak memory consumption was 232.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 793]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 794]: 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, 85 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: 17.6s, OverallIterations: 47, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 13.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4439 SdHoareTripleChecker+Valid, 3.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3066 mSDsluCounter, 1897 SdHoareTripleChecker+Invalid, 2.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1323 mSDsCounter, 411 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6782 IncrementalHoareTripleChecker+Invalid, 7193 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 411 mSolverCounterUnsat, 574 mSDtfsCounter, 6782 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 211 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3107occurred in iteration=20, InterpolantAutomatonStates: 265, 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.1s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 786 NumberOfCodeBlocks, 786 NumberOfCodeBlocksAsserted, 47 NumberOfCheckSat, 739 ConstructedInterpolants, 0 QuantifiedInterpolants, 3110 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 47 InterpolantComputations, 47 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-14 11:18:19,567 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