fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r476-tall-171620505000035
Last Updated
July 7, 2024

About the Execution of LTSMin+red for CANConstruction-PT-040

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
3573.915 1049754.00 2011442.00 2035.70 ?FFFTFFFFTTFFFFF normal

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.r476-tall-171620505000035.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 CANConstruction-PT-040, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r476-tall-171620505000035
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.0M
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.9K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 17:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 20K Apr 12 18:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 164K Apr 12 18:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Apr 12 18:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 104K Apr 12 18:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:31 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 2.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 CANConstruction-PT-040-LTLCardinality-00
FORMULA_NAME CANConstruction-PT-040-LTLCardinality-01
FORMULA_NAME CANConstruction-PT-040-LTLCardinality-02
FORMULA_NAME CANConstruction-PT-040-LTLCardinality-03
FORMULA_NAME CANConstruction-PT-040-LTLCardinality-04
FORMULA_NAME CANConstruction-PT-040-LTLCardinality-05
FORMULA_NAME CANConstruction-PT-040-LTLCardinality-06
FORMULA_NAME CANConstruction-PT-040-LTLCardinality-07
FORMULA_NAME CANConstruction-PT-040-LTLCardinality-08
FORMULA_NAME CANConstruction-PT-040-LTLCardinality-09
FORMULA_NAME CANConstruction-PT-040-LTLCardinality-10
FORMULA_NAME CANConstruction-PT-040-LTLCardinality-11
FORMULA_NAME CANConstruction-PT-040-LTLCardinality-12
FORMULA_NAME CANConstruction-PT-040-LTLCardinality-13
FORMULA_NAME CANConstruction-PT-040-LTLCardinality-14
FORMULA_NAME CANConstruction-PT-040-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717178507165

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANConstruction-PT-040
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 18:01:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 18:01:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 18:01:48] [INFO ] Load time of PNML (sax parser for PT used): 229 ms
[2024-05-31 18:01:48] [INFO ] Transformed 3682 places.
[2024-05-31 18:01:48] [INFO ] Transformed 6720 transitions.
[2024-05-31 18:01:48] [INFO ] Parsed PT model containing 3682 places and 6720 transitions and 20000 arcs in 377 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA CANConstruction-PT-040-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-040-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 45 out of 3682 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3682/3682 places, 6720/6720 transitions.
Discarding 1500 places :
Symmetric choice reduction at 0 with 1500 rule applications. Total rules 1500 place count 2182 transition count 3720
Iterating global reduction 0 with 1500 rules applied. Total rules applied 3000 place count 2182 transition count 3720
Applied a total of 3000 rules in 446 ms. Remains 2182 /3682 variables (removed 1500) and now considering 3720/6720 (removed 3000) transitions.
// Phase 1: matrix 3720 rows 2182 cols
[2024-05-31 18:01:49] [INFO ] Computed 81 invariants in 75 ms
[2024-05-31 18:01:50] [INFO ] Implicit Places using invariants in 1608 ms returned [12, 26, 40, 54, 68, 82, 96, 110, 124, 138, 152, 166, 180, 194, 208, 222, 236, 250, 264, 278, 292, 306, 320, 334, 348, 362, 376, 390, 404, 418, 432, 446, 474, 488, 502, 516, 530, 544, 558]
Discarding 39 places :
Implicit Place search using SMT only with invariants took 1640 ms to find 39 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2143/3682 places, 3720/6720 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 2104 transition count 3681
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 2104 transition count 3681
Applied a total of 78 rules in 405 ms. Remains 2104 /2143 variables (removed 39) and now considering 3681/3720 (removed 39) transitions.
// Phase 1: matrix 3681 rows 2104 cols
[2024-05-31 18:01:51] [INFO ] Computed 42 invariants in 33 ms
[2024-05-31 18:01:52] [INFO ] Implicit Places using invariants in 1053 ms returned []
[2024-05-31 18:01:52] [INFO ] Invariant cache hit.
[2024-05-31 18:01:53] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-31 18:02:20] [INFO ] Implicit Places using invariants and state equation in 28063 ms returned []
Implicit Place search using SMT with State Equation took 29119 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 2104/3682 places, 3681/6720 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31628 ms. Remains : 2104/3682 places, 3681/6720 transitions.
Support contains 45 out of 2104 places after structural reductions.
[2024-05-31 18:02:21] [INFO ] Flatten gal took : 246 ms
[2024-05-31 18:02:21] [INFO ] Flatten gal took : 142 ms
[2024-05-31 18:02:21] [INFO ] Input system was already deterministic with 3681 transitions.
Support contains 42 out of 2104 places (down from 45) after GAL structural reductions.
RANDOM walk for 40000 steps (54 resets) in 1662 ms. (24 steps per ms) remains 12/26 properties
BEST_FIRST walk for 40004 steps (8 resets) in 93 ms. (425 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 87 ms. (454 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 126 ms. (314 steps per ms) remains 11/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 134 ms. (296 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 98 ms. (404 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 154 ms. (258 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 66 ms. (597 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 74 ms. (533 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 79 ms. (500 steps per ms) remains 11/11 properties
[2024-05-31 18:02:22] [INFO ] Invariant cache hit.
[2024-05-31 18:02:22] [INFO ] State equation strengthened by 3160 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp22 is UNSAT
At refinement iteration 1 (OVERLAPS) 2059/2076 variables, 15/15 constraints. Problems are: Problem set: 8 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2076 variables, 0/15 constraints. Problems are: Problem set: 8 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 26/2102 variables, 26/41 constraints. Problems are: Problem set: 8 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2102 variables, 0/41 constraints. Problems are: Problem set: 8 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1/2103 variables, 1/42 constraints. Problems are: Problem set: 8 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2103 variables, 0/42 constraints. Problems are: Problem set: 8 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 3681/5784 variables, 2103/2145 constraints. Problems are: Problem set: 8 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/5784 variables, 3160/5305 constraints. Problems are: Problem set: 8 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/5784 variables, 0/5305 constraints. Problems are: Problem set: 8 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 1/5785 variables, 1/5306 constraints. Problems are: Problem set: 8 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/5785 variables, 0/5306 constraints. Problems are: Problem set: 8 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/5785 variables, 0/5306 constraints. Problems are: Problem set: 8 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5785/5785 variables, and 5306 constraints, problems are : Problem set: 8 solved, 3 unsolved in 2765 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 2104/2104 constraints, ReadFeed: 3160/3160 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 8 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 8 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 2061/2068 variables, 7/7 constraints. Problems are: Problem set: 8 solved, 3 unsolved
[2024-05-31 18:02:27] [INFO ] Deduced a trap composed of 5 places in 1387 ms of which 116 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/2068 variables, 1/8 constraints. Problems are: Problem set: 8 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2068 variables, 0/8 constraints. Problems are: Problem set: 8 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 34/2102 variables, 34/42 constraints. Problems are: Problem set: 8 solved, 3 unsolved
[2024-05-31 18:02:29] [INFO ] Deduced a trap composed of 56 places in 1561 ms of which 17 ms to minimize.
[2024-05-31 18:02:30] [INFO ] Deduced a trap composed of 57 places in 1499 ms of which 13 ms to minimize.
SMT process timed out in 8041ms, After SMT, problems are : Problem set: 8 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 7 out of 2104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2104/2104 places, 3681/3681 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 266 transitions
Trivial Post-agglo rules discarded 266 transitions
Performed 266 trivial Post agglomeration. Transition count delta: 266
Iterating post reduction 0 with 266 rules applied. Total rules applied 266 place count 2104 transition count 3415
Reduce places removed 266 places and 0 transitions.
Iterating post reduction 1 with 266 rules applied. Total rules applied 532 place count 1838 transition count 3415
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 39 Pre rules applied. Total rules applied 532 place count 1838 transition count 3376
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 610 place count 1799 transition count 3376
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 626 place count 1783 transition count 3344
Iterating global reduction 2 with 16 rules applied. Total rules applied 642 place count 1783 transition count 3344
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 2 with 10 rules applied. Total rules applied 652 place count 1783 transition count 3334
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 662 place count 1773 transition count 3334
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 1 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 4 with 88 rules applied. Total rules applied 750 place count 1729 transition count 3290
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 752 place count 1729 transition count 3288
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 754 place count 1727 transition count 3288
Applied a total of 754 rules in 1012 ms. Remains 1727 /2104 variables (removed 377) and now considering 3288/3681 (removed 393) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1013 ms. Remains : 1727/2104 places, 3288/3681 transitions.
RANDOM walk for 30951 steps (112 resets) in 515 ms. (59 steps per ms) remains 0/3 properties
Successfully simplified 8 atomic propositions for a total of 14 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA CANConstruction-PT-040-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-040-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-040-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-040-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-040-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-040-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 122 stabilizing places and 161 stable transitions
FORMULA CANConstruction-PT-040-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U G((F(!p0)||X(p1)))))'
Support contains 2 out of 2104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2104/2104 places, 3681/3681 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 2085 transition count 3643
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 2085 transition count 3643
Applied a total of 38 rules in 245 ms. Remains 2085 /2104 variables (removed 19) and now considering 3643/3681 (removed 38) transitions.
// Phase 1: matrix 3643 rows 2085 cols
[2024-05-31 18:02:32] [INFO ] Computed 42 invariants in 28 ms
[2024-05-31 18:02:33] [INFO ] Implicit Places using invariants in 1240 ms returned [396]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1243 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2084/2104 places, 3643/3681 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 2083 transition count 3642
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 2083 transition count 3642
Applied a total of 2 rules in 168 ms. Remains 2083 /2084 variables (removed 1) and now considering 3642/3643 (removed 1) transitions.
// Phase 1: matrix 3642 rows 2083 cols
[2024-05-31 18:02:33] [INFO ] Computed 41 invariants in 26 ms
[2024-05-31 18:02:34] [INFO ] Implicit Places using invariants in 1055 ms returned []
[2024-05-31 18:02:34] [INFO ] Invariant cache hit.
[2024-05-31 18:02:36] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-31 18:02:59] [INFO ] Implicit Places using invariants and state equation in 24085 ms returned []
Implicit Place search using SMT with State Equation took 25143 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 2083/2104 places, 3642/3681 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 26800 ms. Remains : 2083/2104 places, 3642/3681 transitions.
Stuttering acceptance computed with spot in 297 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), false, p0]
Running random walk in product with property : CANConstruction-PT-040-LTLCardinality-00
Product exploration explored 100000 steps with 33306 reset in 744 ms.
Product exploration explored 100000 steps with 33382 reset in 735 ms.
Computed a total of 121 stabilizing places and 160 stable transitions
Computed a total of 121 stabilizing places and 160 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1)), (X (X (AND p0 p1)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 118 ms. Reduced automaton from 6 states, 11 edges and 2 AP (stutter sensitive) to 6 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 198 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), false, p0]
RANDOM walk for 40000 steps (55 resets) in 360 ms. (110 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 75 ms. (526 steps per ms) remains 1/1 properties
[2024-05-31 18:03:01] [INFO ] Invariant cache hit.
[2024-05-31 18:03:01] [INFO ] State equation strengthened by 3160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2042/2043 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 18:03:03] [INFO ] Deduced a trap composed of 5 places in 1378 ms of which 13 ms to minimize.
[2024-05-31 18:03:04] [INFO ] Deduced a trap composed of 5 places in 1438 ms of which 12 ms to minimize.
[2024-05-31 18:03:05] [INFO ] Deduced a trap composed of 5 places in 1365 ms of which 13 ms to minimize.
[2024-05-31 18:03:07] [INFO ] Deduced a trap composed of 5 places in 1322 ms of which 11 ms to minimize.
SMT process timed out in 5908ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 2083 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2083/2083 places, 3642/3642 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 279 transitions
Trivial Post-agglo rules discarded 279 transitions
Performed 279 trivial Post agglomeration. Transition count delta: 279
Iterating post reduction 0 with 279 rules applied. Total rules applied 279 place count 2083 transition count 3363
Reduce places removed 279 places and 0 transitions.
Iterating post reduction 1 with 279 rules applied. Total rules applied 558 place count 1804 transition count 3363
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 558 place count 1804 transition count 3323
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 638 place count 1764 transition count 3323
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 720 place count 1723 transition count 3282
Applied a total of 720 rules in 268 ms. Remains 1723 /2083 variables (removed 360) and now considering 3282/3642 (removed 360) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 269 ms. Remains : 1723/2083 places, 3282/3642 transitions.
RANDOM walk for 21005 steps (73 resets) in 284 ms. (73 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1)), (X (X (AND p0 p1)))]
False Knowledge obtained : [(F (NOT (AND p0 p1))), (F (NOT (OR (NOT p0) p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 8 factoid took 336 ms. Reduced automaton from 6 states, 11 edges and 2 AP (stutter sensitive) to 6 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 328 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), false, p0]
Stuttering acceptance computed with spot in 220 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), false, p0]
Support contains 2 out of 2083 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2083/2083 places, 3642/3642 transitions.
Applied a total of 0 rules in 128 ms. Remains 2083 /2083 variables (removed 0) and now considering 3642/3642 (removed 0) transitions.
[2024-05-31 18:03:08] [INFO ] Invariant cache hit.
[2024-05-31 18:03:09] [INFO ] Implicit Places using invariants in 990 ms returned []
[2024-05-31 18:03:09] [INFO ] Invariant cache hit.
[2024-05-31 18:03:10] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-31 18:03:32] [INFO ] Implicit Places using invariants and state equation in 22464 ms returned []
Implicit Place search using SMT with State Equation took 23456 ms to find 0 implicit places.
Running 3602 sub problems to find dead transitions.
[2024-05-31 18:03:32] [INFO ] Invariant cache hit.
[2024-05-31 18:03:32] [INFO ] State equation strengthened by 3160 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/2082 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 3602 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2082/5725 variables, and 41 constraints, problems are : Problem set: 0 solved, 3602 unsolved in 30066 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 0/2083 constraints, ReadFeed: 0/3160 constraints, PredecessorRefiner: 3602/3602 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3602 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2082 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 3602 unsolved
[2024-05-31 18:04:27] [INFO ] Deduced a trap composed of 52 places in 692 ms of which 12 ms to minimize.
[2024-05-31 18:04:28] [INFO ] Deduced a trap composed of 52 places in 640 ms of which 10 ms to minimize.
[2024-05-31 18:04:29] [INFO ] Deduced a trap composed of 52 places in 622 ms of which 10 ms to minimize.
[2024-05-31 18:04:29] [INFO ] Deduced a trap composed of 52 places in 606 ms of which 10 ms to minimize.
[2024-05-31 18:04:30] [INFO ] Deduced a trap composed of 52 places in 642 ms of which 11 ms to minimize.
[2024-05-31 18:04:31] [INFO ] Deduced a trap composed of 52 places in 624 ms of which 11 ms to minimize.
[2024-05-31 18:04:31] [INFO ] Deduced a trap composed of 52 places in 590 ms of which 10 ms to minimize.
[2024-05-31 18:04:32] [INFO ] Deduced a trap composed of 52 places in 595 ms of which 9 ms to minimize.
[2024-05-31 18:04:33] [INFO ] Deduced a trap composed of 52 places in 619 ms of which 11 ms to minimize.
[2024-05-31 18:04:33] [INFO ] Deduced a trap composed of 52 places in 579 ms of which 10 ms to minimize.
[2024-05-31 18:04:34] [INFO ] Deduced a trap composed of 52 places in 517 ms of which 8 ms to minimize.
[2024-05-31 18:04:34] [INFO ] Deduced a trap composed of 52 places in 566 ms of which 9 ms to minimize.
SMT process timed out in 62580ms, After SMT, problems are : Problem set: 0 solved, 3602 unsolved
Search for dead transitions found 0 dead transitions in 62623ms
Finished structural reductions in LTL mode , in 1 iterations and 86231 ms. Remains : 2083/2083 places, 3642/3642 transitions.
Computed a total of 121 stabilizing places and 160 stable transitions
Computed a total of 121 stabilizing places and 160 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1)), (X (X (AND p0 p1)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 102 ms. Reduced automaton from 6 states, 11 edges and 2 AP (stutter sensitive) to 6 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 210 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), false, p0]
RANDOM walk for 36445 steps (51 resets) in 335 ms. (108 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1)), (X (X (AND p0 p1)))]
False Knowledge obtained : [(F (NOT (AND p0 p1))), (F (NOT (OR (NOT p0) p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 8 factoid took 216 ms. Reduced automaton from 6 states, 11 edges and 2 AP (stutter sensitive) to 6 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 231 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), false, p0]
Stuttering acceptance computed with spot in 235 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), false, p0]
Stuttering acceptance computed with spot in 246 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), false, p0]
Product exploration explored 100000 steps with 33300 reset in 632 ms.
Product exploration explored 100000 steps with 33349 reset in 648 ms.
Applying partial POR strategy [false, false, true, true, true, true]
Stuttering acceptance computed with spot in 286 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), false, p0]
Support contains 2 out of 2083 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2083/2083 places, 3642/3642 transitions.
Performed 160 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 160 rules applied. Total rules applied 160 place count 2083 transition count 3642
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 40 Pre rules applied. Total rules applied 160 place count 2083 transition count 3642
Deduced a syphon composed of 200 places in 1 ms
Iterating global reduction 1 with 40 rules applied. Total rules applied 200 place count 2083 transition count 3642
Discarding 80 places :
Symmetric choice reduction at 1 with 80 rule applications. Total rules 280 place count 2003 transition count 3562
Deduced a syphon composed of 120 places in 1 ms
Iterating global reduction 1 with 80 rules applied. Total rules applied 360 place count 2003 transition count 3562
Performed 160 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 280 places in 1 ms
Iterating global reduction 1 with 160 rules applied. Total rules applied 520 place count 2003 transition count 3562
Discarding 200 places :
Symmetric choice reduction at 1 with 200 rule applications. Total rules 720 place count 1803 transition count 3362
Deduced a syphon composed of 80 places in 1 ms
Iterating global reduction 1 with 200 rules applied. Total rules applied 920 place count 1803 transition count 3362
Deduced a syphon composed of 80 places in 0 ms
Applied a total of 920 rules in 959 ms. Remains 1803 /2083 variables (removed 280) and now considering 3362/3642 (removed 280) transitions.
[2024-05-31 18:04:39] [INFO ] Redundant transitions in 227 ms returned []
Running 3322 sub problems to find dead transitions.
// Phase 1: matrix 3362 rows 1803 cols
[2024-05-31 18:04:39] [INFO ] Computed 41 invariants in 33 ms
[2024-05-31 18:04:39] [INFO ] State equation strengthened by 3160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1802 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 3322 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1802/5165 variables, and 41 constraints, problems are : Problem set: 0 solved, 3322 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 0/1803 constraints, ReadFeed: 0/3160 constraints, PredecessorRefiner: 3322/3322 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3322 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1802 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 3322 unsolved
[2024-05-31 18:05:13] [INFO ] Deduced a trap composed of 43 places in 687 ms of which 11 ms to minimize.
[2024-05-31 18:05:14] [INFO ] Deduced a trap composed of 43 places in 669 ms of which 11 ms to minimize.
[2024-05-31 18:05:15] [INFO ] Deduced a trap composed of 44 places in 671 ms of which 11 ms to minimize.
[2024-05-31 18:05:15] [INFO ] Deduced a trap composed of 43 places in 651 ms of which 11 ms to minimize.
[2024-05-31 18:05:16] [INFO ] Deduced a trap composed of 43 places in 634 ms of which 10 ms to minimize.
[2024-05-31 18:05:17] [INFO ] Deduced a trap composed of 43 places in 721 ms of which 11 ms to minimize.
[2024-05-31 18:05:18] [INFO ] Deduced a trap composed of 43 places in 665 ms of which 10 ms to minimize.
[2024-05-31 18:05:18] [INFO ] Deduced a trap composed of 48 places in 659 ms of which 10 ms to minimize.
[2024-05-31 18:05:19] [INFO ] Deduced a trap composed of 43 places in 660 ms of which 11 ms to minimize.
[2024-05-31 18:05:20] [INFO ] Deduced a trap composed of 43 places in 674 ms of which 10 ms to minimize.
[2024-05-31 18:05:20] [INFO ] Deduced a trap composed of 43 places in 636 ms of which 9 ms to minimize.
[2024-05-31 18:05:21] [INFO ] Deduced a trap composed of 43 places in 629 ms of which 10 ms to minimize.
[2024-05-31 18:05:22] [INFO ] Deduced a trap composed of 43 places in 642 ms of which 11 ms to minimize.
[2024-05-31 18:05:22] [INFO ] Deduced a trap composed of 43 places in 631 ms of which 10 ms to minimize.
[2024-05-31 18:05:23] [INFO ] Deduced a trap composed of 51 places in 586 ms of which 10 ms to minimize.
[2024-05-31 18:05:24] [INFO ] Deduced a trap composed of 43 places in 603 ms of which 10 ms to minimize.
[2024-05-31 18:05:24] [INFO ] Deduced a trap composed of 43 places in 606 ms of which 10 ms to minimize.
[2024-05-31 18:05:25] [INFO ] Deduced a trap composed of 43 places in 550 ms of which 10 ms to minimize.
[2024-05-31 18:05:25] [INFO ] Deduced a trap composed of 43 places in 534 ms of which 9 ms to minimize.
[2024-05-31 18:05:26] [INFO ] Deduced a trap composed of 43 places in 541 ms of which 10 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1802 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 3322 unsolved
[2024-05-31 18:05:28] [INFO ] Deduced a trap composed of 43 places in 575 ms of which 10 ms to minimize.
[2024-05-31 18:05:29] [INFO ] Deduced a trap composed of 43 places in 571 ms of which 9 ms to minimize.
[2024-05-31 18:05:29] [INFO ] Deduced a trap composed of 43 places in 519 ms of which 10 ms to minimize.
[2024-05-31 18:05:30] [INFO ] Deduced a trap composed of 43 places in 520 ms of which 10 ms to minimize.
[2024-05-31 18:05:30] [INFO ] Deduced a trap composed of 43 places in 500 ms of which 9 ms to minimize.
[2024-05-31 18:05:31] [INFO ] Deduced a trap composed of 43 places in 492 ms of which 9 ms to minimize.
[2024-05-31 18:05:31] [INFO ] Deduced a trap composed of 43 places in 500 ms of which 9 ms to minimize.
[2024-05-31 18:05:32] [INFO ] Deduced a trap composed of 43 places in 502 ms of which 8 ms to minimize.
[2024-05-31 18:05:33] [INFO ] Deduced a trap composed of 43 places in 477 ms of which 9 ms to minimize.
[2024-05-31 18:05:33] [INFO ] Deduced a trap composed of 43 places in 491 ms of which 8 ms to minimize.
[2024-05-31 18:05:34] [INFO ] Deduced a trap composed of 43 places in 460 ms of which 9 ms to minimize.
[2024-05-31 18:05:34] [INFO ] Deduced a trap composed of 43 places in 435 ms of which 8 ms to minimize.
[2024-05-31 18:05:35] [INFO ] Deduced a trap composed of 43 places in 463 ms of which 9 ms to minimize.
[2024-05-31 18:05:35] [INFO ] Deduced a trap composed of 43 places in 458 ms of which 9 ms to minimize.
[2024-05-31 18:05:36] [INFO ] Deduced a trap composed of 43 places in 510 ms of which 9 ms to minimize.
[2024-05-31 18:05:36] [INFO ] Deduced a trap composed of 44 places in 481 ms of which 8 ms to minimize.
[2024-05-31 18:05:37] [INFO ] Deduced a trap composed of 43 places in 443 ms of which 8 ms to minimize.
[2024-05-31 18:05:37] [INFO ] Deduced a trap composed of 43 places in 437 ms of which 13 ms to minimize.
[2024-05-31 18:05:37] [INFO ] Deduced a trap composed of 43 places in 459 ms of which 7 ms to minimize.
[2024-05-31 18:05:38] [INFO ] Deduced a trap composed of 43 places in 431 ms of which 8 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1802 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 3322 unsolved
[2024-05-31 18:05:41] [INFO ] Deduced a trap composed of 43 places in 598 ms of which 11 ms to minimize.
[2024-05-31 18:05:41] [INFO ] Deduced a trap composed of 43 places in 562 ms of which 9 ms to minimize.
SMT process timed out in 62632ms, After SMT, problems are : Problem set: 0 solved, 3322 unsolved
Search for dead transitions found 0 dead transitions in 62663ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1803/2083 places, 3362/3642 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 63869 ms. Remains : 1803/2083 places, 3362/3642 transitions.
Support contains 2 out of 2083 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2083/2083 places, 3642/3642 transitions.
Applied a total of 0 rules in 102 ms. Remains 2083 /2083 variables (removed 0) and now considering 3642/3642 (removed 0) transitions.
// Phase 1: matrix 3642 rows 2083 cols
[2024-05-31 18:05:42] [INFO ] Computed 41 invariants in 24 ms
[2024-05-31 18:05:43] [INFO ] Implicit Places using invariants in 1092 ms returned []
[2024-05-31 18:05:43] [INFO ] Invariant cache hit.
[2024-05-31 18:05:44] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-31 18:06:08] [INFO ] Implicit Places using invariants and state equation in 25331 ms returned []
Implicit Place search using SMT with State Equation took 26426 ms to find 0 implicit places.
Running 3602 sub problems to find dead transitions.
[2024-05-31 18:06:08] [INFO ] Invariant cache hit.
[2024-05-31 18:06:08] [INFO ] State equation strengthened by 3160 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/2082 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 3602 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2082/5725 variables, and 41 constraints, problems are : Problem set: 0 solved, 3602 unsolved in 30068 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 0/2083 constraints, ReadFeed: 0/3160 constraints, PredecessorRefiner: 3602/3602 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3602 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2082 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 3602 unsolved
[2024-05-31 18:07:04] [INFO ] Deduced a trap composed of 52 places in 684 ms of which 12 ms to minimize.
[2024-05-31 18:07:04] [INFO ] Deduced a trap composed of 52 places in 632 ms of which 11 ms to minimize.
[2024-05-31 18:07:05] [INFO ] Deduced a trap composed of 52 places in 603 ms of which 11 ms to minimize.
[2024-05-31 18:07:06] [INFO ] Deduced a trap composed of 52 places in 611 ms of which 10 ms to minimize.
[2024-05-31 18:07:06] [INFO ] Deduced a trap composed of 52 places in 614 ms of which 10 ms to minimize.
[2024-05-31 18:07:07] [INFO ] Deduced a trap composed of 52 places in 588 ms of which 10 ms to minimize.
[2024-05-31 18:07:07] [INFO ] Deduced a trap composed of 52 places in 568 ms of which 10 ms to minimize.
[2024-05-31 18:07:08] [INFO ] Deduced a trap composed of 52 places in 576 ms of which 10 ms to minimize.
[2024-05-31 18:07:09] [INFO ] Deduced a trap composed of 52 places in 601 ms of which 10 ms to minimize.
[2024-05-31 18:07:09] [INFO ] Deduced a trap composed of 52 places in 579 ms of which 10 ms to minimize.
[2024-05-31 18:07:10] [INFO ] Deduced a trap composed of 52 places in 545 ms of which 10 ms to minimize.
[2024-05-31 18:07:10] [INFO ] Deduced a trap composed of 52 places in 581 ms of which 9 ms to minimize.
SMT process timed out in 62531ms, After SMT, problems are : Problem set: 0 solved, 3602 unsolved
Search for dead transitions found 0 dead transitions in 62563ms
Finished structural reductions in LTL mode , in 1 iterations and 89101 ms. Remains : 2083/2083 places, 3642/3642 transitions.
Treatment of property CANConstruction-PT-040-LTLCardinality-00 finished in 279025 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)))'
Support contains 2 out of 2104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2104/2104 places, 3681/3681 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 2085 transition count 3643
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 2085 transition count 3643
Applied a total of 38 rules in 199 ms. Remains 2085 /2104 variables (removed 19) and now considering 3643/3681 (removed 38) transitions.
// Phase 1: matrix 3643 rows 2085 cols
[2024-05-31 18:07:11] [INFO ] Computed 42 invariants in 27 ms
[2024-05-31 18:07:12] [INFO ] Implicit Places using invariants in 1010 ms returned [396]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1013 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2084/2104 places, 3643/3681 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 2083 transition count 3642
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 2083 transition count 3642
Applied a total of 2 rules in 281 ms. Remains 2083 /2084 variables (removed 1) and now considering 3642/3643 (removed 1) transitions.
// Phase 1: matrix 3642 rows 2083 cols
[2024-05-31 18:07:12] [INFO ] Computed 41 invariants in 23 ms
[2024-05-31 18:07:13] [INFO ] Implicit Places using invariants in 1046 ms returned []
[2024-05-31 18:07:13] [INFO ] Invariant cache hit.
[2024-05-31 18:07:14] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-31 18:07:40] [INFO ] Implicit Places using invariants and state equation in 26355 ms returned []
Implicit Place search using SMT with State Equation took 27404 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 2083/2104 places, 3642/3681 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 28897 ms. Remains : 2083/2104 places, 3642/3681 transitions.
Stuttering acceptance computed with spot in 109 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-040-LTLCardinality-02
Entered a terminal (fully accepting) state of product in 10636 steps with 14 reset in 66 ms.
FORMULA CANConstruction-PT-040-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-040-LTLCardinality-02 finished in 29100 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 2104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2104/2104 places, 3681/3681 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 266 transitions
Trivial Post-agglo rules discarded 266 transitions
Performed 266 trivial Post agglomeration. Transition count delta: 266
Iterating post reduction 0 with 266 rules applied. Total rules applied 266 place count 2104 transition count 3415
Reduce places removed 266 places and 0 transitions.
Iterating post reduction 1 with 266 rules applied. Total rules applied 532 place count 1838 transition count 3415
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 39 Pre rules applied. Total rules applied 532 place count 1838 transition count 3376
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 610 place count 1799 transition count 3376
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 629 place count 1780 transition count 3338
Iterating global reduction 2 with 19 rules applied. Total rules applied 648 place count 1780 transition count 3338
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 2 with 13 rules applied. Total rules applied 661 place count 1780 transition count 3325
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 674 place count 1767 transition count 3325
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 4 with 82 rules applied. Total rules applied 756 place count 1726 transition count 3284
Applied a total of 756 rules in 404 ms. Remains 1726 /2104 variables (removed 378) and now considering 3284/3681 (removed 397) transitions.
// Phase 1: matrix 3284 rows 1726 cols
[2024-05-31 18:07:40] [INFO ] Computed 42 invariants in 27 ms
[2024-05-31 18:07:41] [INFO ] Implicit Places using invariants in 981 ms returned [101]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 988 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1725/2104 places, 3284/3681 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1725 transition count 3282
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 1723 transition count 3282
Applied a total of 4 rules in 142 ms. Remains 1723 /1725 variables (removed 2) and now considering 3282/3284 (removed 2) transitions.
// Phase 1: matrix 3282 rows 1723 cols
[2024-05-31 18:07:41] [INFO ] Computed 41 invariants in 23 ms
[2024-05-31 18:07:42] [INFO ] Implicit Places using invariants in 941 ms returned []
[2024-05-31 18:07:42] [INFO ] Invariant cache hit.
[2024-05-31 18:07:43] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-31 18:08:03] [INFO ] Implicit Places using invariants and state equation in 20753 ms returned []
Implicit Place search using SMT with State Equation took 21702 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1723/2104 places, 3282/3681 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 23238 ms. Remains : 1723/2104 places, 3282/3681 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : CANConstruction-PT-040-LTLCardinality-03
Stuttering criterion allowed to conclude after 247 steps with 0 reset in 5 ms.
FORMULA CANConstruction-PT-040-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-040-LTLCardinality-03 finished in 23311 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 2104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2104/2104 places, 3681/3681 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 264 transitions
Trivial Post-agglo rules discarded 264 transitions
Performed 264 trivial Post agglomeration. Transition count delta: 264
Iterating post reduction 0 with 264 rules applied. Total rules applied 264 place count 2104 transition count 3417
Reduce places removed 264 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 265 rules applied. Total rules applied 529 place count 1840 transition count 3416
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 530 place count 1839 transition count 3416
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 40 Pre rules applied. Total rules applied 530 place count 1839 transition count 3376
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 610 place count 1799 transition count 3376
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 629 place count 1780 transition count 3338
Iterating global reduction 3 with 19 rules applied. Total rules applied 648 place count 1780 transition count 3338
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 3 with 13 rules applied. Total rules applied 661 place count 1780 transition count 3325
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 4 with 13 rules applied. Total rules applied 674 place count 1767 transition count 3325
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 5 with 80 rules applied. Total rules applied 754 place count 1727 transition count 3285
Applied a total of 754 rules in 436 ms. Remains 1727 /2104 variables (removed 377) and now considering 3285/3681 (removed 396) transitions.
// Phase 1: matrix 3285 rows 1727 cols
[2024-05-31 18:08:04] [INFO ] Computed 42 invariants in 29 ms
[2024-05-31 18:08:04] [INFO ] Implicit Places using invariants in 924 ms returned []
[2024-05-31 18:08:04] [INFO ] Invariant cache hit.
[2024-05-31 18:08:05] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-31 18:08:25] [INFO ] Implicit Places using invariants and state equation in 20128 ms returned []
Implicit Place search using SMT with State Equation took 21054 ms to find 0 implicit places.
[2024-05-31 18:08:25] [INFO ] Redundant transitions in 143 ms returned []
Running 3245 sub problems to find dead transitions.
[2024-05-31 18:08:25] [INFO ] Invariant cache hit.
[2024-05-31 18:08:25] [INFO ] State equation strengthened by 3160 read => feed constraints.
(s1475 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 2.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 1.0)
(s85 0.0)
(s86 0.0)
(s87 1.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 1.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 1.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 1.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 1.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 1.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 1.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 1.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 1.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 1.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 1.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 1.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 1.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 0.0)
(s606 0.0)
(s607 0.0)
(s608 0.0)
(s609 0.0)
(s610 0.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 1.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 0.0)
(s636 0.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s642 0.0)
(s643 0.0)
(s644 0.0)
(s645 0.0)
(s646 0.0)
(s647 0.0)
(s648 0.0)
(s649 0.0)
(s650 0.0)
(s651 0.0)
(s652 0.0)
(s653 0.0)
(s654 0.0)
(s655 0.0)
(s656 0.0)
(s657 0.0)
(s658 0.0)
(s659 0.0)
(s660 0.0)
(s661 1.0)
(s662 0.0)
(s663 0.0)
(s664 0.0)
(s665 0.0)
(s666 0.0)
(s667 0.0)
(s668 0.0)
(s669 0.0)
(s670 0.0)
(s671 0.0)
(s672 0.0)
(s673 0.0)
(s674 0.0)
(s675 0.0)
(s676 0.0)
(s677 0.0)
(s678 0.0)
(s679 0.0)
(s680 0.0)
(s681 0.0)
(s682 0.0)
(s683 0.0)
(s684 0.0)
(s685 0.0)
(s686 0.0)
(s687 0.0)
(s688 0.0)
(s689 0.0)
(s690 0.0)
(s691 0.0)
(s692 0.0)
(s693 0.0)
(s694 0.0)
(s695 0.0)
(s696 0.0)
(s697 0.0)
(s698 0.0)
(s699 0.0)
(s700 1.0)
(s701 0.0)
(s702 0.0)
(s703 0.0)
(s704 0.0)
(s705 0.0)
(s706 0.0)
(s707 0.0)
(s708 0.0)
(s709 0.0)
(s710 0.0)
(s711 0.0)
(s712 0.0)
(s713 0.0)
(s714 0.0)
(s715 0.0)
(s716 0.0)
(s717 0.0)
(s718 0.0)
(s719 0.0)
(s720 0.0)
(s721 0.0)
(s722 0.0)
(s723 0.0)
(s724 0.0)
(s725 0.0)
(s726 0.0)
(s727 0.0)
(s728 0.0)
(s729 0.0)
(s730 0.0)
(s731 0.0)
(s732 0.0)
(s733 0.0)
(s734 0.0)
(s735 0.0)
(s736 0.0)
(s737 0.0)
(s738 0.0)
(s739 1.0)
(s740 0.0)
(s741 0.0)
(s742 0.0)
(s743 0.0)
(s744 0.0)
(s745 0.0)
(s746 0.0)
(s747 0.0)
(s748 0.0)
(s749 0.0)
(s750 0.0)
(s751 0.0)
(s752 0.0)
(s753 0.0)
(s754 0.0)
(s755 0.0)
(s756 0.0)
(s757 0.0)
(s758 0.0)
(s759 0.0)
(s760 0.0)
(s761 0.0)
(s762 0.0)
(s763 0.0)
(s764 0.0)
(s765 0.0)
(s766 0.0)
(s767 0.0)
(s768 0.0)
(s769 0.0)
(s770 0.0)
(s771 0.0)
(s772 0.0)
(s773 0.0)
(s774 0.0)
(s775 0.0)
(s776 0.0)
(s777 0.0)
(s778 1.0)
(s779 0.0)
(s780 0.0)
(s781 0.0)
(s782 0.0)
(s783 0.0)
(s784 0.0)
(s785 0.0)
(s786 0.0)
(s787 0.0)
(s788 0.0)
(s789 0.0)
(s790 0.0)
(s791 0.0)
(s792 0.0)
(s793 0.0)
(s794 0.0)
(s795 0.0)
(s796 0.0)
(s797 0.0)
(s798 0.0)
(s799 0.0)
(s800 0.0)
(s801 0.0)
(s802 0.0)
(s803 0.0)
(s804 0.0)
(s805 0.0)
(s806 0.0)
(s807 0.0)
(s808 0.0)
(s809 0.0)
(s810 0.0)
(s811 0.0)
(s812 0.0)
(s813 0.0)
(s814 0.0)
(s815 0.0)
(s816 0.0)
(s817 1.0)
(s818 0.0)
(s819 0.0)
(s820 0.0)
(s821 0.0)
(s822 0.0)
(s823 0.0)
(s824 0.0)
(s825 0.0)
(s826 0.0)
(s827 0.0)
(s828 0.0)
(s829 0.0)
(s830 0.0)
(s831 0.0)
(s832 0.0)
(s833 0.0)
(s834 0.0)
(s835 0.0)
(s836 0.0)
(s837 0.0)
(s838 0.0)
(s839 0.0)
(s840 0.0)
(s841 0.0)
(s842 0.0)
(s843 0.0)
(s844 0.0)
(s845 0.0)
(s846 0.0)
(s847 0.0)
(s848 0.0)
(s849 0.0)
(s850 0.0)
(s851 0.0)
(s852 0.0)
(s853 0.0)
(s854 0.0)
(s855 0.0)
(s856 1.0)
(s857 0.0)
(s858 0.0)
(s859 0.0)
(s860 0.0)
(s861 0.0)
(s862 0.0)
(s863 0.0)
(s864 0.0)
(s865 0.0)
(s866 0.0)
(s867 0.0)
(s868 0.0)
(s869 0.0)
(s870 0.0)
(s871 0.0)
(s872 0.0)
(s873 0.0)
(s874 0.0)
(s875 0.0)
(s876 0.0)
(s877 0.0)
(s878 0.0)
(s879 0.0)
(s880 0.0)
(s881 0.0)
(s882 0.0)
(s883 0.0)
(s884 0.0)
(s885 0.0)
(s886 0.0)
(s887 0.0)
(s888 0.0)
(s889 0.0)
(s890 0.0)
(s891 0.0)
(s892 0.0)
(s893 0.0)
(s894 0.0)
(s895 1.0)
(s896 0.0)
(s897 0.0)
(s898 0.0)
(s899 0.0)
(s900 0.0)
(s901 0.0)
(s902 0.0)
(s903 0.0)
(s904 0.0)
(s905 0.0)
(s906 0.0)
(s907 0.0)
(s908 0.0)
(s909 0.0)
(s910 0.0)
(s911 0.0)
(s912 0.0)
(s913 0.0)
(s914 0.0)
(s915 0.0)
(s916 0.0)
(s917 0.0)
(s918 0.0)
(s919 0.0)
(s920 0.0)
(s921 0.0)
(s922 0.0)
(s923 0.0)
(s924 0.0)
(s925 0.0)
(s926 0.0)
(s927 0.0)
(s928 0.0)
(s929 0.0)
(s930 0.0)
(s931 0.0)
(s932 0.0)
(s933 0.0)
(s934 1.0)
(s935 0.0)
(s936 0.0)
(s937 0.0)
(s938 0.0)
(s939 0.0)
(s940 0.0)
(s941 0.0)
(s942 0.0)
(s943 0.0)
(s944 0.0)
(s945 0.0)
(s946 0.0)
(s947 0.0)
(s948 0.0)
(s949 0.0)
(s950 0.0)
(s951 0.0)
(s952 0.0)
(s953 0.0)
(s954 0.0)
(s955 0.0)
(s956 0.0)
(s957 0.0)
(s958 0.0)
(s959 0.0)
(s960 0.0)
(s961 0.0)
(s962 0.0)
(s963 0.0)
(s964 0.0)
(s965 0.0)
(s966 0.0)
(s967 0.0)
(s968 0.0)
(s969 0.0)
(s970 0.0)
(s971 0.0)
(s972 0.0)
(s973 1.0)
(s974 0.0)
(s975 0.0)
(s976 0.0)
(s977 0.0)
(s978 0.0)
(s979 0.0)
(s980 0.0)
(s981 0.0)
(s982 0.0)
(s983 0.0)
(s984 0.0)
(s985 0.0)
(s986 0.0)
(s987 0.0)
(s988 0.0)
(s989 0.0)
(s990 0.0)
(s991 0.0)
(s992 0.0)
(s993 0.0)
(s994 0.0)
(s995 0.0)
(s996 0.0)
(s997 0.0)
(s998 0.0)
(s999 0.0)
(s1000 0.0)
(s1001 0.0)
(s1002 0.0)
(s1003 0.0)
(s1004 0.0)
(s1005 0.0)
(s1006 0.0)
(s1007 0.0)
(s1008 0.0)
(s1009 0.0)
(s1010 0.0)
(s1011 0.0)
(s1012 1.0)
(s1013 0.0)
(s1014 0.0)
(s1015 0.0)
(s1016 0.0)
(s1017 0.0)
(s1018 0.0)
(s1019 0.0)
(s1020 0.0)
(s1021 0.0)
(s1022 0.0)
(s1023 0.0)
(s1024 0.0)
(s1025 0.0)
(s1026 0.0)
(s1027 0.0)
(s1028 0.0)
(s1029 0.0)
(s1030 0.0)
(s1031 0.0)
(s1032 0.0)
(s1033 0.0)
(s1034 0.0)
(s1035 0.0)
(s1036 0.0)
(s1037 0.0)
(s1038 0.0)
(s1039 0.0)
(s1040 0.0)
(s1041 0.0)
(s1042 0.0)
(s1043 0.0)
(s1044 0.0)
(s1045 0.0)
(s1046 0.0)
(s1047 0.0)
(s1048 0.0)
(s1049 0.0)
(s1050 0.0)
(s1051 1.0)
(s1052 0.0)
(s1053 0.0)
(s1054 0.0)
(s1055 0.0)
(s1056 0.0)
(s1057 0.0)
(s1058 0.0)
(s1059 0.0)
(s1060 0.0)
(s1061 0.0)
(s1062 0.0)
(s1063 0.0)
(s1064 0.0)
(s1065 0.0)
(s1066 0.0)
(s1067 0.0)
(s1068 0.0)
(s1069 0.0)
(s1070 0.0)
(s1071 0.0)
(s1072 0.0)
(s1073 0.0)
(s1074 0.0)
(s1075 0.0)
(s1076 0.0)
(s1077 0.0)
(s1078 0.0)
(s1079 0.0)
(s1080 0.0)
(s1081 0.0)
(s1082 0.0)
(s1083 0.0)
(s1084 0.0)
(s1085 0.0)
(s1086 0.0)
(s1087 0.0)
(s1088 0.0)
(s1089 0.0)
(s1090 1.0)
(s1091 0.0)
(s1092 0.0)
(s1093 0.0)
(s1094 0.0)
(s1095 0.0)
(s1096 0.0)
(s1097 0.0)
(s1098 0.0)
(s1099 0.0)
(s1100 0.0)
(s1101 0.0)
(s1102 0.0)
(s1103 0.0)
(s1104 0.0)
(s1105 0.0)
(s1106 0.0)
(s1107 0.0)
(s1108 0.0)
(s1109 0.0)
(s1110 0.0)
(s1111 0.0)
(s1112 0.0)
(s1113 0.0)
(s1114 0.0)
(s1115 0.0)
(s1116 0.0)
(s1117 0.0)
(s1118 0.0)
(s1119 0.0)
(s1120 0.0)
(s1121 0.0)
(s1122 0.0)
(s1123 0.0)
(s1124 0.0)
(s1125 0.0)
(s1126 0.0)
(s1127 0.0)
(s1128 0.0)
(s1129 1.0)
(s1130 0.0)
(s1131 0.0)
(s1132 0.0)
(s1133 0.0)
(s1134 0.0)
(s1135 0.0)
(s1136 0.0)
(s1137 0.0)
(s1138 0.0)
(s1139 0.0)
(s1140 0.0)
(s1141 0.0)
(s1142 0.0)
(s1143 0.0)
(s1144 0.0)
(s1145 0.0)
(s1146 0.0)
(s1147 0.0)
(s1148 0.0)
(s1149 0.0)
(s1150 0.0)
(s1151 0.0)
(s1152 0.0)
(s1153 0.0)
(s1154 0.0)
(s1155 0.0)
(s1156 0.0)
(s1157 0.0)
(s1158 0.0)
(s1159 0.0)
(s1160 0.0)
(s1161 0.0)
(s1162 0.0)
(s1163 0.0)
(s1164 0.0)
(s1165 0.0)
(s1166 0.0)
(s1167 0.0)
(s1168 1.0)
(s1169 0.0)
(s1170 0.0)
(s1171 0.0)
(s1172 0.0)
(s1173 0.0)
(s1174 0.0)
(s1175 0.0)
(s1176 0.0)
(s1177 0.0)
(s1178 0.0)
(s1179 0.0)
(s1180 0.0)
(s1181 0.0)
(s1182 0.0)
(s1183 0.0)
(s1184 0.0)
(s1185 0.0)
(s1186 0.0)
(s1187 0.0)
(s1188 0.0)
(s1189 0.0)
(s1190 0.0)
(s1191 0.0)
(s1192 0.0)
(s1193 0.0)
(s1194 0.0)
(s1195 0.0)
(s1196 0.0)
(s1197 0.0)
(s1198 0.0)
(s1199 0.0)
(s1200 0.0)
(s1201 0.0)
(s1202 0.0)
(s1203 0.0)
(s1204 0.0)
(s1205 0.0)
(s1206 0.0)
(s1207 1.0)
(s1208 0.0)
(s1209 0.0)
(s1210 0.0)
(s1211 0.0)
(s1212 0.0)
(s1213 0.0)
(s1214 0.0)
(s1215 0.0)
(s1216 0.0)
(s1217 0.0)
(s1218 0.0)
(s1219 0.0)
(s1220 0.0)
(s1221 0.0)
(s1222 0.0)
(s1223 0.0)
(s1224 0.0)
(s1225 0.0)
(s1226 0.0)
(s1227 0.0)
(s1228 0.0)
(s1229 0.0)
(s1230 0.0)
(s1231 0.0)
(s1232 0.0)
(s1233 0.0)
(s1234 0.0)
(s1235 0.0)
(s1236 0.0)
(s1237 0.0)
(s1238 0.0)
(s1239 0.0)
(s1240 0.0)
(s1241 0.0)
(s1242 0.0)
(s1243 0.0)
(s1244 0.0)
(s1245 0.0)
(s1246 0.0)
(s1247 0.0)
(s1248 0.0)
(s1249 0.0)
(s1250 0.0)
(s1251 0.0)
(s1252 0.0)
(s1253 0.0)
(s1254 0.0)
(s1255 0.0)
(s1256 0.0)
(s1257 0.0)
(s1258 0.0)
(s1259 0.0)
(s1260 0.0)
(s1261 0.0)
(s1262 0.0)
(s1263 0.0)
(s1264 0.0)
(s1265 0.0)
(s1266 0.0)
(s1267 0.0)
(s1268 0.0)
(s1269 0.0)
(s1270 0.0)
(s1271 0.0)
(s1272 0.0)
(s1273 0.0)
(s1274 0.0)
(s1275 0.0)
(s1276 0.0)
(s1277 0.0)
(s1278 0.0)
(s1279 0.0)
(s1280 0.0)
(s1281 0.0)
(s1282 0.0)
(s1283 0.0)
(s1284 0.0)
(s1285 0.0)
(s1286 0.0)
(s1287 0.0)
(s1288 0.0)
(s1289 0.0)
(s1290 0.0)
(s1291 0.0)
(s1292 0.0)
(s1293 0.0)
(s1294 0.0)
(s1295 0.0)
(s1296 0.0)
(s1297 0.0)
(s1298 0.0)
(s1299 0.0)
(s1300 0.0)
(s1301 0.0)
(s1302 0.0)
(s1303 0.0)
(s1304 0.0)
(s1305 0.0)
(s1306 0.0)
(s1307 0.0)
(s1308 0.0)
(s1309 0.0)
(s1310 0.0)
(s1311 0.0)
(s1312 0.0)
(s1313 0.0)
(s1314 0.0)
(s1315 0.0)
(s1316 0.0)
(s1317 0.0)
(s1318 0.0)
(s1319 0.0)
(s1320 0.0)
(s1321 0.0)
(s1322 0.0)
(s1323 0.0)
(s1324 1.0)
(s1325 0.0)
(s1326 0.0)
(s1327 0.0)
(s1328 0.0)
(s1329 0.0)
(s1330 0.0)
(s1331 0.0)
(s1332 0.0)
(s1333 0.0)
(s1334 0.0)
(s1335 0.0)
(s1336 0.0)
(s1337 0.0)
(s1338 0.0)
(s1339 0.0)
(s1340 0.0)
(s1341 0.0)
(s1342 0.0)
(s1343 0.0)
(s1344 0.0)
(s1345 0.0)
(s1346 0.0)
(s1347 0.0)
(s1348 0.0)
(s1349 0.0)
(s1350 0.0)
(s1351 0.0)
(s1352 0.0)
(s1353 0.0)
(s1354 0.0)
(s1355 0.0)
(s1356 0.0)
(s1357 0.0)
(s1358 0.0)
(s1359 0.0)
(s1360 0.0)
(s1361 0.0)
(s1362 0.0)
(s1363 1.0)
(s1364 0.0)
(s1365 0.0)
(s1366 0.0)
(s1367 0.0)
(s1368 0.0)
(s1369 0.0)
(s1370 0.0)
(s1371 0.0)
(s1372 0.0)
(s1373 0.0)
(s1374 0.0)
(s1375 0.0)
(s1376 0.0)
(s1377 0.0)
(s1378 0.0)
(s1379 0.0)
(s1380 0.0)
(s1381 0.0)
(s1382 0.0)
(s1383 0.0)
(s1384 0.0)
(s1385 0.0)
(s1386 0.0)
(s1387 0.0)
(s1388 0.0)
(s1389 0.0)
(s1390 0.0)
(s1391 0.0)
(s1392 0.0)
(s1393 0.0)
(s1394 0.0)
(s1395 0.0)
(s1396 0.0)
(s1397 0.0)
(s1398 0.0)
(s1399 0.0)
(s1400 0.0)
(s1401 0.0)
(s1402 1.0)
(s1403 0.0)
(s1404 0.0)
(s1405 0.0)
(s1406 0.0)
(s1407 0.0)
(s1408 0.0)
(s1409 0.0)
(s1410 0.0)
(s1411 0.0)
(s1412 0.0)
(s1413 0.0)
(s1414 0.0)
(s1415 0.0)
(s1416 0.0)
(s1417 0.0)
(s1418 0.0)
(s1419 0.0)
(s1420 0.0)
(s1421 0.0)
(s1422 0.0)
(s1423 0.0)
(s1424 0.0)
(s1425 0.0)
(s1426 0.0)
(s1427 0.0)
(s1428 0.0)
(s1429 0.0)
(s1430 0.0)
(s1431 0.0)
(s1432 0.0)
(s1433 0.0)
(s1434 0.0)
(s1435 0.0)
(s1436 0.0)
(s1437 0.0)
(s1438 0.0)
(s1439 0.0)
(s1440 0.0)
(s1441 1.0)
(s1442 0.0)
(s1443 0.0)
(s1444 0.0)
(s1445 0.0)
(s1446 0.0)
(s1447 0.0)
(s1448 0.0)
(s1449 0.0)
(s1450 0.0)
(s1451 0.0)
(s1452 0.0)
(s1453 0.0)
(s1454 0.0)
(s1455 0.0)
(s1456 0.0)
(s1457 0.0)
(s1458 0.0)
(s1459 0.0)
(s1460 0.0)
(s1461 0.0)
(s1462 0.0)
(s1463 0.0)
(s1464 0.0)
(s1465 0.0)
(s1466 0.0)
(s1467 0.0)
(s1468 0.0)
(s1469 0.0)
(s1470 0.0)
(s1471 0.0)
(s1472 0.0)
(s1473 0.0)
(s1474 0.0)
(s1475 0.0timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1726 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 3245 unsolved
SMT process timed out in 31987ms, After SMT, problems are : Problem set: 0 solved, 3245 unsolved
Search for dead transitions found 0 dead transitions in 32014ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1727/2104 places, 3285/3681 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 53663 ms. Remains : 1727/2104 places, 3285/3681 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-040-LTLCardinality-05
Product exploration explored 100000 steps with 513 reset in 786 ms.
Stack based approach found an accepted trace after 330 steps with 1 reset with depth 243 and stack size 243 in 3 ms.
FORMULA CANConstruction-PT-040-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property CANConstruction-PT-040-LTLCardinality-05 finished in 54586 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))'
Support contains 3 out of 2104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2104/2104 places, 3681/3681 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 266 transitions
Trivial Post-agglo rules discarded 266 transitions
Performed 266 trivial Post agglomeration. Transition count delta: 266
Iterating post reduction 0 with 266 rules applied. Total rules applied 266 place count 2104 transition count 3415
Reduce places removed 266 places and 0 transitions.
Iterating post reduction 1 with 266 rules applied. Total rules applied 532 place count 1838 transition count 3415
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 39 Pre rules applied. Total rules applied 532 place count 1838 transition count 3376
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 610 place count 1799 transition count 3376
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 627 place count 1782 transition count 3342
Iterating global reduction 2 with 17 rules applied. Total rules applied 644 place count 1782 transition count 3342
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 2 with 11 rules applied. Total rules applied 655 place count 1782 transition count 3331
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 666 place count 1771 transition count 3331
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Deduced a syphon composed of 43 places in 1 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 4 with 86 rules applied. Total rules applied 752 place count 1728 transition count 3288
Applied a total of 752 rules in 579 ms. Remains 1728 /2104 variables (removed 376) and now considering 3288/3681 (removed 393) transitions.
// Phase 1: matrix 3288 rows 1728 cols
[2024-05-31 18:08:58] [INFO ] Computed 42 invariants in 29 ms
[2024-05-31 18:08:59] [INFO ] Implicit Places using invariants in 973 ms returned [101]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 979 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1727/2104 places, 3288/3681 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1727 transition count 3286
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 1725 transition count 3286
Applied a total of 4 rules in 142 ms. Remains 1725 /1727 variables (removed 2) and now considering 3286/3288 (removed 2) transitions.
// Phase 1: matrix 3286 rows 1725 cols
[2024-05-31 18:08:59] [INFO ] Computed 41 invariants in 24 ms
[2024-05-31 18:09:00] [INFO ] Implicit Places using invariants in 986 ms returned []
[2024-05-31 18:09:00] [INFO ] Invariant cache hit.
[2024-05-31 18:09:01] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-31 18:09:20] [INFO ] Implicit Places using invariants and state equation in 19204 ms returned []
Implicit Place search using SMT with State Equation took 20192 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1725/2104 places, 3286/3681 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 21894 ms. Remains : 1725/2104 places, 3286/3681 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : CANConstruction-PT-040-LTLCardinality-06
Stuttering criterion allowed to conclude after 277 steps with 0 reset in 8 ms.
FORMULA CANConstruction-PT-040-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-040-LTLCardinality-06 finished in 21964 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G(p1))))'
Support contains 3 out of 2104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2104/2104 places, 3681/3681 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 2086 transition count 3645
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 2086 transition count 3645
Applied a total of 36 rules in 287 ms. Remains 2086 /2104 variables (removed 18) and now considering 3645/3681 (removed 36) transitions.
// Phase 1: matrix 3645 rows 2086 cols
[2024-05-31 18:09:20] [INFO ] Computed 42 invariants in 26 ms
[2024-05-31 18:09:21] [INFO ] Implicit Places using invariants in 1019 ms returned [396]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1022 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2085/2104 places, 3645/3681 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 2084 transition count 3644
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 2084 transition count 3644
Applied a total of 2 rules in 246 ms. Remains 2084 /2085 variables (removed 1) and now considering 3644/3645 (removed 1) transitions.
// Phase 1: matrix 3644 rows 2084 cols
[2024-05-31 18:09:21] [INFO ] Computed 41 invariants in 23 ms
[2024-05-31 18:09:22] [INFO ] Implicit Places using invariants in 981 ms returned []
[2024-05-31 18:09:22] [INFO ] Invariant cache hit.
[2024-05-31 18:09:23] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-31 18:09:48] [INFO ] Implicit Places using invariants and state equation in 25654 ms returned []
Implicit Place search using SMT with State Equation took 26638 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 2084/2104 places, 3644/3681 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 28194 ms. Remains : 2084/2104 places, 3644/3681 transitions.
Stuttering acceptance computed with spot in 137 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : CANConstruction-PT-040-LTLCardinality-11
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CANConstruction-PT-040-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-040-LTLCardinality-11 finished in 28361 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(p1)&&p0)))'
Support contains 5 out of 2104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2104/2104 places, 3681/3681 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 2085 transition count 3643
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 2085 transition count 3643
Applied a total of 38 rules in 241 ms. Remains 2085 /2104 variables (removed 19) and now considering 3643/3681 (removed 38) transitions.
// Phase 1: matrix 3643 rows 2085 cols
[2024-05-31 18:09:48] [INFO ] Computed 42 invariants in 23 ms
[2024-05-31 18:09:49] [INFO ] Implicit Places using invariants in 1024 ms returned [396]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1026 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2084/2104 places, 3643/3681 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 2083 transition count 3642
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 2083 transition count 3642
Applied a total of 2 rules in 255 ms. Remains 2083 /2084 variables (removed 1) and now considering 3642/3643 (removed 1) transitions.
// Phase 1: matrix 3642 rows 2083 cols
[2024-05-31 18:09:50] [INFO ] Computed 41 invariants in 27 ms
[2024-05-31 18:09:51] [INFO ] Implicit Places using invariants in 1028 ms returned []
[2024-05-31 18:09:51] [INFO ] Invariant cache hit.
[2024-05-31 18:09:52] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-31 18:10:17] [INFO ] Implicit Places using invariants and state equation in 26339 ms returned []
Implicit Place search using SMT with State Equation took 27369 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 2083/2104 places, 3642/3681 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 28892 ms. Remains : 2083/2104 places, 3642/3681 transitions.
Stuttering acceptance computed with spot in 161 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : CANConstruction-PT-040-LTLCardinality-15
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA CANConstruction-PT-040-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-040-LTLCardinality-15 finished in 29076 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U G((F(!p0)||X(p1)))))'
Found a Lengthening insensitive property : CANConstruction-PT-040-LTLCardinality-00
Stuttering acceptance computed with spot in 217 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), false, p0]
Support contains 2 out of 2104 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 2104/2104 places, 3681/3681 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 266 transitions
Trivial Post-agglo rules discarded 266 transitions
Performed 266 trivial Post agglomeration. Transition count delta: 266
Iterating post reduction 0 with 266 rules applied. Total rules applied 266 place count 2104 transition count 3415
Reduce places removed 266 places and 0 transitions.
Iterating post reduction 1 with 266 rules applied. Total rules applied 532 place count 1838 transition count 3415
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 39 Pre rules applied. Total rules applied 532 place count 1838 transition count 3376
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 610 place count 1799 transition count 3376
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 629 place count 1780 transition count 3338
Iterating global reduction 2 with 19 rules applied. Total rules applied 648 place count 1780 transition count 3338
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 2 with 13 rules applied. Total rules applied 661 place count 1780 transition count 3325
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 674 place count 1767 transition count 3325
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 4 with 82 rules applied. Total rules applied 756 place count 1726 transition count 3284
Applied a total of 756 rules in 386 ms. Remains 1726 /2104 variables (removed 378) and now considering 3284/3681 (removed 397) transitions.
// Phase 1: matrix 3284 rows 1726 cols
[2024-05-31 18:10:18] [INFO ] Computed 42 invariants in 29 ms
[2024-05-31 18:10:19] [INFO ] Implicit Places using invariants in 974 ms returned [101]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 977 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 1725/2104 places, 3284/3681 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1725 transition count 3282
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 1723 transition count 3282
Applied a total of 4 rules in 113 ms. Remains 1723 /1725 variables (removed 2) and now considering 3282/3284 (removed 2) transitions.
// Phase 1: matrix 3282 rows 1723 cols
[2024-05-31 18:10:19] [INFO ] Computed 41 invariants in 25 ms
[2024-05-31 18:10:20] [INFO ] Implicit Places using invariants in 949 ms returned []
[2024-05-31 18:10:20] [INFO ] Invariant cache hit.
[2024-05-31 18:10:21] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-31 18:10:41] [INFO ] Implicit Places using invariants and state equation in 20917 ms returned []
Implicit Place search using SMT with State Equation took 21869 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 1723/2104 places, 3282/3681 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 23348 ms. Remains : 1723/2104 places, 3282/3681 transitions.
Running random walk in product with property : CANConstruction-PT-040-LTLCardinality-00
Product exploration explored 100000 steps with 33347 reset in 912 ms.
Product exploration explored 100000 steps with 33267 reset in 935 ms.
Computed a total of 41 stabilizing places and 80 stable transitions
Computed a total of 41 stabilizing places and 80 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1)), (X (X (AND p0 p1)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 98 ms. Reduced automaton from 6 states, 11 edges and 2 AP (stutter sensitive) to 6 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 250 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), false, p0]
RANDOM walk for 34889 steps (125 resets) in 391 ms. (89 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1)), (X (X (AND p0 p1)))]
False Knowledge obtained : [(F (NOT (AND p0 p1))), (F (NOT (OR (NOT p0) p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 8 factoid took 253 ms. Reduced automaton from 6 states, 11 edges and 2 AP (stutter sensitive) to 6 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 233 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), false, p0]
Stuttering acceptance computed with spot in 255 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), false, p0]
Support contains 2 out of 1723 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1723/1723 places, 3282/3282 transitions.
Applied a total of 0 rules in 87 ms. Remains 1723 /1723 variables (removed 0) and now considering 3282/3282 (removed 0) transitions.
[2024-05-31 18:10:44] [INFO ] Invariant cache hit.
[2024-05-31 18:10:45] [INFO ] Implicit Places using invariants in 960 ms returned []
[2024-05-31 18:10:45] [INFO ] Invariant cache hit.
[2024-05-31 18:10:46] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-31 18:11:06] [INFO ] Implicit Places using invariants and state equation in 20634 ms returned []
Implicit Place search using SMT with State Equation took 21596 ms to find 0 implicit places.
Running 3242 sub problems to find dead transitions.
[2024-05-31 18:11:06] [INFO ] Invariant cache hit.
[2024-05-31 18:11:06] [INFO ] State equation strengthened by 3160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1722 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 3242 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1722/5005 variables, and 41 constraints, problems are : Problem set: 0 solved, 3242 unsolved in 30068 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 0/1723 constraints, ReadFeed: 0/3160 constraints, PredecessorRefiner: 3242/3242 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3242 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1722 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 3242 unsolved
[2024-05-31 18:11:40] [INFO ] Deduced a trap composed of 43 places in 691 ms of which 11 ms to minimize.
[2024-05-31 18:11:44] [INFO ] Deduced a trap composed of 43 places in 613 ms of which 10 ms to minimize.
[2024-05-31 18:11:46] [INFO ] Deduced a trap composed of 43 places in 596 ms of which 10 ms to minimize.
[2024-05-31 18:11:46] [INFO ] Deduced a trap composed of 43 places in 610 ms of which 10 ms to minimize.
[2024-05-31 18:11:48] [INFO ] Deduced a trap composed of 43 places in 1296 ms of which 12 ms to minimize.
[2024-05-31 18:11:49] [INFO ] Deduced a trap composed of 43 places in 1246 ms of which 10 ms to minimize.
[2024-05-31 18:11:50] [INFO ] Deduced a trap composed of 43 places in 1234 ms of which 12 ms to minimize.
[2024-05-31 18:11:52] [INFO ] Deduced a trap composed of 48 places in 1209 ms of which 11 ms to minimize.
[2024-05-31 18:11:53] [INFO ] Deduced a trap composed of 43 places in 1196 ms of which 11 ms to minimize.
[2024-05-31 18:11:54] [INFO ] Deduced a trap composed of 43 places in 1154 ms of which 11 ms to minimize.
[2024-05-31 18:11:55] [INFO ] Deduced a trap composed of 43 places in 1187 ms of which 11 ms to minimize.
[2024-05-31 18:11:56] [INFO ] Deduced a trap composed of 43 places in 1185 ms of which 10 ms to minimize.
[2024-05-31 18:11:58] [INFO ] Deduced a trap composed of 43 places in 1173 ms of which 12 ms to minimize.
[2024-05-31 18:11:59] [INFO ] Deduced a trap composed of 43 places in 1142 ms of which 11 ms to minimize.
[2024-05-31 18:12:00] [INFO ] Deduced a trap composed of 48 places in 1117 ms of which 10 ms to minimize.
[2024-05-31 18:12:01] [INFO ] Deduced a trap composed of 43 places in 1108 ms of which 11 ms to minimize.
[2024-05-31 18:12:02] [INFO ] Deduced a trap composed of 43 places in 1099 ms of which 11 ms to minimize.
[2024-05-31 18:12:03] [INFO ] Deduced a trap composed of 46 places in 1138 ms of which 11 ms to minimize.
[2024-05-31 18:12:05] [INFO ] Deduced a trap composed of 43 places in 1084 ms of which 11 ms to minimize.
[2024-05-31 18:12:06] [INFO ] Deduced a trap composed of 49 places in 1012 ms of which 10 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1722 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 3242 unsolved
[2024-05-31 18:12:09] [INFO ] Deduced a trap composed of 44 places in 1276 ms of which 11 ms to minimize.
SMT process timed out in 63028ms, After SMT, problems are : Problem set: 0 solved, 3242 unsolved
Search for dead transitions found 0 dead transitions in 63061ms
Finished structural reductions in LTL mode , in 1 iterations and 84760 ms. Remains : 1723/1723 places, 3282/3282 transitions.
Computed a total of 41 stabilizing places and 80 stable transitions
Computed a total of 41 stabilizing places and 80 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1)), (X (X (AND p0 p1)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 94 ms. Reduced automaton from 6 states, 11 edges and 2 AP (stutter sensitive) to 6 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 239 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), false, p0]
RANDOM walk for 25968 steps (92 resets) in 242 ms. (106 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1)), (X (X (AND p0 p1)))]
False Knowledge obtained : [(F (NOT (AND p0 p1))), (F (NOT (OR (NOT p0) p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 8 factoid took 238 ms. Reduced automaton from 6 states, 11 edges and 2 AP (stutter sensitive) to 6 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 221 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), false, p0]
Stuttering acceptance computed with spot in 257 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), false, p0]
Stuttering acceptance computed with spot in 238 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), false, p0]
Product exploration explored 100000 steps with 33416 reset in 992 ms.
Product exploration explored 100000 steps with 33336 reset in 1014 ms.
Applying partial POR strategy [false, false, true, true, true, true]
Stuttering acceptance computed with spot in 250 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), false, p0]
Support contains 2 out of 1723 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1723/1723 places, 3282/3282 transitions.
Applied a total of 0 rules in 122 ms. Remains 1723 /1723 variables (removed 0) and now considering 3282/3282 (removed 0) transitions.
[2024-05-31 18:12:13] [INFO ] Redundant transitions in 90 ms returned []
Running 3242 sub problems to find dead transitions.
[2024-05-31 18:12:13] [INFO ] Invariant cache hit.
[2024-05-31 18:12:13] [INFO ] State equation strengthened by 3160 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 1.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 1.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 timeout
0.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1722 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 3242 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1722/5005 variables, and 41 constraints, problems are : Problem set: 0 solved, 3242 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 0/1723 constraints, ReadFeed: 0/3160 constraints, PredecessorRefiner: 3242/3242 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3242 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1722 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 3242 unsolved
[2024-05-31 18:12:47] [INFO ] Deduced a trap composed of 43 places in 709 ms of which 11 ms to minimize.
[2024-05-31 18:12:51] [INFO ] Deduced a trap composed of 43 places in 656 ms of which 11 ms to minimize.
[2024-05-31 18:12:53] [INFO ] Deduced a trap composed of 43 places in 615 ms of which 10 ms to minimize.
[2024-05-31 18:12:53] [INFO ] Deduced a trap composed of 43 places in 602 ms of which 10 ms to minimize.
[2024-05-31 18:12:55] [INFO ] Deduced a trap composed of 43 places in 1145 ms of which 10 ms to minimize.
[2024-05-31 18:12:56] [INFO ] Deduced a trap composed of 43 places in 1269 ms of which 11 ms to minimize.
[2024-05-31 18:12:57] [INFO ] Deduced a trap composed of 43 places in 1226 ms of which 11 ms to minimize.
[2024-05-31 18:12:58] [INFO ] Deduced a trap composed of 48 places in 1225 ms of which 11 ms to minimize.
[2024-05-31 18:13:00] [INFO ] Deduced a trap composed of 43 places in 1211 ms of which 11 ms to minimize.
[2024-05-31 18:13:01] [INFO ] Deduced a trap composed of 43 places in 1194 ms of which 10 ms to minimize.
[2024-05-31 18:13:02] [INFO ] Deduced a trap composed of 43 places in 1186 ms of which 11 ms to minimize.
[2024-05-31 18:13:03] [INFO ] Deduced a trap composed of 43 places in 1194 ms of which 11 ms to minimize.
[2024-05-31 18:13:05] [INFO ] Deduced a trap composed of 43 places in 1170 ms of which 11 ms to minimize.
[2024-05-31 18:13:06] [INFO ] Deduced a trap composed of 43 places in 1144 ms of which 13 ms to minimize.
[2024-05-31 18:13:07] [INFO ] Deduced a trap composed of 48 places in 1119 ms of which 10 ms to minimize.
[2024-05-31 18:13:08] [INFO ] Deduced a trap composed of 43 places in 1092 ms of which 11 ms to minimize.
[2024-05-31 18:13:09] [INFO ] Deduced a trap composed of 43 places in 1096 ms of which 11 ms to minimize.
[2024-05-31 18:13:10] [INFO ] Deduced a trap composed of 46 places in 1105 ms of which 11 ms to minimize.
[2024-05-31 18:13:11] [INFO ] Deduced a trap composed of 43 places in 1073 ms of which 11 ms to minimize.
[2024-05-31 18:13:12] [INFO ] Deduced a trap composed of 49 places in 1038 ms of which 9 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1722 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 3242 unsolved
[2024-05-31 18:13:15] [INFO ] Deduced a trap composed of 44 places in 1242 ms of which 11 ms to minimize.
SMT process timed out in 62763ms, After SMT, problems are : Problem set: 0 solved, 3242 unsolved
Search for dead transitions found 0 dead transitions in 62801ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 63029 ms. Remains : 1723/1723 places, 3282/3282 transitions.
Support contains 2 out of 1723 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1723/1723 places, 3282/3282 transitions.
Applied a total of 0 rules in 82 ms. Remains 1723 /1723 variables (removed 0) and now considering 3282/3282 (removed 0) transitions.
[2024-05-31 18:13:16] [INFO ] Invariant cache hit.
[2024-05-31 18:13:16] [INFO ] Implicit Places using invariants in 908 ms returned []
[2024-05-31 18:13:16] [INFO ] Invariant cache hit.
[2024-05-31 18:13:17] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-31 18:13:37] [INFO ] Implicit Places using invariants and state equation in 20458 ms returned []
Implicit Place search using SMT with State Equation took 21367 ms to find 0 implicit places.
Running 3242 sub problems to find dead transitions.
[2024-05-31 18:13:37] [INFO ] Invariant cache hit.
[2024-05-31 18:13:37] [INFO ] State equation strengthened by 3160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1722 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 3242 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1722/5005 variables, and 41 constraints, problems are : Problem set: 0 solved, 3242 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 0/1723 constraints, ReadFeed: 0/3160 constraints, PredecessorRefiner: 3242/3242 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3242 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1722 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 3242 unsolved
[2024-05-31 18:14:11] [INFO ] Deduced a trap composed of 43 places in 703 ms of which 10 ms to minimize.
[2024-05-31 18:14:15] [INFO ] Deduced a trap composed of 43 places in 651 ms of which 10 ms to minimize.
[2024-05-31 18:14:17] [INFO ] Deduced a trap composed of 43 places in 611 ms of which 11 ms to minimize.
[2024-05-31 18:14:18] [INFO ] Deduced a trap composed of 43 places in 598 ms of which 10 ms to minimize.
[2024-05-31 18:14:19] [INFO ] Deduced a trap composed of 43 places in 1273 ms of which 11 ms to minimize.
[2024-05-31 18:14:20] [INFO ] Deduced a trap composed of 43 places in 1251 ms of which 11 ms to minimize.
[2024-05-31 18:14:21] [INFO ] Deduced a trap composed of 43 places in 1203 ms of which 11 ms to minimize.
[2024-05-31 18:14:23] [INFO ] Deduced a trap composed of 48 places in 1241 ms of which 11 ms to minimize.
[2024-05-31 18:14:24] [INFO ] Deduced a trap composed of 43 places in 1206 ms of which 10 ms to minimize.
[2024-05-31 18:14:25] [INFO ] Deduced a trap composed of 43 places in 1145 ms of which 9 ms to minimize.
[2024-05-31 18:14:26] [INFO ] Deduced a trap composed of 43 places in 1184 ms of which 11 ms to minimize.
[2024-05-31 18:14:27] [INFO ] Deduced a trap composed of 43 places in 1150 ms of which 11 ms to minimize.
[2024-05-31 18:14:29] [INFO ] Deduced a trap composed of 43 places in 1118 ms of which 10 ms to minimize.
[2024-05-31 18:14:30] [INFO ] Deduced a trap composed of 43 places in 1118 ms of which 10 ms to minimize.
[2024-05-31 18:14:31] [INFO ] Deduced a trap composed of 48 places in 1122 ms of which 11 ms to minimize.
[2024-05-31 18:14:32] [INFO ] Deduced a trap composed of 43 places in 1085 ms of which 10 ms to minimize.
[2024-05-31 18:14:33] [INFO ] Deduced a trap composed of 43 places in 1116 ms of which 11 ms to minimize.
[2024-05-31 18:14:34] [INFO ] Deduced a trap composed of 46 places in 1039 ms of which 11 ms to minimize.
[2024-05-31 18:14:35] [INFO ] Deduced a trap composed of 43 places in 1103 ms of which 11 ms to minimize.
[2024-05-31 18:14:37] [INFO ] Deduced a trap composed of 49 places in 1113 ms of which 11 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1722 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 3242 unsolved
[2024-05-31 18:14:40] [INFO ] Deduced a trap composed of 44 places in 1283 ms of which 12 ms to minimize.
SMT process timed out in 62605ms, After SMT, problems are : Problem set: 0 solved, 3242 unsolved
Search for dead transitions found 0 dead transitions in 62632ms
Finished structural reductions in LTL mode , in 1 iterations and 84087 ms. Remains : 1723/1723 places, 3282/3282 transitions.
Treatment of property CANConstruction-PT-040-LTLCardinality-00 finished in 262584 ms.
[2024-05-31 18:14:40] [INFO ] Flatten gal took : 99 ms
[2024-05-31 18:14:40] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-05-31 18:14:40] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2104 places, 3681 transitions and 13766 arcs took 22 ms.
Total runtime 772061 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : CANConstruction-PT-040-LTLCardinality-00

