Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r087-tall-171620521300017.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is CANConstruction-PT-030, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r087-tall-171620521300017
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.8M
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 17:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.0K Apr 12 18:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 65K Apr 12 18:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Apr 12 18:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Apr 12 18:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.4M May 18 16:42 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-030-LTLCardinality-00
FORMULA_NAME CANConstruction-PT-030-LTLCardinality-01
FORMULA_NAME CANConstruction-PT-030-LTLCardinality-02
FORMULA_NAME CANConstruction-PT-030-LTLCardinality-03
FORMULA_NAME CANConstruction-PT-030-LTLCardinality-04
FORMULA_NAME CANConstruction-PT-030-LTLCardinality-05
FORMULA_NAME CANConstruction-PT-030-LTLCardinality-06
FORMULA_NAME CANConstruction-PT-030-LTLCardinality-07
FORMULA_NAME CANConstruction-PT-030-LTLCardinality-08
FORMULA_NAME CANConstruction-PT-030-LTLCardinality-09
FORMULA_NAME CANConstruction-PT-030-LTLCardinality-10
FORMULA_NAME CANConstruction-PT-030-LTLCardinality-11
FORMULA_NAME CANConstruction-PT-030-LTLCardinality-12
FORMULA_NAME CANConstruction-PT-030-LTLCardinality-13
FORMULA_NAME CANConstruction-PT-030-LTLCardinality-14
FORMULA_NAME CANConstruction-PT-030-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716215710294

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=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANConstruction-PT-030
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-20 14:35:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-20 14:35:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-20 14:35:11] [INFO ] Load time of PNML (sax parser for PT used): 152 ms
[2024-05-20 14:35:12] [INFO ] Transformed 2162 places.
[2024-05-20 14:35:12] [INFO ] Transformed 3840 transitions.
[2024-05-20 14:35:12] [INFO ] Parsed PT model containing 2162 places and 3840 transitions and 11400 arcs in 363 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Support contains 54 out of 2162 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2162/2162 places, 3840/3840 transitions.
Discarding 819 places :
Symmetric choice reduction at 0 with 819 rule applications. Total rules 819 place count 1343 transition count 2202
Iterating global reduction 0 with 819 rules applied. Total rules applied 1638 place count 1343 transition count 2202
Applied a total of 1638 rules in 338 ms. Remains 1343 /2162 variables (removed 819) and now considering 2202/3840 (removed 1638) transitions.
// Phase 1: matrix 2202 rows 1343 cols
[2024-05-20 14:35:12] [INFO ] Computed 61 invariants in 46 ms
[2024-05-20 14:35:13] [INFO ] Implicit Places using invariants in 882 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]
Discarding 30 places :
Implicit Place search using SMT only with invariants took 912 ms to find 30 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1313/2162 places, 2202/3840 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 1284 transition count 2173
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 1284 transition count 2173
Applied a total of 58 rules in 89 ms. Remains 1284 /1313 variables (removed 29) and now considering 2173/2202 (removed 29) transitions.
// Phase 1: matrix 2173 rows 1284 cols
[2024-05-20 14:35:13] [INFO ] Computed 31 invariants in 19 ms
[2024-05-20 14:35:14] [INFO ] Implicit Places using invariants in 552 ms returned []
[2024-05-20 14:35:14] [INFO ] Invariant cache hit.
[2024-05-20 14:35:14] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2024-05-20 14:35:21] [INFO ] Implicit Places using invariants and state equation in 7297 ms returned []
Implicit Place search using SMT with State Equation took 7853 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1284/2162 places, 2173/3840 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 9194 ms. Remains : 1284/2162 places, 2173/3840 transitions.
Support contains 54 out of 1284 places after structural reductions.
[2024-05-20 14:35:21] [INFO ] Flatten gal took : 137 ms
[2024-05-20 14:35:21] [INFO ] Flatten gal took : 89 ms
[2024-05-20 14:35:22] [INFO ] Input system was already deterministic with 2173 transitions.
Incomplete random walk after 10000 steps, including 18 resets, run finished after 474 ms. (steps per millisecond=21 ) properties (out of 33) seen :22
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 11) 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 11) 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 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2024-05-20 14:35:22] [INFO ] Invariant cache hit.
[2024-05-20 14:35:23] [INFO ] [Real]Absence check using 31 positive place invariants in 32 ms returned sat
[2024-05-20 14:35:23] [INFO ] After 431ms SMT Verify possible using all constraints in real domain returned unsat :8 sat :0 real:2
[2024-05-20 14:35:23] [INFO ] [Nat]Absence check using 31 positive place invariants in 28 ms returned sat
[2024-05-20 14:35:24] [INFO ] After 631ms SMT Verify possible using state equation in natural domain returned unsat :8 sat :2
[2024-05-20 14:35:24] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2024-05-20 14:35:24] [INFO ] After 273ms SMT Verify possible using 1770 Read/Feed constraints in natural domain returned unsat :8 sat :2
[2024-05-20 14:35:24] [INFO ] After 575ms SMT Verify possible using trap constraints in natural domain returned unsat :8 sat :2
Attempting to minimize the solution found.
Minimization took 158 ms.
[2024-05-20 14:35:24] [INFO ] After 1655ms SMT Verify possible using all constraints in natural domain returned unsat :8 sat :2
Fused 10 Parikh solutions to 1 different solutions.
Finished Parikh walk after 41 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=10 )
Parikh walk visited 0 properties in 14 ms.
Support contains 4 out of 1284 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1284/1284 places, 2173/2173 transitions.
Drop transitions removed 194 transitions
Trivial Post-agglo rules discarded 194 transitions
Performed 194 trivial Post agglomeration. Transition count delta: 194
Iterating post reduction 0 with 194 rules applied. Total rules applied 194 place count 1284 transition count 1979
Reduce places removed 194 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 195 rules applied. Total rules applied 389 place count 1090 transition count 1978
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 390 place count 1089 transition count 1978
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 30 Pre rules applied. Total rules applied 390 place count 1089 transition count 1948
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 450 place count 1059 transition count 1948
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 469 place count 1040 transition count 1910
Iterating global reduction 3 with 19 rules applied. Total rules applied 488 place count 1040 transition count 1910
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 3 with 13 rules applied. Total rules applied 501 place count 1040 transition count 1897
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 4 with 13 rules applied. Total rules applied 514 place count 1027 transition count 1897
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 5 with 62 rules applied. Total rules applied 576 place count 996 transition count 1866
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 577 place count 996 transition count 1866
Applied a total of 577 rules in 480 ms. Remains 996 /1284 variables (removed 288) and now considering 1866/2173 (removed 307) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 480 ms. Remains : 996/1284 places, 1866/2173 transitions.
Incomplete random walk after 10000 steps, including 48 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 2) seen :1
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 1866 rows 996 cols
[2024-05-20 14:35:25] [INFO ] Computed 31 invariants in 14 ms
[2024-05-20 14:35:25] [INFO ] After 102ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 14:35:25] [INFO ] [Nat]Absence check using 31 positive place invariants in 26 ms returned sat
[2024-05-20 14:35:26] [INFO ] After 390ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 14:35:26] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2024-05-20 14:35:26] [INFO ] After 208ms SMT Verify possible using 1770 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-20 14:35:26] [INFO ] After 343ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 68 ms.
[2024-05-20 14:35:26] [INFO ] After 957ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 15 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=7 )
Parikh walk visited 1 properties in 2 ms.
FORMULA CANConstruction-PT-030-LTLCardinality-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA CANConstruction-PT-030-LTLCardinality-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 6 atomic propositions for a total of 14 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA CANConstruction-PT-030-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-030-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-030-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 92 stabilizing places and 121 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X((p1||G(p2)||G(p0)))))'
Support contains 4 out of 1284 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1284/1284 places, 2173/2173 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 1264 transition count 2134
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 1264 transition count 2134
Applied a total of 40 rules in 86 ms. Remains 1264 /1284 variables (removed 20) and now considering 2134/2173 (removed 39) transitions.
// Phase 1: matrix 2134 rows 1264 cols
[2024-05-20 14:35:27] [INFO ] Computed 31 invariants in 12 ms
[2024-05-20 14:35:27] [INFO ] Implicit Places using invariants in 640 ms returned []
[2024-05-20 14:35:27] [INFO ] Invariant cache hit.
[2024-05-20 14:35:28] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2024-05-20 14:35:35] [INFO ] Implicit Places using invariants and state equation in 7519 ms returned []
Implicit Place search using SMT with State Equation took 8169 ms to find 0 implicit places.
[2024-05-20 14:35:35] [INFO ] Invariant cache hit.
[2024-05-20 14:35:36] [INFO ] Dead Transitions using invariants and state equation in 797 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1264/1284 places, 2134/2173 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9055 ms. Remains : 1264/1284 places, 2134/2173 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 274 ms :[(NOT p0), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : CANConstruction-PT-030-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(LEQ 1 s1192), p1:(LEQ 2 s537), p2:(LEQ s1090 s1001)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 24060 steps with 48 reset in 243 ms.
FORMULA CANConstruction-PT-030-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-030-LTLCardinality-00 finished in 9629 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 1284 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1284/1284 places, 2173/2173 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 1263 transition count 2132
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 1263 transition count 2132
Applied a total of 42 rules in 95 ms. Remains 1263 /1284 variables (removed 21) and now considering 2132/2173 (removed 41) transitions.
// Phase 1: matrix 2132 rows 1263 cols
[2024-05-20 14:35:36] [INFO ] Computed 31 invariants in 10 ms
[2024-05-20 14:35:37] [INFO ] Implicit Places using invariants in 546 ms returned []
[2024-05-20 14:35:37] [INFO ] Invariant cache hit.
[2024-05-20 14:35:37] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2024-05-20 14:35:45] [INFO ] Implicit Places using invariants and state equation in 7815 ms returned []
Implicit Place search using SMT with State Equation took 8362 ms to find 0 implicit places.
[2024-05-20 14:35:45] [INFO ] Invariant cache hit.
[2024-05-20 14:35:45] [INFO ] Dead Transitions using invariants and state equation in 779 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1263/1284 places, 2132/2173 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9241 ms. Remains : 1263/1284 places, 2132/2173 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-030-LTLCardinality-03 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 s473 s405)], 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 1335 ms.
Product exploration explored 100000 steps with 50000 reset in 1348 ms.
Computed a total of 91 stabilizing places and 120 stable transitions
Computed a total of 91 stabilizing places and 120 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 23 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-030-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANConstruction-PT-030-LTLCardinality-03 finished in 12065 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((G(p0) U X(p1)))&&F((F(p1)&&X(G(p2)))))))'
Support contains 5 out of 1284 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1284/1284 places, 2173/2173 transitions.
Drop transitions removed 195 transitions
Trivial Post-agglo rules discarded 195 transitions
Performed 195 trivial Post agglomeration. Transition count delta: 195
Iterating post reduction 0 with 195 rules applied. Total rules applied 195 place count 1284 transition count 1978
Reduce places removed 195 places and 0 transitions.
Iterating post reduction 1 with 195 rules applied. Total rules applied 390 place count 1089 transition count 1978
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 390 place count 1089 transition count 1948
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 450 place count 1059 transition count 1948
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 471 place count 1038 transition count 1907
Iterating global reduction 2 with 21 rules applied. Total rules applied 492 place count 1038 transition count 1907
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 2 with 14 rules applied. Total rules applied 506 place count 1038 transition count 1893
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 520 place count 1024 transition count 1893
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 522 place count 1023 transition count 1892
Applied a total of 522 rules in 189 ms. Remains 1023 /1284 variables (removed 261) and now considering 1892/2173 (removed 281) transitions.
// Phase 1: matrix 1892 rows 1023 cols
[2024-05-20 14:35:48] [INFO ] Computed 31 invariants in 15 ms
[2024-05-20 14:35:49] [INFO ] Implicit Places using invariants in 511 ms returned []
[2024-05-20 14:35:49] [INFO ] Invariant cache hit.
[2024-05-20 14:35:49] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2024-05-20 14:35:55] [INFO ] Implicit Places using invariants and state equation in 6363 ms returned []
Implicit Place search using SMT with State Equation took 6878 ms to find 0 implicit places.
[2024-05-20 14:35:55] [INFO ] Redundant transitions in 118 ms returned []
[2024-05-20 14:35:55] [INFO ] Invariant cache hit.
[2024-05-20 14:35:56] [INFO ] Dead Transitions using invariants and state equation in 692 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1023/1284 places, 1892/2173 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7893 ms. Remains : 1023/1284 places, 1892/2173 transitions.
Stuttering acceptance computed with spot in 419 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (NOT p1), (NOT p2), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) p2)]
Running random walk in product with property : CANConstruction-PT-030-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 4}, { cond=p0, acceptance={} source=0 dest: 5}, { cond=p0, acceptance={} source=0 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={1} source=1 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=1 dest: 6}], [{ cond=(NOT p0), acceptance={0, 1} source=2 dest: 1}, { cond=true, acceptance={0} source=2 dest: 2}, { cond=p0, acceptance={1} source=2 dest: 5}, { cond=p0, acceptance={0, 1} source=2 dest: 6}], [{ cond=(NOT p1), acceptance={0, 1} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=p2, acceptance={0} source=4 dest: 4}, { cond=(NOT p2), acceptance={0, 1} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=5 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={1} source=5 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=6 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={1} source=6 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=6 dest: 6}], [{ cond=(AND (NOT p0) p1), acceptance={0, 1} source=7 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=7 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=7 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=7 dest: 4}, { cond=(AND p0 p1), acceptance={1} source=7 dest: 5}, { cond=(AND p0 p1), acceptance={} source=7 dest: 7}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=7 dest: 8}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=8 dest: 3}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=8 dest: 8}]], initial=0, aps=[p0:(LEQ 1 s865), p1:(LEQ s746 s795), p2:(LEQ s0 s185)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 206 steps with 1 reset in 2 ms.
FORMULA CANConstruction-PT-030-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-030-LTLCardinality-05 finished in 8349 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 1284 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1284/1284 places, 2173/2173 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 1263 transition count 2132
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 1263 transition count 2132
Applied a total of 42 rules in 76 ms. Remains 1263 /1284 variables (removed 21) and now considering 2132/2173 (removed 41) transitions.
// Phase 1: matrix 2132 rows 1263 cols
[2024-05-20 14:35:57] [INFO ] Computed 31 invariants in 17 ms
[2024-05-20 14:35:57] [INFO ] Implicit Places using invariants in 550 ms returned []
[2024-05-20 14:35:57] [INFO ] Invariant cache hit.
[2024-05-20 14:35:58] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2024-05-20 14:36:05] [INFO ] Implicit Places using invariants and state equation in 7743 ms returned []
Implicit Place search using SMT with State Equation took 8294 ms to find 0 implicit places.
[2024-05-20 14:36:05] [INFO ] Invariant cache hit.
[2024-05-20 14:36:06] [INFO ] Dead Transitions using invariants and state equation in 811 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1263/1284 places, 2132/2173 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9181 ms. Remains : 1263/1284 places, 2132/2173 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-030-LTLCardinality-07 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 s656 s873)], 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 490 steps with 0 reset in 3 ms.
FORMULA CANConstruction-PT-030-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-030-LTLCardinality-07 finished in 9280 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 1284 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1284/1284 places, 2173/2173 transitions.
Drop transitions removed 197 transitions
Trivial Post-agglo rules discarded 197 transitions
Performed 197 trivial Post agglomeration. Transition count delta: 197
Iterating post reduction 0 with 197 rules applied. Total rules applied 197 place count 1284 transition count 1976
Reduce places removed 197 places and 0 transitions.
Iterating post reduction 1 with 197 rules applied. Total rules applied 394 place count 1087 transition count 1976
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 394 place count 1087 transition count 1946
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 454 place count 1057 transition count 1946
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 474 place count 1037 transition count 1906
Iterating global reduction 2 with 20 rules applied. Total rules applied 494 place count 1037 transition count 1906
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 2 with 14 rules applied. Total rules applied 508 place count 1037 transition count 1892
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 522 place count 1023 transition count 1892
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 4 with 60 rules applied. Total rules applied 582 place count 993 transition count 1862
Applied a total of 582 rules in 161 ms. Remains 993 /1284 variables (removed 291) and now considering 1862/2173 (removed 311) transitions.
// Phase 1: matrix 1862 rows 993 cols
[2024-05-20 14:36:06] [INFO ] Computed 31 invariants in 13 ms
[2024-05-20 14:36:06] [INFO ] Implicit Places using invariants in 490 ms returned []
[2024-05-20 14:36:06] [INFO ] Invariant cache hit.
[2024-05-20 14:36:07] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2024-05-20 14:36:13] [INFO ] Implicit Places using invariants and state equation in 6475 ms returned []
Implicit Place search using SMT with State Equation took 6972 ms to find 0 implicit places.
[2024-05-20 14:36:13] [INFO ] Redundant transitions in 85 ms returned []
[2024-05-20 14:36:13] [INFO ] Invariant cache hit.
[2024-05-20 14:36:14] [INFO ] Dead Transitions using invariants and state equation in 650 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 993/1284 places, 1862/2173 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7885 ms. Remains : 993/1284 places, 1862/2173 transitions.
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-030-LTLCardinality-08 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 s649 s554)], 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 207 steps with 0 reset in 2 ms.
FORMULA CANConstruction-PT-030-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-030-LTLCardinality-08 finished in 8007 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 1284 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1284/1284 places, 2173/2173 transitions.
Drop transitions removed 197 transitions
Trivial Post-agglo rules discarded 197 transitions
Performed 197 trivial Post agglomeration. Transition count delta: 197
Iterating post reduction 0 with 197 rules applied. Total rules applied 197 place count 1284 transition count 1976
Reduce places removed 197 places and 0 transitions.
Iterating post reduction 1 with 197 rules applied. Total rules applied 394 place count 1087 transition count 1976
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 394 place count 1087 transition count 1946
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 454 place count 1057 transition count 1946
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 475 place count 1036 transition count 1904
Iterating global reduction 2 with 21 rules applied. Total rules applied 496 place count 1036 transition count 1904
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 2 with 15 rules applied. Total rules applied 511 place count 1036 transition count 1889
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 3 with 15 rules applied. Total rules applied 526 place count 1021 transition count 1889
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 4 with 58 rules applied. Total rules applied 584 place count 992 transition count 1860
Applied a total of 584 rules in 173 ms. Remains 992 /1284 variables (removed 292) and now considering 1860/2173 (removed 313) transitions.
// Phase 1: matrix 1860 rows 992 cols
[2024-05-20 14:36:14] [INFO ] Computed 31 invariants in 17 ms
[2024-05-20 14:36:15] [INFO ] Implicit Places using invariants in 499 ms returned []
[2024-05-20 14:36:15] [INFO ] Invariant cache hit.
[2024-05-20 14:36:15] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2024-05-20 14:36:21] [INFO ] Implicit Places using invariants and state equation in 6543 ms returned []
Implicit Place search using SMT with State Equation took 7047 ms to find 0 implicit places.
[2024-05-20 14:36:21] [INFO ] Redundant transitions in 31 ms returned []
[2024-05-20 14:36:21] [INFO ] Invariant cache hit.
[2024-05-20 14:36:22] [INFO ] Dead Transitions using invariants and state equation in 667 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 992/1284 places, 1860/2173 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7925 ms. Remains : 992/1284 places, 1860/2173 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : CANConstruction-PT-030-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s340 s491)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 485 reset in 586 ms.
Stack based approach found an accepted trace after 31079 steps with 151 reset with depth 17 and stack size 17 in 212 ms.
FORMULA CANConstruction-PT-030-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property CANConstruction-PT-030-LTLCardinality-09 finished in 8777 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0)||(p0&&F(p1))) U ((p2||G(p3)) U X(p4))))'
Support contains 8 out of 1284 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1284/1284 places, 2173/2173 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 1267 transition count 2139
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 1267 transition count 2139
Applied a total of 34 rules in 78 ms. Remains 1267 /1284 variables (removed 17) and now considering 2139/2173 (removed 34) transitions.
// Phase 1: matrix 2139 rows 1267 cols
[2024-05-20 14:36:23] [INFO ] Computed 31 invariants in 13 ms
[2024-05-20 14:36:23] [INFO ] Implicit Places using invariants in 534 ms returned []
[2024-05-20 14:36:23] [INFO ] Invariant cache hit.
[2024-05-20 14:36:24] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2024-05-20 14:36:31] [INFO ] Implicit Places using invariants and state equation in 7535 ms returned []
Implicit Place search using SMT with State Equation took 8072 ms to find 0 implicit places.
[2024-05-20 14:36:31] [INFO ] Invariant cache hit.
[2024-05-20 14:36:32] [INFO ] Dead Transitions using invariants and state equation in 770 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1267/1284 places, 2139/2173 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8922 ms. Remains : 1267/1284 places, 2139/2173 transitions.
Stuttering acceptance computed with spot in 471 ms :[(NOT p4), (NOT p4), (AND (NOT p1) (NOT p0) (NOT p4)), (NOT p4), (AND (NOT p3) (NOT p4)), (NOT p4), (AND (NOT p1) (NOT p3) (NOT p0) (NOT p4)), true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p3), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p0) (NOT p3))]
Running random walk in product with property : CANConstruction-PT-030-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p3) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p3) p0 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}, { cond=(AND (NOT p2) p3 (NOT p0)), acceptance={} source=0 dest: 4}, { cond=(OR (AND p2 (NOT p0)) (AND p3 (NOT p0))), acceptance={} source=0 dest: 5}, { cond=(AND (NOT p2) p3 p0 (NOT p1)), acceptance={} source=0 dest: 6}], [{ cond=(NOT p4), acceptance={} source=1 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p4)), acceptance={} source=2 dest: 8}, { cond=(AND p0 (NOT p1) (NOT p4)), acceptance={} source=2 dest: 9}], [{ cond=(AND (NOT p2) (NOT p3) (NOT p0) (NOT p4)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p3) p0 (NOT p1) (NOT p4)), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p4)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p2) p3 (NOT p0) (NOT p4)), acceptance={} source=3 dest: 4}, { cond=(OR (AND p2 (NOT p0) (NOT p4)) (AND p3 (NOT p0) (NOT p4))), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p2) p3 p0 (NOT p1) (NOT p4)), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p3) (NOT p4)), acceptance={} source=4 dest: 7}, { cond=(AND p3 (NOT p4)), acceptance={} source=4 dest: 10}], [{ cond=(AND (NOT p2) (NOT p3) (NOT p4)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p2) p3 (NOT p4)), acceptance={} source=5 dest: 4}, { cond=(OR (AND p2 (NOT p4)) (AND p3 (NOT p4))), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p3) (NOT p0) (NOT p1) (NOT p4)), acceptance={} source=6 dest: 8}, { cond=(AND (NOT p3) p0 (NOT p1) (NOT p4)), acceptance={} source=6 dest: 9}, { cond=(AND p3 (NOT p0) (NOT p1) (NOT p4)), acceptance={} source=6 dest: 11}, { cond=(AND p3 p0 (NOT p1) (NOT p4)), acceptance={} source=6 dest: 12}], [{ cond=true, acceptance={0} source=7 dest: 7}], [{ cond=(NOT p1), acceptance={0} source=8 dest: 8}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=9 dest: 8}, { cond=(AND p0 (NOT p1)), acceptance={} source=9 dest: 9}], [{ cond=(NOT p3), acceptance={} source=10 dest: 7}, { cond=p3, acceptance={} source=10 dest: 10}], [{ cond=(AND (NOT p3) (NOT p1)), acceptance={} source=11 dest: 8}, { cond=(AND p3 (NOT p1)), acceptance={} source=11 dest: 11}], [{ cond=(AND (NOT p3) (NOT p0) (NOT p1)), acceptance={} source=12 dest: 8}, { cond=(AND (NOT p3) p0 (NOT p1)), acceptance={} source=12 dest: 9}, { cond=(AND p3 (NOT p0) (NOT p1)), acceptance={} source=12 dest: 11}, { cond=(AND p3 p0 (NOT p1)), acceptance={} source=12 dest: 12}]], initial=0, aps=[p2:(LEQ s252 s913), p3:(LEQ 1 s1046), p0:(LEQ s792 s1157), p1:(GT s288 s419), p4:(GT 1 s657)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1222 ms.
Product exploration explored 100000 steps with 50000 reset in 1221 ms.
Computed a total of 92 stabilizing places and 121 stable transitions
Computed a total of 92 stabilizing places and 121 stable transitions
Knowledge obtained : [(AND p2 (NOT p3) p0 (NOT p1) p4), (X (NOT (AND p0 (NOT p1) (NOT p4)))), (X (NOT (AND (NOT p3) p0 (NOT p1) (NOT p4)))), (X (NOT (AND p3 (NOT p4)))), (X (NOT (AND (NOT p2) (NOT p3) p0 (NOT p1) (NOT p4)))), (X (NOT (AND p0 (NOT p4)))), (X (NOT (OR (AND p2 (NOT p0) (NOT p4)) (AND p3 (NOT p0) (NOT p4))))), (X (NOT (AND p3 p0 (NOT p1) (NOT p4)))), (X (NOT (AND (NOT p2) (NOT p3) (NOT p4)))), (X (NOT (OR (AND p2 (NOT p4)) (AND p3 (NOT p4))))), (X (NOT (AND (NOT p2) p3 (NOT p0) (NOT p4)))), (X (NOT (AND (NOT p2) (NOT p3) (NOT p0) (NOT p4)))), (X (NOT (AND (NOT p3) (NOT p0) (NOT p1) (NOT p4)))), (X (NOT (AND (NOT p2) p3 p0 (NOT p1) (NOT p4)))), (X (NOT (AND (NOT p3) (NOT p4)))), (X p4), (X (NOT (AND (NOT p2) p3 (NOT p4)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p4)))), (X (NOT (AND p3 (NOT p0) (NOT p1) (NOT p4)))), (X (X (NOT (AND p0 (NOT p1) (NOT p4))))), (X (X (NOT (AND (NOT p3) p0 (NOT p1) (NOT p4))))), (X (X (NOT (OR (AND p2 (NOT p4)) (AND p3 (NOT p4)))))), (X (X (NOT (AND (NOT p2) p3 (NOT p0) (NOT p4))))), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p1) (NOT p4))))), (X (X (AND (NOT p3) p0 (NOT p1)))), true, (X (X (NOT (AND (NOT p2) p3 p0 (NOT p1) (NOT p4))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p4))))), (X (X (NOT (AND p3 p0 (NOT p1))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p3 (NOT p0) (NOT p1))))), (X (X (NOT (AND p3 (NOT p4))))), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p3) p0 (NOT p1) (NOT p4))))), (X (X (NOT (AND p0 (NOT p4))))), (X (X (NOT (OR (AND p2 (NOT p0) (NOT p4)) (AND p3 (NOT p0) (NOT p4)))))), (X (X (NOT p3))), (X (X (NOT (AND p3 p0 (NOT p1) (NOT p4))))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p4))))), (X (X (AND p0 (NOT p1)))), (X (X (AND (NOT p3) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p0) (NOT p4))))), (X (X (NOT (AND (NOT p3) (NOT p4))))), (X (X (NOT (AND p3 (NOT p1))))), (X (X p4)), (X (X (NOT (AND (NOT p2) p3 (NOT p4))))), (X (X (NOT (AND p3 (NOT p0) (NOT p1) (NOT p4)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 48 factoid took 26 ms. Reduced automaton from 13 states, 36 edges and 5 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANConstruction-PT-030-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANConstruction-PT-030-LTLCardinality-10 finished in 11927 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(p1)))'
Support contains 4 out of 1284 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1284/1284 places, 2173/2173 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 1263 transition count 2132
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 1263 transition count 2132
Applied a total of 42 rules in 76 ms. Remains 1263 /1284 variables (removed 21) and now considering 2132/2173 (removed 41) transitions.
// Phase 1: matrix 2132 rows 1263 cols
[2024-05-20 14:36:35] [INFO ] Computed 31 invariants in 15 ms
[2024-05-20 14:36:35] [INFO ] Implicit Places using invariants in 518 ms returned []
[2024-05-20 14:36:35] [INFO ] Invariant cache hit.
[2024-05-20 14:36:36] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2024-05-20 14:36:43] [INFO ] Implicit Places using invariants and state equation in 7483 ms returned []
Implicit Place search using SMT with State Equation took 8021 ms to find 0 implicit places.
[2024-05-20 14:36:43] [INFO ] Invariant cache hit.
[2024-05-20 14:36:43] [INFO ] Dead Transitions using invariants and state equation in 761 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1263/1284 places, 2132/2173 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8859 ms. Remains : 1263/1284 places, 2132/2173 transitions.
Stuttering acceptance computed with spot in 111 ms :[(NOT p1), true, (NOT p1), (NOT p1)]
Running random walk in product with property : CANConstruction-PT-030-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}]], initial=0, aps=[p0:(LEQ s388 s815), p1:(LEQ s595 s860)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1189 ms.
Product exploration explored 100000 steps with 50000 reset in 1193 ms.
Computed a total of 91 stabilizing places and 120 stable transitions
Computed a total of 91 stabilizing places and 120 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT (AND p0 (NOT p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 18 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANConstruction-PT-030-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANConstruction-PT-030-LTLCardinality-12 finished in 11395 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U p1))))'
Support contains 4 out of 1284 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1284/1284 places, 2173/2173 transitions.
Drop transitions removed 194 transitions
Trivial Post-agglo rules discarded 194 transitions
Performed 194 trivial Post agglomeration. Transition count delta: 194
Iterating post reduction 0 with 194 rules applied. Total rules applied 194 place count 1284 transition count 1979
Reduce places removed 194 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 195 rules applied. Total rules applied 389 place count 1090 transition count 1978
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 390 place count 1089 transition count 1978
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 30 Pre rules applied. Total rules applied 390 place count 1089 transition count 1948
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 450 place count 1059 transition count 1948
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 469 place count 1040 transition count 1910
Iterating global reduction 3 with 19 rules applied. Total rules applied 488 place count 1040 transition count 1910
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 3 with 13 rules applied. Total rules applied 501 place count 1040 transition count 1897
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 4 with 13 rules applied. Total rules applied 514 place count 1027 transition count 1897
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 5 with 62 rules applied. Total rules applied 576 place count 996 transition count 1866
Applied a total of 576 rules in 166 ms. Remains 996 /1284 variables (removed 288) and now considering 1866/2173 (removed 307) transitions.
// Phase 1: matrix 1866 rows 996 cols
[2024-05-20 14:36:46] [INFO ] Computed 31 invariants in 9 ms
[2024-05-20 14:36:47] [INFO ] Implicit Places using invariants in 466 ms returned []
[2024-05-20 14:36:47] [INFO ] Invariant cache hit.
[2024-05-20 14:36:47] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2024-05-20 14:36:53] [INFO ] Implicit Places using invariants and state equation in 5977 ms returned []
Implicit Place search using SMT with State Equation took 6446 ms to find 0 implicit places.
[2024-05-20 14:36:53] [INFO ] Redundant transitions in 31 ms returned []
[2024-05-20 14:36:53] [INFO ] Invariant cache hit.
[2024-05-20 14:36:53] [INFO ] Dead Transitions using invariants and state equation in 616 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 996/1284 places, 1866/2173 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7271 ms. Remains : 996/1284 places, 1866/2173 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : CANConstruction-PT-030-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (LEQ s20 s291) (LEQ s712 s968)), p0:(LEQ s712 s968)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 477 reset in 573 ms.
Product exploration explored 100000 steps with 477 reset in 585 ms.
Computed a total of 31 stabilizing places and 60 stable transitions
Computed a total of 31 stabilizing places and 60 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (OR p1 p0)), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (OR p1 p0))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 87 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 47 resets, run finished after 224 ms. (steps per millisecond=44 ) properties (out of 3) 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 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 178579 steps, run timeout after 3001 ms. (steps per millisecond=59 ) properties seen :{}
Probabilistic random walk after 178579 steps, saw 44211 distinct states, run finished after 3002 ms. (steps per millisecond=59 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-20 14:36:58] [INFO ] Invariant cache hit.
[2024-05-20 14:36:58] [INFO ] After 118ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2024-05-20 14:36:58] [INFO ] [Nat]Absence check using 31 positive place invariants in 16 ms returned sat
[2024-05-20 14:36:59] [INFO ] After 453ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2024-05-20 14:36:59] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2024-05-20 14:36:59] [INFO ] After 271ms SMT Verify possible using 1770 Read/Feed constraints in natural domain returned unsat :1 sat :2
[2024-05-20 14:36:59] [INFO ] After 461ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 128 ms.
[2024-05-20 14:36:59] [INFO ] After 1226ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 1 different solutions.
Finished Parikh walk after 26 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=26 )
Parikh walk visited 2 properties in 1 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (OR p1 p0)), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (OR p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 8 factoid took 127 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 25 ms :[(NOT p1)]
Support contains 4 out of 996 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 996/996 places, 1866/1866 transitions.
Applied a total of 0 rules in 55 ms. Remains 996 /996 variables (removed 0) and now considering 1866/1866 (removed 0) transitions.
[2024-05-20 14:36:59] [INFO ] Invariant cache hit.
[2024-05-20 14:37:00] [INFO ] Implicit Places using invariants in 459 ms returned []
[2024-05-20 14:37:00] [INFO ] Invariant cache hit.
[2024-05-20 14:37:00] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2024-05-20 14:37:06] [INFO ] Implicit Places using invariants and state equation in 5988 ms returned []
Implicit Place search using SMT with State Equation took 6448 ms to find 0 implicit places.
[2024-05-20 14:37:06] [INFO ] Redundant transitions in 29 ms returned []
[2024-05-20 14:37:06] [INFO ] Invariant cache hit.
[2024-05-20 14:37:07] [INFO ] Dead Transitions using invariants and state equation in 612 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7166 ms. Remains : 996/996 places, 1866/1866 transitions.
Computed a total of 31 stabilizing places and 60 stable transitions
Computed a total of 31 stabilizing places and 60 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 66 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p1)]
Finished random walk after 6038 steps, including 29 resets, run visited all 1 properties in 38 ms. (steps per millisecond=158 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p1)]
Product exploration explored 100000 steps with 478 reset in 549 ms.
Stack based approach found an accepted trace after 13741 steps with 65 reset with depth 186 and stack size 185 in 81 ms.
FORMULA CANConstruction-PT-030-LTLCardinality-13 FALSE TECHNIQUES STACK_TEST
Treatment of property CANConstruction-PT-030-LTLCardinality-13 finished in 21638 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 1284 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1284/1284 places, 2173/2173 transitions.
Drop transitions removed 197 transitions
Trivial Post-agglo rules discarded 197 transitions
Performed 197 trivial Post agglomeration. Transition count delta: 197
Iterating post reduction 0 with 197 rules applied. Total rules applied 197 place count 1284 transition count 1976
Reduce places removed 197 places and 0 transitions.
Iterating post reduction 1 with 197 rules applied. Total rules applied 394 place count 1087 transition count 1976
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 394 place count 1087 transition count 1946
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 454 place count 1057 transition count 1946
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 474 place count 1037 transition count 1906
Iterating global reduction 2 with 20 rules applied. Total rules applied 494 place count 1037 transition count 1906
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 2 with 14 rules applied. Total rules applied 508 place count 1037 transition count 1892
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 522 place count 1023 transition count 1892
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 4 with 60 rules applied. Total rules applied 582 place count 993 transition count 1862
Applied a total of 582 rules in 139 ms. Remains 993 /1284 variables (removed 291) and now considering 1862/2173 (removed 311) transitions.
// Phase 1: matrix 1862 rows 993 cols
[2024-05-20 14:37:08] [INFO ] Computed 31 invariants in 17 ms
[2024-05-20 14:37:08] [INFO ] Implicit Places using invariants in 483 ms returned []
[2024-05-20 14:37:08] [INFO ] Invariant cache hit.
[2024-05-20 14:37:09] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2024-05-20 14:37:14] [INFO ] Implicit Places using invariants and state equation in 6073 ms returned []
Implicit Place search using SMT with State Equation took 6558 ms to find 0 implicit places.
[2024-05-20 14:37:14] [INFO ] Redundant transitions in 34 ms returned []
[2024-05-20 14:37:14] [INFO ] Invariant cache hit.
[2024-05-20 14:37:15] [INFO ] Dead Transitions using invariants and state equation in 634 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 993/1284 places, 1862/2173 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7369 ms. Remains : 993/1284 places, 1862/2173 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : CANConstruction-PT-030-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s475 s668)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 487 reset in 601 ms.
Stack based approach found an accepted trace after 6716 steps with 31 reset with depth 209 and stack size 206 in 41 ms.
FORMULA CANConstruction-PT-030-LTLCardinality-14 FALSE TECHNIQUES STACK_TEST
Treatment of property CANConstruction-PT-030-LTLCardinality-14 finished in 8066 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 1284 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1284/1284 places, 2173/2173 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 1262 transition count 2130
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 1262 transition count 2130
Applied a total of 44 rules in 77 ms. Remains 1262 /1284 variables (removed 22) and now considering 2130/2173 (removed 43) transitions.
// Phase 1: matrix 2130 rows 1262 cols
[2024-05-20 14:37:16] [INFO ] Computed 31 invariants in 21 ms
[2024-05-20 14:37:16] [INFO ] Implicit Places using invariants in 536 ms returned []
[2024-05-20 14:37:16] [INFO ] Invariant cache hit.
[2024-05-20 14:37:17] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2024-05-20 14:37:24] [INFO ] Implicit Places using invariants and state equation in 7591 ms returned []
Implicit Place search using SMT with State Equation took 8128 ms to find 0 implicit places.
[2024-05-20 14:37:24] [INFO ] Invariant cache hit.
[2024-05-20 14:37:25] [INFO ] Dead Transitions using invariants and state equation in 783 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1262/1284 places, 2130/2173 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8988 ms. Remains : 1262/1284 places, 2130/2173 transitions.
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-030-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT s323 s148)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CANConstruction-PT-030-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-030-LTLCardinality-15 finished in 9088 ms.
All properties solved by simple procedures.
Total runtime 133527 ms.

BK_STOP 1716215846182

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CANConstruction-PT-030"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is CANConstruction-PT-030, 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 r087-tall-171620521300017"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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