Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r039-tajo-167813692800643.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...............................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is CANConstruction-PT-040, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r039-tajo-167813692800643
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.9M
-rw-r--r-- 1 mcc users 11K Feb 25 21:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K Feb 25 21:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Feb 25 21:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 25 21:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.1K Feb 25 15:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Feb 25 15:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 21:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 25 21:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 21:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 25 21:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 15:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 2.5M 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 CANConstruction-PT-040-LTLCardinality-00
FORMULA_NAME CANConstruction-PT-040-LTLCardinality-01
FORMULA_NAME CANConstruction-PT-040-LTLCardinality-02
FORMULA_NAME CANConstruction-PT-040-LTLCardinality-03
FORMULA_NAME CANConstruction-PT-040-LTLCardinality-04
FORMULA_NAME CANConstruction-PT-040-LTLCardinality-05
FORMULA_NAME CANConstruction-PT-040-LTLCardinality-06
FORMULA_NAME CANConstruction-PT-040-LTLCardinality-07
FORMULA_NAME CANConstruction-PT-040-LTLCardinality-08
FORMULA_NAME CANConstruction-PT-040-LTLCardinality-09
FORMULA_NAME CANConstruction-PT-040-LTLCardinality-10
FORMULA_NAME CANConstruction-PT-040-LTLCardinality-11
FORMULA_NAME CANConstruction-PT-040-LTLCardinality-12
FORMULA_NAME CANConstruction-PT-040-LTLCardinality-13
FORMULA_NAME CANConstruction-PT-040-LTLCardinality-14
FORMULA_NAME CANConstruction-PT-040-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678504182547

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANConstruction-PT-040
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-11 03:09:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-11 03:09:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 03:09:44] [INFO ] Load time of PNML (sax parser for PT used): 230 ms
[2023-03-11 03:09:44] [INFO ] Transformed 3682 places.
[2023-03-11 03:09:44] [INFO ] Transformed 6720 transitions.
[2023-03-11 03:09:44] [INFO ] Parsed PT model containing 3682 places and 6720 transitions and 20000 arcs in 387 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA CANConstruction-PT-040-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-040-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-040-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-040-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 3682 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3682/3682 places, 6720/6720 transitions.
Discarding 1500 places :
Symmetric choice reduction at 0 with 1500 rule applications. Total rules 1500 place count 2182 transition count 3720
Iterating global reduction 0 with 1500 rules applied. Total rules applied 3000 place count 2182 transition count 3720
Applied a total of 3000 rules in 449 ms. Remains 2182 /3682 variables (removed 1500) and now considering 3720/6720 (removed 3000) transitions.
// Phase 1: matrix 3720 rows 2182 cols
[2023-03-11 03:09:45] [INFO ] Computed 81 place invariants in 68 ms
[2023-03-11 03:09:47] [INFO ] Implicit Places using invariants in 1614 ms returned [12, 26, 40, 54, 68, 82, 96, 110, 124, 138, 152, 166, 180, 194, 208, 222, 236, 250, 264, 278, 292, 306, 320, 334, 348, 362, 376, 390, 404, 418, 432, 446, 460, 474, 488, 502, 516, 530, 544, 558]
Discarding 40 places :
Implicit Place search using SMT only with invariants took 1656 ms to find 40 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2142/3682 places, 3720/6720 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 2103 transition count 3681
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 2103 transition count 3681
Applied a total of 78 rules in 215 ms. Remains 2103 /2142 variables (removed 39) and now considering 3681/3720 (removed 39) transitions.
// Phase 1: matrix 3681 rows 2103 cols
[2023-03-11 03:09:47] [INFO ] Computed 41 place invariants in 61 ms
[2023-03-11 03:09:48] [INFO ] Implicit Places using invariants in 1045 ms returned []
[2023-03-11 03:09:48] [INFO ] Invariant cache hit.
[2023-03-11 03:09:49] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2023-03-11 03:10:08] [INFO ] Implicit Places using invariants and state equation in 20039 ms returned []
Implicit Place search using SMT with State Equation took 21089 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 2103/3682 places, 3681/6720 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 23410 ms. Remains : 2103/3682 places, 3681/6720 transitions.
Support contains 41 out of 2103 places after structural reductions.
[2023-03-11 03:10:08] [INFO ] Flatten gal took : 274 ms
[2023-03-11 03:10:09] [INFO ] Flatten gal took : 148 ms
[2023-03-11 03:10:09] [INFO ] Input system was already deterministic with 3681 transitions.
Support contains 39 out of 2103 places (down from 41) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 640 ms. (steps per millisecond=15 ) properties (out of 25) seen :10
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Running SMT prover for 15 properties.
[2023-03-11 03:10:10] [INFO ] Invariant cache hit.
[2023-03-11 03:10:10] [INFO ] [Real]Absence check using 41 positive place invariants in 41 ms returned sat
[2023-03-11 03:10:10] [INFO ] After 728ms SMT Verify possible using all constraints in real domain returned unsat :4 sat :0 real:11
[2023-03-11 03:10:11] [INFO ] [Nat]Absence check using 41 positive place invariants in 29 ms returned sat
[2023-03-11 03:10:12] [INFO ] After 1420ms SMT Verify possible using state equation in natural domain returned unsat :9 sat :6
[2023-03-11 03:10:12] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2023-03-11 03:10:13] [INFO ] After 1027ms SMT Verify possible using 3160 Read/Feed constraints in natural domain returned unsat :9 sat :6
[2023-03-11 03:10:15] [INFO ] After 2342ms SMT Verify possible using trap constraints in natural domain returned unsat :9 sat :6
Attempting to minimize the solution found.
Minimization took 1057 ms.
[2023-03-11 03:10:16] [INFO ] After 5482ms SMT Verify possible using all constraints in natural domain returned unsat :9 sat :6
Fused 15 Parikh solutions to 5 different solutions.
Parikh walk visited 2 properties in 128 ms.
Support contains 12 out of 2103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2103/2103 places, 3681/3681 transitions.
Drop transitions removed 263 transitions
Trivial Post-agglo rules discarded 263 transitions
Performed 263 trivial Post agglomeration. Transition count delta: 263
Iterating post reduction 0 with 263 rules applied. Total rules applied 263 place count 2103 transition count 3418
Reduce places removed 263 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 264 rules applied. Total rules applied 527 place count 1840 transition count 3417
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 528 place count 1839 transition count 3417
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 40 Pre rules applied. Total rules applied 528 place count 1839 transition count 3377
Deduced a syphon composed of 40 places in 11 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 608 place count 1799 transition count 3377
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 621 place count 1786 transition count 3351
Iterating global reduction 3 with 13 rules applied. Total rules applied 634 place count 1786 transition count 3351
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 3 with 9 rules applied. Total rules applied 643 place count 1786 transition count 3342
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 652 place count 1777 transition count 3342
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 2 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 5 with 92 rules applied. Total rules applied 744 place count 1731 transition count 3296
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 745 place count 1731 transition count 3296
Applied a total of 745 rules in 810 ms. Remains 1731 /2103 variables (removed 372) and now considering 3296/3681 (removed 385) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 811 ms. Remains : 1731/2103 places, 3296/3681 transitions.
Incomplete random walk after 10000 steps, including 34 resets, run finished after 219 ms. (steps per millisecond=45 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 3296 rows 1731 cols
[2023-03-11 03:10:17] [INFO ] Computed 41 place invariants in 22 ms
[2023-03-11 03:10:17] [INFO ] After 234ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 03:10:18] [INFO ] [Nat]Absence check using 41 positive place invariants in 32 ms returned sat
[2023-03-11 03:10:18] [INFO ] After 857ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 03:10:19] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2023-03-11 03:10:19] [INFO ] After 260ms SMT Verify possible using 3160 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 03:10:19] [INFO ] After 455ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 192 ms.
[2023-03-11 03:10:19] [INFO ] After 1852ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 12 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=6 )
Parikh walk visited 1 properties in 4 ms.
FORMULA CANConstruction-PT-040-LTLCardinality-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 9 atomic propositions for a total of 11 simplifications.
FORMULA CANConstruction-PT-040-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-040-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 122 stabilizing places and 161 stable transitions
FORMULA CANConstruction-PT-040-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-040-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-040-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 2103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2103/2103 places, 3681/3681 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 2084 transition count 3643
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 2084 transition count 3643
Applied a total of 38 rules in 257 ms. Remains 2084 /2103 variables (removed 19) and now considering 3643/3681 (removed 38) transitions.
// Phase 1: matrix 3643 rows 2084 cols
[2023-03-11 03:10:20] [INFO ] Computed 41 place invariants in 40 ms
[2023-03-11 03:10:21] [INFO ] Implicit Places using invariants in 1189 ms returned []
[2023-03-11 03:10:21] [INFO ] Invariant cache hit.
[2023-03-11 03:10:22] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2023-03-11 03:10:38] [INFO ] Implicit Places using invariants and state equation in 17472 ms returned []
Implicit Place search using SMT with State Equation took 18678 ms to find 0 implicit places.
[2023-03-11 03:10:38] [INFO ] Invariant cache hit.
[2023-03-11 03:10:40] [INFO ] Dead Transitions using invariants and state equation in 1627 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2084/2103 places, 3643/3681 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20570 ms. Remains : 2084/2103 places, 3643/3681 transitions.
Stuttering acceptance computed with spot in 192 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : CANConstruction-PT-040-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ s240 s1427)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1614 ms.
Product exploration explored 100000 steps with 50000 reset in 1667 ms.
Computed a total of 122 stabilizing places and 161 stable transitions
Computed a total of 122 stabilizing places and 161 stable transitions
Knowledge obtained : [p0, (X p0), true]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 89 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANConstruction-PT-040-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANConstruction-PT-040-LTLCardinality-00 finished in 24259 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(X(G(p1)))))'
Support contains 4 out of 2103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2103/2103 places, 3681/3681 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 2084 transition count 3644
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 2084 transition count 3644
Applied a total of 38 rules in 242 ms. Remains 2084 /2103 variables (removed 19) and now considering 3644/3681 (removed 37) transitions.
// Phase 1: matrix 3644 rows 2084 cols
[2023-03-11 03:10:44] [INFO ] Computed 41 place invariants in 28 ms
[2023-03-11 03:10:45] [INFO ] Implicit Places using invariants in 1183 ms returned []
[2023-03-11 03:10:45] [INFO ] Invariant cache hit.
[2023-03-11 03:10:46] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2023-03-11 03:11:06] [INFO ] Implicit Places using invariants and state equation in 20853 ms returned []
Implicit Place search using SMT with State Equation took 22041 ms to find 0 implicit places.
[2023-03-11 03:11:06] [INFO ] Invariant cache hit.
[2023-03-11 03:11:08] [INFO ] Dead Transitions using invariants and state equation in 1662 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2084/2103 places, 3644/3681 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23948 ms. Remains : 2084/2103 places, 3644/3681 transitions.
Stuttering acceptance computed with spot in 182 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CANConstruction-PT-040-LTLCardinality-03 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=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 5}, { cond=p0, acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={} source=5 dest: 1}], [{ cond=(NOT p0), acceptance={} source=6 dest: 1}, { cond=p0, acceptance={} source=6 dest: 2}]], initial=4, aps=[p1:(LEQ s1279 s1591), p0:(GT s639 s561)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 8919 steps with 12 reset in 62 ms.
FORMULA CANConstruction-PT-040-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-040-LTLCardinality-03 finished in 24219 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 2103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2103/2103 places, 3681/3681 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 2083 transition count 3642
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 2083 transition count 3642
Applied a total of 40 rules in 183 ms. Remains 2083 /2103 variables (removed 20) and now considering 3642/3681 (removed 39) transitions.
// Phase 1: matrix 3642 rows 2083 cols
[2023-03-11 03:11:08] [INFO ] Computed 41 place invariants in 43 ms
[2023-03-11 03:11:09] [INFO ] Implicit Places using invariants in 1161 ms returned []
[2023-03-11 03:11:09] [INFO ] Invariant cache hit.
[2023-03-11 03:11:10] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2023-03-11 03:11:32] [INFO ] Implicit Places using invariants and state equation in 22757 ms returned []
Implicit Place search using SMT with State Equation took 23925 ms to find 0 implicit places.
[2023-03-11 03:11:32] [INFO ] Invariant cache hit.
[2023-03-11 03:11:34] [INFO ] Dead Transitions using invariants and state equation in 1544 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2083/2103 places, 3642/3681 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25654 ms. Remains : 2083/2103 places, 3642/3681 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-040-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s1059 s748)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 1143 ms.
Product exploration explored 100000 steps with 50000 reset in 1118 ms.
Computed a total of 121 stabilizing places and 160 stable transitions
Computed a total of 121 stabilizing places and 160 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 75 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANConstruction-PT-040-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANConstruction-PT-040-LTLCardinality-11 finished in 28081 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((!p0&&X(p1))||G(p1)))))'
Support contains 4 out of 2103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2103/2103 places, 3681/3681 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 2084 transition count 3644
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 2084 transition count 3644
Applied a total of 38 rules in 238 ms. Remains 2084 /2103 variables (removed 19) and now considering 3644/3681 (removed 37) transitions.
// Phase 1: matrix 3644 rows 2084 cols
[2023-03-11 03:11:36] [INFO ] Computed 41 place invariants in 36 ms
[2023-03-11 03:11:38] [INFO ] Implicit Places using invariants in 1266 ms returned []
[2023-03-11 03:11:38] [INFO ] Invariant cache hit.
[2023-03-11 03:11:39] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2023-03-11 03:11:59] [INFO ] Implicit Places using invariants and state equation in 21749 ms returned []
Implicit Place search using SMT with State Equation took 23021 ms to find 0 implicit places.
[2023-03-11 03:11:59] [INFO ] Invariant cache hit.
[2023-03-11 03:12:01] [INFO ] Dead Transitions using invariants and state equation in 1638 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2084/2103 places, 3644/3681 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24913 ms. Remains : 2084/2103 places, 3644/3681 transitions.
Stuttering acceptance computed with spot in 117 ms :[(NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : CANConstruction-PT-040-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LEQ s405 s1040) (LEQ s1601 s915)), p1:(LEQ s405 s1040)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 142 reset in 521 ms.
Product exploration explored 100000 steps with 142 reset in 587 ms.
Computed a total of 121 stabilizing places and 160 stable transitions
Computed a total of 121 stabilizing places and 160 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 367 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter sensitive) to 3 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 90 ms :[(NOT p1), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 14 resets, run finished after 204 ms. (steps per millisecond=49 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-11 03:12:03] [INFO ] Invariant cache hit.
[2023-03-11 03:12:03] [INFO ] After 256ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-11 03:12:03] [INFO ] [Nat]Absence check using 41 positive place invariants in 36 ms returned sat
[2023-03-11 03:12:04] [INFO ] After 995ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-11 03:12:04] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2023-03-11 03:12:05] [INFO ] After 347ms SMT Verify possible using 3160 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-03-11 03:12:05] [INFO ] After 519ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 139 ms.
[2023-03-11 03:12:05] [INFO ] After 2008ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 26 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=13 )
Parikh walk visited 1 properties in 2 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (G (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT (AND p0 p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 10 factoid took 423 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter sensitive) to 3 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1))]
Support contains 4 out of 2084 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2084/2084 places, 3644/3644 transitions.
Drop transitions removed 275 transitions
Trivial Post-agglo rules discarded 275 transitions
Performed 275 trivial Post agglomeration. Transition count delta: 275
Iterating post reduction 0 with 275 rules applied. Total rules applied 275 place count 2084 transition count 3369
Reduce places removed 275 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 276 rules applied. Total rules applied 551 place count 1809 transition count 3368
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 552 place count 1808 transition count 3368
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 40 Pre rules applied. Total rules applied 552 place count 1808 transition count 3328
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 632 place count 1768 transition count 3328
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 716 place count 1726 transition count 3286
Applied a total of 716 rules in 434 ms. Remains 1726 /2084 variables (removed 358) and now considering 3286/3644 (removed 358) transitions.
// Phase 1: matrix 3286 rows 1726 cols
[2023-03-11 03:12:06] [INFO ] Computed 41 place invariants in 58 ms
[2023-03-11 03:12:07] [INFO ] Implicit Places using invariants in 1184 ms returned []
[2023-03-11 03:12:07] [INFO ] Invariant cache hit.
[2023-03-11 03:12:08] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2023-03-11 03:12:29] [INFO ] Implicit Places using invariants and state equation in 21886 ms returned []
Implicit Place search using SMT with State Equation took 23074 ms to find 0 implicit places.
[2023-03-11 03:12:30] [INFO ] Redundant transitions in 200 ms returned []
[2023-03-11 03:12:30] [INFO ] Invariant cache hit.
[2023-03-11 03:12:31] [INFO ] Dead Transitions using invariants and state equation in 1470 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1726/2084 places, 3286/3644 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 25194 ms. Remains : 1726/2084 places, 3286/3644 transitions.
Computed a total of 41 stabilizing places and 80 stable transitions
Computed a total of 41 stabilizing places and 80 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 243 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter insensitive) to 3 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 103 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 36 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-11 03:12:31] [INFO ] Invariant cache hit.
[2023-03-11 03:12:32] [INFO ] After 163ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 03:12:32] [INFO ] [Nat]Absence check using 41 positive place invariants in 21 ms returned sat
[2023-03-11 03:12:33] [INFO ] After 842ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 03:12:33] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2023-03-11 03:12:33] [INFO ] After 423ms SMT Verify possible using 3160 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 03:12:33] [INFO ] After 632ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 151 ms.
[2023-03-11 03:12:33] [INFO ] After 1853ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 9 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=9 )
Parikh walk visited 1 properties in 5 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 330 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter insensitive) to 3 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 362 reset in 982 ms.
Stack based approach found an accepted trace after 1720 steps with 5 reset with depth 296 and stack size 296 in 15 ms.
FORMULA CANConstruction-PT-040-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property CANConstruction-PT-040-LTLCardinality-12 finished in 59194 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 2103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2103/2103 places, 3681/3681 transitions.
Drop transitions removed 264 transitions
Trivial Post-agglo rules discarded 264 transitions
Performed 264 trivial Post agglomeration. Transition count delta: 264
Iterating post reduction 0 with 264 rules applied. Total rules applied 264 place count 2103 transition count 3417
Reduce places removed 264 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 265 rules applied. Total rules applied 529 place count 1839 transition count 3416
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 530 place count 1838 transition count 3416
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 39 Pre rules applied. Total rules applied 530 place count 1838 transition count 3377
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 608 place count 1799 transition count 3377
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 628 place count 1779 transition count 3337
Iterating global reduction 3 with 20 rules applied. Total rules applied 648 place count 1779 transition count 3337
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 3 with 16 rules applied. Total rules applied 664 place count 1779 transition count 3321
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 4 with 16 rules applied. Total rules applied 680 place count 1763 transition count 3321
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 5 with 78 rules applied. Total rules applied 758 place count 1724 transition count 3282
Applied a total of 758 rules in 687 ms. Remains 1724 /2103 variables (removed 379) and now considering 3282/3681 (removed 399) transitions.
// Phase 1: matrix 3282 rows 1724 cols
[2023-03-11 03:12:36] [INFO ] Computed 41 place invariants in 37 ms
[2023-03-11 03:12:38] [INFO ] Implicit Places using invariants in 2151 ms returned []
[2023-03-11 03:12:38] [INFO ] Invariant cache hit.
[2023-03-11 03:12:39] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2023-03-11 03:13:00] [INFO ] Implicit Places using invariants and state equation in 21825 ms returned []
Implicit Place search using SMT with State Equation took 24007 ms to find 0 implicit places.
[2023-03-11 03:13:00] [INFO ] Redundant transitions in 115 ms returned []
[2023-03-11 03:13:00] [INFO ] Invariant cache hit.
[2023-03-11 03:13:01] [INFO ] Dead Transitions using invariants and state equation in 1436 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1724/2103 places, 3282/3681 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 26286 ms. Remains : 1724/2103 places, 3282/3681 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-040-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT s55 s524)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 390 steps with 4 reset in 4 ms.
FORMULA CANConstruction-PT-040-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-040-LTLCardinality-13 finished in 26395 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0||G((p1||F(p2))))))))'
Support contains 5 out of 2103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2103/2103 places, 3681/3681 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 2085 transition count 3646
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 2085 transition count 3646
Applied a total of 36 rules in 267 ms. Remains 2085 /2103 variables (removed 18) and now considering 3646/3681 (removed 35) transitions.
// Phase 1: matrix 3646 rows 2085 cols
[2023-03-11 03:13:02] [INFO ] Computed 41 place invariants in 24 ms
[2023-03-11 03:13:03] [INFO ] Implicit Places using invariants in 1238 ms returned []
[2023-03-11 03:13:03] [INFO ] Invariant cache hit.
[2023-03-11 03:13:04] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2023-03-11 03:13:27] [INFO ] Implicit Places using invariants and state equation in 24088 ms returned []
Implicit Place search using SMT with State Equation took 25340 ms to find 0 implicit places.
[2023-03-11 03:13:27] [INFO ] Invariant cache hit.
[2023-03-11 03:13:29] [INFO ] Dead Transitions using invariants and state equation in 1607 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2085/2103 places, 3646/3681 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27219 ms. Remains : 2085/2103 places, 3646/3681 transitions.
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : CANConstruction-PT-040-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(LEQ s1613 s1646), p1:(GT s1853 s996), p2:(GT 1 s961)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 1141 ms.
Product exploration explored 100000 steps with 33333 reset in 1091 ms.
Computed a total of 121 stabilizing places and 160 stable transitions
Computed a total of 121 stabilizing places and 160 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 3 factoid took 71 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANConstruction-PT-040-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANConstruction-PT-040-LTLCardinality-15 finished in 29682 ms.
All properties solved by simple procedures.
Total runtime 227503 ms.
ITS solved all properties within timeout

BK_STOP 1678504411972

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML

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="CANConstruction-PT-040"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is CANConstruction-PT-040, 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 r039-tajo-167813692800643"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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