Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r295-tall-167873947700331.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
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 r295-tall-167873947700331
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 52M
-rw-r--r-- 1 mcc users 118K Feb 26 13:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 462K Feb 26 13:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0M Feb 26 13:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 9.6M Feb 26 13:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 66K Feb 25 16:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 189K Feb 25 16:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.6M Feb 25 16:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 5.6M Feb 25 16:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 335K Feb 26 14:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.4M Feb 26 14:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0M Feb 26 14:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15M Feb 26 14:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 16:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:34 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 14M Mar 5 18:23 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 1678826280644

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=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PhilosophersDyn-PT-20
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-14 20:38:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-14 20:38:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 20:38:11] [INFO ] Load time of PNML (sax parser for PT used): 582 ms
[2023-03-14 20:38:11] [INFO ] Transformed 540 places.
[2023-03-14 20:38:11] [INFO ] Transformed 17220 transitions.
[2023-03-14 20:38:11] [INFO ] Parsed PT model containing 540 places and 17220 transitions and 140780 arcs in 756 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 28 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 190 transitions
Reduce redundant transitions removed 190 transitions.
FORMULA PhilosophersDyn-PT-20-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-PT-20-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-PT-20-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-PT-20-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 540 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 145 ms. Remains 540 /540 variables (removed 0) and now considering 17030/17030 (removed 0) transitions.
[2023-03-14 20:38:11] [INFO ] Flow matrix only has 15510 transitions (discarded 1520 similar events)
// Phase 1: matrix 15510 rows 540 cols
[2023-03-14 20:38:12] [INFO ] Computed 79 place invariants in 1151 ms
[2023-03-14 20:38:21] [INFO ] Dead Transitions using invariants and state equation in 9879 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
[2023-03-14 20:38:23] [INFO ] Computed 79 place invariants in 1881 ms
[2023-03-14 20:38:23] [INFO ] Implicit Places using invariants in 1991 ms returned []
Implicit Place search using SMT only with invariants took 1992 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 68 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 12128 ms. Remains : 540/540 places, 15470/17030 transitions.
Support contains 540 out of 540 places after structural reductions.
[2023-03-14 20:38:25] [INFO ] Flatten gal took : 955 ms
[2023-03-14 20:38:25] [INFO ] Flatten gal took : 635 ms
[2023-03-14 20:38:27] [INFO ] Input system was already deterministic with 15470 transitions.
Incomplete random walk after 10000 steps, including 1143 resets, run finished after 888 ms. (steps per millisecond=11 ) properties (out of 32) seen :21
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 35 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
[2023-03-14 20:38:28] [INFO ] Invariant cache hit.
[2023-03-14 20:38:29] [INFO ] [Real]Absence check using 27 positive place invariants in 6 ms returned sat
[2023-03-14 20:38:29] [INFO ] [Real]Absence check using 27 positive and 52 generalized place invariants in 49 ms returned sat
[2023-03-14 20:38:41] [INFO ] After 12320ms SMT Verify possible using all constraints in real domain returned unsat :4 sat :0 real:7
[2023-03-14 20:38:41] [INFO ] [Nat]Absence check using 27 positive place invariants in 21 ms returned sat
[2023-03-14 20:38:41] [INFO ] [Nat]Absence check using 27 positive and 52 generalized place invariants in 41 ms returned sat
[2023-03-14 20:39:05] [INFO ] After 23342ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :7
[2023-03-14 20:39:05] [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: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.checkResults(DeadlockTester.java:797)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:644)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
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:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
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)
[2023-03-14 20:39:06] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-14 20:39:06] [INFO ] After 25041ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :0 real:7
Fused 11 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 363 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.
Applied a total of 0 rules in 3575 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
[2023-03-14 20:39:10] [INFO ] Invariant cache hit.
[2023-03-14 20:39:17] [INFO ] Dead Transitions using invariants and state equation in 6845 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10425 ms. Remains : 540/540 places, 15470/15470 transitions.
Incomplete random walk after 10000 steps, including 1144 resets, run finished after 687 ms. (steps per millisecond=14 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 19819 steps, run timeout after 3001 ms. (steps per millisecond=6 ) properties seen :{}
Probabilistic random walk after 19819 steps, saw 5808 distinct states, run finished after 3002 ms. (steps per millisecond=6 ) properties seen :0
Running SMT prover for 7 properties.
[2023-03-14 20:39:21] [INFO ] Invariant cache hit.
[2023-03-14 20:39:21] [INFO ] [Real]Absence check using 27 positive place invariants in 5 ms returned sat
[2023-03-14 20:39:21] [INFO ] [Real]Absence check using 27 positive and 52 generalized place invariants in 46 ms returned sat
[2023-03-14 20:39:35] [INFO ] After 13559ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-14 20:39:35] [INFO ] [Nat]Absence check using 27 positive place invariants in 5 ms returned sat
[2023-03-14 20:39:35] [INFO ] [Nat]Absence check using 27 positive and 52 generalized place invariants in 43 ms returned sat
[2023-03-14 20:39:58] [INFO ] After 23505ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-14 20:39:58] [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: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.checkResults(DeadlockTester.java:797)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:644)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
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:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
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)
[2023-03-14 20:40:00] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-14 20:40:00] [INFO ] After 25059ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
Parikh walk visited 0 properties in 340 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.
Applied a total of 0 rules in 3246 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3246 ms. Remains : 540/540 places, 15470/15470 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 3263 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
[2023-03-14 20:40:06] [INFO ] Invariant cache hit.
[2023-03-14 20:40:08] [INFO ] Implicit Places using invariants in 1830 ms returned []
Implicit Place search using SMT only with invariants took 1831 ms to find 0 implicit places.
[2023-03-14 20:40:08] [INFO ] Invariant cache hit.
[2023-03-14 20:40:16] [INFO ] Dead Transitions using invariants and state equation in 7365 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12464 ms. Remains : 540/540 places, 15470/15470 transitions.
Successfully simplified 4 atomic propositions for a total of 12 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.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G((G(p1)||p0))) U (p1&&(p2 U X(p3)))))'
Support contains 460 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 53 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
[2023-03-14 20:40:16] [INFO ] Invariant cache hit.
[2023-03-14 20:40:24] [INFO ] Dead Transitions using invariants and state equation in 7557 ms found 0 transitions.
[2023-03-14 20:40:24] [INFO ] Invariant cache hit.
[2023-03-14 20:40:25] [INFO ] Implicit Places using invariants in 738 ms returned []
Implicit Place search using SMT only with invariants took 740 ms to find 0 implicit places.
[2023-03-14 20:40:25] [INFO ] Invariant cache hit.
[2023-03-14 20:40:32] [INFO ] Dead Transitions using invariants and state equation in 6995 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15348 ms. Remains : 540/540 places, 15470/15470 transitions.
Stuttering acceptance computed with spot in 638 ms :[(OR (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p0)), (NOT p3), (NOT p3), true, (NOT p1), (OR (AND p1 (NOT p3)) (AND p0 (NOT p3))), (OR (AND p1 (NOT p3)) (AND p0 (NOT p3))), (AND (NOT p1) p0 (NOT p3)), (AND p0 (NOT p1) (NOT p3))]
Running random walk in product with property : PhilosophersDyn-PT-20-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={0} source=0 dest: 2}, { cond=(AND p1 p2), acceptance={0} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p1) p0 (NOT p3)), acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p3)), acceptance={0} source=2 dest: 1}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={0} source=2 dest: 2}, { cond=(AND p1 p2 (NOT p3)), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={0} source=2 dest: 4}, { cond=(AND p1 (NOT p0) (NOT p3)), acceptance={0} source=2 dest: 5}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=3 dest: 2}, { cond=(AND p2 (NOT p3)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)), acceptance={0} source=3 dest: 6}, { cond=(AND (NOT p1) p2 (NOT p0) (NOT p3)), acceptance={0} source=3 dest: 7}, { cond=(AND p1 (NOT p2) (NOT p0) (NOT p3)), acceptance={0} source=3 dest: 8}, { cond=(AND p1 p2 (NOT p0) (NOT p3)), acceptance={0} source=3 dest: 9}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=p1, acceptance={} source=5 dest: 5}], [{ cond=(OR (AND p1 (NOT p3)) (AND p0 (NOT p3))), acceptance={} source=6 dest: 4}], [{ cond=(OR (AND p1 (NOT p2) (NOT p3)) (AND (NOT p2) p0 (NOT p3))), acceptance={0} source=7 dest: 6}, { cond=(OR (AND p1 p2 (NOT p3)) (AND p2 p0 (NOT p3))), acceptance={0} source=7 dest: 7}], [{ cond=(AND (NOT p1) p0 (NOT p3)), acceptance={} source=8 dest: 4}, { cond=(AND p1 p0 (NOT p3)), acceptance={} source=8 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2) p0 (NOT p3)), acceptance={} source=9 dest: 6}, { cond=(AND (NOT p1) p2 p0 (NOT p3)), acceptance={} source=9 dest: 7}, { cond=(AND p1 (NOT p2) p0 (NOT p3)), acceptance={} source=9 dest: 8}, { cond=(AND p1 p2 p0 (NOT p3)), acceptance={} source=9 dest: 9}]], initial=0, aps=[p1:(LEQ 3 (ADD s1 s2 s3 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s26 s27 s28 s30 s32 s36 s37 s38 s39 s40 s41 s43 s45 s48...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 5 ms.
FORMULA PhilosophersDyn-PT-20-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-20-LTLCardinality-02 finished in 16112 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0 U p1))))'
Support contains 420 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 61 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
[2023-03-14 20:40:32] [INFO ] Invariant cache hit.
[2023-03-14 20:40:40] [INFO ] Dead Transitions using invariants and state equation in 7404 ms found 0 transitions.
[2023-03-14 20:40:40] [INFO ] Invariant cache hit.
[2023-03-14 20:40:41] [INFO ] Implicit Places using invariants in 1459 ms returned []
Implicit Place search using SMT only with invariants took 1460 ms to find 0 implicit places.
[2023-03-14 20:40:41] [INFO ] Invariant cache hit.
[2023-03-14 20:40:49] [INFO ] Dead Transitions using invariants and state equation in 7402 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16333 ms. Remains : 540/540 places, 15470/15470 transitions.
Stuttering acceptance computed with spot in 152 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : PhilosophersDyn-PT-20-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ 2 (ADD s1 s2 s3 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s26 s27 s28 s30 s32 s36 s37 s38 s39 s40 s41 s43 s45 s48...], nbAcceptance=1, 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]]
Entered a terminal (fully accepting) state of product in 12 steps with 1 reset in 4 ms.
FORMULA PhilosophersDyn-PT-20-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-20-LTLCardinality-03 finished in 16538 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!G((F(p0) U (p1 U p2))) U (p1 U X(p1))))'
Support contains 60 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 197 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
[2023-03-14 20:40:49] [INFO ] Invariant cache hit.
[2023-03-14 20:40:56] [INFO ] Dead Transitions using invariants and state equation in 7486 ms found 0 transitions.
[2023-03-14 20:40:56] [INFO ] Invariant cache hit.
[2023-03-14 20:40:59] [INFO ] Implicit Places using invariants in 2958 ms returned []
Implicit Place search using SMT only with invariants took 2959 ms to find 0 implicit places.
[2023-03-14 20:40:59] [INFO ] Invariant cache hit.
[2023-03-14 20:41:07] [INFO ] Dead Transitions using invariants and state equation in 7394 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18039 ms. Remains : 540/540 places, 15470/15470 transitions.
Stuttering acceptance computed with spot in 285 ms :[(NOT p1), (AND (NOT p1) p0 p2), (NOT p1), (AND (NOT p1) p2), p2, (AND p0 p2), p2]
Running random walk in product with property : PhilosophersDyn-PT-20-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(OR (AND (NOT p1) p0) (AND (NOT p1) p2)), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={0, 1} source=2 dest: 2}, { cond=(OR (AND (NOT p1) p0) (AND (NOT p1) p2)), acceptance={} source=2 dest: 3}], [{ cond=(OR (AND (NOT p1) p0) (AND (NOT p1) p2)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=(AND p0 (NOT p2)), acceptance={0} source=4 dest: 4}, { cond=p2, acceptance={0, 1} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 5}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 6}], [{ cond=(AND p0 (NOT p2)), acceptance={0} source=5 dest: 4}, { cond=(AND p0 p2), acceptance={0, 1} source=5 dest: 4}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) p2), acceptance={1} source=5 dest: 5}], [{ cond=p2, acceptance={0, 1} source=6 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(LEQ 3 (ADD s35 s51 s64 s113 s151 s182 s190 s209 s273 s281 s282 s343 s355 s367 s385 s420 s434 s465 s476 s507)), p0:(AND (LEQ 2 (ADD s0 s25 s44 s57 s87 ...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 658 steps with 75 reset in 53 ms.
FORMULA PhilosophersDyn-PT-20-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-20-LTLCardinality-04 finished in 18426 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&(G(p1)||G(p2))))))'
Support contains 60 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 193 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
[2023-03-14 20:41:07] [INFO ] Invariant cache hit.
[2023-03-14 20:41:15] [INFO ] Dead Transitions using invariants and state equation in 7329 ms found 0 transitions.
[2023-03-14 20:41:15] [INFO ] Invariant cache hit.
[2023-03-14 20:41:17] [INFO ] Implicit Places using invariants in 2307 ms returned []
Implicit Place search using SMT only with invariants took 2309 ms to find 0 implicit places.
[2023-03-14 20:41:17] [INFO ] Invariant cache hit.
[2023-03-14 20:41:25] [INFO ] Dead Transitions using invariants and state equation in 7508 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17343 ms. Remains : 540/540 places, 15470/15470 transitions.
Stuttering acceptance computed with spot in 935 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : PhilosophersDyn-PT-20-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (AND (NOT p1) (NOT p2))), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=1 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={1} source=1 dest: 3}, { cond=(AND p0 p1 p2), acceptance={} source=1 dest: 4}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={0, 1} source=2 dest: 1}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p1) p2)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={1} source=2 dest: 3}, { cond=(AND p0 p1 p2), acceptance={} source=2 dest: 4}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), acceptance={0, 1} source=3 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=3 dest: 2}, { cond=(OR (AND (NOT p0) p1) (AND p1 (NOT p2))), acceptance={1} source=3 dest: 3}, { cond=(AND p0 p1 p2), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=4 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={0} source=4 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={1} source=4 dest: 3}, { cond=(AND p1 p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ 3 (ADD s42 s72 s154 s156 s192 s212 s214 s263 s286 s304 s307 s348 s371 s372 s373 s403 s427 s443 s505 s508)), p1:(LEQ 1 (ADD s4 s46 s76 s97 s150 s15...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 2 ms.
FORMULA PhilosophersDyn-PT-20-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-20-LTLCardinality-05 finished in 18314 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(X(F(p1)))))'
Support contains 60 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 189 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
[2023-03-14 20:41:26] [INFO ] Invariant cache hit.
[2023-03-14 20:41:33] [INFO ] Dead Transitions using invariants and state equation in 7113 ms found 0 transitions.
[2023-03-14 20:41:33] [INFO ] Invariant cache hit.
[2023-03-14 20:41:35] [INFO ] Implicit Places using invariants in 2382 ms returned []
Implicit Place search using SMT only with invariants took 2386 ms to find 0 implicit places.
[2023-03-14 20:41:35] [INFO ] Invariant cache hit.
[2023-03-14 20:41:43] [INFO ] Dead Transitions using invariants and state equation in 7428 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17120 ms. Remains : 540/540 places, 15470/15470 transitions.
Stuttering acceptance computed with spot in 194 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PhilosophersDyn-PT-20-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(LEQ 3 (ADD s33 s58 s94 s119 s121 s160 s173 s177 s258 s268 s291 s323 s379 s429 s439 s451 s464 s475 s489 s497)), p0:(LEQ (ADD s29 s34 s62 s89 s91 s115 s...], 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, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 4 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 17352 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(p1)||X(G(p2)))))'
Support contains 480 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 58 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
[2023-03-14 20:41:43] [INFO ] Invariant cache hit.
[2023-03-14 20:41:50] [INFO ] Dead Transitions using invariants and state equation in 7379 ms found 0 transitions.
[2023-03-14 20:41:50] [INFO ] Invariant cache hit.
[2023-03-14 20:41:51] [INFO ] Implicit Places using invariants in 768 ms returned []
Implicit Place search using SMT only with invariants took 769 ms to find 0 implicit places.
[2023-03-14 20:41:51] [INFO ] Invariant cache hit.
[2023-03-14 20:41:59] [INFO ] Dead Transitions using invariants and state equation in 7462 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15671 ms. Remains : 540/540 places, 15470/15470 transitions.
Stuttering acceptance computed with spot in 174 ms :[true, (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p1)]
Running random walk in product with property : PhilosophersDyn-PT-20-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={} source=3 dest: 0}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 3}, { cond=(AND p1 p2), acceptance={} source=4 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={} source=5 dest: 0}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=1, aps=[p0:(GT 1 (ADD s42 s72 s154 s156 s192 s212 s214 s263 s286 s304 s307 s348 s371 s372 s373 s403 s427 s443 s505 s508)), p1:(LEQ (ADD s29 s34 s62 s89 s91 s115 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 42 steps with 4 reset in 5 ms.
FORMULA PhilosophersDyn-PT-20-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-20-LTLCardinality-07 finished in 15895 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 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 3793 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
[2023-03-14 20:42:03] [INFO ] Invariant cache hit.
[2023-03-14 20:42:10] [INFO ] Dead Transitions using invariants and state equation in 7412 ms found 0 transitions.
[2023-03-14 20:42:10] [INFO ] Invariant cache hit.
[2023-03-14 20:42:13] [INFO ] Implicit Places using invariants in 3008 ms returned []
Implicit Place search using SMT only with invariants took 3008 ms to find 0 implicit places.
[2023-03-14 20:42:13] [INFO ] Invariant cache hit.
[2023-03-14 20:42:20] [INFO ] Dead Transitions using invariants and state equation in 7486 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 21702 ms. Remains : 540/540 places, 15470/15470 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : PhilosophersDyn-PT-20-LTLCardinality-09 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 s4 s324) (LEQ s361 s137))], 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 82 steps with 8 reset in 5 ms.
FORMULA PhilosophersDyn-PT-20-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-20-LTLCardinality-09 finished in 21781 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(((p0 U p1)&&X((F(G(p0))||(p2 U p3))))))))'
Support contains 7 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 201 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
[2023-03-14 20:42:21] [INFO ] Invariant cache hit.
[2023-03-14 20:42:28] [INFO ] Dead Transitions using invariants and state equation in 7303 ms found 0 transitions.
[2023-03-14 20:42:28] [INFO ] Invariant cache hit.
[2023-03-14 20:42:31] [INFO ] Implicit Places using invariants in 3003 ms returned []
Implicit Place search using SMT only with invariants took 3004 ms to find 0 implicit places.
[2023-03-14 20:42:31] [INFO ] Invariant cache hit.
[2023-03-14 20:42:38] [INFO ] Dead Transitions using invariants and state equation in 7324 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17836 ms. Remains : 540/540 places, 15470/15470 transitions.
Stuttering acceptance computed with spot in 284 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p3))), (OR (NOT p1) (AND (NOT p0) (NOT p3))), (OR (NOT p1) (AND (NOT p0) (NOT p3))), true, (NOT p1), (AND (NOT p0) (NOT p3)), (NOT p0)]
Running random walk in product with property : PhilosophersDyn-PT-20-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 4}, { cond=(OR p1 p0), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 4}], [{ cond=(AND p0 (NOT p3) p2), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=5 dest: 6}], [{ cond=p0, acceptance={} source=6 dest: 6}, { cond=(NOT p0), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(LEQ s413 s184), p0:(LEQ s385 s213), p3:(LEQ 1 s325), p2:(LEQ s64 s520)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 386 steps with 45 reset in 22 ms.
FORMULA PhilosophersDyn-PT-20-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-20-LTLCardinality-10 finished in 18188 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(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 3157 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
[2023-03-14 20:42:42] [INFO ] Invariant cache hit.
[2023-03-14 20:42:49] [INFO ] Dead Transitions using invariants and state equation in 7564 ms found 0 transitions.
[2023-03-14 20:42:49] [INFO ] Invariant cache hit.
[2023-03-14 20:42:52] [INFO ] Implicit Places using invariants in 2978 ms returned []
Implicit Place search using SMT only with invariants took 2979 ms to find 0 implicit places.
[2023-03-14 20:42:52] [INFO ] Invariant cache hit.
[2023-03-14 20:43:00] [INFO ] Dead Transitions using invariants and state equation in 7385 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 21086 ms. Remains : 540/540 places, 15470/15470 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : PhilosophersDyn-PT-20-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s97 s190)], 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 1 ms.
FORMULA PhilosophersDyn-PT-20-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-20-LTLCardinality-11 finished in 21164 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U p1)))'
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 199 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
[2023-03-14 20:43:00] [INFO ] Invariant cache hit.
[2023-03-14 20:43:07] [INFO ] Dead Transitions using invariants and state equation in 7353 ms found 0 transitions.
[2023-03-14 20:43:07] [INFO ] Invariant cache hit.
[2023-03-14 20:43:10] [INFO ] Implicit Places using invariants in 3025 ms returned []
Implicit Place search using SMT only with invariants took 3026 ms to find 0 implicit places.
[2023-03-14 20:43:10] [INFO ] Invariant cache hit.
[2023-03-14 20:43:18] [INFO ] Dead Transitions using invariants and state equation in 7191 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17772 ms. Remains : 540/540 places, 15470/15470 transitions.
Stuttering acceptance computed with spot in 100 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : PhilosophersDyn-PT-20-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(LEQ 3 s173), p0:(LEQ 3 s489)], 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, 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-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-20-LTLCardinality-13 finished in 17913 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((!p0&&X(p1))||G(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 197 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
[2023-03-14 20:43:18] [INFO ] Invariant cache hit.
[2023-03-14 20:43:25] [INFO ] Dead Transitions using invariants and state equation in 7418 ms found 0 transitions.
[2023-03-14 20:43:25] [INFO ] Invariant cache hit.
[2023-03-14 20:43:28] [INFO ] Implicit Places using invariants in 2882 ms returned []
Implicit Place search using SMT only with invariants took 2883 ms to find 0 implicit places.
[2023-03-14 20:43:28] [INFO ] Invariant cache hit.
[2023-03-14 20:43:36] [INFO ] Dead Transitions using invariants and state equation in 7538 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18040 ms. Remains : 540/540 places, 15470/15470 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : PhilosophersDyn-PT-20-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (LEQ s56 s497) (LEQ 1 s348)), p1:(GT s56 s497)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 2 ms.
FORMULA PhilosophersDyn-PT-20-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-20-LTLCardinality-14 finished in 18156 ms.
All properties solved by simple procedures.
Total runtime 326065 ms.
ITS solved all properties within timeout

BK_STOP 1678826620556

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

+ 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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML

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="lolaxred"
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-5348"
echo " Executing tool lolaxred"
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 r295-tall-167873947700331"
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 ;