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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 644K
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K 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.7K May 19 07:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 16:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.4K Apr 11 19:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 11 19:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Apr 11 18:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Apr 11 18:16 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 251K 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-832-LTLCardinality-00
FORMULA_NAME Parking-PT-832-LTLCardinality-01
FORMULA_NAME Parking-PT-832-LTLCardinality-02
FORMULA_NAME Parking-PT-832-LTLCardinality-03
FORMULA_NAME Parking-PT-832-LTLCardinality-04
FORMULA_NAME Parking-PT-832-LTLCardinality-05
FORMULA_NAME Parking-PT-832-LTLCardinality-06
FORMULA_NAME Parking-PT-832-LTLCardinality-07
FORMULA_NAME Parking-PT-832-LTLCardinality-08
FORMULA_NAME Parking-PT-832-LTLCardinality-09
FORMULA_NAME Parking-PT-832-LTLCardinality-10
FORMULA_NAME Parking-PT-832-LTLCardinality-11
FORMULA_NAME Parking-PT-832-LTLCardinality-12
FORMULA_NAME Parking-PT-832-LTLCardinality-13
FORMULA_NAME Parking-PT-832-LTLCardinality-14
FORMULA_NAME Parking-PT-832-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716843750226

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-832
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-27 21:02:33] [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 21:02:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 21:02:34] [INFO ] Load time of PNML (sax parser for PT used): 223 ms
[2024-05-27 21:02:34] [INFO ] Transformed 737 places.
[2024-05-27 21:02:34] [INFO ] Transformed 993 transitions.
[2024-05-27 21:02:34] [INFO ] Found NUPN structural information;
[2024-05-27 21:02:34] [INFO ] Parsed PT model containing 737 places and 993 transitions and 2993 arcs in 354 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Ensure Unique test removed 384 transitions
Reduce redundant transitions removed 384 transitions.
FORMULA Parking-PT-832-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-832-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-832-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-832-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-832-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-832-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-832-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-832-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-832-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-832-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 737 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 737/737 places, 609/609 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 730 transition count 602
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 730 transition count 602
Applied a total of 14 rules in 256 ms. Remains 730 /737 variables (removed 7) and now considering 602/609 (removed 7) transitions.
// Phase 1: matrix 602 rows 730 cols
[2024-05-27 21:02:34] [INFO ] Computed 184 invariants in 48 ms
[2024-05-27 21:02:35] [INFO ] Implicit Places using invariants in 1248 ms returned []
[2024-05-27 21:02:35] [INFO ] Invariant cache hit.
[2024-05-27 21:02:36] [INFO ] State equation strengthened by 152 read => feed constraints.
[2024-05-27 21:02:38] [INFO ] Implicit Places using invariants and state equation in 2752 ms returned [136, 144, 152, 160, 184, 186, 213, 221, 229, 237, 261, 263, 290, 298, 306, 314, 338, 340, 367, 375, 383, 391, 415, 417, 444, 452, 460, 468, 492, 494, 521, 529, 537, 545, 569, 571, 598, 606, 614, 622, 646, 648, 676, 684, 692, 700, 724, 726]
Discarding 48 places :
Implicit Place search using SMT with State Equation took 4075 ms to find 48 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 682/737 places, 602/609 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 651 transition count 571
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 651 transition count 571
Applied a total of 62 rules in 106 ms. Remains 651 /682 variables (removed 31) and now considering 571/602 (removed 31) transitions.
// Phase 1: matrix 571 rows 651 cols
[2024-05-27 21:02:38] [INFO ] Computed 136 invariants in 18 ms
[2024-05-27 21:02:39] [INFO ] Implicit Places using invariants in 609 ms returned []
[2024-05-27 21:02:39] [INFO ] Invariant cache hit.
[2024-05-27 21:02:39] [INFO ] State equation strengthened by 152 read => feed constraints.
[2024-05-27 21:02:41] [INFO ] Implicit Places using invariants and state equation in 1661 ms returned []
Implicit Place search using SMT with State Equation took 2277 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 651/737 places, 571/609 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 6714 ms. Remains : 651/737 places, 571/609 transitions.
Support contains 24 out of 651 places after structural reductions.
[2024-05-27 21:02:41] [INFO ] Flatten gal took : 159 ms
[2024-05-27 21:02:41] [INFO ] Flatten gal took : 82 ms
[2024-05-27 21:02:41] [INFO ] Input system was already deterministic with 571 transitions.
Incomplete random walk after 10000 steps, including 50 resets, run finished after 698 ms. (steps per millisecond=14 ) properties (out of 13) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-27 21:02:42] [INFO ] Invariant cache hit.
[2024-05-27 21:02:42] [INFO ] [Real]Absence check using 136 positive place invariants in 40 ms returned sat
[2024-05-27 21:02:42] [INFO ] After 276ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-27 21:02:43] [INFO ] [Nat]Absence check using 136 positive place invariants in 58 ms returned sat
[2024-05-27 21:02:43] [INFO ] After 567ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-27 21:02:43] [INFO ] State equation strengthened by 152 read => feed constraints.
[2024-05-27 21:02:44] [INFO ] After 189ms SMT Verify possible using 152 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-27 21:02:44] [INFO ] After 500ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 178 ms.
[2024-05-27 21:02:44] [INFO ] After 1625ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 39 ms.
Support contains 4 out of 651 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 651/651 places, 571/571 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 651 transition count 555
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 635 transition count 555
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 635 transition count 539
Deduced a syphon composed of 16 places in 2 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 64 place count 619 transition count 539
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 65 place count 618 transition count 538
Iterating global reduction 2 with 1 rules applied. Total rules applied 66 place count 618 transition count 538
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 130 place count 586 transition count 506
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 132 place count 585 transition count 525
Free-agglomeration rule applied 163 times.
Iterating global reduction 2 with 163 rules applied. Total rules applied 295 place count 585 transition count 362
Reduce places removed 163 places and 0 transitions.
Graph (complete) has 856 edges and 422 vertex of which 226 are kept as prefixes of interest. Removing 196 places using SCC suffix rule.4 ms
Discarding 196 places :
Also discarding 152 output transitions
Drop transitions removed 152 transitions
Iterating post reduction 2 with 164 rules applied. Total rules applied 459 place count 226 transition count 210
Drop transitions removed 36 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 3 with 40 rules applied. Total rules applied 499 place count 226 transition count 170
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 500 place count 225 transition count 169
Reduce places removed 79 places and 0 transitions.
Graph (trivial) has 152 edges and 146 vertex of which 67 / 146 are part of one of the 4 SCC in 4 ms
Free SCC test removed 63 places
Drop transitions removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 4 with 135 rules applied. Total rules applied 635 place count 83 transition count 114
Reduce places removed 55 places and 0 transitions.
Drop transitions removed 82 transitions
Reduce isomorphic transitions removed 82 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 5 with 139 rules applied. Total rules applied 774 place count 28 transition count 30
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 776 place count 26 transition count 30
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 3 Pre rules applied. Total rules applied 776 place count 26 transition count 27
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 782 place count 23 transition count 27
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 785 place count 20 transition count 24
Iterating global reduction 7 with 3 rules applied. Total rules applied 788 place count 20 transition count 24
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 790 place count 18 transition count 22
Iterating global reduction 7 with 2 rules applied. Total rules applied 792 place count 18 transition count 22
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 794 place count 16 transition count 19
Iterating global reduction 7 with 2 rules applied. Total rules applied 796 place count 16 transition count 19
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 797 place count 16 transition count 18
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 798 place count 15 transition count 17
Iterating global reduction 8 with 1 rules applied. Total rules applied 799 place count 15 transition count 17
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 800 place count 15 transition count 16
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 804 place count 13 transition count 14
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 805 place count 13 transition count 13
Free-agglomeration rule applied 2 times.
Iterating global reduction 10 with 2 rules applied. Total rules applied 807 place count 13 transition count 11
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 809 place count 11 transition count 11
Applied a total of 809 rules in 357 ms. Remains 11 /651 variables (removed 640) and now considering 11/571 (removed 560) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 357 ms. Remains : 11/651 places, 11/571 transitions.
Finished random walk after 17 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=17 )
Parikh walk visited 0 properties in 0 ms.
FORMULA Parking-PT-832-LTLCardinality-14 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' '!(X(G(p0)))'
Support contains 2 out of 651 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 651/651 places, 571/571 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 649 transition count 569
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 649 transition count 569
Applied a total of 4 rules in 49 ms. Remains 649 /651 variables (removed 2) and now considering 569/571 (removed 2) transitions.
// Phase 1: matrix 569 rows 649 cols
[2024-05-27 21:02:45] [INFO ] Computed 136 invariants in 7 ms
[2024-05-27 21:02:46] [INFO ] Implicit Places using invariants in 654 ms returned []
[2024-05-27 21:02:46] [INFO ] Invariant cache hit.
[2024-05-27 21:02:46] [INFO ] State equation strengthened by 152 read => feed constraints.
[2024-05-27 21:02:47] [INFO ] Implicit Places using invariants and state equation in 1704 ms returned []
Implicit Place search using SMT with State Equation took 2382 ms to find 0 implicit places.
[2024-05-27 21:02:47] [INFO ] Invariant cache hit.
[2024-05-27 21:02:48] [INFO ] Dead Transitions using invariants and state equation in 899 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 649/651 places, 569/571 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3333 ms. Remains : 649/651 places, 569/571 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 342 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Parking-PT-832-LTLCardinality-03 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:(AND (NEQ s42 0) (NEQ s561 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 31 steps with 0 reset in 7 ms.
FORMULA Parking-PT-832-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-832-LTLCardinality-03 finished in 3790 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(G((X(!p1)||p0)))) U X(p2)))'
Support contains 5 out of 651 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 651/651 places, 571/571 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 649 transition count 569
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 649 transition count 569
Applied a total of 4 rules in 46 ms. Remains 649 /651 variables (removed 2) and now considering 569/571 (removed 2) transitions.
[2024-05-27 21:02:49] [INFO ] Invariant cache hit.
[2024-05-27 21:02:50] [INFO ] Implicit Places using invariants in 920 ms returned []
[2024-05-27 21:02:50] [INFO ] Invariant cache hit.
[2024-05-27 21:02:50] [INFO ] State equation strengthened by 152 read => feed constraints.
[2024-05-27 21:02:51] [INFO ] Implicit Places using invariants and state equation in 1788 ms returned []
Implicit Place search using SMT with State Equation took 2712 ms to find 0 implicit places.
[2024-05-27 21:02:51] [INFO ] Invariant cache hit.
[2024-05-27 21:02:52] [INFO ] Dead Transitions using invariants and state equation in 847 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 649/651 places, 569/571 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3609 ms. Remains : 649/651 places, 569/571 transitions.
Stuttering acceptance computed with spot in 347 ms :[(NOT p2), (NOT p2), (OR (NOT p2) (AND (NOT p0) p1)), p1, (AND (NOT p0) p1), true]
Running random walk in product with property : Parking-PT-832-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 3}, { cond=p2, acceptance={0} source=2 dest: 4}], [{ cond=p1, acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(OR (EQ s411 0) (EQ s3 1)), p0:(OR (EQ s411 0) (EQ s3 1)), p1:(AND (EQ s12 1) (OR (EQ s593 0) (EQ s71 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 2735 ms.
Product exploration explored 100000 steps with 50000 reset in 2486 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 p2 p0 (NOT p1)), (X p2), (X (X p0)), (X (X p2))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 25 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Parking-PT-832-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Parking-PT-832-LTLCardinality-04 finished in 9265 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(p1)&&p0) U (p2 U p3))&&X(p1)))'
Support contains 6 out of 651 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 651/651 places, 571/571 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 649 transition count 569
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 649 transition count 569
Applied a total of 4 rules in 30 ms. Remains 649 /651 variables (removed 2) and now considering 569/571 (removed 2) transitions.
[2024-05-27 21:02:58] [INFO ] Invariant cache hit.
[2024-05-27 21:02:59] [INFO ] Implicit Places using invariants in 755 ms returned []
[2024-05-27 21:02:59] [INFO ] Invariant cache hit.
[2024-05-27 21:02:59] [INFO ] State equation strengthened by 152 read => feed constraints.
[2024-05-27 21:03:00] [INFO ] Implicit Places using invariants and state equation in 1453 ms returned []
Implicit Place search using SMT with State Equation took 2220 ms to find 0 implicit places.
[2024-05-27 21:03:00] [INFO ] Invariant cache hit.
[2024-05-27 21:03:01] [INFO ] Dead Transitions using invariants and state equation in 838 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 649/651 places, 569/571 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3091 ms. Remains : 649/651 places, 569/571 transitions.
Stuttering acceptance computed with spot in 316 ms :[(OR (NOT p3) (NOT p1)), true, (NOT p1), (NOT p1), (NOT p3), (NOT p3)]
Running random walk in product with property : Parking-PT-832-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(OR p3 p2 p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p3) p2 (NOT p0)), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p3) p0), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p3) p2), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p3) (NOT p2) p0 (NOT p1)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p3) p2 (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p3) p0), acceptance={} source=5 dest: 5}]], initial=0, aps=[p3:(EQ s616 1), p2:(NEQ s489 1), p0:(AND (NOT (OR (EQ s585 0) (EQ s343 1))) (OR (EQ s102 0) (EQ s254 1))), p1:(OR (EQ s585 0) (EQ s343 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, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 174 steps with 0 reset in 12 ms.
FORMULA Parking-PT-832-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-832-LTLCardinality-10 finished in 3460 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(((p0 U p1)&&F(G(p2))))))'
Support contains 5 out of 651 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 651/651 places, 571/571 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 649 transition count 569
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 649 transition count 569
Applied a total of 4 rules in 44 ms. Remains 649 /651 variables (removed 2) and now considering 569/571 (removed 2) transitions.
[2024-05-27 21:03:01] [INFO ] Invariant cache hit.
[2024-05-27 21:03:02] [INFO ] Implicit Places using invariants in 628 ms returned []
[2024-05-27 21:03:02] [INFO ] Invariant cache hit.
[2024-05-27 21:03:03] [INFO ] State equation strengthened by 152 read => feed constraints.
[2024-05-27 21:03:04] [INFO ] Implicit Places using invariants and state equation in 1601 ms returned []
Implicit Place search using SMT with State Equation took 2233 ms to find 0 implicit places.
[2024-05-27 21:03:04] [INFO ] Invariant cache hit.
[2024-05-27 21:03:04] [INFO ] Dead Transitions using invariants and state equation in 884 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 649/651 places, 569/571 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3164 ms. Remains : 649/651 places, 569/571 transitions.
Stuttering acceptance computed with spot in 315 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2)]
Running random walk in product with property : Parking-PT-832-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 4}, { cond=(OR p1 p0), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 4}], [{ cond=p2, acceptance={} source=5 dest: 5}, { cond=(NOT p2), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(OR (EQ s465 0) (EQ s639 1)), p0:(OR (EQ s33 0) (EQ s103 1)), p2:(EQ s628 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 238 steps with 0 reset in 4 ms.
FORMULA Parking-PT-832-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-832-LTLCardinality-13 finished in 3514 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 651 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 651/651 places, 571/571 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 650 transition count 554
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 634 transition count 554
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 634 transition count 538
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 618 transition count 538
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 65 place count 617 transition count 537
Iterating global reduction 2 with 1 rules applied. Total rules applied 66 place count 617 transition count 537
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 130 place count 585 transition count 505
Applied a total of 130 rules in 137 ms. Remains 585 /651 variables (removed 66) and now considering 505/571 (removed 66) transitions.
// Phase 1: matrix 505 rows 585 cols
[2024-05-27 21:03:05] [INFO ] Computed 136 invariants in 9 ms
[2024-05-27 21:03:06] [INFO ] Implicit Places using invariants in 747 ms returned []
[2024-05-27 21:03:06] [INFO ] Invariant cache hit.
[2024-05-27 21:03:07] [INFO ] Implicit Places using invariants and state equation in 1208 ms returned []
Implicit Place search using SMT with State Equation took 1958 ms to find 0 implicit places.
[2024-05-27 21:03:07] [INFO ] Redundant transitions in 59 ms returned []
[2024-05-27 21:03:07] [INFO ] Invariant cache hit.
[2024-05-27 21:03:08] [INFO ] Dead Transitions using invariants and state equation in 702 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 585/651 places, 505/571 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2865 ms. Remains : 585/651 places, 505/571 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Parking-PT-832-LTLCardinality-15 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:(OR (EQ s208 0) (EQ s523 1))], 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 513 reset in 1147 ms.
Product exploration explored 100000 steps with 512 reset in 1271 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 127 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 102 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 52 resets, run finished after 186 ms. (steps per millisecond=53 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 370386 steps, run timeout after 3001 ms. (steps per millisecond=123 ) properties seen :{}
Probabilistic random walk after 370386 steps, saw 76767 distinct states, run finished after 3002 ms. (steps per millisecond=123 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-27 21:03:14] [INFO ] Invariant cache hit.
[2024-05-27 21:03:14] [INFO ] After 143ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-27 21:03:14] [INFO ] [Nat]Absence check using 136 positive place invariants in 58 ms returned sat
[2024-05-27 21:03:15] [INFO ] After 423ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-27 21:03:15] [INFO ] After 495ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 39 ms.
[2024-05-27 21:03:15] [INFO ] After 753ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 2 out of 585 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 585/585 places, 505/505 transitions.
Free-agglomeration rule applied 168 times.
Iterating global reduction 0 with 168 rules applied. Total rules applied 168 place count 585 transition count 337
Reduce places removed 295 places and 0 transitions.
Graph (complete) has 350 edges and 290 vertex of which 74 are kept as prefixes of interest. Removing 216 places using SCC suffix rule.0 ms
Discarding 216 places :
Also discarding 252 output transitions
Drop transitions removed 252 transitions
Graph (trivial) has 72 edges and 74 vertex of which 37 / 74 are part of one of the 2 SCC in 0 ms
Free SCC test removed 35 places
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 315 rules applied. Total rules applied 483 place count 39 transition count 67
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 61 rules applied. Total rules applied 544 place count 21 transition count 24
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 545 place count 20 transition count 24
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 545 place count 20 transition count 23
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 547 place count 19 transition count 23
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 550 place count 16 transition count 20
Iterating global reduction 3 with 3 rules applied. Total rules applied 553 place count 16 transition count 20
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 555 place count 14 transition count 18
Iterating global reduction 3 with 2 rules applied. Total rules applied 557 place count 14 transition count 18
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 559 place count 12 transition count 15
Iterating global reduction 3 with 2 rules applied. Total rules applied 561 place count 12 transition count 15
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 562 place count 12 transition count 14
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 563 place count 11 transition count 13
Iterating global reduction 4 with 1 rules applied. Total rules applied 564 place count 11 transition count 13
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 565 place count 11 transition count 12
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 569 place count 9 transition count 10
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 570 place count 9 transition count 9
Free-agglomeration rule applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 572 place count 9 transition count 7
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 574 place count 7 transition count 7
Applied a total of 574 rules in 72 ms. Remains 7 /585 variables (removed 578) and now considering 7/505 (removed 498) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 7/585 places, 7/505 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
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 145 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 114 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 585 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 585/585 places, 505/505 transitions.
Applied a total of 0 rules in 32 ms. Remains 585 /585 variables (removed 0) and now considering 505/505 (removed 0) transitions.
[2024-05-27 21:03:15] [INFO ] Invariant cache hit.
[2024-05-27 21:03:16] [INFO ] Implicit Places using invariants in 760 ms returned []
[2024-05-27 21:03:16] [INFO ] Invariant cache hit.
[2024-05-27 21:03:17] [INFO ] Implicit Places using invariants and state equation in 1097 ms returned []
Implicit Place search using SMT with State Equation took 1874 ms to find 0 implicit places.
[2024-05-27 21:03:17] [INFO ] Redundant transitions in 20 ms returned []
[2024-05-27 21:03:17] [INFO ] Invariant cache hit.
[2024-05-27 21:03:18] [INFO ] Dead Transitions using invariants and state equation in 598 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2539 ms. Remains : 585/585 places, 505/505 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 97 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 99 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 49 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 369560 steps, run timeout after 3001 ms. (steps per millisecond=123 ) properties seen :{}
Probabilistic random walk after 369560 steps, saw 76647 distinct states, run finished after 3001 ms. (steps per millisecond=123 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-27 21:03:21] [INFO ] Invariant cache hit.
[2024-05-27 21:03:21] [INFO ] After 108ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-27 21:03:22] [INFO ] [Nat]Absence check using 136 positive place invariants in 36 ms returned sat
[2024-05-27 21:03:22] [INFO ] After 417ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-27 21:03:22] [INFO ] After 490ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 41 ms.
[2024-05-27 21:03:22] [INFO ] After 674ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 2 out of 585 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 585/585 places, 505/505 transitions.
Free-agglomeration rule applied 168 times.
Iterating global reduction 0 with 168 rules applied. Total rules applied 168 place count 585 transition count 337
Reduce places removed 295 places and 0 transitions.
Graph (complete) has 350 edges and 290 vertex of which 74 are kept as prefixes of interest. Removing 216 places using SCC suffix rule.1 ms
Discarding 216 places :
Also discarding 252 output transitions
Drop transitions removed 252 transitions
Graph (trivial) has 72 edges and 74 vertex of which 37 / 74 are part of one of the 2 SCC in 0 ms
Free SCC test removed 35 places
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 315 rules applied. Total rules applied 483 place count 39 transition count 67
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 61 rules applied. Total rules applied 544 place count 21 transition count 24
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 545 place count 20 transition count 24
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 545 place count 20 transition count 23
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 547 place count 19 transition count 23
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 550 place count 16 transition count 20
Iterating global reduction 3 with 3 rules applied. Total rules applied 553 place count 16 transition count 20
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 555 place count 14 transition count 18
Iterating global reduction 3 with 2 rules applied. Total rules applied 557 place count 14 transition count 18
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 559 place count 12 transition count 15
Iterating global reduction 3 with 2 rules applied. Total rules applied 561 place count 12 transition count 15
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 562 place count 12 transition count 14
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 563 place count 11 transition count 13
Iterating global reduction 4 with 1 rules applied. Total rules applied 564 place count 11 transition count 13
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 565 place count 11 transition count 12
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 569 place count 9 transition count 10
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 570 place count 9 transition count 9
Free-agglomeration rule applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 572 place count 9 transition count 7
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 574 place count 7 transition count 7
Applied a total of 574 rules in 84 ms. Remains 7 /585 variables (removed 578) and now considering 7/505 (removed 498) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 7/585 places, 7/505 transitions.
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
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 221 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 106 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 163 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 510 reset in 1007 ms.
Product exploration explored 100000 steps with 513 reset in 992 ms.
Built C files in :
/tmp/ltsmin15402200107763938871
[2024-05-27 21:03:25] [INFO ] Computing symmetric may disable matrix : 505 transitions.
[2024-05-27 21:03:25] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 21:03:25] [INFO ] Computing symmetric may enable matrix : 505 transitions.
[2024-05-27 21:03:25] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 21:03:25] [INFO ] Computing Do-Not-Accords matrix : 505 transitions.
[2024-05-27 21:03:25] [INFO ] Computation of Completed DNA matrix. took 17 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 21:03:25] [INFO ] Built C files in 92ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15402200107763938871
Running compilation step : cd /tmp/ltsmin15402200107763938871;'/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 2317 ms.
Running link step : cd /tmp/ltsmin15402200107763938871;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 59 ms.
Running LTSmin : cd /tmp/ltsmin15402200107763938871;'/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/stateBased5713349160939090174.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 585 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 585/585 places, 505/505 transitions.
Applied a total of 0 rules in 24 ms. Remains 585 /585 variables (removed 0) and now considering 505/505 (removed 0) transitions.
[2024-05-27 21:03:40] [INFO ] Invariant cache hit.
[2024-05-27 21:03:40] [INFO ] Implicit Places using invariants in 481 ms returned []
[2024-05-27 21:03:40] [INFO ] Invariant cache hit.
[2024-05-27 21:03:41] [INFO ] Implicit Places using invariants and state equation in 894 ms returned []
Implicit Place search using SMT with State Equation took 1386 ms to find 0 implicit places.
[2024-05-27 21:03:41] [INFO ] Redundant transitions in 7 ms returned []
[2024-05-27 21:03:41] [INFO ] Invariant cache hit.
[2024-05-27 21:03:42] [INFO ] Dead Transitions using invariants and state equation in 680 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2120 ms. Remains : 585/585 places, 505/505 transitions.
Built C files in :
/tmp/ltsmin8081772457080617649
[2024-05-27 21:03:42] [INFO ] Computing symmetric may disable matrix : 505 transitions.
[2024-05-27 21:03:42] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 21:03:42] [INFO ] Computing symmetric may enable matrix : 505 transitions.
[2024-05-27 21:03:42] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 21:03:42] [INFO ] Computing Do-Not-Accords matrix : 505 transitions.
[2024-05-27 21:03:42] [INFO ] Computation of Completed DNA matrix. took 41 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 21:03:42] [INFO ] Built C files in 125ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8081772457080617649
Running compilation step : cd /tmp/ltsmin8081772457080617649;'/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 2027 ms.
Running link step : cd /tmp/ltsmin8081772457080617649;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 60 ms.
Running LTSmin : cd /tmp/ltsmin8081772457080617649;'/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/stateBased3324131995021928283.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-27 21:03:57] [INFO ] Flatten gal took : 34 ms
[2024-05-27 21:03:57] [INFO ] Flatten gal took : 31 ms
[2024-05-27 21:03:57] [INFO ] Time to serialize gal into /tmp/LTL12713013333215371319.gal : 7 ms
[2024-05-27 21:03:57] [INFO ] Time to serialize properties into /tmp/LTL4231666312336365425.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/LTL12713013333215371319.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16607124855485866160.hoa' '-atoms' '/tmp/LTL4231666312336365425.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/LTL4231666312336365425.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16607124855485866160.hoa
Detected timeout of ITS tools.
[2024-05-27 21:04:13] [INFO ] Flatten gal took : 28 ms
[2024-05-27 21:04:13] [INFO ] Flatten gal took : 27 ms
[2024-05-27 21:04:13] [INFO ] Time to serialize gal into /tmp/LTL1752851364455435234.gal : 5 ms
[2024-05-27 21:04:13] [INFO ] Time to serialize properties into /tmp/LTL18073476626672961221.ltl : 6 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/LTL1752851364455435234.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18073476626672961221.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 : !((G(F("((p243==0)||(p655==1))"))))
Formula 0 simplified : FG!"((p243==0)||(p655==1))"
Detected timeout of ITS tools.
[2024-05-27 21:04:28] [INFO ] Flatten gal took : 46 ms
[2024-05-27 21:04:28] [INFO ] Applying decomposition
[2024-05-27 21:04:28] [INFO ] Flatten gal took : 41 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/graph11570037218180221170.txt' '-o' '/tmp/graph11570037218180221170.bin' '-w' '/tmp/graph11570037218180221170.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph11570037218180221170.bin' '-l' '-1' '-v' '-w' '/tmp/graph11570037218180221170.weights' '-q' '0' '-e' '0.001'
[2024-05-27 21:04:28] [INFO ] Decomposing Gal with order
[2024-05-27 21:04:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 21:04:28] [INFO ] Removed a total of 109 redundant transitions.
[2024-05-27 21:04:28] [INFO ] Flatten gal took : 164 ms
[2024-05-27 21:04:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 64 labels/synchronizations in 25 ms.
[2024-05-27 21:04:28] [INFO ] Time to serialize gal into /tmp/LTL4771217346442155524.gal : 22 ms
[2024-05-27 21:04:28] [INFO ] Time to serialize properties into /tmp/LTL16561407130549043502.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/LTL4771217346442155524.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16561407130549043502.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 : !((G(F("((i0.i1.i0.u91.p243==0)||(i14.u217.p655==1))"))))
Formula 0 simplified : FG!"((i0.i1.i0.u91.p243==0)||(i14.u217.p655==1))"
Reverse transition relation is NOT exact ! Due to transitions i14.t410_t425, i14.t403_t425, i14.u217.t21, Intersection with reachable at each step enabled...205
Computing Next relation with stutter on 7.8311e+10 deadlock states
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
547 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,5.57613,184572,1,0,419214,595,6595,724114,302,1788,442822
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Parking-PT-832-LTLCardinality-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property Parking-PT-832-LTLCardinality-15 finished in 90146 ms.
All properties solved by simple procedures.
Total runtime 121773 ms.

BK_STOP 1716843876536

--------------------
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-832"
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-832, 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-171654421900057"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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