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.r165-tall-167838850900811.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 itstools
Input is GPPP-PT-C0001N0000100000, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r165-tall-167838850900811
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 468K
-rw-r--r-- 1 mcc users 6.1K Feb 26 10:40 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Feb 26 10:40 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Feb 26 10:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 26 10:39 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Feb 25 16:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Feb 25 16:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 10:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K Feb 26 10:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 10:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Feb 26 10:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 17 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1 Mar 5 18:22 large_marking
-rw-r--r-- 1 mcc users 21K Mar 5 18:22 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 GPPP-PT-C0001N0000100000-LTLCardinality-00
FORMULA_NAME GPPP-PT-C0001N0000100000-LTLCardinality-01
FORMULA_NAME GPPP-PT-C0001N0000100000-LTLCardinality-02
FORMULA_NAME GPPP-PT-C0001N0000100000-LTLCardinality-03
FORMULA_NAME GPPP-PT-C0001N0000100000-LTLCardinality-04
FORMULA_NAME GPPP-PT-C0001N0000100000-LTLCardinality-05
FORMULA_NAME GPPP-PT-C0001N0000100000-LTLCardinality-06
FORMULA_NAME GPPP-PT-C0001N0000100000-LTLCardinality-07
FORMULA_NAME GPPP-PT-C0001N0000100000-LTLCardinality-08
FORMULA_NAME GPPP-PT-C0001N0000100000-LTLCardinality-09
FORMULA_NAME GPPP-PT-C0001N0000100000-LTLCardinality-10
FORMULA_NAME GPPP-PT-C0001N0000100000-LTLCardinality-11
FORMULA_NAME GPPP-PT-C0001N0000100000-LTLCardinality-12
FORMULA_NAME GPPP-PT-C0001N0000100000-LTLCardinality-13
FORMULA_NAME GPPP-PT-C0001N0000100000-LTLCardinality-14
FORMULA_NAME GPPP-PT-C0001N0000100000-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679590549313

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=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPPP-PT-C0001N0000100000
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-23 16:55:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-23 16:55:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 16:55:51] [INFO ] Load time of PNML (sax parser for PT used): 28 ms
[2023-03-23 16:55:51] [INFO ] Transformed 33 places.
[2023-03-23 16:55:51] [INFO ] Transformed 22 transitions.
[2023-03-23 16:55:51] [INFO ] Parsed PT model containing 33 places and 22 transitions and 83 arcs in 83 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA GPPP-PT-C0001N0000100000-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000100000-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000100000-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 9 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2023-03-23 16:55:51] [INFO ] Computed 13 place invariants in 7 ms
[2023-03-23 16:55:51] [INFO ] Dead Transitions using invariants and state equation in 124 ms found 0 transitions.
[2023-03-23 16:55:51] [INFO ] Invariant cache hit.
[2023-03-23 16:55:51] [INFO ] Implicit Places using invariants in 45 ms returned [19]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 47 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 32/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 202 ms. Remains : 32/33 places, 22/22 transitions.
Support contains 24 out of 32 places after structural reductions.
[2023-03-23 16:55:51] [INFO ] Flatten gal took : 18 ms
[2023-03-23 16:55:51] [INFO ] Flatten gal took : 5 ms
[2023-03-23 16:55:51] [INFO ] Input system was already deterministic with 22 transitions.
Support contains 23 out of 32 places (down from 24) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 308 ms. (steps per millisecond=32 ) properties (out of 26) seen :13
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 22 rows 32 cols
[2023-03-23 16:55:52] [INFO ] Computed 12 place invariants in 4 ms
[2023-03-23 16:55:52] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-23 16:55:52] [INFO ] [Nat]Absence check using 7 positive place invariants in 16 ms returned sat
[2023-03-23 16:55:52] [INFO ] [Nat]Absence check using 7 positive and 5 generalized place invariants in 9 ms returned sat
[2023-03-23 16:55:52] [INFO ] After 81ms SMT Verify possible using state equation in natural domain returned unsat :6 sat :6
[2023-03-23 16:55:52] [INFO ] After 174ms SMT Verify possible using trap constraints in natural domain returned unsat :6 sat :6
Attempting to minimize the solution found.
Minimization took 89 ms.
[2023-03-23 16:55:52] [INFO ] After 440ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :6
Fused 12 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 10006 ms.
Support contains 6 out of 32 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 32/32 places, 22/22 transitions.
Graph (trivial) has 3 edges and 32 vertex of which 2 / 32 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 31 transition count 18
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 29 transition count 17
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7 place count 28 transition count 17
Applied a total of 7 rules in 7 ms. Remains 28 /32 variables (removed 4) and now considering 17/22 (removed 5) transitions.
// Phase 1: matrix 17 rows 28 cols
[2023-03-23 16:56:02] [INFO ] Computed 12 place invariants in 2 ms
[2023-03-23 16:56:02] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 28/32 places, 17/22 transitions.
Incomplete random walk after 10005 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 609878 steps, run timeout after 3001 ms. (steps per millisecond=203 ) properties seen :{}
Probabilistic random walk after 609878 steps, saw 314768 distinct states, run finished after 3002 ms. (steps per millisecond=203 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-23 16:56:06] [INFO ] Invariant cache hit.
[2023-03-23 16:56:06] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-23 16:56:06] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-23 16:56:06] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 8 ms returned sat
[2023-03-23 16:56:06] [INFO ] After 209ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-23 16:56:06] [INFO ] After 337ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 691 ms.
[2023-03-23 16:56:07] [INFO ] After 1088ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 1 properties in 12004 ms.
Support contains 5 out of 28 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 28/28 places, 17/17 transitions.
Applied a total of 0 rules in 3 ms. Remains 28 /28 variables (removed 0) and now considering 17/17 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 28/28 places, 17/17 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 28/28 places, 17/17 transitions.
Applied a total of 0 rules in 10 ms. Remains 28 /28 variables (removed 0) and now considering 17/17 (removed 0) transitions.
[2023-03-23 16:56:19] [INFO ] Invariant cache hit.
[2023-03-23 16:56:19] [INFO ] Implicit Places using invariants in 41 ms returned [0, 1, 2, 3]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 42 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 24/28 places, 17/17 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 23 transition count 16
Applied a total of 2 rules in 3 ms. Remains 23 /24 variables (removed 1) and now considering 16/17 (removed 1) transitions.
// Phase 1: matrix 16 rows 23 cols
[2023-03-23 16:56:19] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-23 16:56:19] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-23 16:56:19] [INFO ] Invariant cache hit.
[2023-03-23 16:56:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 16:56:19] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 23/28 places, 16/17 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 121 ms. Remains : 23/28 places, 16/17 transitions.
Incomplete random walk after 10004 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 750125 steps, run timeout after 3001 ms. (steps per millisecond=249 ) properties seen :{}
Probabilistic random walk after 750125 steps, saw 349811 distinct states, run finished after 3001 ms. (steps per millisecond=249 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-23 16:56:22] [INFO ] Invariant cache hit.
[2023-03-23 16:56:22] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-23 16:56:22] [INFO ] [Nat]Absence check using 5 positive place invariants in 0 ms returned sat
[2023-03-23 16:56:22] [INFO ] [Nat]Absence check using 5 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-23 16:56:22] [INFO ] After 44ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-23 16:56:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 16:56:22] [INFO ] After 48ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-23 16:56:22] [INFO ] After 82ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-23 16:56:22] [INFO ] After 191ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 8000 ms.
Support contains 5 out of 23 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 23/23 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 23/23 places, 16/16 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 23/23 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2023-03-23 16:56:30] [INFO ] Invariant cache hit.
[2023-03-23 16:56:30] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-23 16:56:30] [INFO ] Invariant cache hit.
[2023-03-23 16:56:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 16:56:30] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2023-03-23 16:56:30] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-23 16:56:30] [INFO ] Invariant cache hit.
[2023-03-23 16:56:30] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 95 ms. Remains : 23/23 places, 16/16 transitions.
Applied a total of 0 rules in 2 ms. Remains 23 /23 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Running SMT prover for 5 properties.
[2023-03-23 16:56:30] [INFO ] Invariant cache hit.
[2023-03-23 16:56:30] [INFO ] After 19ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-23 16:56:30] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-23 16:56:30] [INFO ] [Nat]Absence check using 5 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-23 16:56:30] [INFO ] After 41ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-23 16:56:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 16:56:31] [INFO ] After 49ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-23 16:56:31] [INFO ] After 71ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-23 16:56:31] [INFO ] After 155ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
FORMULA GPPP-PT-C0001N0000100000-LTLCardinality-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA GPPP-PT-C0001N0000100000-LTLCardinality-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 6 atomic propositions for a total of 11 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA GPPP-PT-C0001N0000100000-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000100000-LTLCardinality-02 TRUE 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' '!(G(F((p0||(p1&&F(p2))))))'
Support contains 4 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 22/22 transitions.
Graph (trivial) has 4 edges and 32 vertex of which 2 / 32 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 31 transition count 18
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 28 transition count 18
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 12 place count 25 transition count 16
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 15 place count 23 transition count 15
Applied a total of 15 rules in 5 ms. Remains 23 /32 variables (removed 9) and now considering 15/22 (removed 7) transitions.
// Phase 1: matrix 15 rows 23 cols
[2023-03-23 16:56:31] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-23 16:56:31] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
[2023-03-23 16:56:31] [INFO ] Invariant cache hit.
[2023-03-23 16:56:31] [INFO ] Implicit Places using invariants in 30 ms returned [0, 1]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 32 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/32 places, 15/22 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 20 transition count 14
Applied a total of 2 rules in 3 ms. Remains 20 /21 variables (removed 1) and now considering 14/15 (removed 1) transitions.
// Phase 1: matrix 14 rows 20 cols
[2023-03-23 16:56:31] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-23 16:56:31] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-23 16:56:31] [INFO ] Invariant cache hit.
[2023-03-23 16:56:31] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-23 16:56:31] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 20/32 places, 14/22 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 131 ms. Remains : 20/32 places, 14/22 transitions.
Stuttering acceptance computed with spot in 241 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : GPPP-PT-C0001N0000100000-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ 3 s2), p0:(LEQ s13 s0), p2:(LEQ 2 s18)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 238 ms.
Product exploration explored 100000 steps with 0 reset in 126 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 p0 p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 271 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 112 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 1274809 steps, run timeout after 3001 ms. (steps per millisecond=424 ) properties seen :{}
Probabilistic random walk after 1274809 steps, saw 368885 distinct states, run finished after 3001 ms. (steps per millisecond=424 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-23 16:56:35] [INFO ] Invariant cache hit.
[2023-03-23 16:56:35] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-23 16:56:35] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-23 16:56:35] [INFO ] [Nat]Absence check using 5 positive and 3 generalized place invariants in 5 ms returned sat
[2023-03-23 16:56:35] [INFO ] After 34ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-23 16:56:35] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-23 16:56:35] [INFO ] After 10ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-23 16:56:35] [INFO ] After 23ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-23 16:56:35] [INFO ] After 108ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 6000 ms.
Support contains 4 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 14/14 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 20 transition count 13
Applied a total of 1 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 13/14 (removed 1) transitions.
// Phase 1: matrix 13 rows 20 cols
[2023-03-23 16:56:41] [INFO ] Computed 8 place invariants in 0 ms
[2023-03-23 16:56:41] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 20/20 places, 13/14 transitions.
Incomplete random walk after 10005 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 576290 steps, run timeout after 3001 ms. (steps per millisecond=192 ) properties seen :{}
Probabilistic random walk after 576290 steps, saw 309163 distinct states, run finished after 3001 ms. (steps per millisecond=192 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-23 16:56:44] [INFO ] Invariant cache hit.
[2023-03-23 16:56:44] [INFO ] After 18ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-23 16:56:45] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-23 16:56:45] [INFO ] [Nat]Absence check using 5 positive and 3 generalized place invariants in 7 ms returned sat
[2023-03-23 16:56:45] [INFO ] After 22ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-23 16:56:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 16:56:45] [INFO ] After 11ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-23 16:56:45] [INFO ] After 25ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-23 16:56:45] [INFO ] After 98ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 6000 ms.
Support contains 4 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 13/13 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 13/13 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 20/20 places, 13/13 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 13/13 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 13/13 (removed 0) transitions.
[2023-03-23 16:56:51] [INFO ] Invariant cache hit.
[2023-03-23 16:56:51] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-23 16:56:51] [INFO ] Invariant cache hit.
[2023-03-23 16:56:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 16:56:51] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2023-03-23 16:56:51] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-23 16:56:51] [INFO ] Invariant cache hit.
[2023-03-23 16:56:51] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 102 ms. Remains : 20/20 places, 13/13 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 13/13 (removed 0) transitions.
Running SMT prover for 3 properties.
[2023-03-23 16:56:51] [INFO ] Invariant cache hit.
[2023-03-23 16:56:51] [INFO ] After 18ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-23 16:56:51] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-23 16:56:51] [INFO ] [Nat]Absence check using 5 positive and 3 generalized place invariants in 12 ms returned sat
[2023-03-23 16:56:51] [INFO ] After 21ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-23 16:56:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 16:56:51] [INFO ] After 10ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-23 16:56:51] [INFO ] After 23ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-23 16:56:51] [INFO ] After 104ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 234 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 127 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 123 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 14/14 transitions.
Applied a total of 0 rules in 3 ms. Remains 20 /20 variables (removed 0) and now considering 14/14 (removed 0) transitions.
// Phase 1: matrix 14 rows 20 cols
[2023-03-23 16:56:51] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-23 16:56:51] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
[2023-03-23 16:56:51] [INFO ] Invariant cache hit.
[2023-03-23 16:56:51] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-23 16:56:51] [INFO ] Invariant cache hit.
[2023-03-23 16:56:51] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-23 16:56:51] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2023-03-23 16:56:51] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-23 16:56:51] [INFO ] Invariant cache hit.
[2023-03-23 16:56:51] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 142 ms. Remains : 20/20 places, 14/14 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 p1 p2), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 280 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 136 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10004 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=122 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 881141 steps, run timeout after 3001 ms. (steps per millisecond=293 ) properties seen :{}
Probabilistic random walk after 881141 steps, saw 297567 distinct states, run finished after 3001 ms. (steps per millisecond=293 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-23 16:56:55] [INFO ] Invariant cache hit.
[2023-03-23 16:56:55] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-23 16:56:55] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2023-03-23 16:56:55] [INFO ] [Nat]Absence check using 5 positive and 3 generalized place invariants in 7 ms returned sat
[2023-03-23 16:56:55] [INFO ] After 25ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-23 16:56:55] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-23 16:56:55] [INFO ] After 10ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-23 16:56:55] [INFO ] After 24ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-23 16:56:55] [INFO ] After 107ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 6000 ms.
Support contains 4 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 14/14 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 20 transition count 13
Applied a total of 1 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 13/14 (removed 1) transitions.
// Phase 1: matrix 13 rows 20 cols
[2023-03-23 16:57:01] [INFO ] Computed 8 place invariants in 0 ms
[2023-03-23 16:57:01] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 20/20 places, 13/14 transitions.
Incomplete random walk after 10004 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 765120 steps, run timeout after 3001 ms. (steps per millisecond=254 ) properties seen :{}
Probabilistic random walk after 765120 steps, saw 385185 distinct states, run finished after 3001 ms. (steps per millisecond=254 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-23 16:57:04] [INFO ] Invariant cache hit.
[2023-03-23 16:57:04] [INFO ] After 16ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-23 16:57:04] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-23 16:57:04] [INFO ] [Nat]Absence check using 5 positive and 3 generalized place invariants in 5 ms returned sat
[2023-03-23 16:57:04] [INFO ] After 21ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-23 16:57:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 16:57:04] [INFO ] After 11ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-23 16:57:04] [INFO ] After 26ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-23 16:57:05] [INFO ] After 94ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 6000 ms.
Support contains 4 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 13/13 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 13/13 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 20/20 places, 13/13 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 13/13 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 13/13 (removed 0) transitions.
[2023-03-23 16:57:11] [INFO ] Invariant cache hit.
[2023-03-23 16:57:11] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-23 16:57:11] [INFO ] Invariant cache hit.
[2023-03-23 16:57:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 16:57:11] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2023-03-23 16:57:11] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-23 16:57:11] [INFO ] Invariant cache hit.
[2023-03-23 16:57:11] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 125 ms. Remains : 20/20 places, 13/13 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 13/13 (removed 0) transitions.
Running SMT prover for 3 properties.
[2023-03-23 16:57:11] [INFO ] Invariant cache hit.
[2023-03-23 16:57:11] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-23 16:57:11] [INFO ] [Nat]Absence check using 5 positive place invariants in 0 ms returned sat
[2023-03-23 16:57:11] [INFO ] [Nat]Absence check using 5 positive and 3 generalized place invariants in 5 ms returned sat
[2023-03-23 16:57:11] [INFO ] After 19ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-23 16:57:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 16:57:11] [INFO ] After 11ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-23 16:57:11] [INFO ] After 23ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-23 16:57:11] [INFO ] After 85ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 267 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 136 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 118 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 105 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 0 reset in 108 ms.
Product exploration explored 100000 steps with 0 reset in 149 ms.
Built C files in :
/tmp/ltsmin17177117313752719971
[2023-03-23 16:57:12] [INFO ] Computing symmetric may disable matrix : 14 transitions.
[2023-03-23 16:57:12] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-23 16:57:12] [INFO ] Computing symmetric may enable matrix : 14 transitions.
[2023-03-23 16:57:12] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-23 16:57:12] [INFO ] Computing Do-Not-Accords matrix : 14 transitions.
[2023-03-23 16:57:12] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-23 16:57:12] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17177117313752719971
Running compilation step : cd /tmp/ltsmin17177117313752719971;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 147 ms.
Running link step : cd /tmp/ltsmin17177117313752719971;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin17177117313752719971;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1682274482532249165.hoa' '--buchi-type=spotba'
LTSmin run took 8557 ms.
FORMULA GPPP-PT-C0001N0000100000-LTLCardinality-00 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property GPPP-PT-C0001N0000100000-LTLCardinality-00 finished in 49681 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))))'
Support contains 2 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 32 cols
[2023-03-23 16:57:20] [INFO ] Computed 12 place invariants in 0 ms
[2023-03-23 16:57:20] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
[2023-03-23 16:57:20] [INFO ] Invariant cache hit.
[2023-03-23 16:57:20] [INFO ] Implicit Places using invariants in 28 ms returned [0, 1, 2, 3]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 29 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 28/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 28 /28 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60 ms. Remains : 28/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C0001N0000100000-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(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=[p0:(GT s14 s9)], 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]]
Product exploration explored 100000 steps with 2478 reset in 126 ms.
Stack based approach found an accepted trace after 15 steps with 0 reset with depth 16 and stack size 16 in 0 ms.
FORMULA GPPP-PT-C0001N0000100000-LTLCardinality-03 FALSE TECHNIQUES STACK_TEST
Treatment of property GPPP-PT-C0001N0000100000-LTLCardinality-03 finished in 309 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))'
Support contains 1 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 22/22 transitions.
Graph (trivial) has 4 edges and 32 vertex of which 2 / 32 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 31 transition count 18
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 28 transition count 18
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 15 place count 23 transition count 15
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 21 place count 19 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 23 place count 18 transition count 12
Applied a total of 23 rules in 8 ms. Remains 18 /32 variables (removed 14) and now considering 12/22 (removed 10) transitions.
// Phase 1: matrix 12 rows 18 cols
[2023-03-23 16:57:21] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-23 16:57:21] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
[2023-03-23 16:57:21] [INFO ] Invariant cache hit.
[2023-03-23 16:57:21] [INFO ] Implicit Places using invariants in 23 ms returned [0, 1]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 24 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/32 places, 12/22 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 16 transition count 11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 15 transition count 11
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 14 transition count 10
Applied a total of 4 rules in 3 ms. Remains 14 /16 variables (removed 2) and now considering 10/12 (removed 2) transitions.
// Phase 1: matrix 10 rows 14 cols
[2023-03-23 16:57:21] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-23 16:57:21] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-23 16:57:21] [INFO ] Invariant cache hit.
[2023-03-23 16:57:21] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-23 16:57:21] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 14/32 places, 10/22 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 110 ms. Remains : 14/32 places, 10/22 transitions.
Initial state reduction rules removed 1 formulas.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : GPPP-PT-C0001N0000100000-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 2 s8)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Initial state of product has no viable successors after 0 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0001N0000100000-LTLCardinality-04 TRUE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000100000-LTLCardinality-04 finished in 153 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 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 22/22 transitions.
Graph (trivial) has 4 edges and 32 vertex of which 2 / 32 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 31 transition count 18
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 28 transition count 18
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 15 place count 23 transition count 15
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 17 place count 22 transition count 14
Applied a total of 17 rules in 9 ms. Remains 22 /32 variables (removed 10) and now considering 14/22 (removed 8) transitions.
// Phase 1: matrix 14 rows 22 cols
[2023-03-23 16:57:21] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-23 16:57:21] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
[2023-03-23 16:57:21] [INFO ] Invariant cache hit.
[2023-03-23 16:57:21] [INFO ] Implicit Places using invariants in 30 ms returned [0, 1, 2]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 31 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 19/32 places, 14/22 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 19 transition count 13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 18 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 17 transition count 12
Applied a total of 4 rules in 3 ms. Remains 17 /19 variables (removed 2) and now considering 12/14 (removed 2) transitions.
// Phase 1: matrix 12 rows 17 cols
[2023-03-23 16:57:21] [INFO ] Computed 7 place invariants in 0 ms
[2023-03-23 16:57:21] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-23 16:57:21] [INFO ] Invariant cache hit.
[2023-03-23 16:57:21] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-23 16:57:21] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 17/32 places, 12/22 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 128 ms. Remains : 17/32 places, 12/22 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : GPPP-PT-C0001N0000100000-LTLCardinality-05 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 s0 s9)], 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 1 steps with 0 reset in 1 ms.
FORMULA GPPP-PT-C0001N0000100000-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000100000-LTLCardinality-05 finished in 188 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(X(p1))))&&X(G(p1))))'
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 32 cols
[2023-03-23 16:57:21] [INFO ] Computed 12 place invariants in 3 ms
[2023-03-23 16:57:21] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
[2023-03-23 16:57:21] [INFO ] Invariant cache hit.
[2023-03-23 16:57:21] [INFO ] Implicit Places using invariants in 28 ms returned [0, 1, 2]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 29 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 29/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 68 ms. Remains : 29/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 137 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : GPPP-PT-C0001N0000100000-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(LEQ s7 s0), p1:(GT 2 s9)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, 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 15 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0001N0000100000-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000100000-LTLCardinality-06 finished in 228 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)&&F((G(F(!p0))||(!p1&&F(!p0))))))'
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 22/22 transitions.
Graph (trivial) has 3 edges and 32 vertex of which 2 / 32 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 31 transition count 19
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 29 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7 place count 28 transition count 18
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 10 place count 26 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 12 place count 25 transition count 16
Applied a total of 12 rules in 8 ms. Remains 25 /32 variables (removed 7) and now considering 16/22 (removed 6) transitions.
// Phase 1: matrix 16 rows 25 cols
[2023-03-23 16:57:21] [INFO ] Computed 11 place invariants in 0 ms
[2023-03-23 16:57:21] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
[2023-03-23 16:57:21] [INFO ] Invariant cache hit.
[2023-03-23 16:57:21] [INFO ] Implicit Places using invariants in 27 ms returned [0, 1, 2, 3]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 29 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/32 places, 16/22 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 21 transition count 15
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 20 transition count 15
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 20 transition count 14
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 19 transition count 14
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 18 transition count 13
Applied a total of 6 rules in 3 ms. Remains 18 /21 variables (removed 3) and now considering 13/16 (removed 3) transitions.
// Phase 1: matrix 13 rows 18 cols
[2023-03-23 16:57:21] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-23 16:57:21] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-23 16:57:21] [INFO ] Invariant cache hit.
[2023-03-23 16:57:21] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-23 16:57:21] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 18/32 places, 13/22 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 119 ms. Remains : 18/32 places, 13/22 transitions.
Stuttering acceptance computed with spot in 144 ms :[true, (NOT p0), p0, p0]
Running random walk in product with property : GPPP-PT-C0001N0000100000-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ 2 s14), p1:(AND (GT 3 s0) (LEQ 1 s9))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0001N0000100000-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000100000-LTLCardinality-09 finished in 281 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||G(p1))))'
Support contains 2 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 22/22 transitions.
Graph (trivial) has 4 edges and 32 vertex of which 2 / 32 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 31 transition count 18
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 28 transition count 18
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 15 place count 23 transition count 15
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 18 place count 21 transition count 14
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 20 transition count 13
Applied a total of 20 rules in 8 ms. Remains 20 /32 variables (removed 12) and now considering 13/22 (removed 9) transitions.
// Phase 1: matrix 13 rows 20 cols
[2023-03-23 16:57:22] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-23 16:57:22] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
[2023-03-23 16:57:22] [INFO ] Invariant cache hit.
[2023-03-23 16:57:22] [INFO ] Implicit Places using invariants in 32 ms returned [0, 1]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 33 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 18/32 places, 13/22 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 18 transition count 12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 17 transition count 12
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 16 transition count 11
Applied a total of 4 rules in 2 ms. Remains 16 /18 variables (removed 2) and now considering 11/13 (removed 2) transitions.
// Phase 1: matrix 11 rows 16 cols
[2023-03-23 16:57:22] [INFO ] Computed 7 place invariants in 0 ms
[2023-03-23 16:57:22] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-23 16:57:22] [INFO ] Invariant cache hit.
[2023-03-23 16:57:22] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-23 16:57:22] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 16/32 places, 11/22 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 126 ms. Remains : 16/32 places, 11/22 transitions.
Stuttering acceptance computed with spot in 75 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : GPPP-PT-C0001N0000100000-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=2, aps=[p1:(LEQ 3 s0), p0:(LEQ 1 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 154 ms.
Product exploration explored 100000 steps with 0 reset in 93 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 (AND (NOT p0) p1)), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 281 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 4518271 steps, run timeout after 3001 ms. (steps per millisecond=1505 ) properties seen :{}
Probabilistic random walk after 4518271 steps, saw 1333860 distinct states, run finished after 3003 ms. (steps per millisecond=1504 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-23 16:57:25] [INFO ] Invariant cache hit.
[2023-03-23 16:57:25] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-23 16:57:25] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-23 16:57:25] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 16:57:25] [INFO ] [Nat]Absence check using 4 positive place invariants in 0 ms returned sat
[2023-03-23 16:57:25] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 6 ms returned sat
[2023-03-23 16:57:26] [INFO ] After 19ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 16:57:26] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-23 16:57:26] [INFO ] After 3ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 16:57:26] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-23 16:57:26] [INFO ] After 59ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 600000 steps, including 0 resets, run visited all 1 properties in 470 ms. (steps per millisecond=1276 )
Parikh walk visited 1 properties in 469 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND (NOT p0) p1)), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 10 factoid took 408 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 90 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p1), (NOT p1)]
Support contains 1 out of 16 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2023-03-23 16:57:27] [INFO ] Invariant cache hit.
[2023-03-23 16:57:27] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
[2023-03-23 16:57:27] [INFO ] Invariant cache hit.
[2023-03-23 16:57:27] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-23 16:57:27] [INFO ] Invariant cache hit.
[2023-03-23 16:57:27] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-23 16:57:27] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2023-03-23 16:57:27] [INFO ] Invariant cache hit.
[2023-03-23 16:57:27] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 105 ms. Remains : 16/16 places, 11/11 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 : [p1, (X p1), true, (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 153 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 74 ms :[true, (NOT p1), (NOT p1)]
Incomplete random walk after 10004 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 4608555 steps, run timeout after 3001 ms. (steps per millisecond=1535 ) properties seen :{}
Probabilistic random walk after 4608555 steps, saw 1374934 distinct states, run finished after 3001 ms. (steps per millisecond=1535 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-23 16:57:30] [INFO ] Invariant cache hit.
[2023-03-23 16:57:30] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-23 16:57:30] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-23 16:57:30] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 16:57:30] [INFO ] [Nat]Absence check using 4 positive place invariants in 0 ms returned sat
[2023-03-23 16:57:30] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 6 ms returned sat
[2023-03-23 16:57:30] [INFO ] After 14ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 16:57:30] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-23 16:57:30] [INFO ] After 4ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 16:57:30] [INFO ] After 8ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-23 16:57:30] [INFO ] After 60ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 600000 steps, including 0 resets, run visited all 1 properties in 456 ms. (steps per millisecond=1315 )
Parikh walk visited 1 properties in 455 ms.
Knowledge obtained : [p1, (X p1), true, (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 4 factoid took 148 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 69 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 74 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 72 ms :[true, (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 63 ms.
Product exploration explored 100000 steps with 0 reset in 92 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p1), (NOT p1)]
Support contains 1 out of 16 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 16/16 places, 11/11 transitions.
Applied a total of 0 rules in 2 ms. Remains 16 /16 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2023-03-23 16:57:31] [INFO ] Invariant cache hit.
[2023-03-23 16:57:31] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
[2023-03-23 16:57:31] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-23 16:57:31] [INFO ] Invariant cache hit.
[2023-03-23 16:57:31] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 51 ms. Remains : 16/16 places, 11/11 transitions.
Built C files in :
/tmp/ltsmin43396289844517128
[2023-03-23 16:57:31] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin43396289844517128
Running compilation step : cd /tmp/ltsmin43396289844517128;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 71 ms.
Running link step : cd /tmp/ltsmin43396289844517128;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin43396289844517128;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15596972460867949975.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 16 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2023-03-23 16:57:46] [INFO ] Invariant cache hit.
[2023-03-23 16:57:46] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
[2023-03-23 16:57:46] [INFO ] Invariant cache hit.
[2023-03-23 16:57:46] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-23 16:57:46] [INFO ] Invariant cache hit.
[2023-03-23 16:57:46] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-23 16:57:46] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2023-03-23 16:57:46] [INFO ] Invariant cache hit.
[2023-03-23 16:57:47] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 99 ms. Remains : 16/16 places, 11/11 transitions.
Built C files in :
/tmp/ltsmin8869912839320347335
[2023-03-23 16:57:47] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8869912839320347335
Running compilation step : cd /tmp/ltsmin8869912839320347335;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 69 ms.
Running link step : cd /tmp/ltsmin8869912839320347335;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin8869912839320347335;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12209113328804144704.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-23 16:58:02] [INFO ] Flatten gal took : 2 ms
[2023-03-23 16:58:02] [INFO ] Flatten gal took : 1 ms
[2023-03-23 16:58:02] [INFO ] Time to serialize gal into /tmp/LTL6409193607425681432.gal : 1 ms
[2023-03-23 16:58:02] [INFO ] Time to serialize properties into /tmp/LTL14563046118869751370.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6409193607425681432.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9243595733127300660.hoa' '-atoms' '/tmp/LTL14563046118869751370.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL14563046118869751370.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9243595733127300660.hoa
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
[2023-03-23 16:58:02] [INFO ] Flatten gal took : 3 ms
[2023-03-23 16:58:02] [INFO ] Flatten gal took : 2 ms
[2023-03-23 16:58:02] [INFO ] Time to serialize gal into /tmp/LTL3031194120126175273.gal : 1 ms
[2023-03-23 16:58:02] [INFO ] Time to serialize properties into /tmp/LTL828701686430462334.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3031194120126175273.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL828701686430462334.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !((G(("(NADPH>=1)")||(G("(NADPplus>=3)")))))
Formula 0 simplified : F(!"(NADPH>=1)" & F!"(NADPplus>=3)")
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
[2023-03-23 16:58:02] [INFO ] Flatten gal took : 2 ms
[2023-03-23 16:58:02] [INFO ] Applying decomposition
[2023-03-23 16:58:02] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph17617117778103176307.txt' '-o' '/tmp/graph17617117778103176307.bin' '-w' '/tmp/graph17617117778103176307.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph17617117778103176307.bin' '-l' '-1' '-v' '-w' '/tmp/graph17617117778103176307.weights' '-q' '0' '-e' '0.001'
[2023-03-23 16:58:02] [INFO ] Decomposing Gal with order
[2023-03-23 16:58:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-23 16:58:02] [INFO ] Removed a total of 1 redundant transitions.
[2023-03-23 16:58:02] [INFO ] Flatten gal took : 20 ms
[2023-03-23 16:58:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2023-03-23 16:58:02] [INFO ] Time to serialize gal into /tmp/LTL508613308717549730.gal : 1 ms
[2023-03-23 16:58:02] [INFO ] Time to serialize properties into /tmp/LTL15490933070477407759.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL508613308717549730.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15490933070477407759.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G(("(u0.NADPH>=1)")||(G("(u0.NADPplus>=3)")))))
Formula 0 simplified : F(!"(u0.NADPH>=1)" & F!"(u0.NADPplus>=3)")
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
Built C files in :
/tmp/ltsmin12708536439328922096
[2023-03-23 16:58:02] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12708536439328922096
Running compilation step : cd /tmp/ltsmin12708536439328922096;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 73 ms.
Running link step : cd /tmp/ltsmin12708536439328922096;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin12708536439328922096;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](((LTLAPp0==true)||[]((LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property GPPP-PT-C0001N0000100000-LTLCardinality-11 finished in 55348 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)))'
Support contains 1 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 32 cols
[2023-03-23 16:58:17] [INFO ] Computed 12 place invariants in 0 ms
[2023-03-23 16:58:17] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
[2023-03-23 16:58:17] [INFO ] Invariant cache hit.
[2023-03-23 16:58:17] [INFO ] Implicit Places using invariants in 42 ms returned [0, 1, 2, 3]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 43 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 28/32 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 28 /28 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 90 ms. Remains : 28/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C0001N0000100000-LTLCardinality-12 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 s4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0001N0000100000-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000100000-LTLCardinality-12 finished in 193 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)&&F(G(p1)))))'
Support contains 2 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 22/22 transitions.
Graph (trivial) has 4 edges and 32 vertex of which 2 / 32 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 31 transition count 18
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 28 transition count 18
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 15 place count 23 transition count 15
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 21 place count 19 transition count 13
Applied a total of 21 rules in 7 ms. Remains 19 /32 variables (removed 13) and now considering 13/22 (removed 9) transitions.
// Phase 1: matrix 13 rows 19 cols
[2023-03-23 16:58:17] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-23 16:58:17] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
[2023-03-23 16:58:17] [INFO ] Invariant cache hit.
[2023-03-23 16:58:17] [INFO ] Implicit Places using invariants in 23 ms returned [0, 1]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 24 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 17/32 places, 13/22 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 16 transition count 12
Applied a total of 2 rules in 1 ms. Remains 16 /17 variables (removed 1) and now considering 12/13 (removed 1) transitions.
// Phase 1: matrix 12 rows 16 cols
[2023-03-23 16:58:17] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-23 16:58:17] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-23 16:58:17] [INFO ] Invariant cache hit.
[2023-03-23 16:58:17] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-23 16:58:17] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 16/32 places, 12/22 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 112 ms. Remains : 16/32 places, 12/22 transitions.
Stuttering acceptance computed with spot in 68 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : GPPP-PT-C0001N0000100000-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 1 s4), p1:(AND (LEQ 1 s4) (LEQ 1 s9))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0001N0000100000-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000100000-LTLCardinality-14 finished in 196 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||G(p1))))'
[2023-03-23 16:58:17] [INFO ] Flatten gal took : 9 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin13298645623233821440
[2023-03-23 16:58:17] [INFO ] Computing symmetric may disable matrix : 22 transitions.
[2023-03-23 16:58:17] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-23 16:58:17] [INFO ] Computing symmetric may enable matrix : 22 transitions.
[2023-03-23 16:58:17] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-23 16:58:17] [INFO ] Computing Do-Not-Accords matrix : 22 transitions.
[2023-03-23 16:58:17] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-23 16:58:17] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13298645623233821440
[2023-03-23 16:58:17] [INFO ] Applying decomposition
Running compilation step : cd /tmp/ltsmin13298645623233821440;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-23 16:58:17] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph2501329367322524388.txt' '-o' '/tmp/graph2501329367322524388.bin' '-w' '/tmp/graph2501329367322524388.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph2501329367322524388.bin' '-l' '-1' '-v' '-w' '/tmp/graph2501329367322524388.weights' '-q' '0' '-e' '0.001'
[2023-03-23 16:58:17] [INFO ] Decomposing Gal with order
[2023-03-23 16:58:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-23 16:58:17] [INFO ] Removed a total of 2 redundant transitions.
[2023-03-23 16:58:17] [INFO ] Flatten gal took : 4 ms
[2023-03-23 16:58:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2023-03-23 16:58:17] [INFO ] Time to serialize gal into /tmp/LTLCardinality16526217269153610831.gal : 1 ms
[2023-03-23 16:58:17] [INFO ] Time to serialize properties into /tmp/LTLCardinality12339968910212865856.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality16526217269153610831.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality12339968910212865856.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 1 LTL properties
Checking formula 0 : !((G(("(i0.u2.NADPH>=1)")||(G("(i0.u2.NADPplus>=3)")))))
Formula 0 simplified : F(!"(i0.u2.NADPH>=1)" & F!"(i0.u2.NADPplus>=3)")
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
[2023-03-23 16:58:17] [INFO ] Flatten gal took : 4 ms
[2023-03-23 16:58:17] [INFO ] Time to serialize gal into /tmp/LTLCardinality3930746085511626045.gal : 1 ms
[2023-03-23 16:58:17] [INFO ] Time to serialize properties into /tmp/LTLCardinality14186340310467864039.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality3930746085511626045.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality14186340310467864039.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 1 LTL properties
Checking formula 0 : !((G(("(NADPH>=1)")||(G("(NADPplus>=3)")))))
Formula 0 simplified : F(!"(NADPH>=1)" & F!"(NADPplus>=3)")
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
[2023-03-23 16:58:18] [INFO ] Flatten gal took : 3 ms
[2023-03-23 16:58:18] [INFO ] Input system was already deterministic with 22 transitions.
[2023-03-23 16:58:18] [INFO ] Transformed 32 places.
[2023-03-23 16:58:18] [INFO ] Transformed 22 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Compilation finished in 107 ms.
Running link step : cd /tmp/ltsmin13298645623233821440;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-23 16:58:18] [INFO ] Time to serialize gal into /tmp/LTLCardinality18044320132445153688.gal : 1 ms
[2023-03-23 16:58:18] [INFO ] Time to serialize properties into /tmp/LTLCardinality9265417028731605631.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality18044320132445153688.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality9265417028731605631.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(("(NADPH>=1)")||(G("(NADPplus>=3)")))))
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin13298645623233821440;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](((LTLAPp0==true)||[]((LTLAPp1==true))))' '--buchi-type=spotba'
Formula 0 simplified : F(!"(NADPH>=1)" & F!"(NADPplus>=3)")
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.009: Loading model from ./gal.so
pins2lts-mc-linux64( 2/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.010: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.010: Initializing POR dependencies: labels 24, guards 22
pins2lts-mc-linux64( 2/ 8), 0.010: LTL layer: formula: [](((LTLAPp0==true)||[]((LTLAPp1==true))))
pins2lts-mc-linux64( 6/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.010: "[](((LTLAPp0==true)||[]((LTLAPp1==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.010: Using Spin LTL semantics
pins2lts-mc-linux64( 6/ 8), 0.010: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.020: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.020: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 0.023: There are 26 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.023: State length is 33, there are 28 groups
pins2lts-mc-linux64( 0/ 8), 0.023: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.023: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.023: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.023: Visible groups: 0 / 28, labels: 2 / 26
pins2lts-mc-linux64( 0/ 8), 0.023: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 0.023: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.050: [Blue] ~85 levels ~960 states ~1416 transitions
pins2lts-mc-linux64( 5/ 8), 0.051: [Blue] ~90 levels ~1920 states ~2488 transitions
pins2lts-mc-linux64( 5/ 8), 0.061: [Blue] ~299 levels ~3840 states ~5176 transitions
pins2lts-mc-linux64( 5/ 8), 0.072: [Blue] ~358 levels ~7680 states ~9232 transitions
pins2lts-mc-linux64( 5/ 8), 0.098: [Blue] ~681 levels ~15360 states ~17952 transitions
pins2lts-mc-linux64( 5/ 8), 0.148: [Blue] ~1460 levels ~30720 states ~36432 transitions
pins2lts-mc-linux64( 5/ 8), 0.259: [Blue] ~2813 levels ~61440 states ~71912 transitions
pins2lts-mc-linux64( 4/ 8), 0.571: [Blue] ~4356 levels ~122880 states ~139264 transitions
pins2lts-mc-linux64( 6/ 8), 1.039: [Blue] ~11264 levels ~245760 states ~275808 transitions
pins2lts-mc-linux64( 4/ 8), 1.604: [Blue] ~23132 levels ~491520 states ~513120 transitions
pins2lts-mc-linux64( 4/ 8), 2.345: [Blue] ~60673 levels ~983040 states ~1004640 transitions
pins2lts-mc-linux64( 4/ 8), 3.379: [Blue] ~138031 levels ~1966080 states ~1987680 transitions
pins2lts-mc-linux64( 4/ 8), 5.270: [Blue] ~298237 levels ~3932160 states ~3953760 transitions
pins2lts-mc-linux64( 4/ 8), 9.043: [Blue] ~624346 levels ~7864320 states ~7885920 transitions
pins2lts-mc-linux64( 4/ 8), 16.704: [Blue] ~1276548 levels ~15728640 states ~15750240 transitions
pins2lts-mc-linux64( 4/ 8), 32.674: [Blue] ~2580954 levels ~31457280 states ~31478880 transitions
pins2lts-mc-linux64( 6/ 8), 42.498: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 42.540:
pins2lts-mc-linux64( 0/ 8), 42.540: Explored 35925263 states 35972670 transitions, fanout: 1.001
pins2lts-mc-linux64( 0/ 8), 42.540: Total exploration time 42.490 sec (42.450 sec minimum, 42.465 sec on average)
pins2lts-mc-linux64( 0/ 8), 42.540: States per second: 845499, Transitions per second: 846615
pins2lts-mc-linux64( 0/ 8), 42.540:
pins2lts-mc-linux64( 0/ 8), 42.540: State space has 37905291 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 42.540: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 42.540: blue states: 35925263 (94.78%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 42.540: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 42.540: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 42.540:
pins2lts-mc-linux64( 0/ 8), 42.540: Total memory used for local state coloring: 319.8MB
pins2lts-mc-linux64( 0/ 8), 42.540:
pins2lts-mc-linux64( 0/ 8), 42.540: Queue width: 8B, total height: 20958039, memory: 159.90MB
pins2lts-mc-linux64( 0/ 8), 42.540: Tree memory: 545.2MB, 15.1 B/state, compr.: 11.3%
pins2lts-mc-linux64( 0/ 8), 42.540: Tree fill ratio (roots/leafs): 28.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 42.540: Stored 23 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 42.540: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 42.540: Est. total memory use: 705.1MB (~1183.9MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin13298645623233821440;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](((LTLAPp0==true)||[]((LTLAPp1==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin13298645623233821440;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](((LTLAPp0==true)||[]((LTLAPp1==true))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Total runtime 189762 ms.

BK_STOP 1679590741596

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="GPPP-PT-C0001N0000100000"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
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 itstools"
echo " Input is GPPP-PT-C0001N0000100000, 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 r165-tall-167838850900811"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/GPPP-PT-C0001N0000100000.tgz
mv GPPP-PT-C0001N0000100000 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 ;