Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r307-tajo-171654460300037.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is PhilosophersDyn-PT-20, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r307-tajo-171654460300037
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 93M
-rw-r--r-- 1 mcc users 145K Apr 11 16:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 604K Apr 11 16:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0M Apr 11 16:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 14M Apr 11 16:11 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 13K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 53K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.4M Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 4.6M Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 306K Apr 11 18:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.3M Apr 11 18:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3M Apr 11 18:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 45M Apr 11 18:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 14M May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME PhilosophersDyn-PT-20-LTLCardinality-00
FORMULA_NAME PhilosophersDyn-PT-20-LTLCardinality-01
FORMULA_NAME PhilosophersDyn-PT-20-LTLCardinality-02
FORMULA_NAME PhilosophersDyn-PT-20-LTLCardinality-03
FORMULA_NAME PhilosophersDyn-PT-20-LTLCardinality-04
FORMULA_NAME PhilosophersDyn-PT-20-LTLCardinality-05
FORMULA_NAME PhilosophersDyn-PT-20-LTLCardinality-06
FORMULA_NAME PhilosophersDyn-PT-20-LTLCardinality-07
FORMULA_NAME PhilosophersDyn-PT-20-LTLCardinality-08
FORMULA_NAME PhilosophersDyn-PT-20-LTLCardinality-09
FORMULA_NAME PhilosophersDyn-PT-20-LTLCardinality-10
FORMULA_NAME PhilosophersDyn-PT-20-LTLCardinality-11
FORMULA_NAME PhilosophersDyn-PT-20-LTLCardinality-12
FORMULA_NAME PhilosophersDyn-PT-20-LTLCardinality-13
FORMULA_NAME PhilosophersDyn-PT-20-LTLCardinality-14
FORMULA_NAME PhilosophersDyn-PT-20-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717107156780

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PhilosophersDyn-PT-20
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-30 22:12:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-30 22:12:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 22:12:39] [INFO ] Load time of PNML (sax parser for PT used): 601 ms
[2024-05-30 22:12:39] [INFO ] Transformed 540 places.
[2024-05-30 22:12:39] [INFO ] Transformed 17220 transitions.
[2024-05-30 22:12:39] [INFO ] Parsed PT model containing 540 places and 17220 transitions and 140780 arcs in 781 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 190 transitions
Reduce redundant transitions removed 190 transitions.
FORMULA PhilosophersDyn-PT-20-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-PT-20-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-PT-20-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 145 out of 540 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 540/540 places, 17030/17030 transitions.
Applied a total of 0 rules in 455 ms. Remains 540 /540 variables (removed 0) and now considering 17030/17030 (removed 0) transitions.
[2024-05-30 22:12:40] [INFO ] Flow matrix only has 15510 transitions (discarded 1520 similar events)
// Phase 1: matrix 15510 rows 540 cols
[2024-05-30 22:12:41] [INFO ] Computed 79 invariants in 1118 ms
[2024-05-30 22:12:49] [INFO ] Dead Transitions using invariants and state equation in 9434 ms found 1560 transitions.
Found 1560 dead transitions using SMT.
Drop transitions removed 1560 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 1560 transitions.
// Phase 1: matrix 15470 rows 540 cols
[2024-05-30 22:12:51] [INFO ] Computed 79 invariants in 2350 ms
[2024-05-30 22:12:53] [INFO ] Implicit Places using invariants in 4326 ms returned []
Implicit Place search using SMT only with invariants took 4328 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 540/540 places, 15470/17030 transitions.
Applied a total of 0 rules in 366 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14622 ms. Remains : 540/540 places, 15470/17030 transitions.
Support contains 145 out of 540 places after structural reductions.
[2024-05-30 22:12:55] [INFO ] Flatten gal took : 957 ms
[2024-05-30 22:12:56] [INFO ] Flatten gal took : 676 ms
[2024-05-30 22:12:57] [INFO ] Input system was already deterministic with 15470 transitions.
Support contains 144 out of 540 places (down from 145) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 1149 resets, run finished after 1161 ms. (steps per millisecond=8 ) properties (out of 28) seen :20
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2024-05-30 22:12:59] [INFO ] Invariant cache hit.
[2024-05-30 22:12:59] [INFO ] [Real]Absence check using 27 positive place invariants in 5 ms returned sat
[2024-05-30 22:12:59] [INFO ] [Real]Absence check using 27 positive and 52 generalized place invariants in 40 ms returned sat
[2024-05-30 22:13:15] [INFO ] After 15640ms SMT Verify possible using all constraints in real domain returned unsat :5 sat :0 real:3
[2024-05-30 22:13:15] [INFO ] [Nat]Absence check using 27 positive place invariants in 8 ms returned sat
[2024-05-30 22:13:15] [INFO ] [Nat]Absence check using 27 positive and 52 generalized place invariants in 52 ms returned sat
[2024-05-30 22:13:32] [INFO ] After 16633ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :3
[2024-05-30 22:13:32] [INFO ] State equation strengthened by 8020 read => feed constraints.
[2024-05-30 22:13:40] [INFO ] After 7726ms SMT Verify possible using 8020 Read/Feed constraints in natural domain returned unsat :5 sat :2
[2024-05-30 22:13:40] [INFO ] After 7729ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :2
Attempting to minimize the solution found.
Minimization took 10 ms.
[2024-05-30 22:13:40] [INFO ] After 25058ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :2
Fused 8 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 214 ms.
Support contains 80 out of 540 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Free-agglomeration rule (complex) applied 20 times.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 540 transition count 15450
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 40 place count 520 transition count 15450
Applied a total of 40 rules in 7116 ms. Remains 520 /540 variables (removed 20) and now considering 15450/15470 (removed 20) transitions.
// Phase 1: matrix 15450 rows 520 cols
[2024-05-30 22:13:49] [INFO ] Computed 79 invariants in 1656 ms
[2024-05-30 22:13:56] [INFO ] Dead Transitions using invariants and state equation in 8740 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15858 ms. Remains : 520/540 places, 15450/15470 transitions.
Incomplete random walk after 10000 steps, including 1146 resets, run finished after 820 ms. (steps per millisecond=12 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 22487 steps, run timeout after 3001 ms. (steps per millisecond=7 ) properties seen :{}
Probabilistic random walk after 22487 steps, saw 6514 distinct states, run finished after 3002 ms. (steps per millisecond=7 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-30 22:14:00] [INFO ] Invariant cache hit.
[2024-05-30 22:14:00] [INFO ] [Real]Absence check using 23 positive place invariants in 5 ms returned sat
[2024-05-30 22:14:00] [INFO ] [Real]Absence check using 23 positive and 56 generalized place invariants in 44 ms returned sat
[2024-05-30 22:14:17] [INFO ] After 16987ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-30 22:14:17] [INFO ] [Nat]Absence check using 23 positive place invariants in 7 ms returned sat
[2024-05-30 22:14:17] [INFO ] [Nat]Absence check using 23 positive and 56 generalized place invariants in 56 ms returned sat
[2024-05-30 22:14:42] [INFO ] After 24407ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-30 22:14:42] [INFO ] State equation strengthened by 8020 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:645)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-30 22:14:42] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-30 22:14:42] [INFO ] After 25056ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 188 ms.
Support contains 80 out of 520 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 520/520 places, 15450/15450 transitions.
Applied a total of 0 rules in 3737 ms. Remains 520 /520 variables (removed 0) and now considering 15450/15450 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3737 ms. Remains : 520/520 places, 15450/15450 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 520/520 places, 15450/15450 transitions.
Applied a total of 0 rules in 3397 ms. Remains 520 /520 variables (removed 0) and now considering 15450/15450 (removed 0) transitions.
[2024-05-30 22:14:49] [INFO ] Invariant cache hit.
[2024-05-30 22:14:52] [INFO ] Implicit Places using invariants in 2454 ms returned [29, 34, 60, 86, 88, 111, 126, 143, 163, 237, 251, 281, 320, 333, 346, 362, 378, 407, 450, 451]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 2503 ms to find 20 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 500/520 places, 15450/15450 transitions.
Applied a total of 0 rules in 3464 ms. Remains 500 /500 variables (removed 0) and now considering 15450/15450 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 9369 ms. Remains : 500/520 places, 15450/15450 transitions.
Successfully simplified 5 atomic propositions for a total of 13 simplifications.
FORMULA PhilosophersDyn-PT-20-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
Support contains 100 out of 540 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 5900 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
// Phase 1: matrix 15470 rows 540 cols
[2024-05-30 22:15:05] [INFO ] Computed 79 invariants in 1912 ms
[2024-05-30 22:15:12] [INFO ] Dead Transitions using invariants and state equation in 8219 ms found 0 transitions.
[2024-05-30 22:15:12] [INFO ] Invariant cache hit.
[2024-05-30 22:15:14] [INFO ] Implicit Places using invariants in 2201 ms returned []
Implicit Place search using SMT only with invariants took 2203 ms to find 0 implicit places.
[2024-05-30 22:15:14] [INFO ] Invariant cache hit.
[2024-05-30 22:15:20] [INFO ] Dead Transitions using invariants and state equation in 6119 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 22446 ms. Remains : 540/540 places, 15470/15470 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 491 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : PhilosophersDyn-PT-20-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ (ADD s4 s46 s76 s97 s150 s159 s170 s184 s218 s261 s275 s308 s319 s325 s353 s362 s394 s462 s520 s523) (ADD s33 s58 s94 s119 s121 s160 s173 s177 s25...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 8 ms.
FORMULA PhilosophersDyn-PT-20-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-20-LTLCardinality-00 finished in 24547 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))&&(p1 U (p2||G(p1))))))'
Support contains 60 out of 540 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 5186 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
[2024-05-30 22:15:26] [INFO ] Invariant cache hit.
[2024-05-30 22:15:32] [INFO ] Dead Transitions using invariants and state equation in 6491 ms found 0 transitions.
[2024-05-30 22:15:32] [INFO ] Invariant cache hit.
[2024-05-30 22:15:35] [INFO ] Implicit Places using invariants in 2606 ms returned []
Implicit Place search using SMT only with invariants took 2610 ms to find 0 implicit places.
[2024-05-30 22:15:35] [INFO ] Invariant cache hit.
[2024-05-30 22:15:41] [INFO ] Dead Transitions using invariants and state equation in 6269 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 20558 ms. Remains : 540/540 places, 15470/15470 transitions.
Stuttering acceptance computed with spot in 186 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p0), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : PhilosophersDyn-PT-20-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GT 2 (ADD s29 s34 s62 s89 s91 s115 s130 s147 s168 s245 s259 s292 s331 s345 s359 s376 s393 s423 s468 s469)), p2:(AND (GT (ADD s0 s25 s44 s57 s87 s102 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 3 ms.
FORMULA PhilosophersDyn-PT-20-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-20-LTLCardinality-01 finished in 20801 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0&&X(p1))) U G(p2)))'
Support contains 80 out of 540 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 173 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
[2024-05-30 22:15:41] [INFO ] Invariant cache hit.
[2024-05-30 22:15:48] [INFO ] Dead Transitions using invariants and state equation in 6403 ms found 0 transitions.
[2024-05-30 22:15:48] [INFO ] Invariant cache hit.
[2024-05-30 22:15:50] [INFO ] Implicit Places using invariants in 2507 ms returned []
Implicit Place search using SMT only with invariants took 2508 ms to find 0 implicit places.
[2024-05-30 22:15:50] [INFO ] Invariant cache hit.
[2024-05-30 22:15:57] [INFO ] Dead Transitions using invariants and state equation in 6894 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15981 ms. Remains : 540/540 places, 15470/15470 transitions.
Stuttering acceptance computed with spot in 93 ms :[(NOT p2), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : PhilosophersDyn-PT-20-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(LEQ 1 (ADD s35 s51 s64 s113 s151 s182 s190 s209 s273 s281 s282 s343 s355 s367 s385 s420 s434 s465 s476 s507)), p0:(OR (LEQ 1 (ADD s29 s34 s62 s89 s91 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 2 ms.
FORMULA PhilosophersDyn-PT-20-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-20-LTLCardinality-02 finished in 16119 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 40 out of 540 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 4848 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
[2024-05-30 22:16:02] [INFO ] Invariant cache hit.
[2024-05-30 22:16:09] [INFO ] Dead Transitions using invariants and state equation in 6436 ms found 0 transitions.
[2024-05-30 22:16:09] [INFO ] Invariant cache hit.
[2024-05-30 22:16:11] [INFO ] Implicit Places using invariants in 2765 ms returned []
Implicit Place search using SMT only with invariants took 2766 ms to find 0 implicit places.
[2024-05-30 22:16:11] [INFO ] Invariant cache hit.
[2024-05-30 22:16:18] [INFO ] Dead Transitions using invariants and state equation in 6258 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 20311 ms. Remains : 540/540 places, 15470/15470 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : PhilosophersDyn-PT-20-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (LEQ (ADD s4 s46 s76 s97 s150 s159 s170 s184 s218 s261 s275 s308 s319 s325 s353 s362 s394 s462 s520 s523) (ADD s0 s25 s44 s57 s87 s102 s129 s137 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 2 ms.
FORMULA PhilosophersDyn-PT-20-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-20-LTLCardinality-03 finished in 20370 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0&&X(p1))))'
Support contains 40 out of 540 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 145 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
[2024-05-30 22:16:18] [INFO ] Invariant cache hit.
[2024-05-30 22:16:24] [INFO ] Dead Transitions using invariants and state equation in 6477 ms found 0 transitions.
[2024-05-30 22:16:24] [INFO ] Invariant cache hit.
[2024-05-30 22:16:26] [INFO ] Implicit Places using invariants in 1920 ms returned []
Implicit Place search using SMT only with invariants took 1922 ms to find 0 implicit places.
[2024-05-30 22:16:26] [INFO ] Invariant cache hit.
[2024-05-30 22:16:33] [INFO ] Dead Transitions using invariants and state equation in 6484 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15031 ms. Remains : 540/540 places, 15470/15470 transitions.
Stuttering acceptance computed with spot in 65 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : PhilosophersDyn-PT-20-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ 1 (ADD s42 s72 s154 s156 s192 s212 s214 s263 s286 s304 s307 s348 s371 s372 s373 s403 s427 s443 s505 s508)), p1:(LEQ 3 (ADD s29 s34 s62 s89 s91 s11...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA PhilosophersDyn-PT-20-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-20-LTLCardinality-05 finished in 15127 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 20 out of 540 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 159 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
[2024-05-30 22:16:33] [INFO ] Invariant cache hit.
[2024-05-30 22:16:39] [INFO ] Dead Transitions using invariants and state equation in 6254 ms found 0 transitions.
[2024-05-30 22:16:39] [INFO ] Invariant cache hit.
[2024-05-30 22:16:42] [INFO ] Implicit Places using invariants in 2637 ms returned []
Implicit Place search using SMT only with invariants took 2638 ms to find 0 implicit places.
[2024-05-30 22:16:42] [INFO ] Invariant cache hit.
[2024-05-30 22:16:49] [INFO ] Dead Transitions using invariants and state equation in 7036 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16090 ms. Remains : 540/540 places, 15470/15470 transitions.
Stuttering acceptance computed with spot in 103 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PhilosophersDyn-PT-20-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(LEQ 2 (ADD s0 s25 s44 s57 s87 s102 s129 s137 s187 s250 s295 s339 s340 s356 s390 s447 s461 s477 s482 s496))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA PhilosophersDyn-PT-20-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-20-LTLCardinality-06 finished in 16228 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 540 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 165 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
[2024-05-30 22:16:49] [INFO ] Invariant cache hit.
[2024-05-30 22:16:56] [INFO ] Dead Transitions using invariants and state equation in 6429 ms found 0 transitions.
[2024-05-30 22:16:56] [INFO ] Invariant cache hit.
[2024-05-30 22:16:58] [INFO ] Implicit Places using invariants in 2574 ms returned []
Implicit Place search using SMT only with invariants took 2575 ms to find 0 implicit places.
[2024-05-30 22:16:58] [INFO ] Invariant cache hit.
[2024-05-30 22:17:05] [INFO ] Dead Transitions using invariants and state equation in 6557 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15729 ms. Remains : 540/540 places, 15470/15470 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PhilosophersDyn-PT-20-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s87 s266)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration timeout after 98350 steps with 40934 reset in 10001 ms.
Stack based approach found an accepted trace after 33685 steps with 13948 reset with depth 6 and stack size 6 in 3213 ms.
FORMULA PhilosophersDyn-PT-20-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property PhilosophersDyn-PT-20-LTLCardinality-08 finished in 29027 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||(!p0 U X(G(p1)))))))'
Support contains 5 out of 540 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 141 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
[2024-05-30 22:17:18] [INFO ] Invariant cache hit.
[2024-05-30 22:17:25] [INFO ] Dead Transitions using invariants and state equation in 6333 ms found 0 transitions.
[2024-05-30 22:17:25] [INFO ] Invariant cache hit.
[2024-05-30 22:17:27] [INFO ] Implicit Places using invariants in 2622 ms returned []
Implicit Place search using SMT only with invariants took 2624 ms to find 0 implicit places.
[2024-05-30 22:17:27] [INFO ] Invariant cache hit.
[2024-05-30 22:17:33] [INFO ] Dead Transitions using invariants and state equation in 6154 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15255 ms. Remains : 540/540 places, 15470/15470 transitions.
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Running random walk in product with property : PhilosophersDyn-PT-20-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(GT s29 s31), p1:(OR (LEQ s371 s390) (LEQ 1 s291))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 1 ms.
FORMULA PhilosophersDyn-PT-20-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-20-LTLCardinality-09 finished in 15421 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p1)&&p0)))'
Support contains 4 out of 540 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 142 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
[2024-05-30 22:17:34] [INFO ] Invariant cache hit.
[2024-05-30 22:17:40] [INFO ] Dead Transitions using invariants and state equation in 6179 ms found 0 transitions.
[2024-05-30 22:17:40] [INFO ] Invariant cache hit.
[2024-05-30 22:17:42] [INFO ] Implicit Places using invariants in 2568 ms returned []
Implicit Place search using SMT only with invariants took 2569 ms to find 0 implicit places.
[2024-05-30 22:17:42] [INFO ] Invariant cache hit.
[2024-05-30 22:17:49] [INFO ] Dead Transitions using invariants and state equation in 6394 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15286 ms. Remains : 540/540 places, 15470/15470 transitions.
Stuttering acceptance computed with spot in 57 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : PhilosophersDyn-PT-20-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GT 2 s379) (LEQ 1 s35)), p1:(LEQ s216 s292)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 1 ms.
FORMULA PhilosophersDyn-PT-20-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-20-LTLCardinality-11 finished in 15373 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||(F(p0) U p1))))'
Support contains 3 out of 540 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 154 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
[2024-05-30 22:17:49] [INFO ] Invariant cache hit.
[2024-05-30 22:17:56] [INFO ] Dead Transitions using invariants and state equation in 6730 ms found 0 transitions.
[2024-05-30 22:17:56] [INFO ] Invariant cache hit.
[2024-05-30 22:17:58] [INFO ] Implicit Places using invariants in 2468 ms returned []
Implicit Place search using SMT only with invariants took 2470 ms to find 0 implicit places.
[2024-05-30 22:17:58] [INFO ] Invariant cache hit.
[2024-05-30 22:18:05] [INFO ] Dead Transitions using invariants and state equation in 6468 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15824 ms. Remains : 540/540 places, 15470/15470 transitions.
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : PhilosophersDyn-PT-20-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ 1 s221), p1:(LEQ s168 s72)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration timeout after 85340 steps with 42670 reset in 10001 ms.
Product exploration timeout after 83660 steps with 41830 reset in 10001 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p1))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 23 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PhilosophersDyn-PT-20-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PhilosophersDyn-PT-20-LTLCardinality-12 finished in 36143 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(p0)&&F(((!p0&&X(F(p1)))||G(F(p1))))))))'
Support contains 3 out of 540 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 150 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
[2024-05-30 22:18:25] [INFO ] Invariant cache hit.
[2024-05-30 22:18:32] [INFO ] Dead Transitions using invariants and state equation in 6558 ms found 0 transitions.
[2024-05-30 22:18:32] [INFO ] Invariant cache hit.
[2024-05-30 22:18:34] [INFO ] Implicit Places using invariants in 2627 ms returned []
Implicit Place search using SMT only with invariants took 2629 ms to find 0 implicit places.
[2024-05-30 22:18:34] [INFO ] Invariant cache hit.
[2024-05-30 22:18:41] [INFO ] Dead Transitions using invariants and state equation in 6423 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15764 ms. Remains : 540/540 places, 15470/15470 transitions.
Stuttering acceptance computed with spot in 155 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : PhilosophersDyn-PT-20-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(OR (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(GT s258 s292), p0:(GT 1 s42)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 9 steps with 1 reset in 2 ms.
FORMULA PhilosophersDyn-PT-20-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-20-LTLCardinality-13 finished in 15964 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(p0))'
Support contains 2 out of 540 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 2990 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
[2024-05-30 22:18:44] [INFO ] Invariant cache hit.
[2024-05-30 22:18:50] [INFO ] Dead Transitions using invariants and state equation in 6374 ms found 0 transitions.
[2024-05-30 22:18:50] [INFO ] Invariant cache hit.
[2024-05-30 22:18:53] [INFO ] Implicit Places using invariants in 2824 ms returned []
Implicit Place search using SMT only with invariants took 2825 ms to find 0 implicit places.
[2024-05-30 22:18:53] [INFO ] Invariant cache hit.
[2024-05-30 22:19:00] [INFO ] Dead Transitions using invariants and state equation in 6702 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 18905 ms. Remains : 540/540 places, 15470/15470 transitions.
Stuttering acceptance computed with spot in 37 ms :[true, (NOT p0)]
Running random walk in product with property : PhilosophersDyn-PT-20-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(LEQ s51 s288)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 83 steps with 9 reset in 9 ms.
FORMULA PhilosophersDyn-PT-20-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-20-LTLCardinality-14 finished in 18994 ms.
All properties solved by simple procedures.
Total runtime 381847 ms.

BK_STOP 1717107540679

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PhilosophersDyn-PT-20"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is PhilosophersDyn-PT-20, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r307-tajo-171654460300037"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PhilosophersDyn-PT-20.tgz
mv PhilosophersDyn-PT-20 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;