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.r153-tall-171631151000072.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 Dekker-PT-100, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r153-tall-171631151000072
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.4M
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 22 14:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 11 20:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K Apr 11 20:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Apr 11 20:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 11 20:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:39 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 5.9M 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 Dekker-PT-100-LTLCardinality-00
FORMULA_NAME Dekker-PT-100-LTLCardinality-01
FORMULA_NAME Dekker-PT-100-LTLCardinality-02
FORMULA_NAME Dekker-PT-100-LTLCardinality-03
FORMULA_NAME Dekker-PT-100-LTLCardinality-04
FORMULA_NAME Dekker-PT-100-LTLCardinality-05
FORMULA_NAME Dekker-PT-100-LTLCardinality-06
FORMULA_NAME Dekker-PT-100-LTLCardinality-07
FORMULA_NAME Dekker-PT-100-LTLCardinality-08
FORMULA_NAME Dekker-PT-100-LTLCardinality-09
FORMULA_NAME Dekker-PT-100-LTLCardinality-10
FORMULA_NAME Dekker-PT-100-LTLCardinality-11
FORMULA_NAME Dekker-PT-100-LTLCardinality-12
FORMULA_NAME Dekker-PT-100-LTLCardinality-13
FORMULA_NAME Dekker-PT-100-LTLCardinality-14
FORMULA_NAME Dekker-PT-100-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716414280366

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=Dekker-PT-100
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-22 21:44:44] [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-22 21:44:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 21:44:45] [INFO ] Load time of PNML (sax parser for PT used): 399 ms
[2024-05-22 21:44:45] [INFO ] Transformed 500 places.
[2024-05-22 21:44:45] [INFO ] Transformed 10200 transitions.
[2024-05-22 21:44:45] [INFO ] Found NUPN structural information;
[2024-05-22 21:44:45] [INFO ] Parsed PT model containing 500 places and 10200 transitions and 80200 arcs in 523 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 1 formulas.
FORMULA Dekker-PT-100-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-100-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-100-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 45 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 10200/10200 transitions.
Applied a total of 0 rules in 321 ms. Remains 500 /500 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2024-05-22 21:44:45] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 500 cols
[2024-05-22 21:44:46] [INFO ] Computed 300 invariants in 34 ms
[2024-05-22 21:44:53] [INFO ] Implicit Places using invariants in 7080 ms returned [200, 203, 206, 209, 212, 215, 218, 221, 224, 230, 233, 236, 239, 242, 245, 248, 251, 254, 257, 260, 263, 269, 272, 275, 278, 281, 284, 290, 293, 296, 299, 302, 305, 311, 314, 317, 320, 323, 329, 332, 335, 338, 341, 344, 347, 350, 353, 356, 359, 362, 365, 368, 371, 374, 377, 380, 383, 386, 389, 392, 395, 398, 401, 404, 407, 410, 413, 416, 419, 422, 425, 428, 431, 434, 437, 440, 443, 446, 449, 455, 458, 464, 467, 470, 473, 476, 479, 482, 485, 488, 491]
Discarding 91 places :
Implicit Place search using SMT only with invariants took 7144 ms to find 91 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 409/500 places, 10200/10200 transitions.
Applied a total of 0 rules in 100 ms. Remains 409 /409 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 7568 ms. Remains : 409/500 places, 10200/10200 transitions.
Support contains 45 out of 409 places after structural reductions.
[2024-05-22 21:44:53] [INFO ] Flatten gal took : 596 ms
[2024-05-22 21:44:54] [INFO ] Flatten gal took : 406 ms
[2024-05-22 21:44:55] [INFO ] Input system was already deterministic with 10200 transitions.
Support contains 43 out of 409 places (down from 45) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 428 ms. (steps per millisecond=23 ) properties (out of 27) seen :24
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-22 21:44:55] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 409 cols
[2024-05-22 21:44:55] [INFO ] Computed 209 invariants in 11 ms
[2024-05-22 21:44:55] [INFO ] [Real]Absence check using 200 positive place invariants in 34 ms returned sat
[2024-05-22 21:44:55] [INFO ] [Real]Absence check using 200 positive and 9 generalized place invariants in 2 ms returned sat
[2024-05-22 21:44:56] [INFO ] After 152ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2024-05-22 21:44:56] [INFO ] State equation strengthened by 100 read => feed constraints.
[2024-05-22 21:44:56] [INFO ] After 64ms SMT Verify possible using 100 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 21:44:56] [INFO ] After 469ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 21:44:56] [INFO ] [Nat]Absence check using 200 positive place invariants in 22 ms returned sat
[2024-05-22 21:44:56] [INFO ] [Nat]Absence check using 200 positive and 9 generalized place invariants in 2 ms returned sat
[2024-05-22 21:44:56] [INFO ] After 140ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-22 21:44:56] [INFO ] After 86ms SMT Verify possible using 100 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-22 21:44:56] [INFO ] After 192ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 45 ms.
[2024-05-22 21:44:56] [INFO ] After 514ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 10 ms.
Support contains 4 out of 409 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 409/409 places, 10200/10200 transitions.
Applied a total of 0 rules in 636 ms. Remains 409 /409 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 638 ms. Remains : 409/409 places, 10200/10200 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 333 ms. (steps per millisecond=30 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 255227 steps, run timeout after 3001 ms. (steps per millisecond=85 ) properties seen :{}
Probabilistic random walk after 255227 steps, saw 234486 distinct states, run finished after 3002 ms. (steps per millisecond=85 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-22 21:45:00] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-22 21:45:00] [INFO ] Invariant cache hit.
[2024-05-22 21:45:00] [INFO ] [Real]Absence check using 200 positive place invariants in 24 ms returned sat
[2024-05-22 21:45:00] [INFO ] [Real]Absence check using 200 positive and 9 generalized place invariants in 1 ms returned sat
[2024-05-22 21:45:01] [INFO ] After 140ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2024-05-22 21:45:01] [INFO ] State equation strengthened by 100 read => feed constraints.
[2024-05-22 21:45:01] [INFO ] After 72ms SMT Verify possible using 100 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 21:45:01] [INFO ] After 416ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 21:45:01] [INFO ] [Nat]Absence check using 200 positive place invariants in 23 ms returned sat
[2024-05-22 21:45:01] [INFO ] [Nat]Absence check using 200 positive and 9 generalized place invariants in 42 ms returned sat
[2024-05-22 21:45:01] [INFO ] After 158ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-22 21:45:01] [INFO ] After 80ms SMT Verify possible using 100 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-22 21:45:01] [INFO ] After 156ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 39 ms.
[2024-05-22 21:45:01] [INFO ] After 511ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 9 ms.
Support contains 4 out of 409 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 409/409 places, 10200/10200 transitions.
Applied a total of 0 rules in 479 ms. Remains 409 /409 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 479 ms. Remains : 409/409 places, 10200/10200 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 409/409 places, 10200/10200 transitions.
Applied a total of 0 rules in 365 ms. Remains 409 /409 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2024-05-22 21:45:02] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-22 21:45:02] [INFO ] Invariant cache hit.
[2024-05-22 21:45:04] [INFO ] Implicit Places using invariants in 2086 ms returned [218, 245, 260, 275, 288, 373, 380, 403, 406]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 2103 ms to find 9 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 400/409 places, 10200/10200 transitions.
Applied a total of 0 rules in 342 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2811 ms. Remains : 400/409 places, 10200/10200 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 296 ms. (steps per millisecond=33 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 277851 steps, run timeout after 3001 ms. (steps per millisecond=92 ) properties seen :{}
Probabilistic random walk after 277851 steps, saw 255095 distinct states, run finished after 3002 ms. (steps per millisecond=92 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-22 21:45:08] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 400 cols
[2024-05-22 21:45:08] [INFO ] Computed 200 invariants in 2 ms
[2024-05-22 21:45:08] [INFO ] [Real]Absence check using 200 positive place invariants in 22 ms returned sat
[2024-05-22 21:45:08] [INFO ] After 128ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2024-05-22 21:45:08] [INFO ] State equation strengthened by 100 read => feed constraints.
[2024-05-22 21:45:08] [INFO ] After 101ms SMT Verify possible using 100 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 21:45:08] [INFO ] After 429ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 21:45:08] [INFO ] [Nat]Absence check using 200 positive place invariants in 23 ms returned sat
[2024-05-22 21:45:09] [INFO ] After 127ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-22 21:45:09] [INFO ] After 84ms SMT Verify possible using 100 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-22 21:45:09] [INFO ] Deduced a trap composed of 4 places in 207 ms of which 1 ms to minimize.
[2024-05-22 21:45:09] [INFO ] Deduced a trap composed of 4 places in 210 ms of which 1 ms to minimize.
[2024-05-22 21:45:09] [INFO ] Deduced a trap composed of 4 places in 189 ms of which 1 ms to minimize.
[2024-05-22 21:45:10] [INFO ] Deduced a trap composed of 4 places in 208 ms of which 0 ms to minimize.
[2024-05-22 21:45:10] [INFO ] Deduced a trap composed of 4 places in 209 ms of which 0 ms to minimize.
[2024-05-22 21:45:10] [INFO ] Deduced a trap composed of 4 places in 177 ms of which 1 ms to minimize.
[2024-05-22 21:45:10] [INFO ] Deduced a trap composed of 4 places in 187 ms of which 1 ms to minimize.
[2024-05-22 21:45:10] [INFO ] Deduced a trap composed of 4 places in 179 ms of which 0 ms to minimize.
[2024-05-22 21:45:11] [INFO ] Deduced a trap composed of 4 places in 179 ms of which 0 ms to minimize.
[2024-05-22 21:45:11] [INFO ] Deduced a trap composed of 4 places in 173 ms of which 1 ms to minimize.
[2024-05-22 21:45:11] [INFO ] Deduced a trap composed of 4 places in 147 ms of which 0 ms to minimize.
[2024-05-22 21:45:11] [INFO ] Trap strengthening procedure interrupted after too many repetitions 2266 ms
[2024-05-22 21:45:11] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2266 ms
[2024-05-22 21:45:11] [INFO ] After 2415ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 43 ms.
[2024-05-22 21:45:11] [INFO ] After 2688ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 6 ms.
Support contains 4 out of 400 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 341 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 342 ms. Remains : 400/400 places, 10200/10200 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 337 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2024-05-22 21:45:12] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-22 21:45:12] [INFO ] Invariant cache hit.
[2024-05-22 21:45:13] [INFO ] Implicit Places using invariants in 1424 ms returned []
Implicit Place search using SMT only with invariants took 1425 ms to find 0 implicit places.
[2024-05-22 21:45:13] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-22 21:45:13] [INFO ] Invariant cache hit.
[2024-05-22 21:45:16] [INFO ] Dead Transitions using invariants and state equation in 3270 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5035 ms. Remains : 400/400 places, 10200/10200 transitions.
Graph (complete) has 600 edges and 400 vertex of which 16 are kept as prefixes of interest. Removing 384 places using SCC suffix rule.2 ms
Discarding 384 places :
Also discarding 9792 output transitions
Drop transitions removed 9792 transitions
Ensure Unique test removed 392 transitions
Reduce isomorphic transitions removed 392 transitions.
Iterating post reduction 0 with 392 rules applied. Total rules applied 393 place count 16 transition count 16
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 9 rules applied. Total rules applied 402 place count 10 transition count 13
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 405 place count 10 transition count 10
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 406 place count 10 transition count 9
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 409 place count 8 transition count 8
Applied a total of 409 rules in 23 ms. Remains 8 /400 variables (removed 392) and now considering 8/10200 (removed 10192) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 8 rows 8 cols
[2024-05-22 21:45:16] [INFO ] Computed 4 invariants in 0 ms
[2024-05-22 21:45:16] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-22 21:45:16] [INFO ] After 4ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2024-05-22 21:45:16] [INFO ] After 7ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 3 ms.
[2024-05-22 21:45:16] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2
FORMULA Dekker-PT-100-LTLCardinality-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!X(p0)||!p1) U !(F(!G(p0))||F(p1))))'
Support contains 4 out of 409 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 409/409 places, 10200/10200 transitions.
Applied a total of 0 rules in 94 ms. Remains 409 /409 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2024-05-22 21:45:17] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 409 cols
[2024-05-22 21:45:17] [INFO ] Computed 209 invariants in 15 ms
[2024-05-22 21:45:19] [INFO ] Implicit Places using invariants in 1931 ms returned [218, 245, 260, 275, 373, 380, 403, 406]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 1944 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 401/409 places, 10200/10200 transitions.
Applied a total of 0 rules in 94 ms. Remains 401 /401 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2134 ms. Remains : 401/409 places, 10200/10200 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 220 ms :[(OR (NOT p0) p1), p0, true]
Running random walk in product with property : Dekker-PT-100-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(OR (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s18 0) (EQ s284 1)), p1:(OR (EQ s216 0) (EQ s254 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 3 ms.
FORMULA Dekker-PT-100-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-100-LTLCardinality-00 finished in 2425 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 1 out of 409 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 409/409 places, 10200/10200 transitions.
Applied a total of 0 rules in 746 ms. Remains 409 /409 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2024-05-22 21:45:20] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-22 21:45:20] [INFO ] Invariant cache hit.
[2024-05-22 21:45:22] [INFO ] Implicit Places using invariants in 2055 ms returned [218, 245, 260, 275, 288, 373, 403, 406]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 2064 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 401/409 places, 10200/10200 transitions.
Applied a total of 0 rules in 571 ms. Remains 401 /401 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3383 ms. Remains : 401/409 places, 10200/10200 transitions.
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Dekker-PT-100-LTLCardinality-01 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:(EQ s374 0)], 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 883 reset in 2189 ms.
Stack based approach found an accepted trace after 97 steps with 0 reset with depth 98 and stack size 98 in 3 ms.
FORMULA Dekker-PT-100-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-100-LTLCardinality-01 finished in 5685 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((X(p1)&&p0)))'
Support contains 2 out of 409 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 409/409 places, 10200/10200 transitions.
Applied a total of 0 rules in 103 ms. Remains 409 /409 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2024-05-22 21:45:25] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-22 21:45:25] [INFO ] Invariant cache hit.
[2024-05-22 21:45:27] [INFO ] Implicit Places using invariants in 1995 ms returned [218, 245, 260, 288, 373, 380, 403, 406]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 2004 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 401/409 places, 10200/10200 transitions.
Applied a total of 0 rules in 89 ms. Remains 401 /401 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2200 ms. Remains : 401/409 places, 10200/10200 transitions.
Stuttering acceptance computed with spot in 91 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Dekker-PT-100-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (NEQ s272 0) (NEQ s400 1)), p1:(AND (NEQ s272 0) (NEQ s400 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 30876 reset in 2063 ms.
Stack based approach found an accepted trace after 926 steps with 399 reset with depth 11 and stack size 11 in 24 ms.
FORMULA Dekker-PT-100-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-100-LTLCardinality-02 finished in 4410 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 409 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 409/409 places, 10200/10200 transitions.
Applied a total of 0 rules in 427 ms. Remains 409 /409 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2024-05-22 21:45:30] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-22 21:45:30] [INFO ] Invariant cache hit.
[2024-05-22 21:45:32] [INFO ] Implicit Places using invariants in 2017 ms returned [218, 245, 260, 275, 288, 373, 380, 403, 406]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 2030 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 400/409 places, 10200/10200 transitions.
Applied a total of 0 rules in 439 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2898 ms. Remains : 400/409 places, 10200/10200 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : Dekker-PT-100-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s360 0) (EQ s333 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 2173 ms.
Stack based approach found an accepted trace after 27 steps with 0 reset with depth 28 and stack size 28 in 2 ms.
FORMULA Dekker-PT-100-LTLCardinality-03 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-100-LTLCardinality-03 finished in 5158 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 p1)&&X(p2)))'
Support contains 5 out of 409 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 409/409 places, 10200/10200 transitions.
Applied a total of 0 rules in 84 ms. Remains 409 /409 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2024-05-22 21:45:35] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-22 21:45:35] [INFO ] Invariant cache hit.
[2024-05-22 21:45:37] [INFO ] Implicit Places using invariants in 2025 ms returned [218, 245, 260, 275, 288, 373, 380, 403, 406]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 2033 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 400/409 places, 10200/10200 transitions.
Applied a total of 0 rules in 89 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2206 ms. Remains : 400/409 places, 10200/10200 transitions.
Stuttering acceptance computed with spot in 488 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2)]
Running random walk in product with property : Dekker-PT-100-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(OR p1 p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 1}]], initial=0, aps=[p1:(OR (EQ s326 0) (EQ s50 1)), p0:(EQ s8 1), p2:(AND (NEQ s229 0) (NEQ s125 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Dekker-PT-100-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-100-LTLCardinality-04 finished in 2728 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 409 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 409/409 places, 10200/10200 transitions.
Applied a total of 0 rules in 85 ms. Remains 409 /409 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2024-05-22 21:45:37] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-22 21:45:37] [INFO ] Invariant cache hit.
[2024-05-22 21:45:39] [INFO ] Implicit Places using invariants in 1963 ms returned [218, 245, 260, 275, 288, 380, 403, 406]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 1972 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 401/409 places, 10200/10200 transitions.
Applied a total of 0 rules in 92 ms. Remains 401 /401 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2150 ms. Remains : 401/409 places, 10200/10200 transitions.
Stuttering acceptance computed with spot in 93 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Dekker-PT-100-LTLCardinality-05 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:(OR (EQ s230 0) (EQ s368 1))], 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 411 steps with 0 reset in 10 ms.
FORMULA Dekker-PT-100-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-100-LTLCardinality-05 finished in 2278 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(G(p0))&&F(p1))))'
Support contains 3 out of 409 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 409/409 places, 10200/10200 transitions.
Applied a total of 0 rules in 89 ms. Remains 409 /409 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2024-05-22 21:45:40] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-22 21:45:40] [INFO ] Invariant cache hit.
[2024-05-22 21:45:42] [INFO ] Implicit Places using invariants in 2007 ms returned [218, 245, 260, 275, 288, 373, 380, 403, 406]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 2014 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 400/409 places, 10200/10200 transitions.
Applied a total of 0 rules in 88 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2192 ms. Remains : 400/409 places, 10200/10200 transitions.
Stuttering acceptance computed with spot in 603 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : Dekker-PT-100-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s128 0) (EQ s326 1) (EQ s157 1)), p0:(AND (EQ s128 0) (EQ s326 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 2140 ms.
Stack based approach found an accepted trace after 97 steps with 0 reset with depth 98 and stack size 98 in 2 ms.
FORMULA Dekker-PT-100-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-100-LTLCardinality-09 finished in 4972 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((F(p0)&&X(p1))))'
Support contains 4 out of 409 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 409/409 places, 10200/10200 transitions.
Applied a total of 0 rules in 86 ms. Remains 409 /409 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2024-05-22 21:45:45] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-22 21:45:45] [INFO ] Invariant cache hit.
[2024-05-22 21:45:47] [INFO ] Implicit Places using invariants in 2003 ms returned [218, 245, 260, 275, 288, 373, 380, 403]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 2011 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 401/409 places, 10200/10200 transitions.
Applied a total of 0 rules in 90 ms. Remains 401 /401 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2187 ms. Remains : 401/409 places, 10200/10200 transitions.
Stuttering acceptance computed with spot in 435 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Dekker-PT-100-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s80 0) (EQ s372 1)), p1:(OR (EQ s306 0) (EQ s398 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 3903 reset in 2068 ms.
Stack based approach found an accepted trace after 42 steps with 7 reset with depth 23 and stack size 23 in 1 ms.
FORMULA Dekker-PT-100-LTLCardinality-11 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-100-LTLCardinality-11 finished in 4723 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((p0&&F((p1||X(((p1 U !p2) U (p1&&(p1 U !p2)))))))))'
Support contains 3 out of 409 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 409/409 places, 10200/10200 transitions.
Applied a total of 0 rules in 444 ms. Remains 409 /409 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2024-05-22 21:45:50] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-22 21:45:50] [INFO ] Invariant cache hit.
[2024-05-22 21:45:52] [INFO ] Implicit Places using invariants in 2031 ms returned [218, 245, 275, 288, 373, 380, 403, 406]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 2039 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 401/409 places, 10200/10200 transitions.
Applied a total of 0 rules in 454 ms. Remains 401 /401 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2938 ms. Remains : 401/409 places, 10200/10200 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Dekker-PT-100-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p1:(EQ s9 1), p0:(OR (EQ s113 0) (EQ s258 1))], 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, null][true, true]]
Product exploration explored 100000 steps with 968 reset in 2095 ms.
Stack based approach found an accepted trace after 39 steps with 0 reset with depth 40 and stack size 40 in 2 ms.
FORMULA Dekker-PT-100-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-100-LTLCardinality-12 finished in 5140 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((p0&&X((p1&&F(p2))))))'
Support contains 5 out of 409 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 409/409 places, 10200/10200 transitions.
Applied a total of 0 rules in 90 ms. Remains 409 /409 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2024-05-22 21:45:54] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-22 21:45:54] [INFO ] Invariant cache hit.
[2024-05-22 21:45:57] [INFO ] Implicit Places using invariants in 2086 ms returned [260, 275, 288, 373, 380, 403, 406]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 2104 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 402/409 places, 10200/10200 transitions.
Applied a total of 0 rules in 91 ms. Remains 402 /402 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2286 ms. Remains : 402/409 places, 10200/10200 transitions.
Stuttering acceptance computed with spot in 682 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p1) (NOT p0)), true]
Running random walk in product with property : Dekker-PT-100-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p2:(EQ s218 1), p1:(OR (EQ s245 0) (EQ s190 1)), p0:(OR (EQ s126 0) (EQ s234 1))], 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, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Dekker-PT-100-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-100-LTLCardinality-13 finished in 2997 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((G((F(p1)&&p0))||X(X(F(p2)))))))'
Support contains 5 out of 409 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 409/409 places, 10200/10200 transitions.
Applied a total of 0 rules in 87 ms. Remains 409 /409 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2024-05-22 21:45:57] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-22 21:45:57] [INFO ] Invariant cache hit.
[2024-05-22 21:46:00] [INFO ] Implicit Places using invariants in 2098 ms returned [218, 245, 260, 275, 288, 373, 380, 406]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 2106 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 401/409 places, 10200/10200 transitions.
Applied a total of 0 rules in 91 ms. Remains 401 /401 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2284 ms. Remains : 401/409 places, 10200/10200 transitions.
Stuttering acceptance computed with spot in 213 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : Dekker-PT-100-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 0}]], initial=4, aps=[p0:(AND (EQ s136 0) (EQ s65 1)), p1:(EQ s396 0), p2:(OR (EQ s296 0) (EQ s342 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 18407 reset in 2066 ms.
Stack based approach found an accepted trace after 644 steps with 118 reset with depth 52 and stack size 52 in 14 ms.
FORMULA Dekker-PT-100-LTLCardinality-14 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-100-LTLCardinality-14 finished in 4615 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 U (G(p2)||F(G(p1)))))))'
Support contains 5 out of 409 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 409/409 places, 10200/10200 transitions.
Applied a total of 0 rules in 94 ms. Remains 409 /409 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2024-05-22 21:46:02] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-22 21:46:02] [INFO ] Invariant cache hit.
[2024-05-22 21:46:04] [INFO ] Implicit Places using invariants in 2047 ms returned [218, 245, 260, 275, 288, 373, 380, 403, 406]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 2056 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 400/409 places, 10200/10200 transitions.
Applied a total of 0 rules in 90 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2241 ms. Remains : 400/409 places, 10200/10200 transitions.
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Dekker-PT-100-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND p0 p2 p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p2 (NOT p1)), acceptance={1} source=1 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0, 1} source=1 dest: 1}], [{ cond=p1, acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0, 1} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=p2, acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(OR (EQ s199 0) (EQ s80 1)), p2:(OR (EQ s373 0) (EQ s399 1)), p0:(EQ s114 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 2150 ms.
Product exploration explored 100000 steps with 0 reset in 2254 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p0 p2 (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND p0 p2 p1)), (X (NOT (AND p0 p2 p1))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT p2))), (X (X p2)), (X (X (NOT p0))), (X (X p0)), (X (X (AND p0 p2 p1))), (X (X (NOT (AND p0 p2 p1)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 9 factoid took 634 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 344 ms. (steps per millisecond=29 ) properties (out of 9) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-05-22 21:46:10] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 400 cols
[2024-05-22 21:46:10] [INFO ] Computed 200 invariants in 3 ms
[2024-05-22 21:46:10] [INFO ] [Real]Absence check using 200 positive place invariants in 24 ms returned sat
[2024-05-22 21:46:11] [INFO ] After 342ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-22 21:46:11] [INFO ] [Nat]Absence check using 200 positive place invariants in 25 ms returned sat
[2024-05-22 21:46:11] [INFO ] After 182ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-22 21:46:11] [INFO ] State equation strengthened by 100 read => feed constraints.
[2024-05-22 21:46:11] [INFO ] After 132ms SMT Verify possible using 100 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-22 21:46:11] [INFO ] Deduced a trap composed of 4 places in 210 ms of which 0 ms to minimize.
[2024-05-22 21:46:12] [INFO ] Deduced a trap composed of 4 places in 220 ms of which 0 ms to minimize.
[2024-05-22 21:46:12] [INFO ] Deduced a trap composed of 4 places in 201 ms of which 0 ms to minimize.
[2024-05-22 21:46:12] [INFO ] Deduced a trap composed of 4 places in 199 ms of which 0 ms to minimize.
[2024-05-22 21:46:12] [INFO ] Deduced a trap composed of 4 places in 203 ms of which 1 ms to minimize.
[2024-05-22 21:46:12] [INFO ] Deduced a trap composed of 4 places in 204 ms of which 1 ms to minimize.
[2024-05-22 21:46:13] [INFO ] Deduced a trap composed of 4 places in 190 ms of which 0 ms to minimize.
[2024-05-22 21:46:13] [INFO ] Deduced a trap composed of 4 places in 186 ms of which 0 ms to minimize.
[2024-05-22 21:46:13] [INFO ] Deduced a trap composed of 4 places in 185 ms of which 0 ms to minimize.
[2024-05-22 21:46:13] [INFO ] Deduced a trap composed of 4 places in 181 ms of which 0 ms to minimize.
[2024-05-22 21:46:13] [INFO ] Deduced a trap composed of 4 places in 182 ms of which 0 ms to minimize.
[2024-05-22 21:46:13] [INFO ] Trap strengthening procedure interrupted after too many repetitions 2349 ms
[2024-05-22 21:46:13] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2350 ms
[2024-05-22 21:46:14] [INFO ] After 2620ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 83 ms.
[2024-05-22 21:46:14] [INFO ] After 3067ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 8 ms.
Support contains 5 out of 400 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 344 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 344 ms. Remains : 400/400 places, 10200/10200 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 313 ms. (steps per millisecond=31 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 4) 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 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-22 21:46:14] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-22 21:46:14] [INFO ] Invariant cache hit.
[2024-05-22 21:46:14] [INFO ] [Real]Absence check using 200 positive place invariants in 24 ms returned sat
[2024-05-22 21:46:15] [INFO ] After 272ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 21:46:15] [INFO ] [Nat]Absence check using 200 positive place invariants in 25 ms returned sat
[2024-05-22 21:46:15] [INFO ] After 138ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-22 21:46:15] [INFO ] State equation strengthened by 100 read => feed constraints.
[2024-05-22 21:46:15] [INFO ] After 94ms SMT Verify possible using 100 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-22 21:46:15] [INFO ] Deduced a trap composed of 4 places in 245 ms of which 1 ms to minimize.
[2024-05-22 21:46:16] [INFO ] Deduced a trap composed of 4 places in 250 ms of which 0 ms to minimize.
[2024-05-22 21:46:16] [INFO ] Deduced a trap composed of 4 places in 232 ms of which 1 ms to minimize.
[2024-05-22 21:46:16] [INFO ] Deduced a trap composed of 4 places in 226 ms of which 1 ms to minimize.
[2024-05-22 21:46:16] [INFO ] Deduced a trap composed of 4 places in 220 ms of which 0 ms to minimize.
[2024-05-22 21:46:17] [INFO ] Deduced a trap composed of 4 places in 218 ms of which 0 ms to minimize.
[2024-05-22 21:46:17] [INFO ] Deduced a trap composed of 4 places in 228 ms of which 2 ms to minimize.
[2024-05-22 21:46:17] [INFO ] Deduced a trap composed of 4 places in 210 ms of which 0 ms to minimize.
[2024-05-22 21:46:17] [INFO ] Deduced a trap composed of 4 places in 209 ms of which 0 ms to minimize.
[2024-05-22 21:46:17] [INFO ] Deduced a trap composed of 4 places in 208 ms of which 0 ms to minimize.
[2024-05-22 21:46:18] [INFO ] Deduced a trap composed of 4 places in 201 ms of which 1 ms to minimize.
[2024-05-22 21:46:18] [INFO ] Trap strengthening procedure interrupted after too many repetitions 2648 ms
[2024-05-22 21:46:18] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2648 ms
[2024-05-22 21:46:18] [INFO ] Deduced a trap composed of 4 places in 191 ms of which 0 ms to minimize.
[2024-05-22 21:46:18] [INFO ] Deduced a trap composed of 4 places in 193 ms of which 1 ms to minimize.
[2024-05-22 21:46:18] [INFO ] Deduced a trap composed of 4 places in 189 ms of which 0 ms to minimize.
[2024-05-22 21:46:19] [INFO ] Deduced a trap composed of 4 places in 186 ms of which 0 ms to minimize.
[2024-05-22 21:46:19] [INFO ] Deduced a trap composed of 4 places in 180 ms of which 0 ms to minimize.
[2024-05-22 21:46:19] [INFO ] Deduced a trap composed of 4 places in 182 ms of which 0 ms to minimize.
[2024-05-22 21:46:19] [INFO ] Deduced a trap composed of 4 places in 172 ms of which 0 ms to minimize.
[2024-05-22 21:46:19] [INFO ] Deduced a trap composed of 4 places in 167 ms of which 0 ms to minimize.
[2024-05-22 21:46:19] [INFO ] Deduced a trap composed of 4 places in 160 ms of which 1 ms to minimize.
[2024-05-22 21:46:20] [INFO ] Deduced a trap composed of 4 places in 157 ms of which 0 ms to minimize.
[2024-05-22 21:46:20] [INFO ] Deduced a trap composed of 4 places in 164 ms of which 0 ms to minimize.
[2024-05-22 21:46:20] [INFO ] Trap strengthening procedure interrupted after too many repetitions 2176 ms
[2024-05-22 21:46:20] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2177 ms
[2024-05-22 21:46:20] [INFO ] After 4964ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 45 ms.
[2024-05-22 21:46:20] [INFO ] After 5312ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 5 out of 400 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 325 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 325 ms. Remains : 400/400 places, 10200/10200 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 277 ms. (steps per millisecond=36 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 273912 steps, run timeout after 3001 ms. (steps per millisecond=91 ) properties seen :{}
Probabilistic random walk after 273912 steps, saw 251438 distinct states, run finished after 3001 ms. (steps per millisecond=91 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-22 21:46:24] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-22 21:46:24] [INFO ] Invariant cache hit.
[2024-05-22 21:46:24] [INFO ] [Real]Absence check using 200 positive place invariants in 23 ms returned sat
[2024-05-22 21:46:24] [INFO ] After 288ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 21:46:24] [INFO ] [Nat]Absence check using 200 positive place invariants in 23 ms returned sat
[2024-05-22 21:46:24] [INFO ] After 137ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-22 21:46:24] [INFO ] State equation strengthened by 100 read => feed constraints.
[2024-05-22 21:46:24] [INFO ] After 93ms SMT Verify possible using 100 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-22 21:46:25] [INFO ] Deduced a trap composed of 4 places in 250 ms of which 2 ms to minimize.
[2024-05-22 21:46:25] [INFO ] Deduced a trap composed of 4 places in 251 ms of which 0 ms to minimize.
[2024-05-22 21:46:25] [INFO ] Deduced a trap composed of 4 places in 225 ms of which 0 ms to minimize.
[2024-05-22 21:46:25] [INFO ] Deduced a trap composed of 4 places in 222 ms of which 0 ms to minimize.
[2024-05-22 21:46:26] [INFO ] Deduced a trap composed of 4 places in 218 ms of which 0 ms to minimize.
[2024-05-22 21:46:26] [INFO ] Deduced a trap composed of 4 places in 225 ms of which 3 ms to minimize.
[2024-05-22 21:46:26] [INFO ] Deduced a trap composed of 4 places in 225 ms of which 0 ms to minimize.
[2024-05-22 21:46:26] [INFO ] Deduced a trap composed of 4 places in 211 ms of which 1 ms to minimize.
[2024-05-22 21:46:26] [INFO ] Deduced a trap composed of 4 places in 218 ms of which 1 ms to minimize.
[2024-05-22 21:46:27] [INFO ] Deduced a trap composed of 4 places in 217 ms of which 1 ms to minimize.
[2024-05-22 21:46:27] [INFO ] Deduced a trap composed of 4 places in 203 ms of which 0 ms to minimize.
[2024-05-22 21:46:27] [INFO ] Trap strengthening procedure interrupted after too many repetitions 2653 ms
[2024-05-22 21:46:27] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2654 ms
[2024-05-22 21:46:27] [INFO ] Deduced a trap composed of 4 places in 202 ms of which 1 ms to minimize.
[2024-05-22 21:46:27] [INFO ] Deduced a trap composed of 4 places in 192 ms of which 0 ms to minimize.
[2024-05-22 21:46:28] [INFO ] Deduced a trap composed of 4 places in 188 ms of which 1 ms to minimize.
[2024-05-22 21:46:28] [INFO ] Deduced a trap composed of 4 places in 189 ms of which 1 ms to minimize.
[2024-05-22 21:46:28] [INFO ] Deduced a trap composed of 4 places in 179 ms of which 2 ms to minimize.
[2024-05-22 21:46:28] [INFO ] Deduced a trap composed of 4 places in 176 ms of which 1 ms to minimize.
[2024-05-22 21:46:28] [INFO ] Deduced a trap composed of 4 places in 187 ms of which 3 ms to minimize.
[2024-05-22 21:46:29] [INFO ] Deduced a trap composed of 4 places in 166 ms of which 0 ms to minimize.
[2024-05-22 21:46:29] [INFO ] Deduced a trap composed of 4 places in 178 ms of which 1 ms to minimize.
[2024-05-22 21:46:29] [INFO ] Deduced a trap composed of 4 places in 162 ms of which 0 ms to minimize.
[2024-05-22 21:46:29] [INFO ] Deduced a trap composed of 4 places in 155 ms of which 0 ms to minimize.
[2024-05-22 21:46:29] [INFO ] Trap strengthening procedure interrupted after too many repetitions 2164 ms
[2024-05-22 21:46:29] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2164 ms
[2024-05-22 21:46:29] [INFO ] After 4958ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 41 ms.
[2024-05-22 21:46:29] [INFO ] After 5300ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 5 out of 400 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 338 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 339 ms. Remains : 400/400 places, 10200/10200 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 329 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2024-05-22 21:46:30] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-22 21:46:30] [INFO ] Invariant cache hit.
[2024-05-22 21:46:31] [INFO ] Implicit Places using invariants in 1441 ms returned []
Implicit Place search using SMT only with invariants took 1443 ms to find 0 implicit places.
[2024-05-22 21:46:31] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-22 21:46:31] [INFO ] Invariant cache hit.
[2024-05-22 21:46:34] [INFO ] Dead Transitions using invariants and state equation in 2926 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4701 ms. Remains : 400/400 places, 10200/10200 transitions.
Graph (complete) has 600 edges and 400 vertex of which 16 are kept as prefixes of interest. Removing 384 places using SCC suffix rule.1 ms
Discarding 384 places :
Also discarding 9792 output transitions
Drop transitions removed 9792 transitions
Ensure Unique test removed 392 transitions
Reduce isomorphic transitions removed 392 transitions.
Iterating post reduction 0 with 392 rules applied. Total rules applied 393 place count 16 transition count 16
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 396 place count 14 transition count 15
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 397 place count 14 transition count 14
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 399 place count 14 transition count 12
Ensure Unique test removed 2 places
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 405 place count 10 transition count 10
Applied a total of 405 rules in 10 ms. Remains 10 /400 variables (removed 390) and now considering 10/10200 (removed 10190) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 10 rows 10 cols
[2024-05-22 21:46:34] [INFO ] Computed 5 invariants in 0 ms
[2024-05-22 21:46:34] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-22 21:46:34] [INFO ] After 5ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2024-05-22 21:46:34] [INFO ] After 9ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 3 ms.
[2024-05-22 21:46:34] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p0 p2 (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND p0 p2 p1)), (X (NOT (AND p0 p2 p1))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT p2))), (X (X p2)), (X (X (NOT p0))), (X (X p0)), (X (X (AND p0 p2 p1))), (X (X (NOT (AND p0 p2 p1)))), (X (X p1)), (X (X (NOT p1))), (F (NOT (AND p2 p1 p0))), (F (NOT p0)), (F (AND p2 (NOT p1) p0)), (F (AND (NOT p2) p1 p0)), (F (NOT p1)), (F (AND p2 (NOT p1))), (F (NOT p2))]
Knowledge based reduction with 9 factoid took 863 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Support contains 5 out of 400 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 90 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2024-05-22 21:46:36] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 400 cols
[2024-05-22 21:46:36] [INFO ] Computed 200 invariants in 8 ms
[2024-05-22 21:46:37] [INFO ] Implicit Places using invariants in 1441 ms returned []
Implicit Place search using SMT only with invariants took 1442 ms to find 0 implicit places.
[2024-05-22 21:46:37] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-22 21:46:37] [INFO ] Invariant cache hit.
[2024-05-22 21:46:40] [INFO ] Dead Transitions using invariants and state equation in 2913 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4447 ms. Remains : 400/400 places, 10200/10200 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p2 (NOT p1) p0))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X p1), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0))))]
False Knowledge obtained : [(X (AND p2 p1 p0)), (X (NOT (AND p2 p1 p0))), (X (NOT p0)), (X p0), (X (X (AND p2 (NOT p1) p0))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND p2 p1 p0))), (X (X (NOT (AND p2 p1 p0)))), (X (X (AND (NOT p2) p1 p0))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT p2))), (X (X p2)), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 9 factoid took 557 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 408 ms. (steps per millisecond=24 ) properties (out of 9) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-05-22 21:46:41] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-22 21:46:41] [INFO ] Invariant cache hit.
[2024-05-22 21:46:41] [INFO ] [Real]Absence check using 200 positive place invariants in 24 ms returned sat
[2024-05-22 21:46:42] [INFO ] After 325ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-22 21:46:42] [INFO ] [Nat]Absence check using 200 positive place invariants in 23 ms returned sat
[2024-05-22 21:46:42] [INFO ] After 182ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-22 21:46:42] [INFO ] State equation strengthened by 100 read => feed constraints.
[2024-05-22 21:46:42] [INFO ] After 137ms SMT Verify possible using 100 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-22 21:46:42] [INFO ] Deduced a trap composed of 4 places in 245 ms of which 0 ms to minimize.
[2024-05-22 21:46:43] [INFO ] Deduced a trap composed of 4 places in 247 ms of which 1 ms to minimize.
[2024-05-22 21:46:43] [INFO ] Deduced a trap composed of 4 places in 237 ms of which 1 ms to minimize.
[2024-05-22 21:46:43] [INFO ] Deduced a trap composed of 4 places in 229 ms of which 1 ms to minimize.
[2024-05-22 21:46:43] [INFO ] Deduced a trap composed of 4 places in 226 ms of which 1 ms to minimize.
[2024-05-22 21:46:44] [INFO ] Deduced a trap composed of 4 places in 221 ms of which 0 ms to minimize.
[2024-05-22 21:46:44] [INFO ] Deduced a trap composed of 4 places in 221 ms of which 0 ms to minimize.
[2024-05-22 21:46:44] [INFO ] Deduced a trap composed of 4 places in 221 ms of which 0 ms to minimize.
[2024-05-22 21:46:44] [INFO ] Deduced a trap composed of 4 places in 224 ms of which 1 ms to minimize.
[2024-05-22 21:46:45] [INFO ] Deduced a trap composed of 4 places in 210 ms of which 0 ms to minimize.
[2024-05-22 21:46:45] [INFO ] Deduced a trap composed of 4 places in 208 ms of which 0 ms to minimize.
[2024-05-22 21:46:45] [INFO ] Trap strengthening procedure interrupted after too many repetitions 2692 ms
[2024-05-22 21:46:45] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2692 ms
[2024-05-22 21:46:45] [INFO ] After 2971ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 84 ms.
[2024-05-22 21:46:45] [INFO ] After 3434ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 5 ms.
Support contains 5 out of 400 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 338 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 338 ms. Remains : 400/400 places, 10200/10200 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 426 ms. (steps per millisecond=23 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 4) 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 4) seen :0
Interrupted probabilistic random walk after 198465 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :{}
Probabilistic random walk after 198465 steps, saw 182769 distinct states, run finished after 3001 ms. (steps per millisecond=66 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-22 21:46:49] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-22 21:46:49] [INFO ] Invariant cache hit.
[2024-05-22 21:46:49] [INFO ] [Real]Absence check using 200 positive place invariants in 23 ms returned sat
[2024-05-22 21:46:49] [INFO ] After 327ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-22 21:46:49] [INFO ] [Nat]Absence check using 200 positive place invariants in 22 ms returned sat
[2024-05-22 21:46:50] [INFO ] After 178ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-22 21:46:50] [INFO ] State equation strengthened by 100 read => feed constraints.
[2024-05-22 21:46:50] [INFO ] After 133ms SMT Verify possible using 100 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-22 21:46:50] [INFO ] Deduced a trap composed of 4 places in 240 ms of which 0 ms to minimize.
[2024-05-22 21:46:50] [INFO ] Deduced a trap composed of 4 places in 234 ms of which 0 ms to minimize.
[2024-05-22 21:46:51] [INFO ] Deduced a trap composed of 4 places in 246 ms of which 1 ms to minimize.
[2024-05-22 21:46:51] [INFO ] Deduced a trap composed of 4 places in 227 ms of which 1 ms to minimize.
[2024-05-22 21:46:51] [INFO ] Deduced a trap composed of 4 places in 220 ms of which 1 ms to minimize.
[2024-05-22 21:46:51] [INFO ] Deduced a trap composed of 4 places in 213 ms of which 0 ms to minimize.
[2024-05-22 21:46:52] [INFO ] Deduced a trap composed of 4 places in 219 ms of which 0 ms to minimize.
[2024-05-22 21:46:52] [INFO ] Deduced a trap composed of 4 places in 208 ms of which 0 ms to minimize.
[2024-05-22 21:46:52] [INFO ] Deduced a trap composed of 4 places in 208 ms of which 0 ms to minimize.
[2024-05-22 21:46:52] [INFO ] Deduced a trap composed of 4 places in 200 ms of which 0 ms to minimize.
[2024-05-22 21:46:52] [INFO ] Deduced a trap composed of 4 places in 198 ms of which 0 ms to minimize.
[2024-05-22 21:46:52] [INFO ] Trap strengthening procedure interrupted after too many repetitions 2633 ms
[2024-05-22 21:46:52] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2633 ms
[2024-05-22 21:46:52] [INFO ] After 2915ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 86 ms.
[2024-05-22 21:46:53] [INFO ] After 3370ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 5 ms.
Support contains 5 out of 400 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 346 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 347 ms. Remains : 400/400 places, 10200/10200 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 338 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2024-05-22 21:46:53] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-22 21:46:53] [INFO ] Invariant cache hit.
[2024-05-22 21:46:55] [INFO ] Implicit Places using invariants in 1454 ms returned []
Implicit Place search using SMT only with invariants took 1455 ms to find 0 implicit places.
[2024-05-22 21:46:55] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-22 21:46:55] [INFO ] Invariant cache hit.
[2024-05-22 21:46:58] [INFO ] Dead Transitions using invariants and state equation in 2953 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4748 ms. Remains : 400/400 places, 10200/10200 transitions.
Graph (complete) has 600 edges and 400 vertex of which 16 are kept as prefixes of interest. Removing 384 places using SCC suffix rule.1 ms
Discarding 384 places :
Also discarding 9792 output transitions
Drop transitions removed 9792 transitions
Ensure Unique test removed 392 transitions
Reduce isomorphic transitions removed 392 transitions.
Iterating post reduction 0 with 392 rules applied. Total rules applied 393 place count 16 transition count 16
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 396 place count 14 transition count 15
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 397 place count 14 transition count 14
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 399 place count 14 transition count 12
Ensure Unique test removed 2 places
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 405 place count 10 transition count 10
Applied a total of 405 rules in 11 ms. Remains 10 /400 variables (removed 390) and now considering 10/10200 (removed 10190) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 10 rows 10 cols
[2024-05-22 21:46:58] [INFO ] Computed 5 invariants in 1 ms
[2024-05-22 21:46:58] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-22 21:46:58] [INFO ] After 9ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2024-05-22 21:46:58] [INFO ] After 11ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-22 21:46:58] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-22 21:46:58] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-22 21:46:58] [INFO ] After 11ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-22 21:46:58] [INFO ] After 20ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 6 ms.
[2024-05-22 21:46:58] [INFO ] After 47ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p2 (NOT p1) p0))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X p1), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0))))]
False Knowledge obtained : [(X (AND p2 p1 p0)), (X (NOT (AND p2 p1 p0))), (X (NOT p0)), (X p0), (X (X (AND p2 (NOT p1) p0))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND p2 p1 p0))), (X (X (NOT (AND p2 p1 p0)))), (X (X (AND (NOT p2) p1 p0))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT p2))), (X (X p2)), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1))), (F (NOT (AND p2 p1 p0))), (F (NOT p0)), (F (AND p2 (NOT p1) p0)), (F (NOT p1)), (F (AND p2 (NOT p1)))]
Knowledge based reduction with 9 factoid took 691 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 0 reset in 2140 ms.
Product exploration explored 100000 steps with 0 reset in 2251 ms.
Applying partial POR strategy [true, false, true, true]
Stuttering acceptance computed with spot in 167 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Support contains 5 out of 400 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 570 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2024-05-22 21:47:04] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 400 cols
[2024-05-22 21:47:04] [INFO ] Computed 200 invariants in 5 ms
[2024-05-22 21:47:07] [INFO ] Dead Transitions using invariants and state equation in 2883 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3454 ms. Remains : 400/400 places, 10200/10200 transitions.
Built C files in :
/tmp/ltsmin1340965185894066138
[2024-05-22 21:47:07] [INFO ] Built C files in 129ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1340965185894066138
Running compilation step : cd /tmp/ltsmin1340965185894066138;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1340965185894066138;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1340965185894066138;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 5 out of 400 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 101 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2024-05-22 21:47:10] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-22 21:47:10] [INFO ] Invariant cache hit.
[2024-05-22 21:47:12] [INFO ] Implicit Places using invariants in 1387 ms returned []
Implicit Place search using SMT only with invariants took 1391 ms to find 0 implicit places.
[2024-05-22 21:47:12] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-22 21:47:12] [INFO ] Invariant cache hit.
[2024-05-22 21:47:15] [INFO ] Dead Transitions using invariants and state equation in 2906 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4399 ms. Remains : 400/400 places, 10200/10200 transitions.
Built C files in :
/tmp/ltsmin3273252414237112373
[2024-05-22 21:47:15] [INFO ] Built C files in 98ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3273252414237112373
Running compilation step : cd /tmp/ltsmin3273252414237112373;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3273252414237112373;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3273252414237112373;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-22 21:47:19] [INFO ] Flatten gal took : 374 ms
[2024-05-22 21:47:19] [INFO ] Flatten gal took : 314 ms
[2024-05-22 21:47:19] [INFO ] Time to serialize gal into /tmp/LTL11371850715683091143.gal : 95 ms
[2024-05-22 21:47:19] [INFO ] Time to serialize properties into /tmp/LTL4766430668510606028.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11371850715683091143.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15316305087890958951.hoa' '-atoms' '/tmp/LTL4766430668510606028.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL4766430668510606028.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15316305087890958951.hoa
Detected timeout of ITS tools.
[2024-05-22 21:47:35] [INFO ] Flatten gal took : 339 ms
[2024-05-22 21:47:35] [INFO ] Flatten gal took : 336 ms
[2024-05-22 21:47:35] [INFO ] Time to serialize gal into /tmp/LTL2282964856116070304.gal : 42 ms
[2024-05-22 21:47:35] [INFO ] Time to serialize properties into /tmp/LTL2769443452804875741.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2282964856116070304.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2769443452804875741.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((("(flag_0_57==1)")U(X(("((flag_1_99==0)||(flag_0_40==1))")U((G("((p3_86==0)||(p3_99==1))"))||(F(G("((flag_1_99==0)||(flag_0_40==1))...164
Formula 0 simplified : !"(flag_0_57==1)" R X(!"((flag_1_99==0)||(flag_0_40==1))" R (F!"((p3_86==0)||(p3_99==1))" & GF!"((flag_1_99==0)||(flag_0_40==1))"))
Detected timeout of ITS tools.
[2024-05-22 21:47:50] [INFO ] Flatten gal took : 314 ms
[2024-05-22 21:47:50] [INFO ] Applying decomposition
[2024-05-22 21:47:51] [INFO ] Flatten gal took : 316 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph14481048058791280753.txt' '-o' '/tmp/graph14481048058791280753.bin' '-w' '/tmp/graph14481048058791280753.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph14481048058791280753.bin' '-l' '-1' '-v' '-w' '/tmp/graph14481048058791280753.weights' '-q' '0' '-e' '0.001'
[2024-05-22 21:47:51] [INFO ] Decomposing Gal with order
[2024-05-22 21:47:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 21:47:52] [INFO ] Removed a total of 29400 redundant transitions.
[2024-05-22 21:47:52] [INFO ] Flatten gal took : 700 ms
[2024-05-22 21:47:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 197 ms.
[2024-05-22 21:47:53] [INFO ] Time to serialize gal into /tmp/LTL2577761054138068614.gal : 49 ms
[2024-05-22 21:47:53] [INFO ] Time to serialize properties into /tmp/LTL2963193464078158087.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2577761054138068614.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2963193464078158087.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((("(u57.flag_0_57==1)")U(X(("((u99.flag_1_99==0)||(u40.flag_0_40==1))")U((G("((u86.p3_86==0)||(u99.p3_99==1))"))||(F(G("((u99.flag_1...192
Formula 0 simplified : !"(u57.flag_0_57==1)" R X(!"((u99.flag_1_99==0)||(u40.flag_0_40==1))" R (F!"((u86.p3_86==0)||(u99.p3_99==1))" & GF!"((u99.flag_1_99=...182
Reverse transition relation is NOT exact ! Due to transitions u0.t101, u1.t203, u2.t305, u3.t407, u4.t509, u5.t611, u6.t713, u7.t815, u8.t917, u9.t1019, u1...1250
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7844982307112369302
[2024-05-22 21:48:08] [INFO ] Built C files in 85ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7844982307112369302
Running compilation step : cd /tmp/ltsmin7844982307112369302;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7844982307112369302;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7844982307112369302;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property Dekker-PT-100-LTLCardinality-15 finished in 129010 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 U (G(p2)||F(G(p1)))))))'
Found a Lengthening insensitive property : Dekker-PT-100-LTLCardinality-15
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Support contains 5 out of 409 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 409/409 places, 10200/10200 transitions.
Applied a total of 0 rules in 251 ms. Remains 409 /409 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2024-05-22 21:48:12] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 409 cols
[2024-05-22 21:48:12] [INFO ] Computed 209 invariants in 3 ms
[2024-05-22 21:48:14] [INFO ] Implicit Places using invariants in 2107 ms returned [218, 245, 260, 275, 288, 373, 380, 403, 406]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 2115 ms to find 9 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 400/409 places, 10200/10200 transitions.
Applied a total of 0 rules in 183 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 2550 ms. Remains : 400/409 places, 10200/10200 transitions.
Running random walk in product with property : Dekker-PT-100-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND p0 p2 p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p2 (NOT p1)), acceptance={1} source=1 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0, 1} source=1 dest: 1}], [{ cond=p1, acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0, 1} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=p2, acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(OR (EQ s199 0) (EQ s80 1)), p2:(OR (EQ s373 0) (EQ s399 1)), p0:(EQ s114 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 2157 ms.
Product exploration explored 100000 steps with 0 reset in 2266 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p0 p2 (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND p0 p2 p1)), (X (NOT (AND p0 p2 p1))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT p2))), (X (X p2)), (X (X (NOT p0))), (X (X p0)), (X (X (AND p0 p2 p1))), (X (X (NOT (AND p0 p2 p1)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 9 factoid took 752 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 320 ms. (steps per millisecond=31 ) properties (out of 9) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-05-22 21:48:20] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 400 cols
[2024-05-22 21:48:20] [INFO ] Computed 200 invariants in 5 ms
[2024-05-22 21:48:20] [INFO ] [Real]Absence check using 200 positive place invariants in 24 ms returned sat
[2024-05-22 21:48:20] [INFO ] After 360ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-22 21:48:20] [INFO ] [Nat]Absence check using 200 positive place invariants in 23 ms returned sat
[2024-05-22 21:48:20] [INFO ] After 179ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-22 21:48:20] [INFO ] State equation strengthened by 100 read => feed constraints.
[2024-05-22 21:48:21] [INFO ] After 134ms SMT Verify possible using 100 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-22 21:48:21] [INFO ] Deduced a trap composed of 4 places in 233 ms of which 0 ms to minimize.
[2024-05-22 21:48:21] [INFO ] Deduced a trap composed of 4 places in 230 ms of which 0 ms to minimize.
[2024-05-22 21:48:21] [INFO ] Deduced a trap composed of 4 places in 206 ms of which 0 ms to minimize.
[2024-05-22 21:48:22] [INFO ] Deduced a trap composed of 4 places in 205 ms of which 1 ms to minimize.
[2024-05-22 21:48:22] [INFO ] Deduced a trap composed of 4 places in 205 ms of which 1 ms to minimize.
[2024-05-22 21:48:22] [INFO ] Deduced a trap composed of 4 places in 238 ms of which 1 ms to minimize.
[2024-05-22 21:48:22] [INFO ] Deduced a trap composed of 4 places in 210 ms of which 0 ms to minimize.
[2024-05-22 21:48:23] [INFO ] Deduced a trap composed of 4 places in 187 ms of which 1 ms to minimize.
[2024-05-22 21:48:23] [INFO ] Deduced a trap composed of 4 places in 181 ms of which 0 ms to minimize.
[2024-05-22 21:48:23] [INFO ] Deduced a trap composed of 4 places in 176 ms of which 0 ms to minimize.
[2024-05-22 21:48:23] [INFO ] Deduced a trap composed of 4 places in 170 ms of which 0 ms to minimize.
[2024-05-22 21:48:23] [INFO ] Trap strengthening procedure interrupted after too many repetitions 2456 ms
[2024-05-22 21:48:23] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2456 ms
[2024-05-22 21:48:23] [INFO ] After 2733ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 85 ms.
[2024-05-22 21:48:23] [INFO ] After 3178ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 5 out of 400 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 321 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 321 ms. Remains : 400/400 places, 10200/10200 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 329 ms. (steps per millisecond=30 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 175639 steps, run timeout after 3002 ms. (steps per millisecond=58 ) properties seen :{}
Probabilistic random walk after 175639 steps, saw 161981 distinct states, run finished after 3002 ms. (steps per millisecond=58 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-22 21:48:27] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-22 21:48:27] [INFO ] Invariant cache hit.
[2024-05-22 21:48:27] [INFO ] [Real]Absence check using 200 positive place invariants in 22 ms returned sat
[2024-05-22 21:48:27] [INFO ] After 326ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-22 21:48:27] [INFO ] [Nat]Absence check using 200 positive place invariants in 25 ms returned sat
[2024-05-22 21:48:28] [INFO ] After 198ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-22 21:48:28] [INFO ] State equation strengthened by 100 read => feed constraints.
[2024-05-22 21:48:28] [INFO ] After 139ms SMT Verify possible using 100 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-22 21:48:28] [INFO ] Deduced a trap composed of 4 places in 243 ms of which 0 ms to minimize.
[2024-05-22 21:48:28] [INFO ] Deduced a trap composed of 4 places in 232 ms of which 0 ms to minimize.
[2024-05-22 21:48:29] [INFO ] Deduced a trap composed of 4 places in 257 ms of which 0 ms to minimize.
[2024-05-22 21:48:29] [INFO ] Deduced a trap composed of 4 places in 252 ms of which 0 ms to minimize.
[2024-05-22 21:48:29] [INFO ] Deduced a trap composed of 4 places in 252 ms of which 0 ms to minimize.
[2024-05-22 21:48:30] [INFO ] Deduced a trap composed of 4 places in 251 ms of which 0 ms to minimize.
[2024-05-22 21:48:30] [INFO ] Deduced a trap composed of 4 places in 208 ms of which 0 ms to minimize.
[2024-05-22 21:48:30] [INFO ] Deduced a trap composed of 4 places in 208 ms of which 1 ms to minimize.
[2024-05-22 21:48:30] [INFO ] Deduced a trap composed of 4 places in 199 ms of which 0 ms to minimize.
[2024-05-22 21:48:30] [INFO ] Deduced a trap composed of 4 places in 202 ms of which 1 ms to minimize.
[2024-05-22 21:48:31] [INFO ] Deduced a trap composed of 4 places in 196 ms of which 0 ms to minimize.
[2024-05-22 21:48:31] [INFO ] Trap strengthening procedure interrupted after too many repetitions 2713 ms
[2024-05-22 21:48:31] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2713 ms
[2024-05-22 21:48:31] [INFO ] After 3000ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 90 ms.
[2024-05-22 21:48:31] [INFO ] After 3503ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 6 ms.
Support contains 5 out of 400 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 346 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 346 ms. Remains : 400/400 places, 10200/10200 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 315 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2024-05-22 21:48:31] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-22 21:48:32] [INFO ] Invariant cache hit.
[2024-05-22 21:48:33] [INFO ] Implicit Places using invariants in 1420 ms returned []
Implicit Place search using SMT only with invariants took 1421 ms to find 0 implicit places.
[2024-05-22 21:48:33] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-22 21:48:33] [INFO ] Invariant cache hit.
[2024-05-22 21:48:36] [INFO ] Dead Transitions using invariants and state equation in 2839 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4579 ms. Remains : 400/400 places, 10200/10200 transitions.
Graph (complete) has 600 edges and 400 vertex of which 16 are kept as prefixes of interest. Removing 384 places using SCC suffix rule.1 ms
Discarding 384 places :
Also discarding 9792 output transitions
Drop transitions removed 9792 transitions
Ensure Unique test removed 392 transitions
Reduce isomorphic transitions removed 392 transitions.
Iterating post reduction 0 with 392 rules applied. Total rules applied 393 place count 16 transition count 16
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 396 place count 14 transition count 15
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 397 place count 14 transition count 14
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 399 place count 14 transition count 12
Ensure Unique test removed 2 places
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 405 place count 10 transition count 10
Applied a total of 405 rules in 9 ms. Remains 10 /400 variables (removed 390) and now considering 10/10200 (removed 10190) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 10 rows 10 cols
[2024-05-22 21:48:36] [INFO ] Computed 5 invariants in 0 ms
[2024-05-22 21:48:36] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-22 21:48:36] [INFO ] After 8ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2024-05-22 21:48:36] [INFO ] After 10ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-22 21:48:36] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-22 21:48:36] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-22 21:48:36] [INFO ] After 7ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-22 21:48:36] [INFO ] After 13ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 5 ms.
[2024-05-22 21:48:36] [INFO ] After 38ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p0 p2 (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND p0 p2 p1)), (X (NOT (AND p0 p2 p1))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT p2))), (X (X p2)), (X (X (NOT p0))), (X (X p0)), (X (X (AND p0 p2 p1))), (X (X (NOT (AND p0 p2 p1)))), (X (X p1)), (X (X (NOT p1))), (F (NOT (AND p2 p1 p0))), (F (NOT p0)), (F (AND p2 (NOT p1) p0)), (F (NOT p1)), (F (AND p2 (NOT p1)))]
Knowledge based reduction with 9 factoid took 808 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 174 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Support contains 5 out of 400 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 79 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2024-05-22 21:48:37] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 400 cols
[2024-05-22 21:48:37] [INFO ] Computed 200 invariants in 2 ms
[2024-05-22 21:48:39] [INFO ] Implicit Places using invariants in 1472 ms returned []
Implicit Place search using SMT only with invariants took 1473 ms to find 0 implicit places.
[2024-05-22 21:48:39] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-22 21:48:39] [INFO ] Invariant cache hit.
[2024-05-22 21:48:41] [INFO ] Dead Transitions using invariants and state equation in 2872 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4426 ms. Remains : 400/400 places, 10200/10200 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p2 (NOT p1) p0))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X p1), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0))))]
False Knowledge obtained : [(X (AND p2 p1 p0)), (X (NOT (AND p2 p1 p0))), (X (NOT p0)), (X p0), (X (X (AND p2 (NOT p1) p0))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND p2 p1 p0))), (X (X (NOT (AND p2 p1 p0)))), (X (X (AND (NOT p2) p1 p0))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT p2))), (X (X p2)), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 9 factoid took 676 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 170 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 448 ms. (steps per millisecond=22 ) properties (out of 9) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-05-22 21:48:43] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-22 21:48:43] [INFO ] Invariant cache hit.
[2024-05-22 21:48:43] [INFO ] [Real]Absence check using 200 positive place invariants in 25 ms returned sat
[2024-05-22 21:48:43] [INFO ] After 365ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-22 21:48:43] [INFO ] [Nat]Absence check using 200 positive place invariants in 25 ms returned sat
[2024-05-22 21:48:44] [INFO ] After 190ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-22 21:48:44] [INFO ] State equation strengthened by 100 read => feed constraints.
[2024-05-22 21:48:44] [INFO ] After 146ms SMT Verify possible using 100 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-22 21:48:44] [INFO ] Deduced a trap composed of 4 places in 276 ms of which 0 ms to minimize.
[2024-05-22 21:48:45] [INFO ] Deduced a trap composed of 4 places in 264 ms of which 0 ms to minimize.
[2024-05-22 21:48:45] [INFO ] Deduced a trap composed of 4 places in 267 ms of which 0 ms to minimize.
[2024-05-22 21:48:45] [INFO ] Deduced a trap composed of 4 places in 261 ms of which 1 ms to minimize.
[2024-05-22 21:48:45] [INFO ] Deduced a trap composed of 4 places in 247 ms of which 0 ms to minimize.
[2024-05-22 21:48:46] [INFO ] Deduced a trap composed of 4 places in 247 ms of which 0 ms to minimize.
[2024-05-22 21:48:46] [INFO ] Deduced a trap composed of 4 places in 244 ms of which 0 ms to minimize.
[2024-05-22 21:48:46] [INFO ] Deduced a trap composed of 4 places in 238 ms of which 0 ms to minimize.
[2024-05-22 21:48:46] [INFO ] Deduced a trap composed of 4 places in 241 ms of which 0 ms to minimize.
[2024-05-22 21:48:47] [INFO ] Deduced a trap composed of 4 places in 234 ms of which 1 ms to minimize.
[2024-05-22 21:48:47] [INFO ] Deduced a trap composed of 4 places in 249 ms of which 0 ms to minimize.
[2024-05-22 21:48:47] [INFO ] Trap strengthening procedure interrupted after too many repetitions 3002 ms
[2024-05-22 21:48:47] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 3002 ms
[2024-05-22 21:48:47] [INFO ] After 3310ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 85 ms.
[2024-05-22 21:48:47] [INFO ] After 3784ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 5 out of 400 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 353 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 353 ms. Remains : 400/400 places, 10200/10200 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 399 ms. (steps per millisecond=25 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 169882 steps, run timeout after 3001 ms. (steps per millisecond=56 ) properties seen :{}
Probabilistic random walk after 169882 steps, saw 156776 distinct states, run finished after 3001 ms. (steps per millisecond=56 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-22 21:48:51] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-22 21:48:51] [INFO ] Invariant cache hit.
[2024-05-22 21:48:51] [INFO ] [Real]Absence check using 200 positive place invariants in 23 ms returned sat
[2024-05-22 21:48:51] [INFO ] After 319ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-22 21:48:51] [INFO ] [Nat]Absence check using 200 positive place invariants in 23 ms returned sat
[2024-05-22 21:48:52] [INFO ] After 173ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-22 21:48:52] [INFO ] State equation strengthened by 100 read => feed constraints.
[2024-05-22 21:48:52] [INFO ] After 148ms SMT Verify possible using 100 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-22 21:48:52] [INFO ] Deduced a trap composed of 4 places in 241 ms of which 1 ms to minimize.
[2024-05-22 21:48:52] [INFO ] Deduced a trap composed of 4 places in 268 ms of which 1 ms to minimize.
[2024-05-22 21:48:53] [INFO ] Deduced a trap composed of 4 places in 261 ms of which 0 ms to minimize.
[2024-05-22 21:48:53] [INFO ] Deduced a trap composed of 4 places in 265 ms of which 1 ms to minimize.
[2024-05-22 21:48:53] [INFO ] Deduced a trap composed of 4 places in 252 ms of which 0 ms to minimize.
[2024-05-22 21:48:54] [INFO ] Deduced a trap composed of 4 places in 227 ms of which 2 ms to minimize.
[2024-05-22 21:48:54] [INFO ] Deduced a trap composed of 4 places in 243 ms of which 0 ms to minimize.
[2024-05-22 21:48:54] [INFO ] Deduced a trap composed of 4 places in 216 ms of which 1 ms to minimize.
[2024-05-22 21:48:54] [INFO ] Deduced a trap composed of 4 places in 234 ms of which 1 ms to minimize.
[2024-05-22 21:48:55] [INFO ] Deduced a trap composed of 4 places in 231 ms of which 0 ms to minimize.
[2024-05-22 21:48:55] [INFO ] Deduced a trap composed of 4 places in 223 ms of which 0 ms to minimize.
[2024-05-22 21:48:55] [INFO ] Trap strengthening procedure interrupted after too many repetitions 2866 ms
[2024-05-22 21:48:55] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2866 ms
[2024-05-22 21:48:55] [INFO ] After 3153ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 82 ms.
[2024-05-22 21:48:55] [INFO ] After 3596ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 5 out of 400 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 321 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 321 ms. Remains : 400/400 places, 10200/10200 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 318 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2024-05-22 21:48:56] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-22 21:48:56] [INFO ] Invariant cache hit.
[2024-05-22 21:48:57] [INFO ] Implicit Places using invariants in 1521 ms returned []
Implicit Place search using SMT only with invariants took 1521 ms to find 0 implicit places.
[2024-05-22 21:48:57] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-22 21:48:57] [INFO ] Invariant cache hit.
[2024-05-22 21:49:00] [INFO ] Dead Transitions using invariants and state equation in 2837 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4678 ms. Remains : 400/400 places, 10200/10200 transitions.
Graph (complete) has 600 edges and 400 vertex of which 16 are kept as prefixes of interest. Removing 384 places using SCC suffix rule.1 ms
Discarding 384 places :
Also discarding 9792 output transitions
Drop transitions removed 9792 transitions
Ensure Unique test removed 392 transitions
Reduce isomorphic transitions removed 392 transitions.
Iterating post reduction 0 with 392 rules applied. Total rules applied 393 place count 16 transition count 16
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 396 place count 14 transition count 15
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 397 place count 14 transition count 14
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 399 place count 14 transition count 12
Ensure Unique test removed 2 places
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 405 place count 10 transition count 10
Applied a total of 405 rules in 8 ms. Remains 10 /400 variables (removed 390) and now considering 10/10200 (removed 10190) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 10 rows 10 cols
[2024-05-22 21:49:00] [INFO ] Computed 5 invariants in 0 ms
[2024-05-22 21:49:00] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-22 21:49:00] [INFO ] After 8ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2024-05-22 21:49:00] [INFO ] After 10ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-22 21:49:00] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-22 21:49:00] [INFO ] [Nat]Absence check using 5 positive place invariants in 0 ms returned sat
[2024-05-22 21:49:00] [INFO ] After 7ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-22 21:49:00] [INFO ] After 13ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 5 ms.
[2024-05-22 21:49:00] [INFO ] After 44ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p2 (NOT p1) p0))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X p1), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0))))]
False Knowledge obtained : [(X (AND p2 p1 p0)), (X (NOT (AND p2 p1 p0))), (X (NOT p0)), (X p0), (X (X (AND p2 (NOT p1) p0))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND p2 p1 p0))), (X (X (NOT (AND p2 p1 p0)))), (X (X (AND (NOT p2) p1 p0))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT p2))), (X (X p2)), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1))), (F (NOT (AND p2 p1 p0))), (F (NOT p0)), (F (AND p2 (NOT p1) p0)), (F (NOT p1)), (F (AND p2 (NOT p1)))]
Knowledge based reduction with 9 factoid took 794 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 162 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 0 reset in 2117 ms.
Product exploration explored 100000 steps with 0 reset in 2231 ms.
Applying partial POR strategy [true, false, true, true]
Stuttering acceptance computed with spot in 186 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Support contains 5 out of 400 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 412 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2024-05-22 21:49:06] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 400 cols
[2024-05-22 21:49:06] [INFO ] Computed 200 invariants in 3 ms
[2024-05-22 21:49:10] [INFO ] Dead Transitions using invariants and state equation in 3176 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3592 ms. Remains : 400/400 places, 10200/10200 transitions.
Built C files in :
/tmp/ltsmin12246403485382571134
[2024-05-22 21:49:10] [INFO ] Built C files in 80ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12246403485382571134
Running compilation step : cd /tmp/ltsmin12246403485382571134;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12246403485382571134;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12246403485382571134;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 5 out of 400 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 86 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2024-05-22 21:49:13] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-22 21:49:13] [INFO ] Invariant cache hit.
[2024-05-22 21:49:14] [INFO ] Implicit Places using invariants in 1475 ms returned []
Implicit Place search using SMT only with invariants took 1478 ms to find 0 implicit places.
[2024-05-22 21:49:14] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-22 21:49:14] [INFO ] Invariant cache hit.
[2024-05-22 21:49:17] [INFO ] Dead Transitions using invariants and state equation in 2951 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4515 ms. Remains : 400/400 places, 10200/10200 transitions.
Built C files in :
/tmp/ltsmin1969667390551604740
[2024-05-22 21:49:17] [INFO ] Built C files in 85ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1969667390551604740
Running compilation step : cd /tmp/ltsmin1969667390551604740;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1969667390551604740;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1969667390551604740;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-22 21:49:21] [INFO ] Flatten gal took : 318 ms
[2024-05-22 21:49:21] [INFO ] Flatten gal took : 327 ms
[2024-05-22 21:49:21] [INFO ] Time to serialize gal into /tmp/LTL12128619025623892698.gal : 41 ms
[2024-05-22 21:49:21] [INFO ] Time to serialize properties into /tmp/LTL16902381284304543132.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12128619025623892698.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11879565252178421191.hoa' '-atoms' '/tmp/LTL16902381284304543132.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL16902381284304543132.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11879565252178421191.hoa
Detected timeout of ITS tools.
[2024-05-22 21:49:37] [INFO ] Flatten gal took : 318 ms
[2024-05-22 21:49:37] [INFO ] Flatten gal took : 331 ms
[2024-05-22 21:49:37] [INFO ] Time to serialize gal into /tmp/LTL14397167721823355584.gal : 43 ms
[2024-05-22 21:49:37] [INFO ] Time to serialize properties into /tmp/LTL5807979750190593245.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14397167721823355584.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5807979750190593245.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((("(flag_0_57==1)")U(X(("((flag_1_99==0)||(flag_0_40==1))")U((G("((p3_86==0)||(p3_99==1))"))||(F(G("((flag_1_99==0)||(flag_0_40==1))...164
Formula 0 simplified : !"(flag_0_57==1)" R X(!"((flag_1_99==0)||(flag_0_40==1))" R (F!"((p3_86==0)||(p3_99==1))" & GF!"((flag_1_99==0)||(flag_0_40==1))"))
Detected timeout of ITS tools.
[2024-05-22 21:49:52] [INFO ] Flatten gal took : 309 ms
[2024-05-22 21:49:52] [INFO ] Applying decomposition
[2024-05-22 21:49:53] [INFO ] Flatten gal took : 315 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph15651780670091532319.txt' '-o' '/tmp/graph15651780670091532319.bin' '-w' '/tmp/graph15651780670091532319.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph15651780670091532319.bin' '-l' '-1' '-v' '-w' '/tmp/graph15651780670091532319.weights' '-q' '0' '-e' '0.001'
[2024-05-22 21:49:53] [INFO ] Decomposing Gal with order
[2024-05-22 21:49:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 21:49:54] [INFO ] Removed a total of 29400 redundant transitions.
[2024-05-22 21:49:54] [INFO ] Flatten gal took : 456 ms
[2024-05-22 21:49:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 112 ms.
[2024-05-22 21:49:54] [INFO ] Time to serialize gal into /tmp/LTL13771479716015204057.gal : 23 ms
[2024-05-22 21:49:54] [INFO ] Time to serialize properties into /tmp/LTL10303294094461576117.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13771479716015204057.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10303294094461576117.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((("(u57.flag_0_57==1)")U(X(("((u99.flag_1_99==0)||(u40.flag_0_40==1))")U((G("((u86.p3_86==0)||(u99.p3_99==1))"))||(F(G("((u99.flag_1...192
Formula 0 simplified : !"(u57.flag_0_57==1)" R X(!"((u99.flag_1_99==0)||(u40.flag_0_40==1))" R (F!"((u86.p3_86==0)||(u99.p3_99==1))" & GF!"((u99.flag_1_99=...182
Reverse transition relation is NOT exact ! Due to transitions u0.t101, u1.t203, u2.t305, u3.t407, u4.t509, u5.t611, u6.t713, u7.t815, u8.t917, u9.t1019, u1...1250
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15393212536543490251
[2024-05-22 21:50:09] [INFO ] Built C files in 83ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15393212536543490251
Running compilation step : cd /tmp/ltsmin15393212536543490251;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15393212536543490251;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15393212536543490251;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property Dekker-PT-100-LTLCardinality-15 finished in 121368 ms.
[2024-05-22 21:50:13] [INFO ] Flatten gal took : 328 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin7607922865486847984
[2024-05-22 21:50:13] [INFO ] Too many transitions (10200) to apply POR reductions. Disabling POR matrices.
[2024-05-22 21:50:13] [INFO ] Built C files in 76ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7607922865486847984
Running compilation step : cd /tmp/ltsmin7607922865486847984;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-22 21:50:13] [INFO ] Applying decomposition
[2024-05-22 21:50:13] [INFO ] Flatten gal took : 376 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph10706213030383116173.txt' '-o' '/tmp/graph10706213030383116173.bin' '-w' '/tmp/graph10706213030383116173.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph10706213030383116173.bin' '-l' '-1' '-v' '-w' '/tmp/graph10706213030383116173.weights' '-q' '0' '-e' '0.001'
[2024-05-22 21:50:14] [INFO ] Decomposing Gal with order
[2024-05-22 21:50:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 21:50:15] [INFO ] Removed a total of 29796 redundant transitions.
[2024-05-22 21:50:15] [INFO ] Flatten gal took : 510 ms
[2024-05-22 21:50:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 240 ms.
[2024-05-22 21:50:15] [INFO ] Time to serialize gal into /tmp/LTLCardinality10391081567729023997.gal : 30 ms
[2024-05-22 21:50:15] [INFO ] Time to serialize properties into /tmp/LTLCardinality10797607210759855019.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality10391081567729023997.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality10797607210759855019.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 1 LTL properties
Checking formula 0 : !((("(u56.flag_0_57==1)")U(X(("((i95.u98.flag_1_99==0)||(u39.flag_0_40==1))")U((G("((u85.p3_86==0)||(i95.u97.p3_99==1))"))||(F(G("((i9...204
Formula 0 simplified : !"(u56.flag_0_57==1)" R X(!"((i95.u98.flag_1_99==0)||(u39.flag_0_40==1))" R (F!"((u85.p3_86==0)||(i95.u97.p3_99==1))" & GF!"((i95.u9...194
Reverse transition relation is NOT exact ! Due to transitions u0.t101, u1.t203, u2.t305, u3.t407, u4.t509, u5.t611, u6.t713, u7.t815, u8.t917, u10.t1121, u...1252
5 unique states visited
5 strongly connected components in search stack
6 transitions explored
5 items max in DFS search stack
1885 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,20.1898,566820,1,0,1.46002e+06,5194,72273,933169,318,5289,1919458
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Dekker-PT-100-LTLCardinality-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 353849 ms.

BK_STOP 1716414640058

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
++ perl -pe 's/.*\.//g'
+ 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="Dekker-PT-100"
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 Dekker-PT-100, 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 r153-tall-171631151000072"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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