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.r468-smll-171620167500363.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 AutonomousCar-PT-10a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r468-smll-171620167500363
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K 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 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 17:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 17:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 171K Apr 12 17:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Apr 12 17:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Apr 12 17:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.5M May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME AutonomousCar-PT-10a-LTLCardinality-00
FORMULA_NAME AutonomousCar-PT-10a-LTLCardinality-01
FORMULA_NAME AutonomousCar-PT-10a-LTLCardinality-02
FORMULA_NAME AutonomousCar-PT-10a-LTLCardinality-03
FORMULA_NAME AutonomousCar-PT-10a-LTLCardinality-04
FORMULA_NAME AutonomousCar-PT-10a-LTLCardinality-05
FORMULA_NAME AutonomousCar-PT-10a-LTLCardinality-06
FORMULA_NAME AutonomousCar-PT-10a-LTLCardinality-07
FORMULA_NAME AutonomousCar-PT-10a-LTLCardinality-08
FORMULA_NAME AutonomousCar-PT-10a-LTLCardinality-09
FORMULA_NAME AutonomousCar-PT-10a-LTLCardinality-10
FORMULA_NAME AutonomousCar-PT-10a-LTLCardinality-11
FORMULA_NAME AutonomousCar-PT-10a-LTLCardinality-12
FORMULA_NAME AutonomousCar-PT-10a-LTLCardinality-13
FORMULA_NAME AutonomousCar-PT-10a-LTLCardinality-14
FORMULA_NAME AutonomousCar-PT-10a-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717225053597

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-10a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 06:57:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 06:57:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 06:57:35] [INFO ] Load time of PNML (sax parser for PT used): 386 ms
[2024-06-01 06:57:35] [INFO ] Transformed 97 places.
[2024-06-01 06:57:35] [INFO ] Transformed 1921 transitions.
[2024-06-01 06:57:35] [INFO ] Found NUPN structural information;
[2024-06-01 06:57:35] [INFO ] Parsed PT model containing 97 places and 1921 transitions and 29152 arcs in 586 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 423 transitions
Reduce redundant transitions removed 423 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA AutonomousCar-PT-10a-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-10a-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-10a-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-10a-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-10a-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-10a-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-10a-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 97 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 1498/1498 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 92 transition count 1443
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 92 transition count 1443
Applied a total of 10 rules in 79 ms. Remains 92 /97 variables (removed 5) and now considering 1443/1498 (removed 55) transitions.
[2024-06-01 06:57:36] [INFO ] Flow matrix only has 1442 transitions (discarded 1 similar events)
// Phase 1: matrix 1442 rows 92 cols
[2024-06-01 06:57:36] [INFO ] Computed 15 invariants in 57 ms
[2024-06-01 06:57:37] [INFO ] Implicit Places using invariants in 1414 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1465 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 91/97 places, 1443/1498 transitions.
Applied a total of 0 rules in 16 ms. Remains 91 /91 variables (removed 0) and now considering 1443/1443 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1585 ms. Remains : 91/97 places, 1443/1498 transitions.
Support contains 30 out of 91 places after structural reductions.
[2024-06-01 06:57:38] [INFO ] Flatten gal took : 606 ms
[2024-06-01 06:57:39] [INFO ] Flatten gal took : 342 ms
[2024-06-01 06:57:39] [INFO ] Input system was already deterministic with 1443 transitions.
Support contains 29 out of 91 places (down from 30) after GAL structural reductions.
RANDOM walk for 40000 steps (1844 resets) in 5192 ms. (7 steps per ms) remains 4/18 properties
BEST_FIRST walk for 40003 steps (128 resets) in 235 ms. (169 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (135 resets) in 224 ms. (177 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (126 resets) in 168 ms. (236 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (127 resets) in 186 ms. (213 steps per ms) remains 4/4 properties
[2024-06-01 06:57:41] [INFO ] Flow matrix only has 1442 transitions (discarded 1 similar events)
// Phase 1: matrix 1442 rows 91 cols
[2024-06-01 06:57:41] [INFO ] Computed 14 invariants in 22 ms
[2024-06-01 06:57:41] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 35/45 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 46/91 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1441/1532 variables, 91/105 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1532 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 1/1533 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1533 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/1533 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1533/1533 variables, and 106 constraints, problems are : Problem set: 0 solved, 4 unsolved in 930 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 91/91 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 35/45 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 46/91 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1441/1532 variables, 91/105 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1532 variables, 4/109 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1532 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 1/1533 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1533 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/1533 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1533/1533 variables, and 110 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2119 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 91/91 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 3254ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 3 properties in 13687 ms.
Support contains 2 out of 91 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 1443/1443 transitions.
Graph (complete) has 1162 edges and 91 vertex of which 89 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.31 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 89 transition count 1429
Reduce places removed 10 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 11 rules applied. Total rules applied 24 place count 79 transition count 1428
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 25 place count 78 transition count 1428
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 25 place count 78 transition count 1427
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 27 place count 77 transition count 1427
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 32 place count 72 transition count 1372
Iterating global reduction 3 with 5 rules applied. Total rules applied 37 place count 72 transition count 1372
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 41 place count 70 transition count 1370
Free-agglomeration rule applied 9 times.
Iterating global reduction 3 with 9 rules applied. Total rules applied 50 place count 70 transition count 1361
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 3 with 99 rules applied. Total rules applied 149 place count 61 transition count 1271
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 150 place count 61 transition count 1271
Applied a total of 150 rules in 684 ms. Remains 61 /91 variables (removed 30) and now considering 1271/1443 (removed 172) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 685 ms. Remains : 61/91 places, 1271/1443 transitions.
RANDOM walk for 40000 steps (14 resets) in 1341 ms. (29 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (15 resets) in 196 ms. (203 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 638718 steps, run timeout after 3001 ms. (steps per millisecond=212 ) properties seen :0 out of 1
Probabilistic random walk after 638718 steps, saw 91982 distinct states, run finished after 3008 ms. (steps per millisecond=212 ) properties seen :0
// Phase 1: matrix 1271 rows 61 cols
[2024-06-01 06:58:02] [INFO ] Computed 14 invariants in 12 ms
[2024-06-01 06:58:02] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 53/61 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1271/1332 variables, 61/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1332 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1332 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/1332 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1332/1332 variables, and 76 constraints, problems are : Problem set: 0 solved, 1 unsolved in 517 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 61/61 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 53/61 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1271/1332 variables, 61/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1332 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1332 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1332 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/1332 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1332/1332 variables, and 77 constraints, problems are : Problem set: 0 solved, 1 unsolved in 716 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 61/61 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1295ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 708 ms.
Support contains 2 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 1271/1271 transitions.
Applied a total of 0 rules in 113 ms. Remains 61 /61 variables (removed 0) and now considering 1271/1271 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 114 ms. Remains : 61/61 places, 1271/1271 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 1271/1271 transitions.
Applied a total of 0 rules in 103 ms. Remains 61 /61 variables (removed 0) and now considering 1271/1271 (removed 0) transitions.
[2024-06-01 06:58:04] [INFO ] Invariant cache hit.
[2024-06-01 06:58:05] [INFO ] Implicit Places using invariants in 694 ms returned []
[2024-06-01 06:58:05] [INFO ] Invariant cache hit.
[2024-06-01 06:58:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 06:58:06] [INFO ] Implicit Places using invariants and state equation in 1114 ms returned [59]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1814 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 60/61 places, 1271/1271 transitions.
Applied a total of 0 rules in 92 ms. Remains 60 /60 variables (removed 0) and now considering 1271/1271 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2010 ms. Remains : 60/61 places, 1271/1271 transitions.
RANDOM walk for 40000 steps (19 resets) in 3713 ms. (10 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (15 resets) in 127 ms. (312 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 660326 steps, run timeout after 3001 ms. (steps per millisecond=220 ) properties seen :0 out of 1
Probabilistic random walk after 660326 steps, saw 94663 distinct states, run finished after 3001 ms. (steps per millisecond=220 ) properties seen :0
// Phase 1: matrix 1271 rows 60 cols
[2024-06-01 06:58:10] [INFO ] Computed 13 invariants in 10 ms
[2024-06-01 06:58:10] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 50/58 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1271/1329 variables, 58/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1329 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1329 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/1331 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1331 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1331 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1331/1331 variables, and 74 constraints, problems are : Problem set: 0 solved, 1 unsolved in 477 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 60/60 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 50/58 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:58:12] [INFO ] Deduced a trap composed of 4 places in 794 ms of which 13 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1271/1329 variables, 58/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1329 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1329 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/1331 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1331 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1331 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1331 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1331/1331 variables, and 76 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1586 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 60/60 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 2113ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 500 ms.
Support contains 2 out of 60 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 1271/1271 transitions.
Applied a total of 0 rules in 91 ms. Remains 60 /60 variables (removed 0) and now considering 1271/1271 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91 ms. Remains : 60/60 places, 1271/1271 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 1271/1271 transitions.
Applied a total of 0 rules in 84 ms. Remains 60 /60 variables (removed 0) and now considering 1271/1271 (removed 0) transitions.
[2024-06-01 06:58:13] [INFO ] Invariant cache hit.
[2024-06-01 06:58:14] [INFO ] Implicit Places using invariants in 637 ms returned []
[2024-06-01 06:58:14] [INFO ] Invariant cache hit.
[2024-06-01 06:58:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 06:58:15] [INFO ] Implicit Places using invariants and state equation in 1106 ms returned []
Implicit Place search using SMT with State Equation took 1750 ms to find 0 implicit places.
[2024-06-01 06:58:15] [INFO ] Redundant transitions in 148 ms returned []
Running 1270 sub problems to find dead transitions.
[2024-06-01 06:58:15] [INFO ] Invariant cache hit.
[2024-06-01 06:58:15] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1270 unsolved
At refinement iteration 1 (OVERLAPS) 1/60 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1270 unsolved
[2024-06-01 06:58:54] [INFO ] Deduced a trap composed of 23 places in 1017 ms of which 6 ms to minimize.
[2024-06-01 06:58:55] [INFO ] Deduced a trap composed of 4 places in 1040 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 1270 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1270 unsolved
SMT process timed out in 53515ms, After SMT, problems are : Problem set: 0 solved, 1270 unsolved
Search for dead transitions found 0 dead transitions in 53546ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55551 ms. Remains : 60/60 places, 1271/1271 transitions.
Attempting over-approximation, by ignoring read arcs.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 59 transition count 1270
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 59 transition count 1270
Applied a total of 2 rules in 117 ms. Remains 59 /60 variables (removed 1) and now considering 1270/1271 (removed 1) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1270 rows 59 cols
[2024-06-01 06:59:09] [INFO ] Computed 13 invariants in 10 ms
[2024-06-01 06:59:09] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 06:59:09] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2024-06-01 06:59:09] [INFO ] After 545ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 06:59:09] [INFO ] After 652ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 06:59:09] [INFO ] After 775ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 975 ms.
Computed a total of 2 stabilizing places and 2 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' '!(G(F(p0)))'
Support contains 4 out of 91 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 91/91 places, 1443/1443 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 91 transition count 1433
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 81 transition count 1433
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 25 place count 76 transition count 1388
Iterating global reduction 2 with 5 rules applied. Total rules applied 30 place count 76 transition count 1388
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 32 place count 75 transition count 1387
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 34 place count 74 transition count 1387
Applied a total of 34 rules in 412 ms. Remains 74 /91 variables (removed 17) and now considering 1387/1443 (removed 56) transitions.
// Phase 1: matrix 1387 rows 74 cols
[2024-06-01 06:59:10] [INFO ] Computed 13 invariants in 12 ms
[2024-06-01 06:59:11] [INFO ] Implicit Places using invariants in 665 ms returned []
[2024-06-01 06:59:11] [INFO ] Invariant cache hit.
[2024-06-01 06:59:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 06:59:12] [INFO ] Implicit Places using invariants and state equation in 1152 ms returned [70, 72]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1823 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 72/91 places, 1387/1443 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 72 transition count 1386
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 71 transition count 1386
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 70 transition count 1385
Applied a total of 4 rules in 237 ms. Remains 70 /72 variables (removed 2) and now considering 1385/1387 (removed 2) transitions.
// Phase 1: matrix 1385 rows 70 cols
[2024-06-01 06:59:12] [INFO ] Computed 11 invariants in 15 ms
[2024-06-01 06:59:13] [INFO ] Implicit Places using invariants in 663 ms returned []
[2024-06-01 06:59:13] [INFO ] Invariant cache hit.
[2024-06-01 06:59:13] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-01 06:59:14] [INFO ] Implicit Places using invariants and state equation in 1097 ms returned []
Implicit Place search using SMT with State Equation took 1766 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 70/91 places, 1385/1443 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4239 ms. Remains : 70/91 places, 1385/1443 transitions.
Stuttering acceptance computed with spot in 259 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-10a-LTLCardinality-00
Stuttering criterion allowed to conclude after 36 steps with 3 reset in 8 ms.
FORMULA AutonomousCar-PT-10a-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-10a-LTLCardinality-00 finished in 4589 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(G(p0))&&((p1&&F(!p1)) U G(p2))))'
Support contains 5 out of 91 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 91/91 places, 1443/1443 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 86 transition count 1398
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 86 transition count 1398
Applied a total of 10 rules in 23 ms. Remains 86 /91 variables (removed 5) and now considering 1398/1443 (removed 45) transitions.
// Phase 1: matrix 1398 rows 86 cols
[2024-06-01 06:59:14] [INFO ] Computed 13 invariants in 13 ms
[2024-06-01 06:59:15] [INFO ] Implicit Places using invariants in 697 ms returned []
[2024-06-01 06:59:15] [INFO ] Invariant cache hit.
[2024-06-01 06:59:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 06:59:16] [INFO ] Implicit Places using invariants and state equation in 1129 ms returned [82, 84]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1834 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 84/91 places, 1398/1443 transitions.
Applied a total of 0 rules in 8 ms. Remains 84 /84 variables (removed 0) and now considering 1398/1398 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1866 ms. Remains : 84/91 places, 1398/1443 transitions.
Stuttering acceptance computed with spot in 309 ms :[true, (OR (NOT p2) (NOT p0)), (OR (NOT p0) (NOT p2)), (OR (NOT p2) (NOT p0)), (OR (NOT p0) (NOT p2) p1)]
Running random walk in product with property : AutonomousCar-PT-10a-LTLCardinality-01
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-10a-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-10a-LTLCardinality-01 finished in 2204 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)))'
Support contains 2 out of 91 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 91/91 places, 1443/1443 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 86 transition count 1398
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 86 transition count 1398
Applied a total of 10 rules in 20 ms. Remains 86 /91 variables (removed 5) and now considering 1398/1443 (removed 45) transitions.
// Phase 1: matrix 1398 rows 86 cols
[2024-06-01 06:59:17] [INFO ] Computed 13 invariants in 9 ms
[2024-06-01 06:59:17] [INFO ] Implicit Places using invariants in 657 ms returned []
[2024-06-01 06:59:17] [INFO ] Invariant cache hit.
[2024-06-01 06:59:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 06:59:18] [INFO ] Implicit Places using invariants and state equation in 1109 ms returned [82, 84]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1777 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 84/91 places, 1398/1443 transitions.
Applied a total of 0 rules in 9 ms. Remains 84 /84 variables (removed 0) and now considering 1398/1398 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1814 ms. Remains : 84/91 places, 1398/1443 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-10a-LTLCardinality-02
Product exploration timeout after 82180 steps with 41090 reset in 10001 ms.
Product exploration timeout after 84560 steps with 42280 reset in 10001 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(NOT p0), (X p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 32 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-10a-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-10a-LTLCardinality-02 finished in 21995 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((p0||G(F(p1)))))'
Support contains 4 out of 91 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 91/91 places, 1443/1443 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 90 transition count 1433
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 81 transition count 1433
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 23 place count 76 transition count 1388
Iterating global reduction 2 with 5 rules applied. Total rules applied 28 place count 76 transition count 1388
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 32 place count 74 transition count 1386
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 34 place count 73 transition count 1386
Applied a total of 34 rules in 210 ms. Remains 73 /91 variables (removed 18) and now considering 1386/1443 (removed 57) transitions.
// Phase 1: matrix 1386 rows 73 cols
[2024-06-01 06:59:39] [INFO ] Computed 13 invariants in 9 ms
[2024-06-01 06:59:40] [INFO ] Implicit Places using invariants in 768 ms returned []
[2024-06-01 06:59:40] [INFO ] Invariant cache hit.
[2024-06-01 06:59:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 06:59:41] [INFO ] Implicit Places using invariants and state equation in 1117 ms returned [69, 71]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1907 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 71/91 places, 1386/1443 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 71 transition count 1385
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 70 transition count 1385
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 69 transition count 1384
Applied a total of 4 rules in 159 ms. Remains 69 /71 variables (removed 2) and now considering 1384/1386 (removed 2) transitions.
// Phase 1: matrix 1384 rows 69 cols
[2024-06-01 06:59:41] [INFO ] Computed 11 invariants in 17 ms
[2024-06-01 06:59:42] [INFO ] Implicit Places using invariants in 668 ms returned []
[2024-06-01 06:59:42] [INFO ] Invariant cache hit.
[2024-06-01 06:59:42] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-01 06:59:43] [INFO ] Implicit Places using invariants and state equation in 1103 ms returned []
Implicit Place search using SMT with State Equation took 1775 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 69/91 places, 1384/1443 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4054 ms. Remains : 69/91 places, 1384/1443 transitions.
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-10a-LTLCardinality-03
Stuttering criterion allowed to conclude after 45 steps with 2 reset in 1 ms.
FORMULA AutonomousCar-PT-10a-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-10a-LTLCardinality-03 finished in 4167 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||G(p1)))))'
Support contains 3 out of 91 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 91/91 places, 1443/1443 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 91 transition count 1432
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 80 transition count 1432
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 28 place count 74 transition count 1376
Iterating global reduction 2 with 6 rules applied. Total rules applied 34 place count 74 transition count 1376
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 36 place count 73 transition count 1375
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 38 place count 72 transition count 1375
Applied a total of 38 rules in 174 ms. Remains 72 /91 variables (removed 19) and now considering 1375/1443 (removed 68) transitions.
// Phase 1: matrix 1375 rows 72 cols
[2024-06-01 06:59:43] [INFO ] Computed 13 invariants in 9 ms
[2024-06-01 06:59:44] [INFO ] Implicit Places using invariants in 618 ms returned []
[2024-06-01 06:59:44] [INFO ] Invariant cache hit.
[2024-06-01 06:59:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 06:59:45] [INFO ] Implicit Places using invariants and state equation in 1110 ms returned [68, 70]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1737 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 70/91 places, 1375/1443 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 70 transition count 1374
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 69 transition count 1374
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 68 transition count 1373
Applied a total of 4 rules in 140 ms. Remains 68 /70 variables (removed 2) and now considering 1373/1375 (removed 2) transitions.
// Phase 1: matrix 1373 rows 68 cols
[2024-06-01 06:59:45] [INFO ] Computed 11 invariants in 8 ms
[2024-06-01 06:59:45] [INFO ] Implicit Places using invariants in 589 ms returned []
[2024-06-01 06:59:45] [INFO ] Invariant cache hit.
[2024-06-01 06:59:46] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-01 06:59:46] [INFO ] Implicit Places using invariants and state equation in 1077 ms returned []
Implicit Place search using SMT with State Equation took 1671 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 68/91 places, 1373/1443 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3723 ms. Remains : 68/91 places, 1373/1443 transitions.
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-10a-LTLCardinality-04
Stuttering criterion allowed to conclude after 15 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-10a-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-10a-LTLCardinality-04 finished in 3836 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 91 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 91/91 places, 1443/1443 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 90 transition count 1431
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 79 transition count 1431
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 27 place count 74 transition count 1386
Iterating global reduction 2 with 5 rules applied. Total rules applied 32 place count 74 transition count 1386
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 36 place count 72 transition count 1384
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 38 place count 71 transition count 1384
Applied a total of 38 rules in 210 ms. Remains 71 /91 variables (removed 20) and now considering 1384/1443 (removed 59) transitions.
// Phase 1: matrix 1384 rows 71 cols
[2024-06-01 06:59:47] [INFO ] Computed 13 invariants in 11 ms
[2024-06-01 06:59:47] [INFO ] Implicit Places using invariants in 678 ms returned []
[2024-06-01 06:59:47] [INFO ] Invariant cache hit.
[2024-06-01 06:59:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 06:59:49] [INFO ] Implicit Places using invariants and state equation in 1111 ms returned [67, 69]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1807 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 69/91 places, 1384/1443 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 68 transition count 1383
Applied a total of 2 rules in 116 ms. Remains 68 /69 variables (removed 1) and now considering 1383/1384 (removed 1) transitions.
// Phase 1: matrix 1383 rows 68 cols
[2024-06-01 06:59:49] [INFO ] Computed 11 invariants in 10 ms
[2024-06-01 06:59:49] [INFO ] Implicit Places using invariants in 667 ms returned []
[2024-06-01 06:59:49] [INFO ] Invariant cache hit.
[2024-06-01 06:59:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 06:59:51] [INFO ] Implicit Places using invariants and state equation in 1173 ms returned []
Implicit Place search using SMT with State Equation took 1842 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 68/91 places, 1383/1443 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3979 ms. Remains : 68/91 places, 1383/1443 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-10a-LTLCardinality-06
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-10a-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-10a-LTLCardinality-06 finished in 4037 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(X(p0)) U p1)&&X(G(p2))))'
Support contains 6 out of 91 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 91/91 places, 1443/1443 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 87 transition count 1409
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 87 transition count 1409
Applied a total of 8 rules in 15 ms. Remains 87 /91 variables (removed 4) and now considering 1409/1443 (removed 34) transitions.
// Phase 1: matrix 1409 rows 87 cols
[2024-06-01 06:59:51] [INFO ] Computed 13 invariants in 9 ms
[2024-06-01 06:59:51] [INFO ] Implicit Places using invariants in 638 ms returned []
[2024-06-01 06:59:51] [INFO ] Invariant cache hit.
[2024-06-01 06:59:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 06:59:52] [INFO ] Implicit Places using invariants and state equation in 1098 ms returned [85]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1740 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 86/91 places, 1409/1443 transitions.
Applied a total of 0 rules in 6 ms. Remains 86 /86 variables (removed 0) and now considering 1409/1409 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1763 ms. Remains : 86/91 places, 1409/1443 transitions.
Stuttering acceptance computed with spot in 179 ms :[(NOT p2), true, (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-10a-LTLCardinality-09
Entered a terminal (fully accepting) state of product in 101 steps with 4 reset in 3 ms.
FORMULA AutonomousCar-PT-10a-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-10a-LTLCardinality-09 finished in 1966 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((G(p1)||p0)))'
Support contains 2 out of 91 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 91/91 places, 1443/1443 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 90 transition count 1431
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 79 transition count 1431
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 27 place count 74 transition count 1386
Iterating global reduction 2 with 5 rules applied. Total rules applied 32 place count 74 transition count 1386
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 36 place count 72 transition count 1384
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 38 place count 71 transition count 1384
Applied a total of 38 rules in 171 ms. Remains 71 /91 variables (removed 20) and now considering 1384/1443 (removed 59) transitions.
// Phase 1: matrix 1384 rows 71 cols
[2024-06-01 06:59:53] [INFO ] Computed 13 invariants in 8 ms
[2024-06-01 06:59:53] [INFO ] Implicit Places using invariants in 664 ms returned []
[2024-06-01 06:59:53] [INFO ] Invariant cache hit.
[2024-06-01 06:59:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 06:59:54] [INFO ] Implicit Places using invariants and state equation in 1054 ms returned [67, 69]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1735 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 69/91 places, 1384/1443 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 69 transition count 1383
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 68 transition count 1383
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 67 transition count 1382
Applied a total of 4 rules in 143 ms. Remains 67 /69 variables (removed 2) and now considering 1382/1384 (removed 2) transitions.
// Phase 1: matrix 1382 rows 67 cols
[2024-06-01 06:59:55] [INFO ] Computed 11 invariants in 8 ms
[2024-06-01 06:59:55] [INFO ] Implicit Places using invariants in 633 ms returned []
[2024-06-01 06:59:55] [INFO ] Invariant cache hit.
[2024-06-01 06:59:56] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-01 06:59:57] [INFO ] Implicit Places using invariants and state equation in 1238 ms returned []
Implicit Place search using SMT with State Equation took 1885 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 67/91 places, 1382/1443 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3938 ms. Remains : 67/91 places, 1382/1443 transitions.
Stuttering acceptance computed with spot in 88 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-10a-LTLCardinality-10
Entered a terminal (fully accepting) state of product in 106 steps with 6 reset in 2 ms.
FORMULA AutonomousCar-PT-10a-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-10a-LTLCardinality-10 finished in 4049 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(((G(p0) U X(p1))||G(p2))))'
Support contains 5 out of 91 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 91/91 places, 1443/1443 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 86 transition count 1388
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 86 transition count 1388
Applied a total of 10 rules in 13 ms. Remains 86 /91 variables (removed 5) and now considering 1388/1443 (removed 55) transitions.
[2024-06-01 06:59:57] [INFO ] Flow matrix only has 1387 transitions (discarded 1 similar events)
// Phase 1: matrix 1387 rows 86 cols
[2024-06-01 06:59:57] [INFO ] Computed 14 invariants in 8 ms
[2024-06-01 06:59:57] [INFO ] Implicit Places using invariants in 646 ms returned []
[2024-06-01 06:59:57] [INFO ] Flow matrix only has 1387 transitions (discarded 1 similar events)
[2024-06-01 06:59:57] [INFO ] Invariant cache hit.
[2024-06-01 06:59:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 06:59:58] [INFO ] Implicit Places using invariants and state equation in 1133 ms returned [81, 84]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1787 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 84/91 places, 1388/1443 transitions.
Applied a total of 0 rules in 6 ms. Remains 84 /84 variables (removed 0) and now considering 1388/1388 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1806 ms. Remains : 84/91 places, 1388/1443 transitions.
Stuttering acceptance computed with spot in 397 ms :[(AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p2) (NOT p1)), true, (NOT p2), (NOT p0), (AND (NOT p2) (NOT p0) p1)]
Running random walk in product with property : AutonomousCar-PT-10a-LTLCardinality-11
Product exploration explored 100000 steps with 33322 reset in 8473 ms.
Product exploration explored 100000 steps with 33414 reset in 8606 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT p2)), (X p1), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p2 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p2)), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 21 factoid took 202 ms. Reduced automaton from 9 states, 24 edges and 3 AP (stutter sensitive) to 8 states, 23 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 302 ms :[(AND (NOT p1) (NOT p2)), (OR (AND p0 (NOT p1)) (AND (NOT p1) p2)), (AND (NOT p2) (NOT p1) p0), (NOT p1), true, (NOT p2), (NOT p0), (AND (NOT p2) (NOT p0) p1)]
Reduction of identical properties reduced properties to check from 16 to 14
RANDOM walk for 40000 steps (1832 resets) in 1151 ms. (34 steps per ms) remains 8/14 properties
BEST_FIRST walk for 40004 steps (120 resets) in 443 ms. (90 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (126 resets) in 146 ms. (272 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (126 resets) in 149 ms. (266 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (123 resets) in 167 ms. (238 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (121 resets) in 165 ms. (240 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (127 resets) in 145 ms. (274 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (122 resets) in 151 ms. (263 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (129 resets) in 561 ms. (71 steps per ms) remains 8/8 properties
[2024-06-01 07:00:17] [INFO ] Flow matrix only has 1387 transitions (discarded 1 similar events)
// Phase 1: matrix 1387 rows 84 cols
[2024-06-01 07:00:17] [INFO ] Computed 12 invariants in 8 ms
[2024-06-01 07:00:18] [INFO ] State equation strengthened by 1 read => feed constraints.
Problem apf1 is UNSAT
Problem apf3 is UNSAT
Problem apf4 is UNSAT
Problem apf9 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 27/32 variables, 4/4 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/4 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 49/81 variables, 8/12 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/12 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1384/1465 variables, 81/93 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1465 variables, 0/93 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 5/1470 variables, 3/96 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1470 variables, 0/96 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 1/1471 variables, 1/97 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1471 variables, 0/97 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/1471 variables, 0/97 constraints. Problems are: Problem set: 4 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1471/1471 variables, and 97 constraints, problems are : Problem set: 4 solved, 4 unsolved in 779 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 84/84 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 27/32 variables, 4/4 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/4 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 49/81 variables, 8/12 constraints. Problems are: Problem set: 4 solved, 4 unsolved
[2024-06-01 07:00:20] [INFO ] Deduced a trap composed of 7 places in 961 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 1/13 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 0/13 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 1384/1465 variables, 81/94 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1465 variables, 4/98 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1465 variables, 0/98 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 5/1470 variables, 3/101 constraints. Problems are: Problem set: 4 solved, 4 unsolved
[2024-06-01 07:00:23] [INFO ] Deduced a trap composed of 24 places in 945 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1470 variables, 1/102 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1470 variables, 0/102 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 1/1471 variables, 1/103 constraints. Problems are: Problem set: 4 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1471/1471 variables, and 103 constraints, problems are : Problem set: 4 solved, 4 unsolved in 5008 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 84/84 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 4/8 constraints, Known Traps: 2/2 constraints]
After SMT, in 6129ms problems are : Problem set: 4 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 5 out of 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 1388/1388 transitions.
Graph (complete) has 1092 edges and 84 vertex of which 83 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 83 transition count 1374
Reduce places removed 10 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 12 rules applied. Total rules applied 26 place count 73 transition count 1372
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 28 place count 71 transition count 1372
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 28 place count 71 transition count 1371
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 30 place count 70 transition count 1371
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 36 place count 67 transition count 1368
Free-agglomeration rule applied 8 times.
Iterating global reduction 3 with 8 rules applied. Total rules applied 44 place count 67 transition count 1360
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 3 with 88 rules applied. Total rules applied 132 place count 59 transition count 1280
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 133 place count 58 transition count 1279
Applied a total of 133 rules in 333 ms. Remains 58 /84 variables (removed 26) and now considering 1279/1388 (removed 109) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 334 ms. Remains : 58/84 places, 1279/1388 transitions.
RANDOM walk for 40000 steps (501 resets) in 1167 ms. (34 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40003 steps (104 resets) in 97 ms. (408 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (58 resets) in 133 ms. (298 steps per ms) remains 2/2 properties
// Phase 1: matrix 1279 rows 58 cols
[2024-06-01 07:00:24] [INFO ] Computed 13 invariants in 7 ms
[2024-06-01 07:00:24] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 23/28 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1258/1286 variables, 28/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1286 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1286 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 51/1337 variables, 30/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1337 variables, 8/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1337 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/1337 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1337/1337 variables, and 72 constraints, problems are : Problem set: 0 solved, 2 unsolved in 521 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 58/58 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 23/28 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1258/1286 variables, 28/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1286 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1286 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 51/1337 variables, 30/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1337 variables, 8/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1337 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1337 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/1337 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1337/1337 variables, and 74 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1304 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 58/58 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1921ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 5 out of 58 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 1279/1279 transitions.
Applied a total of 0 rules in 80 ms. Remains 58 /58 variables (removed 0) and now considering 1279/1279 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 58/58 places, 1279/1279 transitions.
RANDOM walk for 40000 steps (498 resets) in 983 ms. (40 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (81 resets) in 111 ms. (357 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (51 resets) in 140 ms. (283 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 404054 steps, run timeout after 3001 ms. (steps per millisecond=134 ) properties seen :0 out of 2
Probabilistic random walk after 404054 steps, saw 61997 distinct states, run finished after 3004 ms. (steps per millisecond=134 ) properties seen :0
[2024-06-01 07:00:30] [INFO ] Invariant cache hit.
[2024-06-01 07:00:30] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 23/28 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1258/1286 variables, 28/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1286 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1286 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 51/1337 variables, 30/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1337 variables, 8/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1337 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/1337 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1337/1337 variables, and 72 constraints, problems are : Problem set: 0 solved, 2 unsolved in 530 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 58/58 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 23/28 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1258/1286 variables, 28/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1286 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1286 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 51/1337 variables, 30/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1337 variables, 8/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1337 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1337 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/1337 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1337/1337 variables, and 74 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1378 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 58/58 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1970ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 4033 ms.
Support contains 5 out of 58 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 1279/1279 transitions.
Applied a total of 0 rules in 84 ms. Remains 58 /58 variables (removed 0) and now considering 1279/1279 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 58/58 places, 1279/1279 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 1279/1279 transitions.
Applied a total of 0 rules in 82 ms. Remains 58 /58 variables (removed 0) and now considering 1279/1279 (removed 0) transitions.
[2024-06-01 07:00:36] [INFO ] Invariant cache hit.
[2024-06-01 07:00:36] [INFO ] Implicit Places using invariants in 614 ms returned []
[2024-06-01 07:00:36] [INFO ] Invariant cache hit.
[2024-06-01 07:00:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 07:00:38] [INFO ] Implicit Places using invariants and state equation in 1121 ms returned []
Implicit Place search using SMT with State Equation took 1737 ms to find 0 implicit places.
[2024-06-01 07:00:38] [INFO ] Redundant transitions in 44 ms returned []
Running 1278 sub problems to find dead transitions.
[2024-06-01 07:00:38] [INFO ] Invariant cache hit.
[2024-06-01 07:00:38] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1278 unsolved
[2024-06-01 07:01:14] [INFO ] Deduced a trap composed of 22 places in 1026 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1278 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1278 unsolved
At refinement iteration 3 (OVERLAPS) 1/58 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1278 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 58/1337 variables, and 14 constraints, problems are : Problem set: 0 solved, 1278 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 0/58 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1278/33 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1278 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1278 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1278 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1278 unsolved
At refinement iteration 3 (OVERLAPS) 1/58 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1278 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1278 unsolved
At refinement iteration 5 (OVERLAPS) 1279/1337 variables, 58/72 constraints. Problems are: Problem set: 0 solved, 1278 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1337 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 1278 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1337 variables, 33/106 constraints. Problems are: Problem set: 0 solved, 1278 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 1)
(s3 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1337/1337 variables, and 106 constraints, problems are : Problem set: 0 solved, 1278 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 58/58 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1278/33 constraints, Known Traps: 1/1 constraints]
After SMT, in 83647ms problems are : Problem set: 0 solved, 1278 unsolved
Search for dead transitions found 0 dead transitions in 83666ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85541 ms. Remains : 58/58 places, 1279/1279 transitions.
Found 4 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT p2)), (X p1), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p2 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p2)), (X (X p1)), (G (OR p2 p1 (NOT p0))), (G (OR (NOT p2) (NOT p1) p0)), (G (OR p1 (NOT p0))), (G (OR (NOT p2) p1 (NOT p0)))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) p1 p0))), (F (NOT (OR p2 p1 p0))), (F (NOT p1)), (F (NOT p0)), (F (NOT (OR p2 (NOT p1) p0))), (F (NOT (OR (NOT p2) (NOT p1) (NOT p0)))), (F (NOT (OR p1 p0))), (F p2), (F (NOT (OR p1 p0))), (F (NOT (AND (NOT p2) p0)))]
Property proved to be false thanks to negative knowledge :(F (NOT (OR p2 p1 p0)))
Knowledge based reduction with 25 factoid took 230 ms. Reduced automaton from 8 states, 23 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-10a-LTLCardinality-11 FALSE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-10a-LTLCardinality-11 finished in 124948 ms.
All properties solved by simple procedures.
Total runtime 266712 ms.
ITS solved all properties within timeout

BK_STOP 1717225322145

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

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="AutonomousCar-PT-10a"
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 AutonomousCar-PT-10a, 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 r468-smll-171620167500363"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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