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.r041-tajo-167813694900619.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 ltsminxred
Input is CANConstruction-PT-010, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r041-tajo-167813694900619
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 604K
-rw-r--r-- 1 mcc users 7.1K Feb 25 21:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Feb 25 21:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Feb 25 21:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 76K Feb 25 21:32 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.8K Feb 25 15:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Feb 25 15:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 21:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K Feb 25 21:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Feb 25 21:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 25 21:38 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 173K 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-010-LTLCardinality-00
FORMULA_NAME CANConstruction-PT-010-LTLCardinality-01
FORMULA_NAME CANConstruction-PT-010-LTLCardinality-02
FORMULA_NAME CANConstruction-PT-010-LTLCardinality-03
FORMULA_NAME CANConstruction-PT-010-LTLCardinality-04
FORMULA_NAME CANConstruction-PT-010-LTLCardinality-05
FORMULA_NAME CANConstruction-PT-010-LTLCardinality-06
FORMULA_NAME CANConstruction-PT-010-LTLCardinality-07
FORMULA_NAME CANConstruction-PT-010-LTLCardinality-08
FORMULA_NAME CANConstruction-PT-010-LTLCardinality-09
FORMULA_NAME CANConstruction-PT-010-LTLCardinality-10
FORMULA_NAME CANConstruction-PT-010-LTLCardinality-11
FORMULA_NAME CANConstruction-PT-010-LTLCardinality-12
FORMULA_NAME CANConstruction-PT-010-LTLCardinality-13
FORMULA_NAME CANConstruction-PT-010-LTLCardinality-14
FORMULA_NAME CANConstruction-PT-010-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678650823018

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=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANConstruction-PT-010
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 19:53:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 19:53:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 19:53:45] [INFO ] Load time of PNML (sax parser for PT used): 66 ms
[2023-03-12 19:53:45] [INFO ] Transformed 322 places.
[2023-03-12 19:53:45] [INFO ] Transformed 480 transitions.
[2023-03-12 19:53:45] [INFO ] Parsed PT model containing 322 places and 480 transitions and 1400 arcs in 159 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA CANConstruction-PT-010-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-010-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-010-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-010-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 43 out of 322 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 322/322 places, 480/480 transitions.
Discarding 70 places :
Symmetric choice reduction at 0 with 70 rule applications. Total rules 70 place count 252 transition count 340
Iterating global reduction 0 with 70 rules applied. Total rules applied 140 place count 252 transition count 340
Applied a total of 140 rules in 43 ms. Remains 252 /322 variables (removed 70) and now considering 340/480 (removed 140) transitions.
// Phase 1: matrix 340 rows 252 cols
[2023-03-12 19:53:45] [INFO ] Computed 21 place invariants in 16 ms
[2023-03-12 19:53:45] [INFO ] Implicit Places using invariants in 266 ms returned [12, 26, 40, 54, 68, 82, 96, 124, 138]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 294 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 243/322 places, 340/480 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 237 transition count 334
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 237 transition count 334
Applied a total of 12 rules in 13 ms. Remains 237 /243 variables (removed 6) and now considering 334/340 (removed 6) transitions.
// Phase 1: matrix 334 rows 237 cols
[2023-03-12 19:53:45] [INFO ] Computed 12 place invariants in 3 ms
[2023-03-12 19:53:45] [INFO ] Implicit Places using invariants in 107 ms returned []
[2023-03-12 19:53:45] [INFO ] Invariant cache hit.
[2023-03-12 19:53:45] [INFO ] State equation strengthened by 190 read => feed constraints.
[2023-03-12 19:53:46] [INFO ] Implicit Places using invariants and state equation in 258 ms returned []
Implicit Place search using SMT with State Equation took 367 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 237/322 places, 334/480 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 718 ms. Remains : 237/322 places, 334/480 transitions.
Support contains 43 out of 237 places after structural reductions.
[2023-03-12 19:53:46] [INFO ] Flatten gal took : 43 ms
[2023-03-12 19:53:46] [INFO ] Flatten gal took : 19 ms
[2023-03-12 19:53:46] [INFO ] Input system was already deterministic with 334 transitions.
Support contains 41 out of 237 places (down from 43) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 63 resets, run finished after 402 ms. (steps per millisecond=24 ) properties (out of 26) seen :19
Incomplete Best-First random walk after 10000 steps, including 7 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 7 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-12 19:53:47] [INFO ] Invariant cache hit.
[2023-03-12 19:53:47] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-03-12 19:53:47] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 19:53:47] [INFO ] After 91ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:6
[2023-03-12 19:53:47] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-03-12 19:53:47] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 19:53:47] [INFO ] After 83ms SMT Verify possible using state equation in natural domain returned unsat :6 sat :1
[2023-03-12 19:53:47] [INFO ] State equation strengthened by 190 read => feed constraints.
[2023-03-12 19:53:47] [INFO ] After 14ms SMT Verify possible using 190 Read/Feed constraints in natural domain returned unsat :7 sat :0
[2023-03-12 19:53:47] [INFO ] After 186ms SMT Verify possible using all constraints in natural domain returned unsat :7 sat :0
Fused 7 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 7 atomic propositions for a total of 12 simplifications.
Initial state reduction rules removed 2 formulas.
FORMULA CANConstruction-PT-010-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-010-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-010-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-010-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-010-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 35 stabilizing places and 44 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' '!(F((X(G(p0))&&(p1||F(p2)))))'
Support contains 5 out of 237 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 237/237 places, 334/334 transitions.
Drop transitions removed 69 transitions
Trivial Post-agglo rules discarded 69 transitions
Performed 69 trivial Post agglomeration. Transition count delta: 69
Iterating post reduction 0 with 69 rules applied. Total rules applied 69 place count 237 transition count 265
Reduce places removed 69 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 70 rules applied. Total rules applied 139 place count 168 transition count 264
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 140 place count 167 transition count 264
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 140 place count 167 transition count 254
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 160 place count 157 transition count 254
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 169 place count 148 transition count 236
Iterating global reduction 3 with 9 rules applied. Total rules applied 178 place count 148 transition count 236
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 3 rules applied. Total rules applied 181 place count 148 transition count 233
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 184 place count 145 transition count 233
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 200 place count 137 transition count 225
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -69
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 220 place count 127 transition count 294
Applied a total of 220 rules in 50 ms. Remains 127 /237 variables (removed 110) and now considering 294/334 (removed 40) transitions.
// Phase 1: matrix 294 rows 127 cols
[2023-03-12 19:53:47] [INFO ] Computed 12 place invariants in 3 ms
[2023-03-12 19:53:47] [INFO ] Implicit Places using invariants in 83 ms returned []
[2023-03-12 19:53:47] [INFO ] Invariant cache hit.
[2023-03-12 19:53:47] [INFO ] State equation strengthened by 279 read => feed constraints.
[2023-03-12 19:53:48] [INFO ] Implicit Places using invariants and state equation in 268 ms returned []
Implicit Place search using SMT with State Equation took 353 ms to find 0 implicit places.
[2023-03-12 19:53:48] [INFO ] Redundant transitions in 14 ms returned []
[2023-03-12 19:53:48] [INFO ] Invariant cache hit.
[2023-03-12 19:53:48] [INFO ] Dead Transitions using invariants and state equation in 120 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 127/237 places, 294/334 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 549 ms. Remains : 127/237 places, 294/334 transitions.
Stuttering acceptance computed with spot in 385 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : CANConstruction-PT-010-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ 1 s91), p2:(LEQ s27 s53), p0:(LEQ s83 s125)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 2002 reset in 421 ms.
Stack based approach found an accepted trace after 51 steps with 1 reset with depth 11 and stack size 11 in 11 ms.
FORMULA CANConstruction-PT-010-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property CANConstruction-PT-010-LTLCardinality-05 finished in 1435 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 237 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 334/334 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 224 transition count 311
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 224 transition count 311
Applied a total of 26 rules in 12 ms. Remains 224 /237 variables (removed 13) and now considering 311/334 (removed 23) transitions.
// Phase 1: matrix 311 rows 224 cols
[2023-03-12 19:53:49] [INFO ] Computed 12 place invariants in 2 ms
[2023-03-12 19:53:49] [INFO ] Implicit Places using invariants in 168 ms returned [96]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 170 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 223/237 places, 311/334 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 222 transition count 310
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 222 transition count 310
Applied a total of 2 rules in 5 ms. Remains 222 /223 variables (removed 1) and now considering 310/311 (removed 1) transitions.
// Phase 1: matrix 310 rows 222 cols
[2023-03-12 19:53:49] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-12 19:53:49] [INFO ] Implicit Places using invariants in 169 ms returned []
[2023-03-12 19:53:49] [INFO ] Invariant cache hit.
[2023-03-12 19:53:49] [INFO ] State equation strengthened by 190 read => feed constraints.
[2023-03-12 19:53:49] [INFO ] Implicit Places using invariants and state equation in 441 ms returned []
Implicit Place search using SMT with State Equation took 625 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 222/237 places, 310/334 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 813 ms. Remains : 222/237 places, 310/334 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-010-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT s31 s150)], 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]]
Stuttering criterion allowed to conclude after 357 steps with 12 reset in 3 ms.
FORMULA CANConstruction-PT-010-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-010-LTLCardinality-06 finished in 921 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X((p1||G((p2 U p3))||X(G(p2)))))))'
Support contains 7 out of 237 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 334/334 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 227 transition count 316
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 227 transition count 316
Applied a total of 20 rules in 9 ms. Remains 227 /237 variables (removed 10) and now considering 316/334 (removed 18) transitions.
// Phase 1: matrix 316 rows 227 cols
[2023-03-12 19:53:50] [INFO ] Computed 12 place invariants in 1 ms
[2023-03-12 19:53:50] [INFO ] Implicit Places using invariants in 136 ms returned [96]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 150 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 226/237 places, 316/334 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 225 transition count 315
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 225 transition count 315
Applied a total of 2 rules in 5 ms. Remains 225 /226 variables (removed 1) and now considering 315/316 (removed 1) transitions.
// Phase 1: matrix 315 rows 225 cols
[2023-03-12 19:53:50] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-12 19:53:50] [INFO ] Implicit Places using invariants in 164 ms returned []
[2023-03-12 19:53:50] [INFO ] Invariant cache hit.
[2023-03-12 19:53:50] [INFO ] State equation strengthened by 190 read => feed constraints.
[2023-03-12 19:53:50] [INFO ] Implicit Places using invariants and state equation in 280 ms returned []
Implicit Place search using SMT with State Equation took 447 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 225/237 places, 315/334 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 611 ms. Remains : 225/237 places, 315/334 transitions.
Stuttering acceptance computed with spot in 717 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p1) (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p1) (NOT p2) (NOT p3))]
Running random walk in product with property : CANConstruction-PT-010-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0, 1} source=0 dest: 0}, { cond=p0, acceptance={0, 1} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), acceptance={0, 1} source=1 dest: 2}, { cond=(OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) (NOT p1) p2)), acceptance={1} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p3) p2), acceptance={0, 1} source=1 dest: 4}, { cond=(OR (AND p0 (NOT p1) p3) (AND p0 (NOT p1) p2)), acceptance={1} source=1 dest: 5}, { cond=(AND p0 (NOT p1) (NOT p3) (NOT p2)), acceptance={0, 1} source=1 dest: 5}, { cond=(AND p0 (NOT p1) (NOT p3) p2), acceptance={0, 1} source=1 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p2), acceptance={0} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={0, 1} source=3 dest: 0}, { cond=(AND p0 p3 (NOT p2)), acceptance={1} source=3 dest: 1}, { cond=(AND p0 (NOT p3) (NOT p2)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={0} source=3 dest: 4}, { cond=(AND p0 p2), acceptance={} source=3 dest: 5}, { cond=(AND p0 (NOT p3) p2), acceptance={0} source=3 dest: 6}, { cond=(AND (NOT p0) p3 (NOT p2)), acceptance={1} source=3 dest: 7}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={0, 1} source=4 dest: 0}, { cond=(AND p0 (NOT p3) (NOT p2)), acceptance={0, 1} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={0} source=4 dest: 4}, { cond=(AND p0 (NOT p3) p2), acceptance={0} source=4 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), acceptance={0, 1} source=5 dest: 2}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p0) (NOT p1) p3 (NOT p2)), acceptance={1} source=5 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p3) p2), acceptance={0} source=5 dest: 4}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=5 dest: 5}, { cond=(AND p0 (NOT p1) p3 (NOT p2)), acceptance={1} source=5 dest: 5}, { cond=(AND p0 (NOT p1) (NOT p3) (NOT p2)), acceptance={0, 1} source=5 dest: 5}, { cond=(AND p0 (NOT p1) (NOT p3) p2), acceptance={0} source=5 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), acceptance={0, 1} source=6 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p3) p2), acceptance={0} source=6 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p3) (NOT p2)), acceptance={0, 1} source=6 dest: 5}, { cond=(AND p0 (NOT p1) (NOT p3) p2), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={0, 1} source=7 dest: 0}, { cond=(OR (AND p0 p3) (AND p0 p2)), acceptance={1} source=7 dest: 1}, { cond=(AND p0 (NOT p3) (NOT p2)), acceptance={0, 1} source=7 dest: 1}, { cond=(OR (AND (NOT p0) p3) (AND (NOT p0) p2)), acceptance={1} source=7 dest: 7}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={0, 1} source=7 dest: 8}, { cond=(AND p0 (NOT p3) p2), acceptance={0, 1} source=7 dest: 9}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={0, 1} source=8 dest: 0}, { cond=(AND p0 (NOT p3) (NOT p2)), acceptance={0, 1} source=8 dest: 1}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={0, 1} source=8 dest: 8}, { cond=(AND p0 (NOT p3) p2), acceptance={0, 1} source=8 dest: 9}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), acceptance={0, 1} source=9 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p3) p2), acceptance={0, 1} source=9 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p3) (NOT p2)), acceptance={0, 1} source=9 dest: 5}, { cond=(AND p0 (NOT p1) (NOT p3) p2), acceptance={0, 1} source=9 dest: 6}]], initial=0, aps=[p0:(LEQ s54 s150), p1:(LEQ s101 s188), p3:(LEQ 1 s128), p2:(LEQ s33 s55)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 393 ms.
Product exploration explored 100000 steps with 50000 reset in 443 ms.
Computed a total of 32 stabilizing places and 41 stable transitions
Computed a total of 32 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p3) p2), (X p0), (X (NOT (AND p0 (NOT p1) (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)))), (X (NOT (OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) (NOT p1) p2)))), (X (NOT (OR (AND p0 (NOT p1) p3) (AND p0 (NOT p1) p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) p2))), (X (NOT (AND p0 (NOT p1) (NOT p3) p2))), (X (X (NOT (AND p0 (NOT p3) (NOT p2))))), (X (X p0)), (X (X (NOT (AND p0 (NOT p1) (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 p2))), (X (X (NOT (AND (NOT p0) (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p3 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2))))), (X (X (NOT (OR (AND p0 (NOT p1) p3) (AND p0 (NOT p1) p2))))), (X (X (NOT (AND (NOT p0) p3 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p3 (NOT p2))))), (X (X (NOT (AND p0 p3 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) (NOT p1) p2))))), (X (X (AND p0 (NOT p3) p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p3) p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p0 p1 (NOT p3) p2)
Knowledge based reduction with 29 factoid took 1436 ms. Reduced automaton from 10 states, 50 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANConstruction-PT-010-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANConstruction-PT-010-LTLCardinality-07 finished in 3646 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 237 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 237/237 places, 334/334 transitions.
Drop transitions removed 69 transitions
Trivial Post-agglo rules discarded 69 transitions
Performed 69 trivial Post agglomeration. Transition count delta: 69
Iterating post reduction 0 with 69 rules applied. Total rules applied 69 place count 237 transition count 265
Reduce places removed 69 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 70 rules applied. Total rules applied 139 place count 168 transition count 264
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 140 place count 167 transition count 264
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 140 place count 167 transition count 255
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 158 place count 158 transition count 255
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 168 place count 148 transition count 235
Iterating global reduction 3 with 10 rules applied. Total rules applied 178 place count 148 transition count 235
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 3 with 5 rules applied. Total rules applied 183 place count 148 transition count 230
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 188 place count 143 transition count 230
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 202 place count 136 transition count 223
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -70
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 222 place count 126 transition count 293
Applied a total of 222 rules in 37 ms. Remains 126 /237 variables (removed 111) and now considering 293/334 (removed 41) transitions.
// Phase 1: matrix 293 rows 126 cols
[2023-03-12 19:53:53] [INFO ] Computed 12 place invariants in 3 ms
[2023-03-12 19:53:53] [INFO ] Implicit Places using invariants in 72 ms returned [27]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 76 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 125/237 places, 293/334 transitions.
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 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 123 transition count 291
Applied a total of 4 rules in 16 ms. Remains 123 /125 variables (removed 2) and now considering 291/293 (removed 2) transitions.
// Phase 1: matrix 291 rows 123 cols
[2023-03-12 19:53:53] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-12 19:53:53] [INFO ] Implicit Places using invariants in 77 ms returned []
[2023-03-12 19:53:53] [INFO ] Invariant cache hit.
[2023-03-12 19:53:53] [INFO ] State equation strengthened by 280 read => feed constraints.
[2023-03-12 19:53:54] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 336 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 123/237 places, 291/334 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 466 ms. Remains : 123/237 places, 291/334 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : CANConstruction-PT-010-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 1 s12)], 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]]
Stuttering criterion allowed to conclude after 36 steps with 1 reset in 1 ms.
FORMULA CANConstruction-PT-010-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-010-LTLCardinality-10 finished in 511 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||G(p1)||G(!p1)))))'
Support contains 4 out of 237 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 334/334 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 227 transition count 316
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 227 transition count 316
Applied a total of 20 rules in 4 ms. Remains 227 /237 variables (removed 10) and now considering 316/334 (removed 18) transitions.
// Phase 1: matrix 316 rows 227 cols
[2023-03-12 19:53:54] [INFO ] Computed 12 place invariants in 1 ms
[2023-03-12 19:53:54] [INFO ] Implicit Places using invariants in 98 ms returned [97]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 100 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 226/237 places, 316/334 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 225 transition count 315
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 225 transition count 315
Applied a total of 2 rules in 5 ms. Remains 225 /226 variables (removed 1) and now considering 315/316 (removed 1) transitions.
// Phase 1: matrix 315 rows 225 cols
[2023-03-12 19:53:54] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-12 19:53:54] [INFO ] Implicit Places using invariants in 100 ms returned []
[2023-03-12 19:53:54] [INFO ] Invariant cache hit.
[2023-03-12 19:53:54] [INFO ] State equation strengthened by 190 read => feed constraints.
[2023-03-12 19:53:54] [INFO ] Implicit Places using invariants and state equation in 281 ms returned []
Implicit Place search using SMT with State Equation took 383 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 225/237 places, 315/334 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 492 ms. Remains : 225/237 places, 315/334 transitions.
Stuttering acceptance computed with spot in 144 ms :[true, p1, (NOT p1), false, false]
Running random walk in product with property : CANConstruction-PT-010-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 2}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=3, aps=[p1:(LEQ s147 s208), p0:(GT s7 s84)], 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][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1411 steps with 7 reset in 2 ms.
FORMULA CANConstruction-PT-010-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-010-LTLCardinality-11 finished in 653 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 1 out of 237 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 334/334 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 225 transition count 313
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 225 transition count 313
Applied a total of 24 rules in 5 ms. Remains 225 /237 variables (removed 12) and now considering 313/334 (removed 21) transitions.
// Phase 1: matrix 313 rows 225 cols
[2023-03-12 19:53:54] [INFO ] Computed 12 place invariants in 2 ms
[2023-03-12 19:53:54] [INFO ] Implicit Places using invariants in 98 ms returned [96]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 101 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 224/237 places, 313/334 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 223 transition count 312
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 223 transition count 312
Applied a total of 2 rules in 6 ms. Remains 223 /224 variables (removed 1) and now considering 312/313 (removed 1) transitions.
// Phase 1: matrix 312 rows 223 cols
[2023-03-12 19:53:54] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-12 19:53:54] [INFO ] Implicit Places using invariants in 90 ms returned []
[2023-03-12 19:53:55] [INFO ] Invariant cache hit.
[2023-03-12 19:53:55] [INFO ] State equation strengthened by 190 read => feed constraints.
[2023-03-12 19:53:55] [INFO ] Implicit Places using invariants and state equation in 266 ms returned []
Implicit Place search using SMT with State Equation took 362 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 223/237 places, 312/334 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 474 ms. Remains : 223/237 places, 312/334 transitions.
Stuttering acceptance computed with spot in 123 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-010-LTLCardinality-13 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:(LEQ 1 s181)], 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]]
Stuttering criterion allowed to conclude after 166 steps with 0 reset in 1 ms.
FORMULA CANConstruction-PT-010-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-010-LTLCardinality-13 finished in 611 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((G(F(p1))||(F(p1)&&F(!p0)))))))'
Support contains 2 out of 237 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 237/237 places, 334/334 transitions.
Drop transitions removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 71 place count 237 transition count 263
Reduce places removed 71 places and 0 transitions.
Iterating post reduction 1 with 71 rules applied. Total rules applied 142 place count 166 transition count 263
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 142 place count 166 transition count 254
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 160 place count 157 transition count 254
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 170 place count 147 transition count 234
Iterating global reduction 2 with 10 rules applied. Total rules applied 180 place count 147 transition count 234
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 2 with 5 rules applied. Total rules applied 185 place count 147 transition count 229
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 190 place count 142 transition count 229
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 202 place count 136 transition count 223
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -70
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 222 place count 126 transition count 293
Applied a total of 222 rules in 30 ms. Remains 126 /237 variables (removed 111) and now considering 293/334 (removed 41) transitions.
// Phase 1: matrix 293 rows 126 cols
[2023-03-12 19:53:55] [INFO ] Computed 12 place invariants in 3 ms
[2023-03-12 19:53:55] [INFO ] Implicit Places using invariants in 97 ms returned [27]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 98 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 125/237 places, 293/334 transitions.
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 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 123 transition count 291
Applied a total of 4 rules in 14 ms. Remains 123 /125 variables (removed 2) and now considering 291/293 (removed 2) transitions.
// Phase 1: matrix 291 rows 123 cols
[2023-03-12 19:53:55] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-12 19:53:55] [INFO ] Implicit Places using invariants in 75 ms returned []
[2023-03-12 19:53:55] [INFO ] Invariant cache hit.
[2023-03-12 19:53:55] [INFO ] State equation strengthened by 280 read => feed constraints.
[2023-03-12 19:53:55] [INFO ] Implicit Places using invariants and state equation in 251 ms returned []
Implicit Place search using SMT with State Equation took 328 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 123/237 places, 291/334 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 471 ms. Remains : 123/237 places, 291/334 transitions.
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CANConstruction-PT-010-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 1 s7), p1:(GT 1 s121)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 24521 reset in 327 ms.
Stack based approach found an accepted trace after 42895 steps with 10486 reset with depth 25 and stack size 25 in 135 ms.
FORMULA CANConstruction-PT-010-LTLCardinality-15 FALSE TECHNIQUES STACK_TEST
Treatment of property CANConstruction-PT-010-LTLCardinality-15 finished in 1049 ms.
All properties solved by simple procedures.
Total runtime 11384 ms.
ITS solved all properties within timeout

BK_STOP 1678650836597

--------------------
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-010"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is CANConstruction-PT-010, 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 r041-tajo-167813694900619"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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