BK_STOP 1717179556919

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name CANConstruction-PT-040-LTLCardinality-00
ltl formula formula --ltl=/tmp/1748/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 2104 places, 3681 transitions and 13766 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.360 real 0.110 user 0.130 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1748/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1748/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1748/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1748/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): There are 2105 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 2105, there are 3692 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~1251 levels ~10000 states ~270940 transitions
pnml2lts-mc( 1/ 4): ~2501 levels ~20000 states ~433140 transitions
pnml2lts-mc( 1/ 4): ~5001 levels ~40000 states ~715516 transitions
pnml2lts-mc( 1/ 4): ~10001 levels ~80000 states ~1173396 transitions
pnml2lts-mc( 1/ 4): ~12571 levels ~160000 states ~1559948 transitions
pnml2lts-mc( 1/ 4): ~24143 levels ~320000 states ~2477052 transitions
pnml2lts-mc( 1/ 4): ~41198 levels ~640000 states ~4020476 transitions
pnml2lts-mc( 2/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 612716
pnml2lts-mc( 0/ 4): unique states count: 1225128
pnml2lts-mc( 0/ 4): unique transitions count: 12896172
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 2160669
pnml2lts-mc( 0/ 4): - claim found count: 1808074
pnml2lts-mc( 0/ 4): - claim success count: 1225131
pnml2lts-mc( 0/ 4): - cum. max stack depth: 309601
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 1225131 states 12896415 transitions, fanout: 10.527
pnml2lts-mc( 0/ 4): Total exploration time 274.800 sec (274.500 sec minimum, 274.575 sec on average)
pnml2lts-mc( 0/ 4): States per second: 4458, Transitions per second: 46930
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 128.6MB, 15.9 B/state, compr.: 0.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 25.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 3738 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 128.6MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CANConstruction-PT-040"
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 CANConstruction-PT-040, 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 r476-tall-171620505000035"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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