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.r512-smll-171654406900083.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 ltsminxred
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 r512-smll-171654406900083
=====================================================================

--------------------
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 1717246241353

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Parking-PT-432
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 12:50:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 12:50:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 12:50:43] [INFO ] Load time of PNML (sax parser for PT used): 279 ms
[2024-06-01 12:50:43] [INFO ] Transformed 529 places.
[2024-06-01 12:50:43] [INFO ] Transformed 785 transitions.
[2024-06-01 12:50:43] [INFO ] Found NUPN structural information;
[2024-06-01 12:50:43] [INFO ] Parsed PT model containing 529 places and 785 transitions and 2329 arcs in 456 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 17 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 133 ms. Remains 527 /529 variables (removed 2) and now considering 455/457 (removed 2) transitions.
// Phase 1: matrix 455 rows 527 cols
[2024-06-01 12:50:44] [INFO ] Computed 124 invariants in 27 ms
[2024-06-01 12:50:45] [INFO ] Implicit Places using invariants in 984 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 1038 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-06-01 12:50:45] [INFO ] Computed 88 invariants in 5 ms
[2024-06-01 12:50:45] [INFO ] Implicit Places using invariants in 362 ms returned []
[2024-06-01 12:50:45] [INFO ] Invariant cache hit.
[2024-06-01 12:50:45] [INFO ] State equation strengthened by 108 read => feed constraints.
[2024-06-01 12:50:46] [INFO ] Implicit Places using invariants and state equation in 1077 ms returned []
Implicit Place search using SMT with State Equation took 1442 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 2690 ms. Remains : 464/529 places, 428/457 transitions.
Support contains 24 out of 464 places after structural reductions.
[2024-06-01 12:50:46] [INFO ] Flatten gal took : 94 ms
[2024-06-01 12:50:46] [INFO ] Flatten gal took : 44 ms
[2024-06-01 12:50:47] [INFO ] Input system was already deterministic with 428 transitions.
RANDOM walk for 40000 steps (358 resets) in 2865 ms. (13 steps per ms) remains 3/15 properties
BEST_FIRST walk for 40004 steps (8 resets) in 227 ms. (175 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 232 ms. (171 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 228 ms. (174 steps per ms) remains 3/3 properties
[2024-06-01 12:50:48] [INFO ] Invariant cache hit.
[2024-06-01 12:50:48] [INFO ] State equation strengthened by 108 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 288/294 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/294 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 170/464 variables, 84/88 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/464 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 428/892 variables, 464/552 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/892 variables, 108/660 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/892 variables, 0/660 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/892 variables, 0/660 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 892/892 variables, and 660 constraints, problems are : Problem set: 0 solved, 3 unsolved in 712 ms.
Refiners :[Positive P Invariants (semi-flows): 88/88 constraints, State Equation: 464/464 constraints, ReadFeed: 108/108 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 288/294 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/294 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 170/464 variables, 84/88 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/464 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 428/892 variables, 464/552 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/892 variables, 108/660 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/892 variables, 3/663 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/892 variables, 0/663 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/892 variables, 0/663 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 892/892 variables, and 663 constraints, problems are : Problem set: 0 solved, 3 unsolved in 909 ms.
Refiners :[Positive P Invariants (semi-flows): 88/88 constraints, State Equation: 464/464 constraints, ReadFeed: 108/108 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 1661ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 1 properties in 936 ms.
Support contains 4 out of 464 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 464/464 places, 428/428 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) 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 2 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 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 124 place count 402 transition count 366
Free-agglomeration rule applied 112 times.
Iterating global reduction 2 with 112 rules applied. Total rules applied 236 place count 402 transition count 254
Reduce places removed 112 places and 0 transitions.
Graph (complete) has 600 edges and 290 vertex of which 221 are kept as prefixes of interest. Removing 69 places using SCC suffix rule.1 ms
Discarding 69 places :
Also discarding 57 output transitions
Drop transitions (Output transitions of discarded places.) removed 57 transitions
Iterating post reduction 2 with 113 rules applied. Total rules applied 349 place count 221 transition count 197
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 355 place count 221 transition count 191
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 358 place count 221 transition count 188
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 361 place count 218 transition count 188
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 362 place count 217 transition count 187
Reduce places removed 63 places and 0 transitions.
Graph (trivial) has 172 edges and 154 vertex of which 92 / 154 are part of one of the 3 SCC in 3 ms
Free SCC test removed 89 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 5 with 111 rules applied. Total rules applied 473 place count 65 transition count 140
Reduce places removed 50 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 123 transitions
Reduce isomorphic transitions removed 123 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 6 with 176 rules applied. Total rules applied 649 place count 15 transition count 14
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 7 with 5 rules applied. Total rules applied 654 place count 12 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 655 place count 11 transition count 12
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 2 Pre rules applied. Total rules applied 655 place count 11 transition count 10
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 659 place count 9 transition count 10
Free-agglomeration rule applied 2 times.
Iterating global reduction 9 with 2 rules applied. Total rules applied 661 place count 9 transition count 8
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 663 place count 7 transition count 8
Applied a total of 663 rules in 184 ms. Remains 7 /464 variables (removed 457) and now considering 8/428 (removed 420) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 184 ms. Remains : 7/464 places, 8/428 transitions.
RANDOM walk for 27 steps (0 resets) in 4 ms. (5 steps per ms) remains 0/2 properties
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.202405141337/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 (Trivial Post-Agglo cleanup.) 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 106 ms. Remains 403 /464 variables (removed 61) and now considering 367/428 (removed 61) transitions.
// Phase 1: matrix 367 rows 403 cols
[2024-06-01 12:50:51] [INFO ] Computed 88 invariants in 4 ms
[2024-06-01 12:50:51] [INFO ] Implicit Places using invariants in 306 ms returned [75, 90, 184, 373]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 308 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 32 ms. Remains 398 /399 variables (removed 1) and now considering 366/367 (removed 1) transitions.
// Phase 1: matrix 366 rows 398 cols
[2024-06-01 12:50:51] [INFO ] Computed 84 invariants in 3 ms
[2024-06-01 12:50:51] [INFO ] Implicit Places using invariants in 286 ms returned []
[2024-06-01 12:50:51] [INFO ] Invariant cache hit.
[2024-06-01 12:50:52] [INFO ] State equation strengthened by 156 read => feed constraints.
[2024-06-01 12:50:52] [INFO ] Implicit Places using invariants and state equation in 997 ms returned []
Implicit Place search using SMT with State Equation took 1286 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 1734 ms. Remains : 398/464 places, 366/428 transitions.
Stuttering acceptance computed with spot in 402 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), false]
Running random walk in product with property : Parking-PT-432-LTLCardinality-00
Product exploration explored 100000 steps with 8533 reset in 1162 ms.
Product exploration explored 100000 steps with 8567 reset in 1137 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 (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 6 factoid took 206 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 153 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), false]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 40000 steps (370 resets) in 439 ms. (90 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 131 ms. (303 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 172 ms. (231 steps per ms) remains 2/2 properties
[2024-06-01 12:50:56] [INFO ] Invariant cache hit.
[2024-06-01 12:50:56] [INFO ] State equation strengthened by 156 read => feed constraints.
Problem apf2 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 118/120 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 278/398 variables, 82/84 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/398 variables, 0/84 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 366/764 variables, 398/482 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/764 variables, 156/638 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/764 variables, 0/638 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/764 variables, 0/638 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 764/764 variables, and 638 constraints, problems are : Problem set: 1 solved, 1 unsolved in 355 ms.
Refiners :[Positive P Invariants (semi-flows): 84/84 constraints, State Equation: 398/398 constraints, ReadFeed: 156/156 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 118/120 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 278/398 variables, 82/84 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/398 variables, 0/84 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 366/764 variables, 398/482 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/764 variables, 156/638 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/764 variables, 1/639 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/764 variables, 0/639 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/764 variables, 0/639 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 764/764 variables, and 639 constraints, problems are : Problem set: 1 solved, 1 unsolved in 409 ms.
Refiners :[Positive P Invariants (semi-flows): 84/84 constraints, State Equation: 398/398 constraints, ReadFeed: 156/156 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 780ms problems are : Problem set: 1 solved, 1 unsolved
Finished Parikh walk after 100 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=50 )
Parikh walk visited 1 properties in 7 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (G (OR p0 (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1)]
Knowledge based reduction with 7 factoid took 299 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 70 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p1), (NOT p1)]
[2024-06-01 12:50:57] [INFO ] Invariant cache hit.
[2024-06-01 12:50:57] [INFO ] [Real]Absence check using 84 positive place invariants in 20 ms returned unsat
Proved EG (NOT p1)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (G (OR p0 (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (G (NOT p1))]
Property proved to be false thanks to negative knowledge :(G (NOT p1))
Knowledge based reduction with 7 factoid took 324 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 7081 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/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 19 ms. Remains 462 /464 variables (removed 2) and now considering 426/428 (removed 2) transitions.
// Phase 1: matrix 426 rows 462 cols
[2024-06-01 12:50:58] [INFO ] Computed 88 invariants in 3 ms
[2024-06-01 12:50:58] [INFO ] Implicit Places using invariants in 402 ms returned [103, 212, 428]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 404 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 17 ms. Remains 456 /459 variables (removed 3) and now considering 423/426 (removed 3) transitions.
// Phase 1: matrix 423 rows 456 cols
[2024-06-01 12:50:58] [INFO ] Computed 85 invariants in 3 ms
[2024-06-01 12:50:59] [INFO ] Implicit Places using invariants in 320 ms returned []
[2024-06-01 12:50:59] [INFO ] Invariant cache hit.
[2024-06-01 12:50:59] [INFO ] State equation strengthened by 108 read => feed constraints.
[2024-06-01 12:51:00] [INFO ] Implicit Places using invariants and state equation in 1069 ms returned []
Implicit Place search using SMT with State Equation took 1392 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 1833 ms. Remains : 456/464 places, 423/428 transitions.
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Parking-PT-432-LTLCardinality-02
Stuttering criterion allowed to conclude after 98 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 1931 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/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 (Trivial Post-Agglo cleanup.) 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 53 ms. Remains 403 /464 variables (removed 61) and now considering 367/428 (removed 61) transitions.
// Phase 1: matrix 367 rows 403 cols
[2024-06-01 12:51:00] [INFO ] Computed 88 invariants in 2 ms
[2024-06-01 12:51:00] [INFO ] Implicit Places using invariants in 341 ms returned [75, 90, 373]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 342 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 15 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 411 ms. Remains : 400/464 places, 367/428 transitions.
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Parking-PT-432-LTLCardinality-04
Product exploration explored 100000 steps with 927 reset in 598 ms.
Product exploration explored 100000 steps with 918 reset in 627 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 (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 8 factoid took 158 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))]
RANDOM walk for 35097 steps (323 resets) in 451 ms. (77 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 8 factoid took 271 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))]
Stuttering acceptance computed with spot in 71 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 15 ms. Remains 400 /400 variables (removed 0) and now considering 367/367 (removed 0) transitions.
// Phase 1: matrix 367 rows 400 cols
[2024-06-01 12:51:02] [INFO ] Computed 85 invariants in 2 ms
[2024-06-01 12:51:03] [INFO ] Implicit Places using invariants in 332 ms returned []
[2024-06-01 12:51:03] [INFO ] Invariant cache hit.
[2024-06-01 12:51:03] [INFO ] State equation strengthened by 152 read => feed constraints.
[2024-06-01 12:51:04] [INFO ] Implicit Places using invariants and state equation in 1027 ms returned []
Implicit Place search using SMT with State Equation took 1376 ms to find 0 implicit places.
[2024-06-01 12:51:04] [INFO ] Redundant transitions in 25 ms returned []
Running 366 sub problems to find dead transitions.
[2024-06-01 12:51:04] [INFO ] Invariant cache hit.
[2024-06-01 12:51:04] [INFO ] State equation strengthened by 152 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/399 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 1 (OVERLAPS) 1/400 variables, 85/85 constraints. Problems are: Problem set: 0 solved, 366 unsolved
[2024-06-01 12:51:11] [INFO ] Deduced a trap composed of 47 places in 78 ms of which 14 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/400 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 4 (OVERLAPS) 367/767 variables, 400/486 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/767 variables, 152/638 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/767 variables, 0/638 constraints. Problems are: Problem set: 0 solved, 366 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 767/767 variables, and 638 constraints, problems are : Problem set: 0 solved, 366 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 85/85 constraints, State Equation: 400/400 constraints, ReadFeed: 152/152 constraints, PredecessorRefiner: 366/366 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 366 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/399 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 1 (OVERLAPS) 1/400 variables, 85/85 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/400 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 4 (OVERLAPS) 367/767 variables, 400/486 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/767 variables, 152/638 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/767 variables, 366/1004 constraints. Problems are: Problem set: 0 solved, 366 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 1)
(s3 0)
(s4 1)
(s5 0)
(s6 1)
(s7 0)
(s8 1)
(s9 0)
(s10 1)
(s11 1)
(s12 0)
(s13 0)
(s14 1)
(s15 0)
(s16 1)
(s17 1)
(s18 0)
(s19 1)
(s20 0)
(s21 0)
(s22 1)
(s23 0)
(s24 1)
(s25 0)
(s26 1)
(s27 1)
(s28 0)
(s29 0)
(s30 1)
(s31 1)
(s32 0)
(s33 0)
(s34 1)
(s35 1)
(s36 0)
(s37 0)
(s38 1)
(s39 1)
(s40 0)
(s41 0)
(s42 1)
(s43 1)
(s44 0)
(s45 0)
(s46 1)
(s47 0)
(s48 1)
(s49 0)
(s50 1)
(s51 0)
(s52 1)
(s53 0)
(s54 1)
(s55 1)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 1)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 1)
(s118 0)
(s119 1)
(s120 0)
(s121 1)
(s122 0)
(s123 1)
(s124 0)
(s125 1)
(s126 0)
(s127 1)
(s128 0)
(s129 1)
(s130 0)
(s131 1)
(s132 0)
(s133 1)
(s134 0)
(s135 1)
(s136 0)
(s137 1)
(s138 0)
(s139 1)
(s140 0)
(s141 1)
(s142 0)
(s143 1)
(s144 0)
(s145 1)
(s146 0)
(s147 1)
(s148 0)
(s149 1)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 1)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 1)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 1)
(s214 1)
(s215 0)
(s216 0)
(s217 1)
(s218 1)
(s219 0)
(s220 0)
(s221 1)
(s222 1)
(s223 0)
(s224 0)
(s225 1)
(s226 1)
(s227 0)
(s228 0)
(s229 1)
(s230 1)
(s231 0)
(s232 0)
(s233 1)
(s234 1)
(s235 0)
(s236 0)
(s237 1)
(s238 1)
(s239 0)
(s240 0)
(s241 1)
(s242 1)
(s243 0)
(s244 0)
(s245 1)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 1)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 1)
(s307 1)
(s308 0)
(s309 0)
(s310 1)
(s311 0)
(s312 1)
(s313 0)
(s314 1)
(s315 1)
(s316 0)
(s317 0)
(s318 1)
(s319 1)
(s320 0)
(s321 0)
(s322 1)
(s323 1)
(s324 0)
(s325 0)
(s326 1)
(s327 1)
(s328 0)
(s329 0)
(s330 1)
(s331 1)
(s332 0)
(s333 0)
(s334 1)
(s335 1)
(s336 0)
(s337 0)
(s338 1)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 767/767 variables, and 1004 constraints, problems are : Problem set: 0 solved, 366 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 85/85 constraints, State Equation: 400/400 constraints, ReadFeed: 152/152 constraints, PredecessorRefiner: 366/366 constraints, Known Traps: 1/1 constraints]
After SMT, in 60248ms problems are : Problem set: 0 solved, 366 unsolved
Search for dead transitions found 0 dead transitions in 60260ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61686 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 (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 8 factoid took 229 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 104 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (365 resets) in 401 ms. (99 steps per ms) remains 1/4 properties
BEST_FIRST walk for 37707 steps (8 resets) in 118 ms. (316 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 8 factoid took 407 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 105 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 925 reset in 748 ms.
Product exploration explored 100000 steps with 921 reset in 908 ms.
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 19 ms. Remains 400 /400 variables (removed 0) and now considering 367/367 (removed 0) transitions.
[2024-06-01 12:52:07] [INFO ] Invariant cache hit.
[2024-06-01 12:52:07] [INFO ] Implicit Places using invariants in 373 ms returned []
[2024-06-01 12:52:07] [INFO ] Invariant cache hit.
[2024-06-01 12:52:08] [INFO ] State equation strengthened by 152 read => feed constraints.
[2024-06-01 12:52:09] [INFO ] Implicit Places using invariants and state equation in 1398 ms returned []
Implicit Place search using SMT with State Equation took 1773 ms to find 0 implicit places.
[2024-06-01 12:52:09] [INFO ] Redundant transitions in 8 ms returned []
Running 366 sub problems to find dead transitions.
[2024-06-01 12:52:09] [INFO ] Invariant cache hit.
[2024-06-01 12:52:09] [INFO ] State equation strengthened by 152 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/399 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 1 (OVERLAPS) 1/400 variables, 85/85 constraints. Problems are: Problem set: 0 solved, 366 unsolved
[2024-06-01 12:52:18] [INFO ] Deduced a trap composed of 47 places in 60 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/400 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 4 (OVERLAPS) 367/767 variables, 400/486 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/767 variables, 152/638 constraints. Problems are: Problem set: 0 solved, 366 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 767/767 variables, and 638 constraints, problems are : Problem set: 0 solved, 366 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 85/85 constraints, State Equation: 400/400 constraints, ReadFeed: 152/152 constraints, PredecessorRefiner: 366/366 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 366 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/399 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 1 (OVERLAPS) 1/400 variables, 85/85 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/400 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 4 (OVERLAPS) 367/767 variables, 400/486 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/767 variables, 152/638 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/767 variables, 366/1004 constraints. Problems are: Problem set: 0 solved, 366 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 767/767 variables, and 1004 constraints, problems are : Problem set: 0 solved, 366 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 85/85 constraints, State Equation: 400/400 constraints, ReadFeed: 152/152 constraints, PredecessorRefiner: 366/366 constraints, Known Traps: 1/1 constraints]
After SMT, in 60168ms problems are : Problem set: 0 solved, 366 unsolved
Search for dead transitions found 0 dead transitions in 60177ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61986 ms. Remains : 400/400 places, 367/367 transitions.
Treatment of property Parking-PT-432-LTLCardinality-04 finished in 129357 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/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 21 ms. Remains 461 /464 variables (removed 3) and now considering 425/428 (removed 3) transitions.
// Phase 1: matrix 425 rows 461 cols
[2024-06-01 12:53:09] [INFO ] Computed 88 invariants in 3 ms
[2024-06-01 12:53:10] [INFO ] Implicit Places using invariants in 437 ms returned [83, 103, 212]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 441 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 21 ms. Remains 455 /458 variables (removed 3) and now considering 422/425 (removed 3) transitions.
// Phase 1: matrix 422 rows 455 cols
[2024-06-01 12:53:10] [INFO ] Computed 85 invariants in 4 ms
[2024-06-01 12:53:10] [INFO ] Implicit Places using invariants in 457 ms returned []
[2024-06-01 12:53:10] [INFO ] Invariant cache hit.
[2024-06-01 12:53:10] [INFO ] State equation strengthened by 108 read => feed constraints.
[2024-06-01 12:53:11] [INFO ] Implicit Places using invariants and state equation in 1302 ms returned []
Implicit Place search using SMT with State Equation took 1761 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 2247 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
Product exploration explored 100000 steps with 50000 reset in 1496 ms.
Product exploration explored 100000 steps with 50000 reset in 1464 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)]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 12 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 5334 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/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-06-01 12:53:14] [INFO ] Computed 88 invariants in 2 ms
[2024-06-01 12:53:15] [INFO ] Implicit Places using invariants in 359 ms returned [83, 103, 212, 428]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 360 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-06-01 12:53:15] [INFO ] Computed 84 invariants in 2 ms
[2024-06-01 12:53:15] [INFO ] Implicit Places using invariants in 613 ms returned []
[2024-06-01 12:53:15] [INFO ] Invariant cache hit.
[2024-06-01 12:53:16] [INFO ] State equation strengthened by 108 read => feed constraints.
[2024-06-01 12:53:17] [INFO ] Implicit Places using invariants and state equation in 1550 ms returned []
Implicit Place search using SMT with State Equation took 2166 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 2551 ms. Remains : 453/464 places, 421/428 transitions.
Stuttering acceptance computed with spot in 270 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
Product exploration explored 100000 steps with 50000 reset in 1678 ms.
Product exploration explored 100000 steps with 50000 reset in 1460 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 p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 14 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 5995 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/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 (Trivial Post-Agglo cleanup.) 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 42 ms. Remains 400 /464 variables (removed 64) and now considering 364/428 (removed 64) transitions.
// Phase 1: matrix 364 rows 400 cols
[2024-06-01 12:53:20] [INFO ] Computed 88 invariants in 2 ms
[2024-06-01 12:53:21] [INFO ] Implicit Places using invariants in 282 ms returned [74, 89, 183, 370]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 283 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 10 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 335 ms. Remains : 396/464 places, 364/428 transitions.
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Parking-PT-432-LTLCardinality-09
Product exploration explored 100000 steps with 955 reset in 737 ms.
Product exploration explored 100000 steps with 957 reset in 568 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 86 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 74 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 4675 steps (42 resets) in 36 ms. (126 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 122 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 79 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 87 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-06-01 12:53:23] [INFO ] Computed 84 invariants in 2 ms
[2024-06-01 12:53:23] [INFO ] Implicit Places using invariants in 486 ms returned []
[2024-06-01 12:53:23] [INFO ] Invariant cache hit.
[2024-06-01 12:53:24] [INFO ] Implicit Places using invariants and state equation in 862 ms returned []
Implicit Place search using SMT with State Equation took 1351 ms to find 0 implicit places.
[2024-06-01 12:53:24] [INFO ] Redundant transitions in 6 ms returned []
Running 248 sub problems to find dead transitions.
[2024-06-01 12:53:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 2 (OVERLAPS) 4/396 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/396 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 4 (OVERLAPS) 364/760 variables, 396/480 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/760 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 6 (OVERLAPS) 0/760 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 248 unsolved
No progress, stopping.
After SMT solving in domain Real declared 760/760 variables, and 480 constraints, problems are : Problem set: 0 solved, 248 unsolved in 25849 ms.
Refiners :[Positive P Invariants (semi-flows): 84/84 constraints, State Equation: 396/396 constraints, PredecessorRefiner: 248/248 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 248 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 2 (OVERLAPS) 4/396 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/396 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 4 (OVERLAPS) 364/760 variables, 396/480 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/760 variables, 248/728 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/760 variables, 0/728 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 7 (OVERLAPS) 0/760 variables, 0/728 constraints. Problems are: Problem set: 0 solved, 248 unsolved
No progress, stopping.
After SMT solving in domain Int declared 760/760 variables, and 728 constraints, problems are : Problem set: 0 solved, 248 unsolved in 26743 ms.
Refiners :[Positive P Invariants (semi-flows): 84/84 constraints, State Equation: 396/396 constraints, PredecessorRefiner: 248/248 constraints, Known Traps: 0/0 constraints]
After SMT, in 52657ms problems are : Problem set: 0 solved, 248 unsolved
Search for dead transitions found 0 dead transitions in 52664ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 54039 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 73 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 83 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 3601 steps (31 resets) in 25 ms. (138 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 113 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 76 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 959 reset in 697 ms.
Product exploration explored 100000 steps with 955 reset in 547 ms.
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 8 ms. Remains 396 /396 variables (removed 0) and now considering 364/364 (removed 0) transitions.
[2024-06-01 12:54:19] [INFO ] Invariant cache hit.
[2024-06-01 12:54:19] [INFO ] Implicit Places using invariants in 325 ms returned []
[2024-06-01 12:54:19] [INFO ] Invariant cache hit.
[2024-06-01 12:54:19] [INFO ] Implicit Places using invariants and state equation in 594 ms returned []
Implicit Place search using SMT with State Equation took 925 ms to find 0 implicit places.
[2024-06-01 12:54:19] [INFO ] Redundant transitions in 2 ms returned []
Running 248 sub problems to find dead transitions.
[2024-06-01 12:54:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 2 (OVERLAPS) 4/396 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/396 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 4 (OVERLAPS) 364/760 variables, 396/480 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/760 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 6 (OVERLAPS) 0/760 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 248 unsolved
No progress, stopping.
After SMT solving in domain Real declared 760/760 variables, and 480 constraints, problems are : Problem set: 0 solved, 248 unsolved in 25138 ms.
Refiners :[Positive P Invariants (semi-flows): 84/84 constraints, State Equation: 396/396 constraints, PredecessorRefiner: 248/248 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 248 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 2 (OVERLAPS) 4/396 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/396 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 4 (OVERLAPS) 364/760 variables, 396/480 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/760 variables, 248/728 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/760 variables, 0/728 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 7 (OVERLAPS) 0/760 variables, 0/728 constraints. Problems are: Problem set: 0 solved, 248 unsolved
No progress, stopping.
After SMT solving in domain Int declared 760/760 variables, and 728 constraints, problems are : Problem set: 0 solved, 248 unsolved in 28382 ms.
Refiners :[Positive P Invariants (semi-flows): 84/84 constraints, State Equation: 396/396 constraints, PredecessorRefiner: 248/248 constraints, Known Traps: 0/0 constraints]
After SMT, in 53582ms problems are : Problem set: 0 solved, 248 unsolved
Search for dead transitions found 0 dead transitions in 53588ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 54534 ms. Remains : 396/396 places, 364/364 transitions.
Treatment of property Parking-PT-432-LTLCardinality-09 finished in 112704 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/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 (Trivial Post-Agglo cleanup.) 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 29 ms. Remains 400 /464 variables (removed 64) and now considering 364/428 (removed 64) transitions.
// Phase 1: matrix 364 rows 400 cols
[2024-06-01 12:55:13] [INFO ] Computed 88 invariants in 1 ms
[2024-06-01 12:55:14] [INFO ] Implicit Places using invariants in 387 ms returned [74, 89, 183, 370]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 402 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 13 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 444 ms. Remains : 396/464 places, 364/428 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Running random walk in product with property : Parking-PT-432-LTLCardinality-12
Stuttering criterion allowed to conclude after 115 steps with 0 reset in 2 ms.
FORMULA Parking-PT-432-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-432-LTLCardinality-12 finished in 522 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/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 18 ms. Remains 461 /464 variables (removed 3) and now considering 425/428 (removed 3) transitions.
// Phase 1: matrix 425 rows 461 cols
[2024-06-01 12:55:14] [INFO ] Computed 88 invariants in 4 ms
[2024-06-01 12:55:14] [INFO ] Implicit Places using invariants in 395 ms returned [83, 212, 428]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 397 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 14 ms. Remains 455 /458 variables (removed 3) and now considering 422/425 (removed 3) transitions.
// Phase 1: matrix 422 rows 455 cols
[2024-06-01 12:55:14] [INFO ] Computed 85 invariants in 1 ms
[2024-06-01 12:55:14] [INFO ] Implicit Places using invariants in 338 ms returned []
[2024-06-01 12:55:14] [INFO ] Invariant cache hit.
[2024-06-01 12:55:15] [INFO ] State equation strengthened by 108 read => feed constraints.
[2024-06-01 12:55:16] [INFO ] Implicit Places using invariants and state equation in 1172 ms returned []
Implicit Place search using SMT with State Equation took 1523 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 1953 ms. Remains : 455/464 places, 422/428 transitions.
Stuttering acceptance computed with spot in 266 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
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 2243 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/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 21 ms. Remains 461 /464 variables (removed 3) and now considering 425/428 (removed 3) transitions.
// Phase 1: matrix 425 rows 461 cols
[2024-06-01 12:55:16] [INFO ] Computed 88 invariants in 3 ms
[2024-06-01 12:55:16] [INFO ] Implicit Places using invariants in 495 ms returned [83, 103, 212, 428]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 497 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 19 ms. Remains 453 /457 variables (removed 4) and now considering 421/425 (removed 4) transitions.
// Phase 1: matrix 421 rows 453 cols
[2024-06-01 12:55:16] [INFO ] Computed 84 invariants in 3 ms
[2024-06-01 12:55:17] [INFO ] Implicit Places using invariants in 480 ms returned []
[2024-06-01 12:55:17] [INFO ] Invariant cache hit.
[2024-06-01 12:55:17] [INFO ] State equation strengthened by 108 read => feed constraints.
[2024-06-01 12:55:18] [INFO ] Implicit Places using invariants and state equation in 1492 ms returned []
Implicit Place search using SMT with State Equation took 1977 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 2518 ms. Remains : 453/464 places, 421/428 transitions.
Stuttering acceptance computed with spot in 149 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Parking-PT-432-LTLCardinality-15
Stuttering criterion allowed to conclude after 97 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 2758 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(p0)||F(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2024-06-01 12:55:19] [INFO ] Flatten gal took : 58 ms
[2024-06-01 12:55:19] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 4 ms.
[2024-06-01 12:55:19] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 464 places, 428 transitions and 1415 arcs took 19 ms.
Total runtime 276716 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA Parking-PT-432-LTLCardinality-04 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA Parking-PT-432-LTLCardinality-09 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717247436835

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name Parking-PT-432-LTLCardinality-04
ltl formula formula --ltl=/tmp/1142/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 464 places, 428 transitions and 1415 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.080 real 0.030 user 0.020 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1142/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1142/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1142/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1142/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 465 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 465, there are 493 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~109 levels ~10000 states ~61372 transitions
pnml2lts-mc( 0/ 4): ~109 levels ~20000 states ~115384 transitions
pnml2lts-mc( 0/ 4): ~109 levels ~40000 states ~233832 transitions
pnml2lts-mc( 0/ 4): ~109 levels ~80000 states ~490160 transitions
pnml2lts-mc( 0/ 4): ~109 levels ~160000 states ~1045936 transitions
pnml2lts-mc( 2/ 4): ~189 levels ~320000 states ~2204864 transitions
pnml2lts-mc( 2/ 4): ~189 levels ~640000 states ~4752532 transitions
pnml2lts-mc( 2/ 4): ~189 levels ~1280000 states ~10220780 transitions
pnml2lts-mc( 0/ 4): ~109 levels ~2560000 states ~21620576 transitions
pnml2lts-mc( 0/ 4): ~109 levels ~5120000 states ~45786644 transitions
pnml2lts-mc( 3/ 4): ~172 levels ~10240000 states ~93613116 transitions
pnml2lts-mc( 3/ 4): ~487 levels ~20480000 states ~188706340 transitions
pnml2lts-mc( 2/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 33486137
pnml2lts-mc( 0/ 4): unique states count: 33534070
pnml2lts-mc( 0/ 4): unique transitions count: 336175644
pnml2lts-mc( 0/ 4): - self-loop count: 91
pnml2lts-mc( 0/ 4): - claim dead count: 302562344
pnml2lts-mc( 0/ 4): - claim found count: 58382
pnml2lts-mc( 0/ 4): - claim success count: 33534076
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1041
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33534076 states 336175997 transitions, fanout: 10.025
pnml2lts-mc( 0/ 4): Total exploration time 455.100 sec (455.030 sec minimum, 455.062 sec on average)
pnml2lts-mc( 0/ 4): States per second: 73685, Transitions per second: 738686
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 258.5MB, 8.1 B/state, compr.: 0.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/3.0%
pnml2lts-mc( 0/ 4): Stored 431 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 258.5MB (~256.0MB paged-in)
ltl formula name Parking-PT-432-LTLCardinality-09
ltl formula formula --ltl=/tmp/1142/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 464 places, 428 transitions and 1415 arcs
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.070 real 0.020 user 0.010 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1142/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1142/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1142/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1142/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 466 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 465, there are 433 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~119 levels ~10000 states ~63172 transitions
pnml2lts-mc( 1/ 4): ~109 levels ~20000 states ~123004 transitions
pnml2lts-mc( 0/ 4): ~193 levels ~40000 states ~249176 transitions
pnml2lts-mc( 0/ 4): ~193 levels ~80000 states ~530864 transitions
pnml2lts-mc( 0/ 4): ~193 levels ~160000 states ~1096096 transitions
pnml2lts-mc( 0/ 4): ~193 levels ~320000 states ~2308340 transitions
pnml2lts-mc( 0/ 4): ~193 levels ~640000 states ~4907076 transitions
pnml2lts-mc( 0/ 4): ~193 levels ~1280000 states ~10423688 transitions
pnml2lts-mc( 0/ 4): ~193 levels ~2560000 states ~21499260 transitions
pnml2lts-mc( 0/ 4): ~193 levels ~5120000 states ~45537036 transitions
pnml2lts-mc( 0/ 4): ~193 levels ~10240000 states ~96173116 transitions
pnml2lts-mc( 0/ 4): ~193 levels ~20480000 states ~202566004 transitions
pnml2lts-mc( 0/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 33534930
pnml2lts-mc( 0/ 4): unique states count: 33535413
pnml2lts-mc( 0/ 4): unique transitions count: 346424865
pnml2lts-mc( 0/ 4): - self-loop count: 17
pnml2lts-mc( 0/ 4): - claim dead count: 312870343
pnml2lts-mc( 0/ 4): - claim found count: 26
pnml2lts-mc( 0/ 4): - claim success count: 33535419
pnml2lts-mc( 0/ 4): - cum. max stack depth: 544
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33535419 states 346425219 transitions, fanout: 10.330
pnml2lts-mc( 0/ 4): Total exploration time 460.440 sec (460.400 sec minimum, 460.410 sec on average)
pnml2lts-mc( 0/ 4): States per second: 72833, Transitions per second: 752379
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 256.7MB, 8.0 B/state, compr.: 0.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/1.0%
pnml2lts-mc( 0/ 4): Stored 431 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 256.7MB (~256.0MB paged-in)

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="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
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 r512-smll-171654406900083"
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 ;