About the Execution of LoLa+red for Philosophers-PT-000500
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1505.483 | 578694.00 | 617355.00 | 1836.00 | FFFFFFFFFFFFFFFF | normal |
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-167873947600235.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 Philosophers-PT-000500, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r295-tall-167873947600235
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 20M
-rw-r--r-- 1 mcc users 716K Feb 25 14:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 3.9M Feb 25 14:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 379K Feb 25 13:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 2.4M Feb 25 13:29 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 214K Feb 25 16:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 840K Feb 25 16:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 184K Feb 25 16:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 850K Feb 25 16:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.2M Feb 25 15:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 6.5M Feb 25 15:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 234K Feb 25 14:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.4M Feb 25 14:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 46K Feb 25 16:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 130K Feb 25 16:33 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 1.1M 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 Philosophers-PT-000500-LTLCardinality-00
FORMULA_NAME Philosophers-PT-000500-LTLCardinality-01
FORMULA_NAME Philosophers-PT-000500-LTLCardinality-02
FORMULA_NAME Philosophers-PT-000500-LTLCardinality-03
FORMULA_NAME Philosophers-PT-000500-LTLCardinality-04
FORMULA_NAME Philosophers-PT-000500-LTLCardinality-05
FORMULA_NAME Philosophers-PT-000500-LTLCardinality-06
FORMULA_NAME Philosophers-PT-000500-LTLCardinality-07
FORMULA_NAME Philosophers-PT-000500-LTLCardinality-08
FORMULA_NAME Philosophers-PT-000500-LTLCardinality-09
FORMULA_NAME Philosophers-PT-000500-LTLCardinality-10
FORMULA_NAME Philosophers-PT-000500-LTLCardinality-11
FORMULA_NAME Philosophers-PT-000500-LTLCardinality-12
FORMULA_NAME Philosophers-PT-000500-LTLCardinality-13
FORMULA_NAME Philosophers-PT-000500-LTLCardinality-14
FORMULA_NAME Philosophers-PT-000500-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1678805639949
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=Philosophers-PT-000500
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-14 14:54:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-14 14:54:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 14:54:01] [INFO ] Load time of PNML (sax parser for PT used): 143 ms
[2023-03-14 14:54:01] [INFO ] Transformed 2500 places.
[2023-03-14 14:54:01] [INFO ] Transformed 2500 transitions.
[2023-03-14 14:54:01] [INFO ] Parsed PT model containing 2500 places and 2500 transitions and 8000 arcs in 237 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 112 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA Philosophers-PT-000500-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 2500 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 31 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
// Phase 1: matrix 2500 rows 2500 cols
[2023-03-14 14:54:02] [INFO ] Computed 1000 place invariants in 31 ms
[2023-03-14 14:54:02] [INFO ] Implicit Places using invariants in 437 ms returned []
[2023-03-14 14:54:02] [INFO ] Invariant cache hit.
[2023-03-14 14:54:04] [INFO ] Implicit Places using invariants and state equation in 1421 ms returned []
Implicit Place search using SMT with State Equation took 1882 ms to find 0 implicit places.
[2023-03-14 14:54:04] [INFO ] Invariant cache hit.
[2023-03-14 14:54:05] [INFO ] Dead Transitions using invariants and state equation in 1574 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3489 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Support contains 2500 out of 2500 places after structural reductions.
[2023-03-14 14:54:06] [INFO ] Flatten gal took : 201 ms
[2023-03-14 14:54:06] [INFO ] Flatten gal took : 127 ms
[2023-03-14 14:54:06] [INFO ] Input system was already deterministic with 2500 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1173 ms. (steps per millisecond=8 ) properties (out of 32) seen :17
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 38 ms. (steps per millisecond=26 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 50 ms. (steps per millisecond=20 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 39 ms. (steps per millisecond=25 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 15) seen :0
Running SMT prover for 15 properties.
[2023-03-14 14:54:08] [INFO ] Invariant cache hit.
[2023-03-14 14:54:09] [INFO ] [Real]Absence check using 1000 positive place invariants in 183 ms returned sat
[2023-03-14 14:54:11] [INFO ] After 2665ms SMT Verify possible using all constraints in real domain returned unsat :7 sat :0 real:8
[2023-03-14 14:54:11] [INFO ] [Nat]Absence check using 1000 positive place invariants in 175 ms returned sat
[2023-03-14 14:54:13] [INFO ] After 1522ms SMT Verify possible using state equation in natural domain returned unsat :11 sat :4
[2023-03-14 14:54:14] [INFO ] After 2422ms SMT Verify possible using trap constraints in natural domain returned unsat :11 sat :4
Attempting to minimize the solution found.
Minimization took 325 ms.
[2023-03-14 14:54:14] [INFO ] After 3698ms SMT Verify possible using all constraints in natural domain returned unsat :11 sat :4
Fused 15 Parikh solutions to 2 different solutions.
Finished Parikh walk after 500 steps, including 0 resets, run visited all 4 properties in 99 ms. (steps per millisecond=5 )
Parikh walk visited 4 properties in 101 ms.
FORMULA Philosophers-PT-000500-LTLCardinality-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 11 atomic propositions for a total of 14 simplifications.
FORMULA Philosophers-PT-000500-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
FORMULA Philosophers-PT-000500-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000500-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000500-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000500-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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)))'
Support contains 500 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 189 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-14 14:54:15] [INFO ] Invariant cache hit.
[2023-03-14 14:54:16] [INFO ] Implicit Places using invariants in 1156 ms returned []
[2023-03-14 14:54:16] [INFO ] Invariant cache hit.
[2023-03-14 14:54:19] [INFO ] Implicit Places using invariants and state equation in 2496 ms returned []
Implicit Place search using SMT with State Equation took 3653 ms to find 0 implicit places.
[2023-03-14 14:54:19] [INFO ] Invariant cache hit.
[2023-03-14 14:54:20] [INFO ] Dead Transitions using invariants and state equation in 1465 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5308 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Stuttering acceptance computed with spot in 210 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-PT-000500-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ 1 (ADD s477 s478 s479 s480 s481 s482 s483 s484 s488 s509 s510 s511 s512 s513 s514 s515 s516 s517 s518 s519 s520 s521 s522 s523 s524 s525 s526 s527...], 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 27317 steps with 0 reset in 1147 ms.
FORMULA Philosophers-PT-000500-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000500-LTLCardinality-00 finished in 6733 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)||X(F(p1)))))'
Support contains 1500 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 84 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-14 14:54:22] [INFO ] Invariant cache hit.
[2023-03-14 14:54:22] [INFO ] Implicit Places using invariants in 832 ms returned []
[2023-03-14 14:54:22] [INFO ] Invariant cache hit.
[2023-03-14 14:54:25] [INFO ] Implicit Places using invariants and state equation in 2142 ms returned []
Implicit Place search using SMT with State Equation took 2977 ms to find 0 implicit places.
[2023-03-14 14:54:25] [INFO ] Redundant transitions in 207 ms returned []
[2023-03-14 14:54:25] [INFO ] Invariant cache hit.
[2023-03-14 14:54:26] [INFO ] Dead Transitions using invariants and state equation in 1482 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4764 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Philosophers-PT-000500-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration timeout after 49200 steps with 660 reset in 10001 ms.
Product exploration timeout after 48340 steps with 659 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 p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 2 factoid took 198 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 26 steps, including 0 resets, run visited all 2 properties in 7 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (NOT p0)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 205 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 1500 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 57 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-14 14:55:00] [INFO ] Invariant cache hit.
[2023-03-14 14:55:00] [INFO ] Implicit Places using invariants in 808 ms returned []
[2023-03-14 14:55:00] [INFO ] Invariant cache hit.
[2023-03-14 14:55:02] [INFO ] Implicit Places using invariants and state equation in 2025 ms returned []
Implicit Place search using SMT with State Equation took 2835 ms to find 0 implicit places.
[2023-03-14 14:55:03] [INFO ] Redundant transitions in 46 ms returned []
[2023-03-14 14:55:03] [INFO ] Invariant cache hit.
[2023-03-14 14:55:04] [INFO ] Dead Transitions using invariants and state equation in 1482 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4432 ms. Remains : 2500/2500 places, 2500/2500 transitions.
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 p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 2 factoid took 103 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 61 steps, including 0 resets, run visited all 2 properties in 15 ms. (steps per millisecond=4 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (NOT p0)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 146 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration timeout after 49530 steps with 653 reset in 10002 ms.
Product exploration timeout after 48200 steps with 653 reset in 10001 ms.
Support contains 1500 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 102 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-14 14:55:37] [INFO ] Invariant cache hit.
[2023-03-14 14:55:38] [INFO ] Implicit Places using invariants in 837 ms returned []
[2023-03-14 14:55:38] [INFO ] Invariant cache hit.
[2023-03-14 14:55:40] [INFO ] Implicit Places using invariants and state equation in 2010 ms returned []
Implicit Place search using SMT with State Equation took 2851 ms to find 0 implicit places.
[2023-03-14 14:55:40] [INFO ] Redundant transitions in 129 ms returned []
[2023-03-14 14:55:40] [INFO ] Invariant cache hit.
[2023-03-14 14:55:42] [INFO ] Dead Transitions using invariants and state equation in 1476 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4571 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Treatment of property Philosophers-PT-000500-LTLCardinality-01 finished in 80504 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)&&G(F(p0)))))'
Support contains 1500 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 126 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-14 14:55:42] [INFO ] Invariant cache hit.
[2023-03-14 14:55:43] [INFO ] Implicit Places using invariants in 908 ms returned []
[2023-03-14 14:55:43] [INFO ] Invariant cache hit.
[2023-03-14 14:55:45] [INFO ] Implicit Places using invariants and state equation in 2190 ms returned []
Implicit Place search using SMT with State Equation took 3101 ms to find 0 implicit places.
[2023-03-14 14:55:45] [INFO ] Invariant cache hit.
[2023-03-14 14:55:47] [INFO ] Dead Transitions using invariants and state equation in 1445 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4672 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Stuttering acceptance computed with spot in 225 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p1), (NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-PT-000500-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 4}, { cond=(OR p1 p0), acceptance={} source=1 dest: 5}], [{ 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}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(LEQ (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, 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 1 steps with 0 reset in 1 ms.
FORMULA Philosophers-PT-000500-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000500-LTLCardinality-02 finished in 4929 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(F((p0||G(p1))))))'
Support contains 1000 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 30 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-14 14:55:47] [INFO ] Invariant cache hit.
[2023-03-14 14:55:48] [INFO ] Implicit Places using invariants in 1141 ms returned []
[2023-03-14 14:55:48] [INFO ] Invariant cache hit.
[2023-03-14 14:55:51] [INFO ] Implicit Places using invariants and state equation in 2479 ms returned []
Implicit Place search using SMT with State Equation took 3622 ms to find 0 implicit places.
[2023-03-14 14:55:51] [INFO ] Invariant cache hit.
[2023-03-14 14:55:52] [INFO ] Dead Transitions using invariants and state equation in 1434 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5087 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Philosophers-PT-000500-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p1:(GT 1 (ADD s957 s958 s959 s960 s961 s962 s963 s964 s965 s966 s967 s968 s969 s970 s971 s972 s975 s977 s978 s979 s980 s1021 s1022 s1023 s1024 s1025 s1026...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration timeout after 76270 steps with 21738 reset in 10001 ms.
Product exploration timeout after 73520 steps with 20918 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 p1 (NOT p0)), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Knowledge based reduction with 2 factoid took 121 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 712 ms. (steps per millisecond=14 ) properties (out of 2) seen :1
Finished Best-First random walk after 2997 steps, including 0 resets, run visited all 1 properties in 122 ms. (steps per millisecond=24 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 185 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 1000 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 25 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-14 14:56:50] [INFO ] Invariant cache hit.
[2023-03-14 14:56:52] [INFO ] Implicit Places using invariants in 1192 ms returned []
[2023-03-14 14:56:52] [INFO ] Invariant cache hit.
[2023-03-14 14:56:54] [INFO ] Implicit Places using invariants and state equation in 2600 ms returned []
Implicit Place search using SMT with State Equation took 3798 ms to find 0 implicit places.
[2023-03-14 14:56:54] [INFO ] Invariant cache hit.
[2023-03-14 14:56:56] [INFO ] Dead Transitions using invariants and state equation in 1469 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5294 ms. Remains : 2500/2500 places, 2500/2500 transitions.
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 (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 2 factoid took 122 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 710 ms. (steps per millisecond=14 ) properties (out of 2) seen :1
Finished Best-First random walk after 2997 steps, including 0 resets, run visited all 1 properties in 123 ms. (steps per millisecond=24 )
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 239 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration timeout after 74470 steps with 21286 reset in 10001 ms.
Product exploration timeout after 72060 steps with 20545 reset in 10003 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 1000 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 114 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-14 14:57:52] [INFO ] Redundant transitions in 47 ms returned []
[2023-03-14 14:57:52] [INFO ] Invariant cache hit.
[2023-03-14 14:57:54] [INFO ] Dead Transitions using invariants and state equation in 1492 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1662 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Support contains 1000 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 29 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-14 14:57:54] [INFO ] Invariant cache hit.
[2023-03-14 14:57:55] [INFO ] Implicit Places using invariants in 1193 ms returned []
[2023-03-14 14:57:55] [INFO ] Invariant cache hit.
[2023-03-14 14:57:58] [INFO ] Implicit Places using invariants and state equation in 2555 ms returned []
Implicit Place search using SMT with State Equation took 3750 ms to find 0 implicit places.
[2023-03-14 14:57:58] [INFO ] Invariant cache hit.
[2023-03-14 14:57:59] [INFO ] Dead Transitions using invariants and state equation in 1435 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5216 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Treatment of property Philosophers-PT-000500-LTLCardinality-03 finished in 132249 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 1000 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 56 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-14 14:57:59] [INFO ] Invariant cache hit.
[2023-03-14 14:58:00] [INFO ] Implicit Places using invariants in 1129 ms returned []
[2023-03-14 14:58:00] [INFO ] Invariant cache hit.
[2023-03-14 14:58:03] [INFO ] Implicit Places using invariants and state equation in 2483 ms returned []
Implicit Place search using SMT with State Equation took 3613 ms to find 0 implicit places.
[2023-03-14 14:58:03] [INFO ] Redundant transitions in 52 ms returned []
[2023-03-14 14:58:03] [INFO ] Invariant cache hit.
[2023-03-14 14:58:04] [INFO ] Dead Transitions using invariants and state equation in 1385 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5116 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Stuttering acceptance computed with spot in 42 ms :[p0]
Running random walk in product with property : Philosophers-PT-000500-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 5532 ms.
Stack based approach found an accepted trace after 29753 steps with 0 reset with depth 29754 and stack size 9285 in 1927 ms.
FORMULA Philosophers-PT-000500-LTLCardinality-04 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-000500-LTLCardinality-04 finished in 12646 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&&X(F(!p0))&&F(p1)))))'
Support contains 1000 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 26 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-14 14:58:12] [INFO ] Invariant cache hit.
[2023-03-14 14:58:13] [INFO ] Implicit Places using invariants in 866 ms returned []
[2023-03-14 14:58:13] [INFO ] Invariant cache hit.
[2023-03-14 14:58:15] [INFO ] Implicit Places using invariants and state equation in 2134 ms returned []
Implicit Place search using SMT with State Equation took 3001 ms to find 0 implicit places.
[2023-03-14 14:58:15] [INFO ] Invariant cache hit.
[2023-03-14 14:58:16] [INFO ] Dead Transitions using invariants and state equation in 1435 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4464 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Stuttering acceptance computed with spot in 151 ms :[true, true, p0, (NOT p1)]
Running random walk in product with property : Philosophers-PT-000500-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(GT 1 (ADD s957 s958 s959 s960 s961 s962 s963 s964 s965 s966 s967 s968 s969 s970 s971 s972 s975 s977 s978 s979 s980 s1021 s1022 s1023 s1024 s1025 s1026...], 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 explored 100000 steps with 0 reset in 6550 ms.
Stack based approach found an accepted trace after 2478 steps with 1 reset with depth 2472 and stack size 2472 in 250 ms.
FORMULA Philosophers-PT-000500-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-000500-LTLCardinality-05 finished in 11448 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((((p0||G(p1)) U X(!p2)) U p3))))'
Support contains 1500 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 25 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-14 14:58:23] [INFO ] Invariant cache hit.
[2023-03-14 14:58:24] [INFO ] Implicit Places using invariants in 702 ms returned []
[2023-03-14 14:58:24] [INFO ] Invariant cache hit.
[2023-03-14 14:58:26] [INFO ] Implicit Places using invariants and state equation in 1782 ms returned []
Implicit Place search using SMT with State Equation took 2487 ms to find 0 implicit places.
[2023-03-14 14:58:26] [INFO ] Invariant cache hit.
[2023-03-14 14:58:27] [INFO ] Dead Transitions using invariants and state equation in 1465 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3981 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Stuttering acceptance computed with spot in 307 ms :[(NOT p3), (NOT p3), (NOT p3), p2, (AND (NOT p1) p2), p2, true, (NOT p1)]
Running random walk in product with property : Philosophers-PT-000500-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p3), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p3) (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p3) (NOT p0) p1), acceptance={0} source=2 dest: 4}, { cond=(OR (AND (NOT p3) p0) (AND (NOT p3) p1)), acceptance={0} source=2 dest: 5}], [{ cond=p2, acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 6}, { cond=(AND p1 p2), acceptance={} source=4 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p0) p1 p2), acceptance={0} source=5 dest: 4}, { cond=(OR (AND p0 p2) (AND p1 p2)), acceptance={0} source=5 dest: 5}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(NOT p1), acceptance={} source=7 dest: 6}, { cond=p1, acceptance={} source=7 dest: 7}]], initial=0, aps=[p3:(OR (LEQ 2 (ADD s1414 s1437 s1438 s1439 s1440 s1441 s1442 s1443 s1444 s1445 s1446 s1447 s1448 s1449 s1450 s1451 s1452 s1453 s1454 s1455 s1456 s1457 s14...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration timeout after 73300 steps with 24417 reset in 10001 ms.
Product exploration timeout after 71000 steps with 23659 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 p3) p0 (NOT p1) p2), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p0) p1))))]
False Knowledge obtained : [(X (X (NOT p3))), (X (X p3)), (X (X (OR (AND (NOT p3) p0) (AND (NOT p3) p1)))), (X (X (NOT (OR (AND (NOT p3) p0) (AND (NOT p3) p1)))))]
Knowledge based reduction with 3 factoid took 277 ms. Reduced automaton from 8 states, 15 edges and 4 AP (stutter sensitive) to 8 states, 15 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 288 ms :[(NOT p3), (NOT p3), (NOT p3), p2, (AND (NOT p1) p2), p2, true, (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1198 ms. (steps per millisecond=8 ) properties (out of 11) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 564 ms. (steps per millisecond=17 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 672 ms. (steps per millisecond=14 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 560 ms. (steps per millisecond=17 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 567 ms. (steps per millisecond=17 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-14 14:59:38] [INFO ] Invariant cache hit.
[2023-03-14 14:59:39] [INFO ] [Real]Absence check using 1000 positive place invariants in 183 ms returned sat
[2023-03-14 14:59:41] [INFO ] After 2147ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:1
[2023-03-14 14:59:41] [INFO ] [Nat]Absence check using 1000 positive place invariants in 181 ms returned sat
[2023-03-14 14:59:44] [INFO ] After 1279ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :1
[2023-03-14 14:59:44] [INFO ] After 1439ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :1
Attempting to minimize the solution found.
Minimization took 92 ms.
[2023-03-14 14:59:44] [INFO ] After 2939ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :1
Fused 4 Parikh solutions to 1 different solutions.
Finished Parikh walk after 500 steps, including 0 resets, run visited all 1 properties in 44 ms. (steps per millisecond=11 )
Parikh walk visited 1 properties in 44 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p3) p0 (NOT p1) p2), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p0) p1)))), (G (NOT (AND (NOT p0) p1 (NOT p3)))), (G (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (G (NOT (AND (NOT p0) (NOT p1) p2)))]
False Knowledge obtained : [(X (X (NOT p3))), (X (X p3)), (X (X (OR (AND (NOT p3) p0) (AND (NOT p3) p1)))), (X (X (NOT (OR (AND (NOT p3) p0) (AND (NOT p3) p1))))), (F (NOT p2)), (F (NOT (OR (AND p0 (NOT p3)) (AND p1 (NOT p3))))), (F (AND p1 p2)), (F (NOT (AND (NOT p1) p2))), (F p3), (F (AND (NOT p0) p1 p2)), (F p1), (F (NOT (OR (AND p0 p2) (AND p1 p2))))]
Knowledge based reduction with 6 factoid took 611 ms. Reduced automaton from 8 states, 15 edges and 4 AP (stutter sensitive) to 7 states, 11 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 229 ms :[(AND p0 (NOT p3)), (AND p0 (NOT p3)), (AND p0 (NOT p3)), (AND (NOT p1) p2), p2, true, (NOT p1)]
Stuttering acceptance computed with spot in 262 ms :[(AND p0 (NOT p3)), (AND p0 (NOT p3)), (AND p0 (NOT p3)), (AND (NOT p1) p2), p2, true, (NOT p1)]
[2023-03-14 14:59:45] [INFO ] Invariant cache hit.
[2023-03-14 15:00:00] [INFO ] [Real]Absence check using 1000 positive place invariants in 229 ms returned unknown
Could not prove EG (AND p0 (NOT p3))
Support contains 1500 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 26 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-14 15:00:00] [INFO ] Invariant cache hit.
[2023-03-14 15:00:01] [INFO ] Implicit Places using invariants in 702 ms returned []
[2023-03-14 15:00:01] [INFO ] Invariant cache hit.
[2023-03-14 15:00:03] [INFO ] Implicit Places using invariants and state equation in 1739 ms returned []
Implicit Place search using SMT with State Equation took 2445 ms to find 0 implicit places.
[2023-03-14 15:00:03] [INFO ] Invariant cache hit.
[2023-03-14 15:00:04] [INFO ] Dead Transitions using invariants and state equation in 1455 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3927 ms. Remains : 2500/2500 places, 2500/2500 transitions.
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 p0 (NOT p3) (NOT p1) p2)]
False Knowledge obtained : [(X (X (AND p0 (NOT p3)))), (X (X (NOT (AND p0 (NOT p3)))))]
Knowledge based reduction with 1 factoid took 114 ms. Reduced automaton from 7 states, 11 edges and 4 AP (stutter sensitive) to 7 states, 11 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 234 ms :[(AND p0 (NOT p3)), (AND p0 (NOT p3)), (AND p0 (NOT p3)), (AND (NOT p1) p2), p2, true, (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 697 ms. (steps per millisecond=14 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 467 ms. (steps per millisecond=21 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-14 15:00:18] [INFO ] Invariant cache hit.
[2023-03-14 15:00:19] [INFO ] [Real]Absence check using 1000 positive place invariants in 176 ms returned sat
[2023-03-14 15:00:20] [INFO ] After 1180ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 15:00:20] [INFO ] [Nat]Absence check using 1000 positive place invariants in 178 ms returned sat
[2023-03-14 15:00:23] [INFO ] After 2151ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 15:00:23] [INFO ] After 2294ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 80 ms.
[2023-03-14 15:00:23] [INFO ] After 3597ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 500 steps, including 0 resets, run visited all 1 properties in 44 ms. (steps per millisecond=11 )
Parikh walk visited 1 properties in 44 ms.
Knowledge obtained : [(AND p0 (NOT p3) (NOT p1) p2)]
False Knowledge obtained : [(X (X (AND p0 (NOT p3)))), (X (X (NOT (AND p0 (NOT p3))))), (F (NOT p2)), (F (AND (NOT p0) p2)), (F p1), (F (NOT (AND p0 (NOT p3)))), (F (AND p1 p2)), (F (NOT (AND (NOT p1) p2)))]
Knowledge based reduction with 1 factoid took 224 ms. Reduced automaton from 7 states, 11 edges and 4 AP (stutter sensitive) to 7 states, 11 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 268 ms :[(AND p0 (NOT p3)), (AND p0 (NOT p3)), (AND p0 (NOT p3)), (AND (NOT p1) p2), p2, true, (NOT p1)]
Stuttering acceptance computed with spot in 242 ms :[(AND p0 (NOT p3)), (AND p0 (NOT p3)), (AND p0 (NOT p3)), (AND (NOT p1) p2), p2, true, (NOT p1)]
[2023-03-14 15:00:24] [INFO ] Invariant cache hit.
[2023-03-14 15:00:39] [INFO ] [Real]Absence check using 1000 positive place invariants in 361 ms returned unknown
Could not prove EG (AND p0 (NOT p3))
Stuttering acceptance computed with spot in 284 ms :[(AND p0 (NOT p3)), (AND p0 (NOT p3)), (AND p0 (NOT p3)), (AND (NOT p1) p2), p2, true, (NOT p1)]
Product exploration timeout after 71800 steps with 23917 reset in 10001 ms.
Product exploration timeout after 69360 steps with 23107 reset in 10003 ms.
Applying partial POR strategy [false, false, false, true, false, true, true]
Stuttering acceptance computed with spot in 229 ms :[(AND p0 (NOT p3)), (AND p0 (NOT p3)), (AND p0 (NOT p3)), (AND (NOT p1) p2), p2, true, (NOT p1)]
Support contains 1500 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 37 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-14 15:01:00] [INFO ] Redundant transitions in 50 ms returned []
[2023-03-14 15:01:00] [INFO ] Invariant cache hit.
[2023-03-14 15:01:01] [INFO ] Dead Transitions using invariants and state equation in 1351 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1450 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Support contains 1500 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 18 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-14 15:01:01] [INFO ] Invariant cache hit.
[2023-03-14 15:01:02] [INFO ] Implicit Places using invariants in 684 ms returned []
[2023-03-14 15:01:02] [INFO ] Invariant cache hit.
[2023-03-14 15:01:04] [INFO ] Implicit Places using invariants and state equation in 1733 ms returned []
Implicit Place search using SMT with State Equation took 2419 ms to find 0 implicit places.
[2023-03-14 15:01:04] [INFO ] Invariant cache hit.
[2023-03-14 15:01:05] [INFO ] Dead Transitions using invariants and state equation in 1442 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3879 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Treatment of property Philosophers-PT-000500-LTLCardinality-06 finished in 162062 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(G(p0))&&G(p1))))'
Support contains 4 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 62 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-14 15:01:05] [INFO ] Invariant cache hit.
[2023-03-14 15:01:07] [INFO ] Implicit Places using invariants in 1399 ms returned []
[2023-03-14 15:01:07] [INFO ] Invariant cache hit.
[2023-03-14 15:01:10] [INFO ] Implicit Places using invariants and state equation in 2983 ms returned []
Implicit Place search using SMT with State Equation took 4383 ms to find 0 implicit places.
[2023-03-14 15:01:10] [INFO ] Invariant cache hit.
[2023-03-14 15:01:11] [INFO ] Dead Transitions using invariants and state equation in 1388 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5834 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
Running random walk in product with property : Philosophers-PT-000500-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ s345 s896), p0:(GT s2331 s1229)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1224 ms.
Stack based approach found an accepted trace after 6293 steps with 0 reset with depth 6294 and stack size 6294 in 189 ms.
FORMULA Philosophers-PT-000500-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-000500-LTLCardinality-12 finished in 7379 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 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Performed 497 Post agglomeration using F-continuation condition.Transition count delta: 497
Deduced a syphon composed of 497 places in 0 ms
Reduce places removed 497 places and 0 transitions.
Iterating global reduction 0 with 994 rules applied. Total rules applied 994 place count 2003 transition count 2003
Applied a total of 994 rules in 250 ms. Remains 2003 /2500 variables (removed 497) and now considering 2003/2500 (removed 497) transitions.
// Phase 1: matrix 2003 rows 2003 cols
[2023-03-14 15:01:13] [INFO ] Computed 1000 place invariants in 6 ms
[2023-03-14 15:01:14] [INFO ] Implicit Places using invariants in 1207 ms returned []
[2023-03-14 15:01:14] [INFO ] Invariant cache hit.
[2023-03-14 15:01:17] [INFO ] Implicit Places using invariants and state equation in 2772 ms returned []
Implicit Place search using SMT with State Equation took 3979 ms to find 0 implicit places.
[2023-03-14 15:01:17] [INFO ] Redundant transitions in 39 ms returned []
[2023-03-14 15:01:17] [INFO ] Invariant cache hit.
[2023-03-14 15:01:18] [INFO ] Dead Transitions using invariants and state equation in 1051 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2003/2500 places, 2003/2500 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5331 ms. Remains : 2003/2500 places, 2003/2500 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : Philosophers-PT-000500-LTLCardinality-13 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 s722 s156)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 1483 ms.
Stack based approach found an accepted trace after 2557 steps with 0 reset with depth 2558 and stack size 2552 in 149 ms.
FORMULA Philosophers-PT-000500-LTLCardinality-13 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-000500-LTLCardinality-13 finished in 7019 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)||X(F(p1)))))'
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(F((p0||G(p1))))))'
Found a Shortening insensitive property : Philosophers-PT-000500-LTLCardinality-03
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 1000 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 42 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
// Phase 1: matrix 2500 rows 2500 cols
[2023-03-14 15:01:20] [INFO ] Computed 1000 place invariants in 11 ms
[2023-03-14 15:01:21] [INFO ] Implicit Places using invariants in 1177 ms returned []
[2023-03-14 15:01:21] [INFO ] Invariant cache hit.
[2023-03-14 15:01:24] [INFO ] Implicit Places using invariants and state equation in 2555 ms returned []
Implicit Place search using SMT with State Equation took 3734 ms to find 0 implicit places.
[2023-03-14 15:01:24] [INFO ] Invariant cache hit.
[2023-03-14 15:01:25] [INFO ] Dead Transitions using invariants and state equation in 1461 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 5238 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Running random walk in product with property : Philosophers-PT-000500-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p1:(GT 1 (ADD s957 s958 s959 s960 s961 s962 s963 s964 s965 s966 s967 s968 s969 s970 s971 s972 s975 s977 s978 s979 s980 s1021 s1022 s1023 s1024 s1025 s1026...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration timeout after 75450 steps with 21472 reset in 10001 ms.
Product exploration timeout after 73070 steps with 20807 reset in 10002 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 p1 (NOT p0)), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Knowledge based reduction with 2 factoid took 140 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 710 ms. (steps per millisecond=14 ) properties (out of 2) seen :1
Finished Best-First random walk after 2997 steps, including 0 resets, run visited all 1 properties in 137 ms. (steps per millisecond=21 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 154 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 1000 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 27 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-14 15:02:25] [INFO ] Invariant cache hit.
[2023-03-14 15:02:26] [INFO ] Implicit Places using invariants in 1207 ms returned []
[2023-03-14 15:02:26] [INFO ] Invariant cache hit.
[2023-03-14 15:02:29] [INFO ] Implicit Places using invariants and state equation in 2614 ms returned []
Implicit Place search using SMT with State Equation took 3822 ms to find 0 implicit places.
[2023-03-14 15:02:29] [INFO ] Invariant cache hit.
[2023-03-14 15:02:31] [INFO ] Dead Transitions using invariants and state equation in 1443 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5294 ms. Remains : 2500/2500 places, 2500/2500 transitions.
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 (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 2 factoid took 136 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 721 ms. (steps per millisecond=13 ) properties (out of 2) seen :1
Finished Best-First random walk after 2997 steps, including 0 resets, run visited all 1 properties in 127 ms. (steps per millisecond=23 )
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 139 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration timeout after 73970 steps with 21141 reset in 10001 ms.
Product exploration timeout after 71180 steps with 20207 reset in 10001 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 1000 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 39 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-14 15:03:29] [INFO ] Redundant transitions in 50 ms returned []
[2023-03-14 15:03:29] [INFO ] Invariant cache hit.
[2023-03-14 15:03:30] [INFO ] Dead Transitions using invariants and state equation in 1473 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1574 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Support contains 1000 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 24 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-14 15:03:30] [INFO ] Invariant cache hit.
[2023-03-14 15:03:31] [INFO ] Implicit Places using invariants in 1171 ms returned []
[2023-03-14 15:03:31] [INFO ] Invariant cache hit.
[2023-03-14 15:03:34] [INFO ] Implicit Places using invariants and state equation in 2500 ms returned []
Implicit Place search using SMT with State Equation took 3673 ms to find 0 implicit places.
[2023-03-14 15:03:34] [INFO ] Invariant cache hit.
[2023-03-14 15:03:35] [INFO ] Dead Transitions using invariants and state equation in 1478 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5175 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Treatment of property Philosophers-PT-000500-LTLCardinality-03 finished in 135501 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((((p0||G(p1)) U X(!p2)) U p3))))'
[2023-03-14 15:03:35] [INFO ] Flatten gal took : 98 ms
[2023-03-14 15:03:36] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2023-03-14 15:03:36] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2500 places, 2500 transitions and 8000 arcs took 10 ms.
Total runtime 574698 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT Philosophers-PT-000500
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/368
LTLCardinality
FORMULA Philosophers-PT-000500-LTLCardinality-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Philosophers-PT-000500-LTLCardinality-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Philosophers-PT-000500-LTLCardinality-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
BK_STOP 1678806218643
--------------------
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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ 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
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/368/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/368/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/368/LTLCardinality.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: LAUNCH task # 1 (type EXCL) for 0 Philosophers-PT-000500-LTLCardinality-01
lola: time limit : 1199 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for Philosophers-PT-000500-LTLCardinality-01
lola: result : false
lola: markings : 112
lola: fired transitions : 116
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 4 (type EXCL) for 3 Philosophers-PT-000500-LTLCardinality-03
lola: time limit : 1799 sec
lola: memory limit: 32 pages
lola: FINISHED task # 4 (type EXCL) for Philosophers-PT-000500-LTLCardinality-03
lola: result : false
lola: markings : 7184
lola: fired transitions : 7184
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 7 (type EXCL) for 6 Philosophers-PT-000500-LTLCardinality-06
lola: time limit : 3598 sec
lola: memory limit: 32 pages
lola: FINISHED task # 7 (type EXCL) for Philosophers-PT-000500-LTLCardinality-06
lola: result : false
lola: markings : 7065
lola: fired transitions : 7065
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open formulas
FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Philosophers-PT-000500-LTLCardinality-01: LTL false LTL model checker
Philosophers-PT-000500-LTLCardinality-03: LTL false LTL model checker
Philosophers-PT-000500-LTLCardinality-06: LTL false LTL model checker
Time elapsed: 2 secs. Pages in use: 1
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="Philosophers-PT-000500"
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 Philosophers-PT-000500, 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-167873947600235"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Philosophers-PT-000500.tgz
mv Philosophers-PT-000500 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 '
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 ;