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.r285-smll-171654421800052.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 Parking-PT-432, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r285-smll-171654421800052
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 600K
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.3K Apr 11 17:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 71K Apr 11 17:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Apr 11 17:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Apr 11 17:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 192K May 18 16:43 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 Parking-PT-432-LTLCardinality-00
FORMULA_NAME Parking-PT-432-LTLCardinality-01
FORMULA_NAME Parking-PT-432-LTLCardinality-02
FORMULA_NAME Parking-PT-432-LTLCardinality-03
FORMULA_NAME Parking-PT-432-LTLCardinality-04
FORMULA_NAME Parking-PT-432-LTLCardinality-05
FORMULA_NAME Parking-PT-432-LTLCardinality-06
FORMULA_NAME Parking-PT-432-LTLCardinality-07
FORMULA_NAME Parking-PT-432-LTLCardinality-08
FORMULA_NAME Parking-PT-432-LTLCardinality-09
FORMULA_NAME Parking-PT-432-LTLCardinality-10
FORMULA_NAME Parking-PT-432-LTLCardinality-11
FORMULA_NAME Parking-PT-432-LTLCardinality-12
FORMULA_NAME Parking-PT-432-LTLCardinality-13
FORMULA_NAME Parking-PT-432-LTLCardinality-14
FORMULA_NAME Parking-PT-432-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716842043446

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=Parking-PT-432
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-27 20:34:05] [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-27 20:34:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 20:34:06] [INFO ] Load time of PNML (sax parser for PT used): 152 ms
[2024-05-27 20:34:06] [INFO ] Transformed 529 places.
[2024-05-27 20:34:06] [INFO ] Transformed 785 transitions.
[2024-05-27 20:34:06] [INFO ] Found NUPN structural information;
[2024-05-27 20:34:06] [INFO ] Parsed PT model containing 529 places and 785 transitions and 2329 arcs in 274 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 328 transitions
Reduce redundant transitions removed 328 transitions.
FORMULA Parking-PT-432-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-432-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-432-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-432-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-432-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-432-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 529 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 529/529 places, 457/457 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 527 transition count 455
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 527 transition count 455
Applied a total of 4 rules in 122 ms. Remains 527 /529 variables (removed 2) and now considering 455/457 (removed 2) transitions.
// Phase 1: matrix 455 rows 527 cols
[2024-05-27 20:34:06] [INFO ] Computed 124 invariants in 34 ms
[2024-05-27 20:34:07] [INFO ] Implicit Places using invariants in 932 ms returned [64, 72, 80, 96, 104, 120, 144, 146, 189, 197, 205, 213, 221, 229, 245, 269, 271, 315, 323, 331, 339, 347, 355, 363, 371, 395, 397, 440, 448, 456, 464, 472, 480, 496, 520, 522]
Discarding 36 places :
Implicit Place search using SMT only with invariants took 977 ms to find 36 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 491/529 places, 455/457 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 464 transition count 428
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 464 transition count 428
Applied a total of 54 rules in 50 ms. Remains 464 /491 variables (removed 27) and now considering 428/455 (removed 27) transitions.
// Phase 1: matrix 428 rows 464 cols
[2024-05-27 20:34:07] [INFO ] Computed 88 invariants in 5 ms
[2024-05-27 20:34:07] [INFO ] Implicit Places using invariants in 321 ms returned []
[2024-05-27 20:34:07] [INFO ] Invariant cache hit.
[2024-05-27 20:34:08] [INFO ] State equation strengthened by 108 read => feed constraints.
[2024-05-27 20:34:08] [INFO ] Implicit Places using invariants and state equation in 803 ms returned []
Implicit Place search using SMT with State Equation took 1127 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 464/529 places, 428/457 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2277 ms. Remains : 464/529 places, 428/457 transitions.
Support contains 24 out of 464 places after structural reductions.
[2024-05-27 20:34:09] [INFO ] Flatten gal took : 100 ms
[2024-05-27 20:34:09] [INFO ] Flatten gal took : 43 ms
[2024-05-27 20:34:09] [INFO ] Input system was already deterministic with 428 transitions.
Incomplete random walk after 10000 steps, including 91 resets, run finished after 612 ms. (steps per millisecond=16 ) properties (out of 15) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) 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 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-27 20:34:09] [INFO ] Invariant cache hit.
[2024-05-27 20:34:10] [INFO ] [Real]Absence check using 88 positive place invariants in 37 ms returned sat
[2024-05-27 20:34:10] [INFO ] After 222ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-27 20:34:10] [INFO ] [Nat]Absence check using 88 positive place invariants in 30 ms returned sat
[2024-05-27 20:34:10] [INFO ] After 324ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-27 20:34:10] [INFO ] State equation strengthened by 108 read => feed constraints.
[2024-05-27 20:34:10] [INFO ] After 127ms SMT Verify possible using 108 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-27 20:34:11] [INFO ] After 296ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 143 ms.
[2024-05-27 20:34:11] [INFO ] After 970ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 42 ms.
Support contains 6 out of 464 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 464/464 places, 428/428 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 464 transition count 412
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 448 transition count 412
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 32 place count 448 transition count 396
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 64 place count 432 transition count 396
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 67 place count 429 transition count 393
Iterating global reduction 2 with 3 rules applied. Total rules applied 70 place count 429 transition count 393
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 120 place count 404 transition count 368
Free-agglomeration rule applied 104 times.
Iterating global reduction 2 with 104 rules applied. Total rules applied 224 place count 404 transition count 264
Reduce places removed 104 places and 0 transitions.
Iterating post reduction 2 with 104 rules applied. Total rules applied 328 place count 300 transition count 264
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 331 place count 300 transition count 261
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 334 place count 297 transition count 261
Applied a total of 334 rules in 121 ms. Remains 297 /464 variables (removed 167) and now considering 261/428 (removed 167) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 122 ms. Remains : 297/464 places, 261/428 transitions.
Finished random walk after 593 steps, including 0 resets, run visited all 3 properties in 12 ms. (steps per millisecond=49 )
Parikh walk visited 0 properties in 0 ms.
FORMULA Parking-PT-432-LTLCardinality-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(p0) U X(p1)))))'
Support contains 2 out of 464 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 464/464 places, 428/428 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 464 transition count 412
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 448 transition count 412
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 32 place count 448 transition count 396
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 64 place count 432 transition count 396
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 67 place count 429 transition count 393
Iterating global reduction 2 with 3 rules applied. Total rules applied 70 place count 429 transition count 393
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 122 place count 403 transition count 367
Applied a total of 122 rules in 97 ms. Remains 403 /464 variables (removed 61) and now considering 367/428 (removed 61) transitions.
// Phase 1: matrix 367 rows 403 cols
[2024-05-27 20:34:11] [INFO ] Computed 88 invariants in 4 ms
[2024-05-27 20:34:12] [INFO ] Implicit Places using invariants in 311 ms returned [75, 90, 184, 373]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 312 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 399/464 places, 367/428 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 398 transition count 366
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 398 transition count 366
Applied a total of 2 rules in 51 ms. Remains 398 /399 variables (removed 1) and now considering 366/367 (removed 1) transitions.
// Phase 1: matrix 366 rows 398 cols
[2024-05-27 20:34:12] [INFO ] Computed 84 invariants in 3 ms
[2024-05-27 20:34:12] [INFO ] Implicit Places using invariants in 287 ms returned []
[2024-05-27 20:34:12] [INFO ] Invariant cache hit.
[2024-05-27 20:34:12] [INFO ] State equation strengthened by 156 read => feed constraints.
[2024-05-27 20:34:13] [INFO ] Implicit Places using invariants and state equation in 755 ms returned []
Implicit Place search using SMT with State Equation took 1046 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 398/464 places, 366/428 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1506 ms. Remains : 398/464 places, 366/428 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 333 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), false]
Running random walk in product with property : Parking-PT-432-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s395 1), p1:(AND (EQ s291 1) (EQ s395 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 8464 reset in 1432 ms.
Product exploration explored 100000 steps with 8450 reset in 1198 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 5 factoid took 154 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 161 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), false]
Incomplete random walk after 10000 steps, including 91 resets, run finished after 229 ms. (steps per millisecond=43 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) 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 2) seen :0
Running SMT prover for 2 properties.
[2024-05-27 20:34:16] [INFO ] Invariant cache hit.
[2024-05-27 20:34:16] [INFO ] [Real]Absence check using 84 positive place invariants in 25 ms returned sat
[2024-05-27 20:34:17] [INFO ] After 309ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2024-05-27 20:34:17] [INFO ] [Nat]Absence check using 84 positive place invariants in 23 ms returned sat
[2024-05-27 20:34:17] [INFO ] After 191ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2024-05-27 20:34:17] [INFO ] State equation strengthened by 156 read => feed constraints.
[2024-05-27 20:34:17] [INFO ] After 49ms SMT Verify possible using 156 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2024-05-27 20:34:17] [INFO ] After 93ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 26 ms.
[2024-05-27 20:34:17] [INFO ] After 423ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 398 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 398/398 places, 366/366 transitions.
Free-agglomeration rule applied 107 times.
Iterating global reduction 0 with 107 rules applied. Total rules applied 107 place count 398 transition count 259
Reduce places removed 107 places and 0 transitions.
Graph (complete) has 590 edges and 291 vertex of which 155 are kept as prefixes of interest. Removing 136 places using SCC suffix rule.2 ms
Discarding 136 places :
Also discarding 116 output transitions
Drop transitions removed 116 transitions
Iterating post reduction 0 with 108 rules applied. Total rules applied 215 place count 155 transition count 143
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 223 place count 155 transition count 135
Applied a total of 223 rules in 39 ms. Remains 155 /398 variables (removed 243) and now considering 135/366 (removed 231) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 155/398 places, 135/366 transitions.
Finished random walk after 64 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=64 )
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (G (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F p1), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 6 factoid took 342 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 108 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p1), (NOT p1)]
[2024-05-27 20:34:18] [INFO ] Invariant cache hit.
[2024-05-27 20:34:18] [INFO ] [Real]Absence check using 84 positive place invariants in 19 ms returned unsat
Proved EG (NOT p1)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (G (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (G (NOT p1))]
Property proved to be false thanks to negative knowledge :(G (NOT p1))
Knowledge based reduction with 6 factoid took 226 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Parking-PT-432-LTLCardinality-00 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Parking-PT-432-LTLCardinality-00 finished in 7069 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||X(p1)))))'
Support contains 4 out of 464 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 464/464 places, 428/428 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 462 transition count 426
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 462 transition count 426
Applied a total of 4 rules in 17 ms. Remains 462 /464 variables (removed 2) and now considering 426/428 (removed 2) transitions.
// Phase 1: matrix 426 rows 462 cols
[2024-05-27 20:34:18] [INFO ] Computed 88 invariants in 3 ms
[2024-05-27 20:34:18] [INFO ] Implicit Places using invariants in 277 ms returned [103, 212, 428]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 280 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 459/464 places, 426/428 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 456 transition count 423
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 456 transition count 423
Applied a total of 6 rules in 15 ms. Remains 456 /459 variables (removed 3) and now considering 423/426 (removed 3) transitions.
// Phase 1: matrix 423 rows 456 cols
[2024-05-27 20:34:18] [INFO ] Computed 85 invariants in 3 ms
[2024-05-27 20:34:19] [INFO ] Implicit Places using invariants in 268 ms returned []
[2024-05-27 20:34:19] [INFO ] Invariant cache hit.
[2024-05-27 20:34:19] [INFO ] State equation strengthened by 108 read => feed constraints.
[2024-05-27 20:34:19] [INFO ] Implicit Places using invariants and state equation in 718 ms returned []
Implicit Place search using SMT with State Equation took 989 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 456/464 places, 423/428 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1302 ms. Remains : 456/464 places, 423/428 transitions.
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Parking-PT-432-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p0:(AND (EQ s83 0) (EQ s452 1)), p1:(AND (EQ s126 0) (EQ s288 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 100 steps with 0 reset in 1 ms.
FORMULA Parking-PT-432-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-432-LTLCardinality-02 finished in 1418 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((X(p0)||F(p1)))))'
Support contains 4 out of 464 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 464/464 places, 428/428 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 464 transition count 412
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 448 transition count 412
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 32 place count 448 transition count 396
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 64 place count 432 transition count 396
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 66 place count 430 transition count 394
Iterating global reduction 2 with 2 rules applied. Total rules applied 68 place count 430 transition count 394
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 122 place count 403 transition count 367
Applied a total of 122 rules in 47 ms. Remains 403 /464 variables (removed 61) and now considering 367/428 (removed 61) transitions.
// Phase 1: matrix 367 rows 403 cols
[2024-05-27 20:34:20] [INFO ] Computed 88 invariants in 2 ms
[2024-05-27 20:34:20] [INFO ] Implicit Places using invariants in 326 ms returned [75, 90, 373]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 328 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 400/464 places, 367/428 transitions.
Applied a total of 0 rules in 14 ms. Remains 400 /400 variables (removed 0) and now considering 367/367 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 390 ms. Remains : 400/464 places, 367/428 transitions.
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Parking-PT-432-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s227 0) (EQ s211 1)), p1:(OR (EQ s351 0) (EQ s183 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 921 reset in 627 ms.
Product exploration explored 100000 steps with 926 reset in 659 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 91 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 92 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 367 rows 400 cols
[2024-05-27 20:34:22] [INFO ] Computed 85 invariants in 2 ms
[2024-05-27 20:34:22] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-27 20:34:22] [INFO ] [Nat]Absence check using 85 positive place invariants in 27 ms returned sat
[2024-05-27 20:34:22] [INFO ] After 211ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-27 20:34:22] [INFO ] State equation strengthened by 152 read => feed constraints.
[2024-05-27 20:34:22] [INFO ] After 50ms SMT Verify possible using 152 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-27 20:34:22] [INFO ] After 102ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2024-05-27 20:34:22] [INFO ] After 449ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 93 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=46 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 5 factoid took 320 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 400 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 400/400 places, 367/367 transitions.
Applied a total of 0 rules in 14 ms. Remains 400 /400 variables (removed 0) and now considering 367/367 (removed 0) transitions.
[2024-05-27 20:34:23] [INFO ] Invariant cache hit.
[2024-05-27 20:34:23] [INFO ] Implicit Places using invariants in 318 ms returned []
[2024-05-27 20:34:23] [INFO ] Invariant cache hit.
[2024-05-27 20:34:23] [INFO ] State equation strengthened by 152 read => feed constraints.
[2024-05-27 20:34:24] [INFO ] Implicit Places using invariants and state equation in 795 ms returned []
Implicit Place search using SMT with State Equation took 1115 ms to find 0 implicit places.
[2024-05-27 20:34:24] [INFO ] Redundant transitions in 30 ms returned []
[2024-05-27 20:34:24] [INFO ] Invariant cache hit.
[2024-05-27 20:34:24] [INFO ] Dead Transitions using invariants and state equation in 279 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1453 ms. Remains : 400/400 places, 367/367 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 88 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 91 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-27 20:34:24] [INFO ] Invariant cache hit.
[2024-05-27 20:34:24] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-27 20:34:25] [INFO ] [Nat]Absence check using 85 positive place invariants in 27 ms returned sat
[2024-05-27 20:34:25] [INFO ] After 209ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-27 20:34:25] [INFO ] State equation strengthened by 152 read => feed constraints.
[2024-05-27 20:34:25] [INFO ] After 47ms SMT Verify possible using 152 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-27 20:34:25] [INFO ] After 87ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2024-05-27 20:34:25] [INFO ] After 434ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 16 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=16 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 5 factoid took 133 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 928 reset in 551 ms.
Product exploration explored 100000 steps with 927 reset in 621 ms.
Built C files in :
/tmp/ltsmin4244622199405866003
[2024-05-27 20:34:26] [INFO ] Computing symmetric may disable matrix : 367 transitions.
[2024-05-27 20:34:26] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:34:26] [INFO ] Computing symmetric may enable matrix : 367 transitions.
[2024-05-27 20:34:26] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:34:27] [INFO ] Computing Do-Not-Accords matrix : 367 transitions.
[2024-05-27 20:34:27] [INFO ] Computation of Completed DNA matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:34:27] [INFO ] Built C files in 71ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4244622199405866003
Running compilation step : cd /tmp/ltsmin4244622199405866003;'/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'
Compilation finished in 1334 ms.
Running link step : cd /tmp/ltsmin4244622199405866003;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin4244622199405866003;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17827552854662891887.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 400 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 400/400 places, 367/367 transitions.
Applied a total of 0 rules in 13 ms. Remains 400 /400 variables (removed 0) and now considering 367/367 (removed 0) transitions.
[2024-05-27 20:34:42] [INFO ] Invariant cache hit.
[2024-05-27 20:34:42] [INFO ] Implicit Places using invariants in 503 ms returned []
[2024-05-27 20:34:42] [INFO ] Invariant cache hit.
[2024-05-27 20:34:42] [INFO ] State equation strengthened by 152 read => feed constraints.
[2024-05-27 20:34:43] [INFO ] Implicit Places using invariants and state equation in 779 ms returned []
Implicit Place search using SMT with State Equation took 1287 ms to find 0 implicit places.
[2024-05-27 20:34:43] [INFO ] Redundant transitions in 7 ms returned []
[2024-05-27 20:34:43] [INFO ] Invariant cache hit.
[2024-05-27 20:34:43] [INFO ] Dead Transitions using invariants and state equation in 287 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1601 ms. Remains : 400/400 places, 367/367 transitions.
Built C files in :
/tmp/ltsmin14329414097995519505
[2024-05-27 20:34:43] [INFO ] Computing symmetric may disable matrix : 367 transitions.
[2024-05-27 20:34:43] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:34:43] [INFO ] Computing symmetric may enable matrix : 367 transitions.
[2024-05-27 20:34:43] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:34:43] [INFO ] Computing Do-Not-Accords matrix : 367 transitions.
[2024-05-27 20:34:43] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:34:43] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14329414097995519505
Running compilation step : cd /tmp/ltsmin14329414097995519505;'/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'
Compilation finished in 1063 ms.
Running link step : cd /tmp/ltsmin14329414097995519505;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin14329414097995519505;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6066078821172338917.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-27 20:34:58] [INFO ] Flatten gal took : 30 ms
[2024-05-27 20:34:58] [INFO ] Flatten gal took : 28 ms
[2024-05-27 20:34:58] [INFO ] Time to serialize gal into /tmp/LTL6660102804934361468.gal : 7 ms
[2024-05-27 20:34:58] [INFO ] Time to serialize properties into /tmp/LTL9813131255813427046.prop : 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/LTL6660102804934361468.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1946503745623898836.hoa' '-atoms' '/tmp/LTL9813131255813427046.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...317
Loading property file /tmp/LTL9813131255813427046.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1946503745623898836.hoa
Detected timeout of ITS tools.
[2024-05-27 20:35:14] [INFO ] Flatten gal took : 26 ms
[2024-05-27 20:35:14] [INFO ] Flatten gal took : 24 ms
[2024-05-27 20:35:14] [INFO ] Time to serialize gal into /tmp/LTL13295658221139471085.gal : 5 ms
[2024-05-27 20:35:14] [INFO ] Time to serialize properties into /tmp/LTL14611828542507871878.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/LTL13295658221139471085.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14611828542507871878.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...277
Read 1 LTL properties
Checking formula 0 : !((F(G((X("((p290==0)||(p274==1))"))||(F("((p456==0)||(p238==1))"))))))
Formula 0 simplified : G(FG!"((p456==0)||(p238==1))" & F!"((p290==0)||(p274==1))")
Detected timeout of ITS tools.
[2024-05-27 20:35:29] [INFO ] Flatten gal took : 23 ms
[2024-05-27 20:35:29] [INFO ] Applying decomposition
[2024-05-27 20:35:29] [INFO ] Flatten gal took : 22 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/graph6778231031031179780.txt' '-o' '/tmp/graph6778231031031179780.bin' '-w' '/tmp/graph6778231031031179780.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph6778231031031179780.bin' '-l' '-1' '-v' '-w' '/tmp/graph6778231031031179780.weights' '-q' '0' '-e' '0.001'
[2024-05-27 20:35:29] [INFO ] Decomposing Gal with order
[2024-05-27 20:35:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 20:35:29] [INFO ] Removed a total of 115 redundant transitions.
[2024-05-27 20:35:29] [INFO ] Flatten gal took : 114 ms
[2024-05-27 20:35:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 56 labels/synchronizations in 20 ms.
[2024-05-27 20:35:29] [INFO ] Time to serialize gal into /tmp/LTL9630785118563307129.gal : 13 ms
[2024-05-27 20:35:29] [INFO ] Time to serialize properties into /tmp/LTL17105374288148381996.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9630785118563307129.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17105374288148381996.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...255
Read 1 LTL properties
Checking formula 0 : !((F(G((X("((i8.i2.u86.p290==0)||(i4.i1.u79.p274==1))"))||(F("((i10.i3.u132.p456==0)||(i4.i1.u68.p238==1))"))))))
Formula 0 simplified : G(FG!"((i10.i3.u132.p456==0)||(i4.i1.u68.p238==1))" & F!"((i8.i2.u86.p290==0)||(i4.i1.u79.p274==1))")
Reverse transition relation is NOT exact ! Due to transitions i4.t336_t377, i4.i1.t341_t377, i4.i1.t344_t377, i4.i1.t347_t377, i4.i1.u79.t71, Intersection...241
Computing Next relation with stutter on 1.50062e+06 deadlock states
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
77 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,0.859464,39772,1,0,51897,2497,6325,97932,511,7798,89350
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Parking-PT-432-LTLCardinality-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property Parking-PT-432-LTLCardinality-04 finished in 70428 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))'
Support contains 2 out of 464 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 464/464 places, 428/428 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 461 transition count 425
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 461 transition count 425
Applied a total of 6 rules in 12 ms. Remains 461 /464 variables (removed 3) and now considering 425/428 (removed 3) transitions.
// Phase 1: matrix 425 rows 461 cols
[2024-05-27 20:35:30] [INFO ] Computed 88 invariants in 2 ms
[2024-05-27 20:35:30] [INFO ] Implicit Places using invariants in 303 ms returned [83, 103, 212]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 305 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 458/464 places, 425/428 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 455 transition count 422
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 455 transition count 422
Applied a total of 6 rules in 13 ms. Remains 455 /458 variables (removed 3) and now considering 422/425 (removed 3) transitions.
// Phase 1: matrix 422 rows 455 cols
[2024-05-27 20:35:30] [INFO ] Computed 85 invariants in 2 ms
[2024-05-27 20:35:31] [INFO ] Implicit Places using invariants in 267 ms returned []
[2024-05-27 20:35:31] [INFO ] Invariant cache hit.
[2024-05-27 20:35:31] [INFO ] State equation strengthened by 108 read => feed constraints.
[2024-05-27 20:35:31] [INFO ] Implicit Places using invariants and state equation in 689 ms returned []
Implicit Place search using SMT with State Equation took 959 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 455/464 places, 422/428 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1290 ms. Remains : 455/464 places, 422/428 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : Parking-PT-432-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(AND (NEQ s422 0) (NEQ s199 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 2368 ms.
Product exploration explored 100000 steps with 50000 reset in 2410 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X p0), true]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 13 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Parking-PT-432-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Parking-PT-432-LTLCardinality-07 finished in 6195 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))&&(X(X(p0))||F(p1))))'
Support contains 4 out of 464 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 464/464 places, 428/428 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 461 transition count 425
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 461 transition count 425
Applied a total of 6 rules in 12 ms. Remains 461 /464 variables (removed 3) and now considering 425/428 (removed 3) transitions.
// Phase 1: matrix 425 rows 461 cols
[2024-05-27 20:35:36] [INFO ] Computed 88 invariants in 2 ms
[2024-05-27 20:35:37] [INFO ] Implicit Places using invariants in 346 ms returned [83, 103, 212, 428]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 347 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 457/464 places, 425/428 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 453 transition count 421
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 453 transition count 421
Applied a total of 8 rules in 12 ms. Remains 453 /457 variables (removed 4) and now considering 421/425 (removed 4) transitions.
// Phase 1: matrix 421 rows 453 cols
[2024-05-27 20:35:37] [INFO ] Computed 84 invariants in 2 ms
[2024-05-27 20:35:37] [INFO ] Implicit Places using invariants in 322 ms returned []
[2024-05-27 20:35:37] [INFO ] Invariant cache hit.
[2024-05-27 20:35:37] [INFO ] State equation strengthened by 108 read => feed constraints.
[2024-05-27 20:35:38] [INFO ] Implicit Places using invariants and state equation in 757 ms returned []
Implicit Place search using SMT with State Equation took 1081 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 453/464 places, 421/428 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1454 ms. Remains : 453/464 places, 421/428 transitions.
Stuttering acceptance computed with spot in 173 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : Parking-PT-432-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(OR (EQ s354 0) (EQ s215 1)), p0:(OR (EQ s218 0) (EQ s197 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, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 2342 ms.
Product exploration explored 100000 steps with 50000 reset in 2371 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X p0), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 13 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Parking-PT-432-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Parking-PT-432-LTLCardinality-08 finished in 6377 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 464 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 464/464 places, 428/428 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 463 transition count 411
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 447 transition count 411
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 32 place count 447 transition count 395
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 64 place count 431 transition count 395
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 67 place count 428 transition count 392
Iterating global reduction 2 with 3 rules applied. Total rules applied 70 place count 428 transition count 392
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 126 place count 400 transition count 364
Applied a total of 126 rules in 38 ms. Remains 400 /464 variables (removed 64) and now considering 364/428 (removed 64) transitions.
// Phase 1: matrix 364 rows 400 cols
[2024-05-27 20:35:43] [INFO ] Computed 88 invariants in 2 ms
[2024-05-27 20:35:43] [INFO ] Implicit Places using invariants in 339 ms returned [74, 89, 183, 370]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 341 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 396/464 places, 364/428 transitions.
Applied a total of 0 rules in 9 ms. Remains 396 /396 variables (removed 0) and now considering 364/364 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 389 ms. Remains : 396/464 places, 364/428 transitions.
Stuttering acceptance computed with spot in 178 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Parking-PT-432-LTLCardinality-09 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 s297 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 960 reset in 646 ms.
Product exploration explored 100000 steps with 958 reset in 567 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 80 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Finished random walk after 426 steps, including 3 resets, run visited all 1 properties in 5 ms. (steps per millisecond=85 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 99 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 396 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 396/396 places, 364/364 transitions.
Applied a total of 0 rules in 10 ms. Remains 396 /396 variables (removed 0) and now considering 364/364 (removed 0) transitions.
// Phase 1: matrix 364 rows 396 cols
[2024-05-27 20:35:45] [INFO ] Computed 84 invariants in 5 ms
[2024-05-27 20:35:45] [INFO ] Implicit Places using invariants in 329 ms returned []
[2024-05-27 20:35:45] [INFO ] Invariant cache hit.
[2024-05-27 20:35:46] [INFO ] Implicit Places using invariants and state equation in 545 ms returned []
Implicit Place search using SMT with State Equation took 878 ms to find 0 implicit places.
[2024-05-27 20:35:46] [INFO ] Redundant transitions in 6 ms returned []
[2024-05-27 20:35:46] [INFO ] Invariant cache hit.
[2024-05-27 20:35:46] [INFO ] Dead Transitions using invariants and state equation in 332 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1237 ms. Remains : 396/396 places, 364/364 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 72 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Finished random walk after 701 steps, including 6 resets, run visited all 1 properties in 4 ms. (steps per millisecond=175 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 95 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 962 reset in 497 ms.
Product exploration explored 100000 steps with 957 reset in 564 ms.
Built C files in :
/tmp/ltsmin8494953625027629102
[2024-05-27 20:35:48] [INFO ] Computing symmetric may disable matrix : 364 transitions.
[2024-05-27 20:35:48] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:35:48] [INFO ] Computing symmetric may enable matrix : 364 transitions.
[2024-05-27 20:35:48] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:35:48] [INFO ] Computing Do-Not-Accords matrix : 364 transitions.
[2024-05-27 20:35:48] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:35:48] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8494953625027629102
Running compilation step : cd /tmp/ltsmin8494953625027629102;'/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'
Compilation finished in 1099 ms.
Running link step : cd /tmp/ltsmin8494953625027629102;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin8494953625027629102;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16912873706226434497.hoa' '--buchi-type=spotba'
LTSmin run took 3068 ms.
FORMULA Parking-PT-432-LTLCardinality-09 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property Parking-PT-432-LTLCardinality-09 finished in 9271 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 464 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 464/464 places, 428/428 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 463 transition count 411
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 447 transition count 411
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 32 place count 447 transition count 395
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 64 place count 431 transition count 395
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 67 place count 428 transition count 392
Iterating global reduction 2 with 3 rules applied. Total rules applied 70 place count 428 transition count 392
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 126 place count 400 transition count 364
Applied a total of 126 rules in 33 ms. Remains 400 /464 variables (removed 64) and now considering 364/428 (removed 64) transitions.
// Phase 1: matrix 364 rows 400 cols
[2024-05-27 20:35:52] [INFO ] Computed 88 invariants in 2 ms
[2024-05-27 20:35:52] [INFO ] Implicit Places using invariants in 361 ms returned [74, 89, 183, 370]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 364 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 396/464 places, 364/428 transitions.
Applied a total of 0 rules in 8 ms. Remains 396 /396 variables (removed 0) and now considering 364/364 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 406 ms. Remains : 396/464 places, 364/428 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : Parking-PT-432-LTLCardinality-12 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 (NEQ s93 0) (NEQ s252 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 135 steps with 0 reset in 1 ms.
FORMULA Parking-PT-432-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-432-LTLCardinality-12 finished in 458 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(X(G(p1)))))'
Support contains 2 out of 464 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 464/464 places, 428/428 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 461 transition count 425
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 461 transition count 425
Applied a total of 6 rules in 13 ms. Remains 461 /464 variables (removed 3) and now considering 425/428 (removed 3) transitions.
// Phase 1: matrix 425 rows 461 cols
[2024-05-27 20:35:52] [INFO ] Computed 88 invariants in 1 ms
[2024-05-27 20:35:53] [INFO ] Implicit Places using invariants in 284 ms returned [83, 212, 428]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 285 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 458/464 places, 425/428 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 455 transition count 422
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 455 transition count 422
Applied a total of 6 rules in 15 ms. Remains 455 /458 variables (removed 3) and now considering 422/425 (removed 3) transitions.
// Phase 1: matrix 422 rows 455 cols
[2024-05-27 20:35:53] [INFO ] Computed 85 invariants in 2 ms
[2024-05-27 20:35:53] [INFO ] Implicit Places using invariants in 268 ms returned []
[2024-05-27 20:35:53] [INFO ] Invariant cache hit.
[2024-05-27 20:35:53] [INFO ] State equation strengthened by 108 read => feed constraints.
[2024-05-27 20:35:54] [INFO ] Implicit Places using invariants and state equation in 722 ms returned []
Implicit Place search using SMT with State Equation took 991 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 455/464 places, 422/428 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1307 ms. Remains : 455/464 places, 422/428 transitions.
Stuttering acceptance computed with spot in 365 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Parking-PT-432-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 5}, { cond=p0, acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={} source=5 dest: 1}], [{ cond=(NOT p0), acceptance={} source=6 dest: 1}, { cond=p0, acceptance={} source=6 dest: 2}]], initial=4, aps=[p1:(OR (EQ s101 0) (EQ s295 1)), p0:(AND (EQ s295 0) (EQ s101 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, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Parking-PT-432-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-432-LTLCardinality-13 finished in 1690 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(X(F(p0))))'
Support contains 1 out of 464 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 464/464 places, 428/428 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 461 transition count 425
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 461 transition count 425
Applied a total of 6 rules in 12 ms. Remains 461 /464 variables (removed 3) and now considering 425/428 (removed 3) transitions.
// Phase 1: matrix 425 rows 461 cols
[2024-05-27 20:35:54] [INFO ] Computed 88 invariants in 1 ms
[2024-05-27 20:35:54] [INFO ] Implicit Places using invariants in 355 ms returned [83, 103, 212, 428]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 357 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 457/464 places, 425/428 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 453 transition count 421
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 453 transition count 421
Applied a total of 8 rules in 10 ms. Remains 453 /457 variables (removed 4) and now considering 421/425 (removed 4) transitions.
// Phase 1: matrix 421 rows 453 cols
[2024-05-27 20:35:54] [INFO ] Computed 84 invariants in 2 ms
[2024-05-27 20:35:55] [INFO ] Implicit Places using invariants in 352 ms returned []
[2024-05-27 20:35:55] [INFO ] Invariant cache hit.
[2024-05-27 20:35:55] [INFO ] State equation strengthened by 108 read => feed constraints.
[2024-05-27 20:35:55] [INFO ] Implicit Places using invariants and state equation in 767 ms returned []
Implicit Place search using SMT with State Equation took 1126 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 453/464 places, 421/428 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1506 ms. Remains : 453/464 places, 421/428 transitions.
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Parking-PT-432-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(EQ s416 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][false, false, false]]
Stuttering criterion allowed to conclude after 122 steps with 0 reset in 1 ms.
FORMULA Parking-PT-432-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-432-LTLCardinality-15 finished in 1631 ms.
All properties solved by simple procedures.
Total runtime 110142 ms.

BK_STOP 1716842157160

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Parking-PT-432"
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 Parking-PT-432, 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 r285-smll-171654421800052"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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