About the Execution of ITS-Tools for CANConstruction-PT-100
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 3600000.00 | 0.00 | 0.00 | FFFFFFF?FFTFFF?T | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r030-smll-174853813600244.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is CANConstruction-PT-100, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r030-smll-174853813600244
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 6.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 44K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 107K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 15M May 29 14:32 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME CANConstruction-PT-100-LTLFireability-00
FORMULA_NAME CANConstruction-PT-100-LTLFireability-01
FORMULA_NAME CANConstruction-PT-100-LTLFireability-02
FORMULA_NAME CANConstruction-PT-100-LTLFireability-03
FORMULA_NAME CANConstruction-PT-100-LTLFireability-04
FORMULA_NAME CANConstruction-PT-100-LTLFireability-05
FORMULA_NAME CANConstruction-PT-100-LTLFireability-06
FORMULA_NAME CANConstruction-PT-100-LTLFireability-07
FORMULA_NAME CANConstruction-PT-100-LTLFireability-08
FORMULA_NAME CANConstruction-PT-100-LTLFireability-09
FORMULA_NAME CANConstruction-PT-100-LTLFireability-10
FORMULA_NAME CANConstruction-PT-100-LTLFireability-11
FORMULA_NAME CANConstruction-PT-100-LTLFireability-12
FORMULA_NAME CANConstruction-PT-100-LTLFireability-13
FORMULA_NAME CANConstruction-PT-100-LTLFireability-14
FORMULA_NAME CANConstruction-PT-100-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1748728651570
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANConstruction-PT-100
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-05-31 21:57:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-31 21:57:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 21:57:35] [INFO ] Load time of PNML (sax parser for PT used): 1430 ms
[2025-05-31 21:57:35] [INFO ] Transformed 21202 places.
[2025-05-31 21:57:35] [INFO ] Transformed 40800 transitions.
[2025-05-31 21:57:35] [INFO ] Parsed PT model containing 21202 places and 40800 transitions and 122000 arcs in 1788 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 30 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA CANConstruction-PT-100-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-100-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 52 out of 21202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21202/21202 places, 40800/40800 transitions.
Applied a total of 0 rules in 346 ms. Remains 21202 /21202 variables (removed 0) and now considering 40800/40800 (removed 0) transitions.
// Phase 1: matrix 40800 rows 21202 cols
[2025-05-31 21:57:38] [INFO ] Computed 201 invariants in 991 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:58:15] [INFO ] Performed 1019/21202 implicitness test of which 72 returned IMPLICIT in 30 seconds.
[2025-05-31 21:58:45] [INFO ] Performed 10192/21202 implicitness test of which 100 returned IMPLICIT in 60 seconds.
[2025-05-31 21:59:11] [INFO ] Implicit Places using invariants in 94685 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, 460, 474, 488, 502, 516, 530, 544, 558, 572, 586, 600, 614, 628, 642, 656, 670, 684, 698, 712, 726, 740, 754, 768, 782, 796, 810, 824, 838, 852, 866, 880, 894, 908, 922, 936, 950, 964, 978, 992, 1006, 1020, 1034, 1048, 1062, 1076, 1090, 1104, 1118, 1132, 1146, 1160, 1174, 1188, 1202, 1216, 1230, 1244, 1258, 1272, 1286, 1300, 1314, 1328, 1342, 1356, 1370, 1384, 1398]
Discarding 100 places :
Implicit Place search using SMT only with invariants took 94793 ms to find 100 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21102/21202 places, 40800/40800 transitions.
Discarding 9782 places :
Symmetric choice reduction at 0 with 9782 rule applications. Total rules 9782 place count 11320 transition count 21236
Iterating global reduction 0 with 9782 rules applied. Total rules applied 19564 place count 11320 transition count 21236
Applied a total of 19564 rules in 1822 ms. Remains 11320 /21102 variables (removed 9782) and now considering 21236/40800 (removed 19564) transitions.
// Phase 1: matrix 21236 rows 11320 cols
[2025-05-31 21:59:14] [INFO ] Computed 101 invariants in 458 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:59:46] [INFO ] Performed 10182/11320 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-05-31 21:59:48] [INFO ] Implicit Places using invariants in 35169 ms returned []
Implicit Place search using SMT only with invariants took 35170 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 11320/21202 places, 21236/40800 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 132166 ms. Remains : 11320/21202 places, 21236/40800 transitions.
Support contains 52 out of 11320 places after structural reductions.
[2025-05-31 21:59:50] [INFO ] Flatten gal took : 1052 ms
[2025-05-31 21:59:51] [INFO ] Flatten gal took : 819 ms
[2025-05-31 21:59:52] [INFO ] Input system was already deterministic with 21236 transitions.
Reduction of identical properties reduced properties to check from 37 to 36
RANDOM walk for 40000 steps (20 resets) in 4642 ms. (8 steps per ms) remains 19/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 19/19 properties
[2025-05-31 21:59:54] [INFO ] Invariant cache hit.
[2025-05-31 21:59:54] [INFO ] State equation strengthened by 19900 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 11218/11243 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 19 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:00:35] [INFO ] Deduced a trap composed of 5 places in 37740 ms of which 451 ms to minimize.
SMT process timed out in 41375ms, After SMT, problems are : Problem set: 0 solved, 19 unsolved
Fused 19 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 25 out of 11320 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 11320/11320 places, 21236/21236 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 852 transitions
Trivial Post-agglo rules discarded 852 transitions
Performed 852 trivial Post agglomeration. Transition count delta: 852
Iterating post reduction 0 with 852 rules applied. Total rules applied 852 place count 11320 transition count 20384
Reduce places removed 852 places and 0 transitions.
Iterating post reduction 1 with 852 rules applied. Total rules applied 1704 place count 10468 transition count 20384
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 1704 place count 10468 transition count 20284
Deduced a syphon composed of 100 places in 8 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 1904 place count 10368 transition count 20284
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 1918 place count 10354 transition count 20263
Iterating global reduction 2 with 14 rules applied. Total rules applied 1932 place count 10354 transition count 20263
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 2 with 12 rules applied. Total rules applied 1944 place count 10354 transition count 20251
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 1956 place count 10342 transition count 20251
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 7 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 4 with 44 rules applied. Total rules applied 2000 place count 10320 transition count 20229
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 4 with 7 rules applied. Total rules applied 2007 place count 10320 transition count 20222
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 2014 place count 10313 transition count 20222
Applied a total of 2014 rules in 26919 ms. Remains 10313 /11320 variables (removed 1007) and now considering 20222/21236 (removed 1014) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26920 ms. Remains : 10313/11320 places, 20222/21236 transitions.
RANDOM walk for 40000 steps (56 resets) in 2293 ms. (17 steps per ms) remains 4/19 properties
BEST_FIRST walk for 40004 steps (8 resets) in 133 ms. (298 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 123 ms. (322 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 131 ms. (303 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 90 ms. (439 steps per ms) remains 3/3 properties
// Phase 1: matrix 20222 rows 10313 cols
[2025-05-31 22:01:04] [INFO ] Computed 101 invariants in 688 ms
[2025-05-31 22:01:04] [INFO ] State equation strengthened by 19900 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 10212/10215 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:01:46] [INFO ] Deduced a trap composed of 2 places in 39077 ms of which 279 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:02:25] [INFO ] Deduced a trap composed of 2 places in 38797 ms of which 289 ms to minimize.
SMT process timed out in 81457ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 10313 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10313/10313 places, 20222/20222 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 10305 transition count 20206
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 10305 transition count 20206
Applied a total of 16 rules in 11715 ms. Remains 10305 /10313 variables (removed 8) and now considering 20206/20222 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11715 ms. Remains : 10305/10313 places, 20206/20222 transitions.
Computed a total of 401 stabilizing places and 500 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 11320 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11320/11320 places, 21236/21236 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 864 transitions
Trivial Post-agglo rules discarded 864 transitions
Performed 864 trivial Post agglomeration. Transition count delta: 864
Iterating post reduction 0 with 864 rules applied. Total rules applied 864 place count 11320 transition count 20372
Reduce places removed 864 places and 0 transitions.
Iterating post reduction 1 with 864 rules applied. Total rules applied 1728 place count 10456 transition count 20372
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 1728 place count 10456 transition count 20272
Deduced a syphon composed of 100 places in 6 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 1928 place count 10356 transition count 20272
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 1947 place count 10337 transition count 20235
Iterating global reduction 2 with 19 rules applied. Total rules applied 1966 place count 10337 transition count 20235
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 2 with 34 rules applied. Total rules applied 2000 place count 10337 transition count 20201
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 3 with 34 rules applied. Total rules applied 2034 place count 10303 transition count 20201
Applied a total of 2034 rules in 13576 ms. Remains 10303 /11320 variables (removed 1017) and now considering 20201/21236 (removed 1035) transitions.
// Phase 1: matrix 20201 rows 10303 cols
[2025-05-31 22:02:52] [INFO ] Computed 101 invariants in 848 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:03:23] [INFO ] Implicit Places using invariants in 32594 ms returned []
Implicit Place search using SMT only with invariants took 32597 ms to find 0 implicit places.
Running 20101 sub problems to find dead transitions.
[2025-05-31 22:03:24] [INFO ] Invariant cache hit.
[2025-05-31 22:03:24] [INFO ] State equation strengthened by 19900 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/10302 variables, 101/101 constraints. Problems are: Problem set: 0 solved, 20101 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 10302/30504 variables, and 101 constraints, problems are : Problem set: 0 solved, 20101 unsolved in 30702 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 0/10303 constraints, ReadFeed: 0/19900 constraints, PredecessorRefiner: 20101/20101 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20101 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/10302 variables, 101/101 constraints. Problems are: Problem set: 0 solved, 20101 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 10302/30504 variables, and 101 constraints, problems are : Problem set: 0 solved, 20101 unsolved in 30455 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 0/10303 constraints, ReadFeed: 0/19900 constraints, PredecessorRefiner: 0/20101 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 105351ms problems are : Problem set: 0 solved, 20101 unsolved
Search for dead transitions found 0 dead transitions in 105511ms
Starting structural reductions in SI_LTL mode, iteration 1 : 10303/11320 places, 20201/21236 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 151799 ms. Remains : 10303/11320 places, 20201/21236 transitions.
Stuttering acceptance computed with spot in 243 ms :[(NOT p0)]
Running random walk in product with property : CANConstruction-PT-100-LTLFireability-00
Stuttering criterion allowed to conclude after 758 steps with 0 reset in 65 ms.
FORMULA CANConstruction-PT-100-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-100-LTLFireability-00 finished in 152248 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((((p0||F(p1)) U X(X(p2)))&&F(p3)))'
Support contains 5 out of 11320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11320/11320 places, 21236/21236 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 11305 transition count 21206
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 11305 transition count 21206
Applied a total of 30 rules in 308 ms. Remains 11305 /11320 variables (removed 15) and now considering 21206/21236 (removed 30) transitions.
// Phase 1: matrix 21206 rows 11305 cols
[2025-05-31 22:05:10] [INFO ] Computed 101 invariants in 548 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:05:43] [INFO ] Performed 10691/11305 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-05-31 22:05:44] [INFO ] Implicit Places using invariants in 34528 ms returned []
Implicit Place search using SMT only with invariants took 34529 ms to find 0 implicit places.
Running 21106 sub problems to find dead transitions.
[2025-05-31 22:05:44] [INFO ] Invariant cache hit.
[2025-05-31 22:05:44] [INFO ] State equation strengthened by 19900 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/11304 variables, 101/101 constraints. Problems are: Problem set: 0 solved, 21106 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 11304/32511 variables, and 101 constraints, problems are : Problem set: 0 solved, 21106 unsolved in 30640 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 0/11305 constraints, ReadFeed: 0/19900 constraints, PredecessorRefiner: 21106/21106 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21106 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/11304 variables, 101/101 constraints. Problems are: Problem set: 0 solved, 21106 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 11304/32511 variables, and 101 constraints, problems are : Problem set: 0 solved, 21106 unsolved in 30613 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 0/11305 constraints, ReadFeed: 0/19900 constraints, PredecessorRefiner: 0/21106 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 107970ms problems are : Problem set: 0 solved, 21106 unsolved
Search for dead transitions found 0 dead transitions in 108062ms
Starting structural reductions in LTL mode, iteration 1 : 11305/11320 places, 21206/21236 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 142954 ms. Remains : 11305/11320 places, 21206/21236 transitions.
Stuttering acceptance computed with spot in 520 ms :[(OR (NOT p3) (NOT p2)), (NOT p3), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1)]
Running random walk in product with property : CANConstruction-PT-100-LTLFireability-01
Stuttering criterion allowed to conclude after 1705 steps with 0 reset in 83 ms.
FORMULA CANConstruction-PT-100-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-100-LTLFireability-01 finished in 143642 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||(p1&&X((p1&&F((p2&&X(p1)))))))))'
Support contains 5 out of 11320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11320/11320 places, 21236/21236 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 11303 transition count 21202
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 11303 transition count 21202
Applied a total of 34 rules in 420 ms. Remains 11303 /11320 variables (removed 17) and now considering 21202/21236 (removed 34) transitions.
// Phase 1: matrix 21202 rows 11303 cols
[2025-05-31 22:07:34] [INFO ] Computed 101 invariants in 541 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:08:07] [INFO ] Performed 10546/11303 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-05-31 22:08:08] [INFO ] Implicit Places using invariants in 34624 ms returned []
Implicit Place search using SMT only with invariants took 34626 ms to find 0 implicit places.
Running 21102 sub problems to find dead transitions.
[2025-05-31 22:08:08] [INFO ] Invariant cache hit.
[2025-05-31 22:08:08] [INFO ] State equation strengthened by 19900 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/11302 variables, 101/101 constraints. Problems are: Problem set: 0 solved, 21102 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 11302/32505 variables, and 101 constraints, problems are : Problem set: 0 solved, 21102 unsolved in 30489 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 0/11303 constraints, ReadFeed: 0/19900 constraints, PredecessorRefiner: 21102/21102 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21102 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/11302 variables, 101/101 constraints. Problems are: Problem set: 0 solved, 21102 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 11302/32505 variables, and 101 constraints, problems are : Problem set: 0 solved, 21102 unsolved in 30454 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 0/11303 constraints, ReadFeed: 0/19900 constraints, PredecessorRefiner: 0/21102 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 108957ms problems are : Problem set: 0 solved, 21102 unsolved
Search for dead transitions found 0 dead transitions in 108998ms
Starting structural reductions in LTL mode, iteration 1 : 11303/11320 places, 21202/21236 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 144071 ms. Remains : 11303/11320 places, 21202/21236 transitions.
Stuttering acceptance computed with spot in 235 ms :[(AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : CANConstruction-PT-100-LTLFireability-02
Stuttering criterion allowed to conclude after 1777 steps with 0 reset in 91 ms.
FORMULA CANConstruction-PT-100-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-100-LTLFireability-02 finished in 144465 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G(!p0)))'
Support contains 2 out of 11320 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11320/11320 places, 21236/21236 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 864 transitions
Trivial Post-agglo rules discarded 864 transitions
Performed 864 trivial Post agglomeration. Transition count delta: 864
Iterating post reduction 0 with 864 rules applied. Total rules applied 864 place count 11320 transition count 20372
Reduce places removed 864 places and 0 transitions.
Iterating post reduction 1 with 864 rules applied. Total rules applied 1728 place count 10456 transition count 20372
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 1728 place count 10456 transition count 20272
Deduced a syphon composed of 100 places in 6 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 1928 place count 10356 transition count 20272
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 1947 place count 10337 transition count 20235
Iterating global reduction 2 with 19 rules applied. Total rules applied 1966 place count 10337 transition count 20235
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 2 with 34 rules applied. Total rules applied 2000 place count 10337 transition count 20201
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 3 with 34 rules applied. Total rules applied 2034 place count 10303 transition count 20201
Applied a total of 2034 rules in 14257 ms. Remains 10303 /11320 variables (removed 1017) and now considering 20201/21236 (removed 1035) transitions.
// Phase 1: matrix 20201 rows 10303 cols
[2025-05-31 22:10:12] [INFO ] Computed 101 invariants in 774 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:10:44] [INFO ] Implicit Places using invariants in 31968 ms returned []
Implicit Place search using SMT only with invariants took 31970 ms to find 0 implicit places.
Running 20101 sub problems to find dead transitions.
[2025-05-31 22:10:44] [INFO ] Invariant cache hit.
[2025-05-31 22:10:44] [INFO ] State equation strengthened by 19900 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/10302 variables, 101/101 constraints. Problems are: Problem set: 0 solved, 20101 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 10302/30504 variables, and 101 constraints, problems are : Problem set: 0 solved, 20101 unsolved in 30457 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 0/10303 constraints, ReadFeed: 0/19900 constraints, PredecessorRefiner: 20101/20101 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20101 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/10302 variables, 101/101 constraints. Problems are: Problem set: 0 solved, 20101 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 10302/30504 variables, and 101 constraints, problems are : Problem set: 0 solved, 20101 unsolved in 30417 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 0/10303 constraints, ReadFeed: 0/19900 constraints, PredecessorRefiner: 0/20101 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 103719ms problems are : Problem set: 0 solved, 20101 unsolved
Search for dead transitions found 0 dead transitions in 103768ms
Starting structural reductions in SI_LTL mode, iteration 1 : 10303/11320 places, 20201/21236 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 150034 ms. Remains : 10303/11320 places, 20201/21236 transitions.
Stuttering acceptance computed with spot in 164 ms :[true, false, (NOT p0), p0]
Running random walk in product with property : CANConstruction-PT-100-LTLFireability-03
Entered a terminal (fully accepting) state of product in 94874 steps with 136 reset in 3046 ms.
FORMULA CANConstruction-PT-100-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-100-LTLFireability-03 finished in 153302 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 11320 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11320/11320 places, 21236/21236 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 866 transitions
Trivial Post-agglo rules discarded 866 transitions
Performed 866 trivial Post agglomeration. Transition count delta: 866
Iterating post reduction 0 with 866 rules applied. Total rules applied 866 place count 11320 transition count 20370
Reduce places removed 866 places and 0 transitions.
Iterating post reduction 1 with 866 rules applied. Total rules applied 1732 place count 10454 transition count 20370
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 1732 place count 10454 transition count 20270
Deduced a syphon composed of 100 places in 6 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 1932 place count 10354 transition count 20270
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 1949 place count 10337 transition count 20236
Iterating global reduction 2 with 17 rules applied. Total rules applied 1966 place count 10337 transition count 20236
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 2 with 32 rules applied. Total rules applied 1998 place count 10337 transition count 20204
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 3 with 32 rules applied. Total rules applied 2030 place count 10305 transition count 20204
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 2034 place count 10303 transition count 20202
Applied a total of 2034 rules in 18693 ms. Remains 10303 /11320 variables (removed 1017) and now considering 20202/21236 (removed 1034) transitions.
// Phase 1: matrix 20202 rows 10303 cols
[2025-05-31 22:12:50] [INFO ] Computed 101 invariants in 679 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:13:19] [INFO ] Implicit Places using invariants in 29915 ms returned []
Implicit Place search using SMT only with invariants took 29919 ms to find 0 implicit places.
Running 20102 sub problems to find dead transitions.
[2025-05-31 22:13:19] [INFO ] Invariant cache hit.
[2025-05-31 22:13:19] [INFO ] State equation strengthened by 19900 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/10302 variables, 101/101 constraints. Problems are: Problem set: 0 solved, 20102 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 10302/30505 variables, and 101 constraints, problems are : Problem set: 0 solved, 20102 unsolved in 30872 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 0/10303 constraints, ReadFeed: 0/19900 constraints, PredecessorRefiner: 20102/20102 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20102 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/10302 variables, 101/101 constraints. Problems are: Problem set: 0 solved, 20102 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 10302/30505 variables, and 101 constraints, problems are : Problem set: 0 solved, 20102 unsolved in 30694 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 0/10303 constraints, ReadFeed: 0/19900 constraints, PredecessorRefiner: 0/20102 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 103000ms problems are : Problem set: 0 solved, 20102 unsolved
Search for dead transitions found 0 dead transitions in 103033ms
Starting structural reductions in SI_LTL mode, iteration 1 : 10303/11320 places, 20202/21236 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 151680 ms. Remains : 10303/11320 places, 20202/21236 transitions.
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-100-LTLFireability-04
Stuttering criterion allowed to conclude after 724 steps with 0 reset in 36 ms.
FORMULA CANConstruction-PT-100-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-100-LTLFireability-04 finished in 151884 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((p0 U X(G(p0)))||X((X(p1)||(p2 U p3))))))'
Support contains 5 out of 11320 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 11320/11320 places, 21236/21236 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 11303 transition count 21202
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 11303 transition count 21202
Applied a total of 34 rules in 386 ms. Remains 11303 /11320 variables (removed 17) and now considering 21202/21236 (removed 34) transitions.
// Phase 1: matrix 21202 rows 11303 cols
[2025-05-31 22:15:04] [INFO ] Computed 101 invariants in 555 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:15:36] [INFO ] Performed 9936/11303 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-05-31 22:15:39] [INFO ] Implicit Places using invariants in 36320 ms returned []
Implicit Place search using SMT only with invariants took 36321 ms to find 0 implicit places.
Running 21102 sub problems to find dead transitions.
[2025-05-31 22:15:39] [INFO ] Invariant cache hit.
[2025-05-31 22:15:40] [INFO ] State equation strengthened by 19900 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/11302 variables, 101/101 constraints. Problems are: Problem set: 0 solved, 21102 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 11302/32505 variables, and 101 constraints, problems are : Problem set: 0 solved, 21102 unsolved in 30465 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 0/11303 constraints, ReadFeed: 0/19900 constraints, PredecessorRefiner: 21102/21102 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21102 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/11302 variables, 101/101 constraints. Problems are: Problem set: 0 solved, 21102 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 11302/32505 variables, and 101 constraints, problems are : Problem set: 0 solved, 21102 unsolved in 30448 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 0/11303 constraints, ReadFeed: 0/19900 constraints, PredecessorRefiner: 0/21102 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 105224ms problems are : Problem set: 0 solved, 21102 unsolved
Search for dead transitions found 0 dead transitions in 105277ms
Starting structural reductions in LTL mode, iteration 1 : 11303/11320 places, 21202/21236 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 142024 ms. Remains : 11303/11320 places, 21202/21236 transitions.
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p3) (NOT p0) (NOT p1))]
Running random walk in product with property : CANConstruction-PT-100-LTLFireability-05
Stuttering criterion allowed to conclude after 2874 steps with 1 reset in 70 ms.
FORMULA CANConstruction-PT-100-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-100-LTLFireability-05 finished in 142319 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((((F(p1)&&p0) U p1) U (G(!p1) U X(p2))))'
Support contains 5 out of 11320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11320/11320 places, 21236/21236 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 11303 transition count 21202
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 11303 transition count 21202
Applied a total of 34 rules in 362 ms. Remains 11303 /11320 variables (removed 17) and now considering 21202/21236 (removed 34) transitions.
// Phase 1: matrix 21202 rows 11303 cols
[2025-05-31 22:17:26] [INFO ] Computed 101 invariants in 542 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:17:58] [INFO ] Performed 11089/11303 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-05-31 22:17:59] [INFO ] Implicit Places using invariants in 33628 ms returned []
Implicit Place search using SMT only with invariants took 33629 ms to find 0 implicit places.
Running 21102 sub problems to find dead transitions.
[2025-05-31 22:17:59] [INFO ] Invariant cache hit.
[2025-05-31 22:17:59] [INFO ] State equation strengthened by 19900 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/11302 variables, 101/101 constraints. Problems are: Problem set: 0 solved, 21102 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 11302/32505 variables, and 101 constraints, problems are : Problem set: 0 solved, 21102 unsolved in 30473 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 0/11303 constraints, ReadFeed: 0/19900 constraints, PredecessorRefiner: 21102/21102 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21102 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/11302 variables, 101/101 constraints. Problems are: Problem set: 0 solved, 21102 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 11302/32505 variables, and 101 constraints, problems are : Problem set: 0 solved, 21102 unsolved in 30530 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 0/11303 constraints, ReadFeed: 0/19900 constraints, PredecessorRefiner: 0/21102 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 106679ms problems are : Problem set: 0 solved, 21102 unsolved
Search for dead transitions found 0 dead transitions in 106722ms
Starting structural reductions in LTL mode, iteration 1 : 11303/11320 places, 21202/21236 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 140749 ms. Remains : 11303/11320 places, 21202/21236 transitions.
Stuttering acceptance computed with spot in 267 ms :[(NOT p2), (NOT p2), false, (NOT p2), true, p1, false]
Running random walk in product with property : CANConstruction-PT-100-LTLFireability-06
Entered a terminal (fully accepting) state of product in 1151 steps with 0 reset in 29 ms.
FORMULA CANConstruction-PT-100-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-100-LTLFireability-06 finished in 141191 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G((F(p1) U X(X(p2))))))))'
Support contains 4 out of 11320 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11320/11320 places, 21236/21236 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 864 transitions
Trivial Post-agglo rules discarded 864 transitions
Performed 864 trivial Post agglomeration. Transition count delta: 864
Iterating post reduction 0 with 864 rules applied. Total rules applied 864 place count 11320 transition count 20372
Reduce places removed 864 places and 0 transitions.
Iterating post reduction 1 with 864 rules applied. Total rules applied 1728 place count 10456 transition count 20372
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 1728 place count 10456 transition count 20272
Deduced a syphon composed of 100 places in 5 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 1928 place count 10356 transition count 20272
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 1945 place count 10339 transition count 20239
Iterating global reduction 2 with 17 rules applied. Total rules applied 1962 place count 10339 transition count 20239
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 2 with 30 rules applied. Total rules applied 1992 place count 10339 transition count 20209
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 3 with 30 rules applied. Total rules applied 2022 place count 10309 transition count 20209
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 5 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 2030 place count 10305 transition count 20205
Applied a total of 2030 rules in 18791 ms. Remains 10305 /11320 variables (removed 1015) and now considering 20205/21236 (removed 1031) transitions.
// Phase 1: matrix 20205 rows 10305 cols
[2025-05-31 22:20:06] [INFO ] Computed 101 invariants in 712 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:20:38] [INFO ] Performed 9281/10305 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-05-31 22:20:40] [INFO ] Implicit Places using invariants in 35166 ms returned []
Implicit Place search using SMT only with invariants took 35172 ms to find 0 implicit places.
Running 20105 sub problems to find dead transitions.
[2025-05-31 22:20:40] [INFO ] Invariant cache hit.
[2025-05-31 22:20:40] [INFO ] State equation strengthened by 19900 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/10304 variables, 101/101 constraints. Problems are: Problem set: 0 solved, 20105 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 10304/30510 variables, and 101 constraints, problems are : Problem set: 0 solved, 20105 unsolved in 30470 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 0/10305 constraints, ReadFeed: 0/19900 constraints, PredecessorRefiner: 20105/20105 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20105 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/10304 variables, 101/101 constraints. Problems are: Problem set: 0 solved, 20105 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 10304/30510 variables, and 101 constraints, problems are : Problem set: 0 solved, 20105 unsolved in 30627 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 0/10305 constraints, ReadFeed: 0/19900 constraints, PredecessorRefiner: 0/20105 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 106658ms problems are : Problem set: 0 solved, 20105 unsolved
Search for dead transitions found 0 dead transitions in 106711ms
Starting structural reductions in SI_LTL mode, iteration 1 : 10305/11320 places, 20205/21236 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 160705 ms. Remains : 10305/11320 places, 20205/21236 transitions.
Stuttering acceptance computed with spot in 348 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), false]
Running random walk in product with property : CANConstruction-PT-100-LTLFireability-07
Product exploration explored 100000 steps with 10577 reset in 3600 ms.
Product exploration explored 100000 steps with 10531 reset in 3487 ms.
Computed a total of 101 stabilizing places and 200 stable transitions
Computed a total of 101 stabilizing places and 200 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 145 ms. Reduced automaton from 7 states, 15 edges and 3 AP (stutter insensitive) to 6 states, 18 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 241 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), false, false]
RANDOM walk for 40000 steps (56 resets) in 2043 ms. (19 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 134 ms. (296 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 257 ms. (155 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 139 ms. (285 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 382 ms. (104 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 175 ms. (227 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 104 ms. (380 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 41785 steps, run timeout after 3001 ms. (steps per millisecond=13 ) properties seen :4 out of 7
Probabilistic random walk after 41785 steps, saw 36428 distinct states, run finished after 3008 ms. (steps per millisecond=13 ) properties seen :4
[2025-05-31 22:22:39] [INFO ] Invariant cache hit.
[2025-05-31 22:22:39] [INFO ] State equation strengthened by 19900 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 10204/10208 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10208 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 96/10304 variables, 96/101 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10304 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SMT process timed out in 5155ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 10305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10305/10305 places, 20205/20205 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 10305 transition count 20204
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 10304 transition count 20204
Applied a total of 2 rules in 12174 ms. Remains 10304 /10305 variables (removed 1) and now considering 20204/20205 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12174 ms. Remains : 10304/10305 places, 20204/20205 transitions.
RANDOM walk for 40000 steps (56 resets) in 2508 ms. (15 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 126 ms. (314 steps per ms) remains 1/1 properties
// Phase 1: matrix 20204 rows 10304 cols
[2025-05-31 22:22:58] [INFO ] Computed 101 invariants in 937 ms
[2025-05-31 22:22:58] [INFO ] State equation strengthened by 19900 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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) 10203/10204 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:23:42] [INFO ] Deduced a trap composed of 2 places in 40371 ms of which 276 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:24:19] [INFO ] Deduced a trap composed of 2 places in 36599 ms of which 389 ms to minimize.
SMT process timed out in 81694ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 10304 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10304/10304 places, 20204/20204 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 10303 transition count 20202
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 10303 transition count 20202
Applied a total of 2 rules in 14768 ms. Remains 10303 /10304 variables (removed 1) and now considering 20202/20204 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14769 ms. Remains : 10303/10304 places, 20202/20204 transitions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (OR p0 p1 (NOT p2)))), (F p0), (F p2), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2))))]
Knowledge based reduction with 9 factoid took 448 ms. Reduced automaton from 6 states, 18 edges and 3 AP (stutter insensitive) to 5 states, 16 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 294 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), false]
Stuttering acceptance computed with spot in 266 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), false]
// Phase 1: matrix 20205 rows 10305 cols
[2025-05-31 22:24:35] [INFO ] Computed 101 invariants in 961 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
Could not prove EG (AND (NOT p0) (NOT p2))
Support contains 4 out of 10305 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10305/10305 places, 20205/20205 transitions.
Applied a total of 0 rules in 6530 ms. Remains 10305 /10305 variables (removed 0) and now considering 20205/20205 (removed 0) transitions.
[2025-05-31 22:24:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:25:29] [INFO ] Performed 9533/10305 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-05-31 22:25:31] [INFO ] Implicit Places using invariants in 34016 ms returned []
Implicit Place search using SMT only with invariants took 34023 ms to find 0 implicit places.
Running 20105 sub problems to find dead transitions.
[2025-05-31 22:25:31] [INFO ] Invariant cache hit.
[2025-05-31 22:25:32] [INFO ] State equation strengthened by 19900 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/10304 variables, 101/101 constraints. Problems are: Problem set: 0 solved, 20105 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 10304/30510 variables, and 101 constraints, problems are : Problem set: 0 solved, 20105 unsolved in 30696 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 0/10305 constraints, ReadFeed: 0/19900 constraints, PredecessorRefiner: 20105/20105 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20105 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/10304 variables, 101/101 constraints. Problems are: Problem set: 0 solved, 20105 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 10304/30510 variables, and 101 constraints, problems are : Problem set: 0 solved, 20105 unsolved in 30417 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 0/10305 constraints, ReadFeed: 0/19900 constraints, PredecessorRefiner: 0/20105 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 109653ms problems are : Problem set: 0 solved, 20105 unsolved
Search for dead transitions found 0 dead transitions in 109907ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 150596 ms. Remains : 10305/10305 places, 20205/20205 transitions.
Computed a total of 101 stabilizing places and 200 stable transitions
Computed a total of 101 stabilizing places and 200 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 173 ms. Reduced automaton from 5 states, 16 edges and 3 AP (stutter insensitive) to 5 states, 15 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 231 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), false]
RANDOM walk for 40000 steps (55 resets) in 3355 ms. (11 steps per ms) remains 2/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 219 ms. (181 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 185 ms. (215 steps per ms) remains 2/2 properties
[2025-05-31 22:27:23] [INFO ] Invariant cache hit.
[2025-05-31 22:27:23] [INFO ] State equation strengthened by 19900 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 10204/10207 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:28:01] [INFO ] Deduced a trap composed of 2 places in 35051 ms of which 277 ms to minimize.
SMT process timed out in 37634ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 10305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10305/10305 places, 20205/20205 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 10304 transition count 20203
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 10304 transition count 20203
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 10304 transition count 20202
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 10303 transition count 20202
Applied a total of 4 rules in 17552 ms. Remains 10303 /10305 variables (removed 2) and now considering 20202/20205 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17553 ms. Remains : 10303/10305 places, 20202/20205 transitions.
RANDOM walk for 40000 steps (56 resets) in 2056 ms. (19 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 1/1 properties
// Phase 1: matrix 20202 rows 10303 cols
[2025-05-31 22:28:20] [INFO ] Computed 101 invariants in 1586 ms
[2025-05-31 22:28:20] [INFO ] State equation strengthened by 19900 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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) 10202/10203 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:29:03] [INFO ] Deduced a trap composed of 2 places in 40793 ms of which 366 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/10203 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10203 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 99/10302 variables, 99/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:30:21] [INFO ] Deduced a trap composed of 103 places in 76324 ms of which 12022 ms to minimize.
SMT process timed out in 122349ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 10303 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10303/10303 places, 20202/20202 transitions.
Applied a total of 0 rules in 7359 ms. Remains 10303 /10303 variables (removed 0) and now considering 20202/20202 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7359 ms. Remains : 10303/10303 places, 20202/20202 transitions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F (NOT (OR p0 p1 (NOT p2)))), (F p2)]
Knowledge based reduction with 13 factoid took 448 ms. Reduced automaton from 5 states, 15 edges and 3 AP (stutter insensitive) to 5 states, 15 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 220 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), false]
Stuttering acceptance computed with spot in 207 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), false]
// Phase 1: matrix 20205 rows 10305 cols
[2025-05-31 22:30:30] [INFO ] Computed 101 invariants in 994 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 213 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), false]
Product exploration explored 100000 steps with 26105 reset in 5307 ms.
Product exploration explored 100000 steps with 26010 reset in 4543 ms.
Built C files in :
/tmp/ltsmin1289317285764784736
[2025-05-31 22:30:56] [INFO ] Too many transitions (20205) to apply POR reductions. Disabling POR matrices.
[2025-05-31 22:30:56] [INFO ] Built C files in 297ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1289317285764784736
Running compilation step : cd /tmp/ltsmin1289317285764784736;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1289317285764784736;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1289317285764784736;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 4 out of 10305 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10305/10305 places, 20205/20205 transitions.
Applied a total of 0 rules in 7846 ms. Remains 10305 /10305 variables (removed 0) and now considering 20205/20205 (removed 0) transitions.
[2025-05-31 22:31:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:31:37] [INFO ] Implicit Places using invariants in 30360 ms returned []
Implicit Place search using SMT only with invariants took 30362 ms to find 0 implicit places.
Running 20105 sub problems to find dead transitions.
[2025-05-31 22:31:37] [INFO ] Invariant cache hit.
[2025-05-31 22:31:37] [INFO ] State equation strengthened by 19900 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/10304 variables, 101/101 constraints. Problems are: Problem set: 0 solved, 20105 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 10304/30510 variables, and 101 constraints, problems are : Problem set: 0 solved, 20105 unsolved in 30420 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 0/10305 constraints, ReadFeed: 0/19900 constraints, PredecessorRefiner: 20105/20105 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20105 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/10304 variables, 101/101 constraints. Problems are: Problem set: 0 solved, 20105 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 10304/30510 variables, and 101 constraints, problems are : Problem set: 0 solved, 20105 unsolved in 30426 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 0/10305 constraints, ReadFeed: 0/19900 constraints, PredecessorRefiner: 0/20105 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 116497ms problems are : Problem set: 0 solved, 20105 unsolved
Search for dead transitions found 0 dead transitions in 116542ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 154797 ms. Remains : 10305/10305 places, 20205/20205 transitions.
Built C files in :
/tmp/ltsmin17090984528524497065
[2025-05-31 22:33:34] [INFO ] Too many transitions (20205) to apply POR reductions. Disabling POR matrices.
[2025-05-31 22:33:34] [INFO ] Built C files in 233ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17090984528524497065
Running compilation step : cd /tmp/ltsmin17090984528524497065;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17090984528524497065;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17090984528524497065;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-05-31 22:33:39] [INFO ] Flatten gal took : 1043 ms
[2025-05-31 22:33:40] [INFO ] Flatten gal took : 583 ms
[2025-05-31 22:33:40] [INFO ] Time to serialize gal into /tmp/LTL11161315231410320674.gal : 210 ms
[2025-05-31 22:33:40] [INFO ] Time to serialize properties into /tmp/LTL2197768643452982324.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11161315231410320674.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17478788997882447953.hoa' '-atoms' '/tmp/LTL2197768643452982324.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL2197768643452982324.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17478788997882447953.hoa
Detected timeout of ITS tools.
[2025-05-31 22:33:56] [INFO ] Flatten gal took : 475 ms
[2025-05-31 22:33:57] [INFO ] Flatten gal took : 496 ms
[2025-05-31 22:33:57] [INFO ] Time to serialize gal into /tmp/LTL9655675877326282998.gal : 135 ms
[2025-05-31 22:33:57] [INFO ] Time to serialize properties into /tmp/LTL8931460908939172641.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9655675877326282998.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8931460908939172641.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(F((G((F("(Node99GiveAnswer61>=1)"))U(X(X("(Node45GiveAnswer66>=1)")))))||("((Node82IsInserted>=1)&&(Node49requestsent82>=1))"))))...156
Formula 0 simplified : G(F(G!"(Node99GiveAnswer61>=1)" R XX!"(Node45GiveAnswer66>=1)") & FG!"((Node82IsInserted>=1)&&(Node49requestsent82>=1))")
Detected timeout of ITS tools.
[2025-05-31 22:34:12] [INFO ] Flatten gal took : 593 ms
[2025-05-31 22:34:12] [INFO ] Applying decomposition
[2025-05-31 22:34:13] [INFO ] Flatten gal took : 469 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph10381143172751092128.txt' '-o' '/tmp/graph10381143172751092128.bin' '-w' '/tmp/graph10381143172751092128.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10381143172751092128.bin' '-l' '-1' '-v' '-w' '/tmp/graph10381143172751092128.weights' '-q' '0' '-e' '0.001'
[2025-05-31 22:34:14] [INFO ] Decomposing Gal with order
[2025-05-31 22:34:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 22:34:21] [INFO ] Removed a total of 19898 redundant transitions.
[2025-05-31 22:34:22] [INFO ] Flatten gal took : 5468 ms
[2025-05-31 22:34:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 19996 labels/synchronizations in 5535 ms.
[2025-05-31 22:34:28] [INFO ] Time to serialize gal into /tmp/LTL1333904413110886022.gal : 148 ms
[2025-05-31 22:34:28] [INFO ] Time to serialize properties into /tmp/LTL11345633415970634578.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1333904413110886022.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11345633415970634578.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F((G((F("(i60.u101.Node99GiveAnswer61>=1)"))U(X(X("(u66.Node45GiveAnswer66>=1)")))))||("((u9.Node82IsInserted>=1)&&(u50.Node49req...176
Formula 0 simplified : G(F(G!"(i60.u101.Node99GiveAnswer61>=1)" R XX!"(u66.Node45GiveAnswer66>=1)") & FG!"((u9.Node82IsInserted>=1)&&(u50.Node49requestsent...164
Detected timeout of ITS tools.
Treatment of property CANConstruction-PT-100-LTLFireability-07 finished in 897162 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U (F((X(p1)||(G(p3)&&p2)))||X(p4))))'
Support contains 5 out of 11320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11320/11320 places, 21236/21236 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 11305 transition count 21206
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 11305 transition count 21206
Applied a total of 30 rules in 280 ms. Remains 11305 /11320 variables (removed 15) and now considering 21206/21236 (removed 30) transitions.
// Phase 1: matrix 21206 rows 11305 cols
[2025-05-31 22:34:44] [INFO ] Computed 101 invariants in 493 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:35:17] [INFO ] Performed 8575/11305 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-05-31 22:35:22] [INFO ] Implicit Places using invariants in 38449 ms returned []
Implicit Place search using SMT only with invariants took 38450 ms to find 0 implicit places.
Running 21106 sub problems to find dead transitions.
[2025-05-31 22:35:22] [INFO ] Invariant cache hit.
[2025-05-31 22:35:22] [INFO ] State equation strengthened by 19900 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/11304 variables, 101/101 constraints. Problems are: Problem set: 0 solved, 21106 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 11304/32511 variables, and 101 constraints, problems are : Problem set: 0 solved, 21106 unsolved in 30709 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 0/11305 constraints, ReadFeed: 0/19900 constraints, PredecessorRefiner: 21106/21106 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21106 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/11304 variables, 101/101 constraints. Problems are: Problem set: 0 solved, 21106 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 11304/32511 variables, and 101 constraints, problems are : Problem set: 0 solved, 21106 unsolved in 30419 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 0/11305 constraints, ReadFeed: 0/19900 constraints, PredecessorRefiner: 0/21106 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 107822ms problems are : Problem set: 0 solved, 21106 unsolved
Search for dead transitions found 0 dead transitions in 107863ms
Starting structural reductions in LTL mode, iteration 1 : 11305/11320 places, 21206/21236 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 146620 ms. Remains : 11305/11320 places, 21206/21236 transitions.
Stuttering acceptance computed with spot in 413 ms :[(OR (AND (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p2) (NOT p4))), (OR (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p1) (NOT p3) (NOT p4))), (OR (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p1) (NOT p3) (NOT p4))), (AND (NOT p1) (NOT p3) (NOT p4)), (AND (NOT p1) (NOT p3) (NOT p4)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p1) (NOT p3))]
Running random walk in product with property : CANConstruction-PT-100-LTLFireability-08
Product exploration explored 100000 steps with 56 reset in 2364 ms.
Product exploration explored 100000 steps with 55 reset in 3017 ms.
Computed a total of 401 stabilizing places and 500 stable transitions
Computed a total of 401 stabilizing places and 500 stable transitions
Knowledge obtained : [(AND (NOT p2) p0 (NOT p3) (NOT p1) (NOT p4)), (X (NOT p2)), (X (NOT p3)), (X (NOT p4)), (X (NOT (AND p2 p3 p0 (NOT p1) (NOT p4)))), (X (NOT (AND p3 p0 (NOT p1) (NOT p4)))), (X (AND (NOT p3) (NOT p1) (NOT p4))), (X (NOT (AND (NOT p3) (NOT p0) (NOT p1) (NOT p4)))), (X (AND (NOT p3) p0 (NOT p1) (NOT p4))), (X (NOT (AND p3 (NOT p0) (NOT p1) (NOT p4)))), (X (OR (AND (NOT p2) p0 (NOT p1) (NOT p4)) (AND (NOT p3) p0 (NOT p1) (NOT p4)))), (X (OR (AND (NOT p2) (NOT p1) (NOT p4)) (AND (NOT p3) (NOT p1) (NOT p4)))), (X (NOT (OR (AND (NOT p2) (NOT p0) (NOT p1) (NOT p4)) (AND (NOT p3) (NOT p0) (NOT p1) (NOT p4))))), (X (NOT (AND p2 p3 (NOT p0) (NOT p1) (NOT p4)))), (X (NOT (AND p2 p3 (NOT p1) (NOT p4)))), (X (NOT (AND p3 (NOT p1) (NOT p4)))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT p4))), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p1) (NOT p4))))), (X (X (OR (AND (NOT p2) p0 (NOT p1)) (AND (NOT p3) p0 (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p1))))), (X (X (NOT (OR (AND (NOT p2) (NOT p0) (NOT p1) (NOT p4)) (AND (NOT p3) (NOT p0) (NOT p1) (NOT p4)))))), (X (X (AND (NOT p3) p0 (NOT p1)))), (X (X (NOT (AND p3 p0 (NOT p1))))), (X (X (AND (NOT p3) (NOT p1)))), (X (X (NOT (AND p2 p3 p0 (NOT p1))))), (X (X (NOT (AND p2 p3 p0 (NOT p1) (NOT p4))))), (X (X (NOT (AND p3 p0 (NOT p1) (NOT p4))))), (X (X (AND (NOT p3) p0 (NOT p1) (NOT p4)))), (X (X (NOT (AND p2 p3 (NOT p1))))), (X (X (NOT (AND p3 (NOT p0) (NOT p1) (NOT p4))))), (X (X (OR (AND (NOT p2) p0 (NOT p1) (NOT p4)) (AND (NOT p3) p0 (NOT p1) (NOT p4))))), (X (X (NOT (AND p3 (NOT p1))))), (X (X (NOT (AND p2 p3 (NOT p0) (NOT p1) (NOT p4))))), (X (X (NOT (AND p2 p3 (NOT p0) (NOT p1))))), (X (X (OR (AND (NOT p2) (NOT p1)) (AND (NOT p3) (NOT p1))))), (X (X (NOT (OR (AND (NOT p2) (NOT p0) (NOT p1)) (AND (NOT p3) (NOT p0) (NOT p1)))))), (X (X (NOT (AND p3 (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 43 factoid took 411 ms. Reduced automaton from 9 states, 32 edges and 5 AP (stutter sensitive) to 30 states, 113 edges and 5 AP (stutter insensitive).
Stuttering acceptance computed with spot in 2113 ms :[(OR (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p2) (NOT p4))), (AND p0 (NOT p1) (NOT p3) (NOT p4)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1) (NOT p3)), false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]
Reduction of identical properties reduced properties to check from 45 to 36
RANDOM walk for 40000 steps (20 resets) in 2887 ms. (13 steps per ms) remains 29/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 108 ms. (36 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 29/29 properties
[2025-05-31 22:37:20] [INFO ] Invariant cache hit.
[2025-05-31 22:37:20] [INFO ] State equation strengthened by 19900 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem apf5 is UNSAT
Problem apf13 is UNSAT
Problem apf20 is UNSAT
Problem apf22 is UNSAT
Problem apf24 is UNSAT
Problem apf27 is UNSAT
Problem apf28 is UNSAT
Problem apf29 is UNSAT
Problem apf33 is UNSAT
Problem apf39 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 10 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 11203/11208 variables, 5/5 constraints. Problems are: Problem set: 10 solved, 19 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 11208/32511 variables, and 5 constraints, problems are : Problem set: 10 solved, 19 unsolved in 5014 ms.
Refiners :[Positive P Invariants (semi-flows): 5/101 constraints, State Equation: 0/11305 constraints, ReadFeed: 0/19900 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 10 solved, 19 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 10 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 11203/11208 variables, 5/5 constraints. Problems are: Problem set: 10 solved, 19 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:38:09] [INFO ] Deduced a trap composed of 5 places in 41033 ms of which 359 ms to minimize.
SMT process timed out in 49532ms, After SMT, problems are : Problem set: 10 solved, 19 unsolved
Fused 19 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 11305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 11305/11305 places, 21206/21206 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 696 transitions
Trivial Post-agglo rules discarded 696 transitions
Performed 696 trivial Post agglomeration. Transition count delta: 696
Iterating post reduction 0 with 696 rules applied. Total rules applied 696 place count 11305 transition count 20510
Reduce places removed 696 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 697 rules applied. Total rules applied 1393 place count 10609 transition count 20509
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1394 place count 10608 transition count 20509
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 100 Pre rules applied. Total rules applied 1394 place count 10608 transition count 20409
Deduced a syphon composed of 100 places in 7 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 3 with 200 rules applied. Total rules applied 1594 place count 10508 transition count 20409
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 9 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 1600 place count 10505 transition count 20406
Free-agglomeration rule applied 97 times.
Iterating global reduction 3 with 97 rules applied. Total rules applied 1697 place count 10505 transition count 20309
Reduce places removed 97 places and 0 transitions.
Iterating post reduction 3 with 97 rules applied. Total rules applied 1794 place count 10408 transition count 20309
Free-agglomeration rule (complex) applied 99 times.
Iterating global reduction 4 with 99 rules applied. Total rules applied 1893 place count 10408 transition count 20210
Reduce places removed 99 places and 0 transitions.
Iterating post reduction 4 with 99 rules applied. Total rules applied 1992 place count 10309 transition count 20210
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 1995 place count 10309 transition count 20210
Applied a total of 1995 rules in 14551 ms. Remains 10309 /11305 variables (removed 996) and now considering 20210/21206 (removed 996) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14552 ms. Remains : 10309/11305 places, 20210/21206 transitions.
RANDOM walk for 40000 steps (56 resets) in 2422 ms. (16 steps per ms) remains 11/19 properties
BEST_FIRST walk for 40004 steps (8 resets) in 157 ms. (253 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 135 ms. (294 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 144 ms. (275 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 96 ms. (412 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 94 ms. (421 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 119 ms. (333 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 95 ms. (416 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 95 ms. (416 steps per ms) remains 11/11 properties
// Phase 1: matrix 20210 rows 10309 cols
[2025-05-31 22:38:26] [INFO ] Computed 101 invariants in 1098 ms
[2025-05-31 22:38:26] [INFO ] State equation strengthened by 19900 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 10207/10212 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10212 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 96/10308 variables, 96/101 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:39:56] [INFO ] Deduced a trap composed of 103 places in 79495 ms of which 12019 ms to minimize.
SMT process timed out in 91088ms, After SMT, problems are : Problem set: 0 solved, 11 unsolved
Fused 11 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 10309 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10309/10309 places, 20210/20210 transitions.
Applied a total of 0 rules in 5987 ms. Remains 10309 /10309 variables (removed 0) and now considering 20210/20210 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5989 ms. Remains : 10309/10309 places, 20210/20210 transitions.
Found 10 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p0 (NOT p3) (NOT p1) (NOT p4)), (X (NOT p2)), (X (NOT p3)), (X (NOT p4)), (X (NOT (AND p2 p3 p0 (NOT p1) (NOT p4)))), (X (NOT (AND p3 p0 (NOT p1) (NOT p4)))), (X (AND (NOT p3) (NOT p1) (NOT p4))), (X (NOT (AND (NOT p3) (NOT p0) (NOT p1) (NOT p4)))), (X (AND (NOT p3) p0 (NOT p1) (NOT p4))), (X (NOT (AND p3 (NOT p0) (NOT p1) (NOT p4)))), (X (OR (AND (NOT p2) p0 (NOT p1) (NOT p4)) (AND (NOT p3) p0 (NOT p1) (NOT p4)))), (X (OR (AND (NOT p2) (NOT p1) (NOT p4)) (AND (NOT p3) (NOT p1) (NOT p4)))), (X (NOT (OR (AND (NOT p2) (NOT p0) (NOT p1) (NOT p4)) (AND (NOT p3) (NOT p0) (NOT p1) (NOT p4))))), (X (NOT (AND p2 p3 (NOT p0) (NOT p1) (NOT p4)))), (X (NOT (AND p2 p3 (NOT p1) (NOT p4)))), (X (NOT (AND p3 (NOT p1) (NOT p4)))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT p4))), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p1) (NOT p4))))), (X (X (OR (AND (NOT p2) p0 (NOT p1)) (AND (NOT p3) p0 (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p1))))), (X (X (NOT (OR (AND (NOT p2) (NOT p0) (NOT p1) (NOT p4)) (AND (NOT p3) (NOT p0) (NOT p1) (NOT p4)))))), (X (X (AND (NOT p3) p0 (NOT p1)))), (X (X (NOT (AND p3 p0 (NOT p1))))), (X (X (AND (NOT p3) (NOT p1)))), (X (X (NOT (AND p2 p3 p0 (NOT p1))))), (X (X (NOT (AND p2 p3 p0 (NOT p1) (NOT p4))))), (X (X (NOT (AND p3 p0 (NOT p1) (NOT p4))))), (X (X (AND (NOT p3) p0 (NOT p1) (NOT p4)))), (X (X (NOT (AND p2 p3 (NOT p1))))), (X (X (NOT (AND p3 (NOT p0) (NOT p1) (NOT p4))))), (X (X (OR (AND (NOT p2) p0 (NOT p1) (NOT p4)) (AND (NOT p3) p0 (NOT p1) (NOT p4))))), (X (X (NOT (AND p3 (NOT p1))))), (X (X (NOT (AND p2 p3 (NOT p0) (NOT p1) (NOT p4))))), (X (X (NOT (AND p2 p3 (NOT p0) (NOT p1))))), (X (X (OR (AND (NOT p2) (NOT p1)) (AND (NOT p3) (NOT p1))))), (X (X (NOT (OR (AND (NOT p2) (NOT p0) (NOT p1)) (AND (NOT p3) (NOT p0) (NOT p1)))))), (X (X (NOT (AND p3 (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1))), (G (OR p0 (NOT p1) (NOT p3) p4 p2)), (G (OR (NOT p0) p1 (NOT p3) (NOT p4) p2)), (G (OR p0 (NOT p1) (NOT p3) (NOT p4) p2)), (G (OR (NOT p0) (NOT p1) p3 (NOT p4) (NOT p2))), (G (OR p0 (NOT p1) p3 (NOT p4) (NOT p2))), (G (OR (NOT p0) (NOT p1) p3 p4 (NOT p2))), (G (OR p0 (NOT p1) p3 p4 (NOT p2))), (G (OR (NOT p0) (NOT p1) (NOT p3) (NOT p4) p2)), (G (OR (NOT p0) (NOT p1) (NOT p3) p4 p2)), (G (OR (NOT p0) p1 p3 (NOT p4) (NOT p2)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1 (NOT p3)))), (F (NOT (OR (NOT p0) p1 p3 (NOT p4) p2))), (F p4), (F (NOT (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))))), (F p2), (F p3), (F (NOT (OR (NOT p0) p1 (NOT p3) p4 (NOT p2)))), (F (NOT (OR p0 p1 (AND p3 p2)))), (F p1), (F (NOT p0)), (F (NOT (OR p0 p1 p3))), (F (NOT (OR (NOT p0) (NOT p1) p3 p4 p2))), (F (NOT (AND p0 (NOT p1) (NOT p3)))), (F (NOT (OR (NOT p0) p1 (NOT p3) (NOT p2)))), (F (NOT (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p1) (NOT p2))))), (F (NOT (OR (NOT p0) p1 (NOT p3) p4))), (F (NOT (OR p1 (NOT p3) (NOT p2)))), (F (NOT (OR (AND p0 (NOT p1) (NOT p3) (NOT p4)) (AND p0 (NOT p1) (NOT p4) (NOT p2))))), (F (NOT (AND (OR p0 p1 p3) (OR p0 p1 p2)))), (F (NOT (OR p1 (NOT p3)))), (F (NOT (AND (NOT p1) (NOT p3)))), (F (NOT (AND p0 (NOT p1) (NOT p3) (NOT p4)))), (F (NOT (AND (OR p0 p1 p3 p4) (OR p0 p1 p4 p2))))]
Knowledge based reduction with 53 factoid took 1793 ms. Reduced automaton from 30 states, 113 edges and 5 AP (stutter insensitive) to 25 states, 94 edges and 5 AP (stutter insensitive).
Stuttering acceptance computed with spot in 1430 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p2) p3)), (OR (AND (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p2) p3 (NOT p4)) (AND p0 (NOT p2) p3)), (AND p0 (NOT p1) (NOT p3) (NOT p4)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) p3)), (AND (NOT p0) (NOT p1) (NOT p3)), false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]
Stuttering acceptance computed with spot in 1643 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p2) p3)), (OR (AND (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p2) p3 (NOT p4)) (AND p0 (NOT p2) p3)), (AND p0 (NOT p1) (NOT p3) (NOT p4)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) p3)), (AND (NOT p0) (NOT p1) (NOT p3)), false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]
// Phase 1: matrix 21206 rows 11305 cols
[2025-05-31 22:40:08] [INFO ] Computed 101 invariants in 795 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
Could not prove EG (AND (NOT p1) (NOT p3) (NOT p4))
Support contains 5 out of 11305 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11305/11305 places, 21206/21206 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 696 transitions
Trivial Post-agglo rules discarded 696 transitions
Performed 696 trivial Post agglomeration. Transition count delta: 696
Iterating post reduction 0 with 696 rules applied. Total rules applied 696 place count 11305 transition count 20510
Reduce places removed 696 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 697 rules applied. Total rules applied 1393 place count 10609 transition count 20509
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1394 place count 10608 transition count 20509
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 100 Pre rules applied. Total rules applied 1394 place count 10608 transition count 20409
Deduced a syphon composed of 100 places in 9 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 3 with 200 rules applied. Total rules applied 1594 place count 10508 transition count 20409
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 7 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 1600 place count 10505 transition count 20406
Applied a total of 1600 rules in 1761 ms. Remains 10505 /11305 variables (removed 800) and now considering 20406/21206 (removed 800) transitions.
// Phase 1: matrix 20406 rows 10505 cols
[2025-05-31 22:40:26] [INFO ] Computed 101 invariants in 760 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:40:57] [INFO ] Implicit Places using invariants in 31673 ms returned []
Implicit Place search using SMT only with invariants took 31680 ms to find 0 implicit places.
Running 20306 sub problems to find dead transitions.
[2025-05-31 22:40:57] [INFO ] Invariant cache hit.
[2025-05-31 22:40:57] [INFO ] State equation strengthened by 19900 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/10504 variables, 101/101 constraints. Problems are: Problem set: 0 solved, 20306 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 10504/30911 variables, and 101 constraints, problems are : Problem set: 0 solved, 20306 unsolved in 30402 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 0/10505 constraints, ReadFeed: 0/19900 constraints, PredecessorRefiner: 20306/20306 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20306 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/10504 variables, 101/101 constraints. Problems are: Problem set: 0 solved, 20306 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 10504/30911 variables, and 101 constraints, problems are : Problem set: 0 solved, 20306 unsolved in 30414 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 0/10505 constraints, ReadFeed: 0/19900 constraints, PredecessorRefiner: 0/20306 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 109391ms problems are : Problem set: 0 solved, 20306 unsolved
Search for dead transitions found 0 dead transitions in 109426ms
Starting structural reductions in SI_LTL mode, iteration 1 : 10505/11305 places, 20406/21206 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 142890 ms. Remains : 10505/11305 places, 20406/21206 transitions.
Computed a total of 201 stabilizing places and 300 stable transitions
Computed a total of 201 stabilizing places and 300 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p3) (NOT p2) (NOT p4)), (X (NOT p2)), (X (NOT p3)), (X (NOT p4)), (X (NOT (AND (NOT p1) p2 p3))), (X (NOT (AND p0 p1 (NOT p2) (NOT p3) (NOT p4)))), (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3) p4))), (X (NOT (AND p0 p1 (NOT p2) (NOT p3) p4))), (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) p3)))), (X (NOT (AND p0 (NOT p1) p2 p3 p4))), (X (NOT (AND (NOT p1) p3))), (X (NOT (AND p0 p1 p2 p3 p4))), (X (NOT (AND (NOT p0) (NOT p1) p2 p3 (NOT p4)))), (X (NOT (AND (NOT p0) p1 p2 (NOT p3) (NOT p4)))), (X (NOT (AND p0 p1 p2 p3 (NOT p4)))), (X (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) p3))), (X (NOT (AND (NOT p0) p1 p2 p3 p4))), (X (NOT (AND (NOT p0) p1 p2 p3 (NOT p4)))), (X (OR (AND p0 (NOT p1) (NOT p3) (NOT p4)) (AND p0 (NOT p2) p3))), (X (NOT (AND p0 (NOT p1) p2 p3))), (X (NOT (AND p0 (NOT p1) p2 (NOT p3) p4))), (X (NOT (AND p0 p1 p2 (NOT p3) p4))), (X (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p2) p3))), (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p2) p3 (NOT p4))))), (X (AND (NOT p1) (NOT p3))), (X (NOT (AND p0 p1 p2 (NOT p3) (NOT p4)))), (X (NOT (AND (NOT p0) p1 p2 (NOT p3) p4))), (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3) p4))), (X (NOT (AND p0 (NOT p1) p2 p3 (NOT p4)))), (X (NOT (AND (NOT p0) (NOT p1) p2 p3 p4))), (X (NOT (AND (NOT p0) (NOT p1) p2 p3))), (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3) (NOT p4)))), (X p0), (X (NOT p1)), (X (X (NOT p4))), (X (X (NOT (AND p0 p1 (NOT p2) (NOT p3) (NOT p4))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3) p4)))), (X (X (NOT (AND p0 p1 (NOT p2) (NOT p3) p4)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) p3))))), (X (X (NOT (AND p0 (NOT p1) p2 p3 p4)))), (X (X (NOT (AND p0 p1 p2 p3 p4)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2 p3 (NOT p4))))), (X (X (NOT (AND (NOT p0) p1 p2 (NOT p3) (NOT p4))))), (X (X (NOT (AND p0 p1 p2 p3 (NOT p4))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 p2 p3 p4)))), (X (X (NOT (AND (NOT p0) p1 p2 p3 (NOT p4))))), (X (X (NOT (AND p0 (NOT p1) p2 (NOT p3) p4)))), (X (X (NOT (AND p0 p1 p2 (NOT p3) p4)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p2) p3 (NOT p4)))))), (X (X (NOT (AND p0 p1 p2 (NOT p3) (NOT p4))))), (X (X (NOT (AND (NOT p0) (NOT p1) p3)))), (X (X (NOT (AND (NOT p0) p1 p2 (NOT p3) p4)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3) p4)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2 p3 p4)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2 p3)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3) (NOT p4))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT p3))), (X (X (AND (NOT p1) p2 p3))), (X (X (NOT (AND (NOT p1) p2 p3)))), (X (X (AND p0 (NOT p1) p3))), (X (X (NOT (AND p0 (NOT p1) p3)))), (X (X (AND (NOT p1) p3))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (AND p0 (NOT p1) p3 (NOT p4)))), (X (X (NOT (AND p0 (NOT p1) p3 (NOT p4))))), (X (X (AND p0 (NOT p1) (NOT p3)))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) p3)))), (X (X (NOT (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) p3))))), (X (X (OR (AND p0 (NOT p1) (NOT p3) (NOT p4)) (AND p0 (NOT p2) p3)))), (X (X (NOT (OR (AND p0 (NOT p1) (NOT p3) (NOT p4)) (AND p0 (NOT p2) p3))))), (X (X (AND p0 (NOT p1) p2 p3))), (X (X (NOT (AND p0 (NOT p1) p2 p3)))), (X (X (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p2) p3)))), (X (X (NOT (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p2) p3))))), (X (X (AND p0 (NOT p1) (NOT p3) (NOT p4)))), (X (X (NOT (AND p0 (NOT p1) (NOT p3) (NOT p4))))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (AND p0 (NOT p1) p2 p3 (NOT p4)))), (X (X (NOT (AND p0 (NOT p1) p2 p3 (NOT p4)))))]
Knowledge based reduction with 59 factoid took 1573 ms. Reduced automaton from 25 states, 94 edges and 5 AP (stutter insensitive) to 25 states, 94 edges and 5 AP (stutter insensitive).
Stuttering acceptance computed with spot in 1245 ms :[(OR (AND (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) p3)), (OR (AND (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p2) p3 (NOT p4)) (AND p0 (NOT p2) p3)), (AND p0 (NOT p1) (NOT p3) (NOT p4)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) p3)), (AND (NOT p0) (NOT p1) (NOT p3)), false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]
Reduction of identical properties reduced properties to check from 40 to 35
RANDOM walk for 40000 steps (48 resets) in 1532 ms. (26 steps per ms) remains 16/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
[2025-05-31 22:42:49] [INFO ] Invariant cache hit.
[2025-05-31 22:42:49] [INFO ] State equation strengthened by 19900 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem apf6 is UNSAT
Problem apf12 is UNSAT
Problem apf17 is UNSAT
Problem apf27 is UNSAT
Problem apf29 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 10403/10408 variables, 5/5 constraints. Problems are: Problem set: 5 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10408 variables, 0/5 constraints. Problems are: Problem set: 5 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 96/10504 variables, 96/101 constraints. Problems are: Problem set: 5 solved, 11 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 10504/30911 variables, and 101 constraints, problems are : Problem set: 5 solved, 11 unsolved in 5030 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 0/10505 constraints, ReadFeed: 0/19900 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 11 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 10403/10408 variables, 5/5 constraints. Problems are: Problem set: 5 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:43:43] [INFO ] Deduced a trap composed of 3 places in 44544 ms of which 309 ms to minimize.
SMT process timed out in 53312ms, After SMT, problems are : Problem set: 5 solved, 11 unsolved
Fused 11 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 10505 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10505/10505 places, 20406/20406 transitions.
Free-agglomeration rule applied 97 times.
Iterating global reduction 0 with 97 rules applied. Total rules applied 97 place count 10505 transition count 20309
Reduce places removed 97 places and 0 transitions.
Iterating post reduction 0 with 97 rules applied. Total rules applied 194 place count 10408 transition count 20309
Free-agglomeration rule (complex) applied 99 times.
Iterating global reduction 1 with 99 rules applied. Total rules applied 293 place count 10408 transition count 20210
Reduce places removed 99 places and 0 transitions.
Iterating post reduction 1 with 99 rules applied. Total rules applied 392 place count 10309 transition count 20210
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 395 place count 10309 transition count 20210
Applied a total of 395 rules in 12819 ms. Remains 10309 /10505 variables (removed 196) and now considering 20210/20406 (removed 196) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12820 ms. Remains : 10309/10505 places, 20210/20406 transitions.
RANDOM walk for 40000 steps (56 resets) in 1511 ms. (26 steps per ms) remains 10/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 99 ms. (400 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 123 ms. (322 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 129 ms. (307 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 129 ms. (307 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 131 ms. (303 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 130 ms. (305 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 131 ms. (303 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 129 ms. (307 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 130 ms. (305 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 132 ms. (300 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 41187 steps, run timeout after 3004 ms. (steps per millisecond=13 ) properties seen :0 out of 10
Probabilistic random walk after 41187 steps, saw 36247 distinct states, run finished after 3004 ms. (steps per millisecond=13 ) properties seen :0
// Phase 1: matrix 20210 rows 10309 cols
[2025-05-31 22:44:00] [INFO ] Computed 101 invariants in 1142 ms
[2025-05-31 22:44:01] [INFO ] State equation strengthened by 19900 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 10207/10212 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10212 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 96/10308 variables, 96/101 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:45:22] [INFO ] Deduced a trap composed of 103 places in 73050 ms of which 12032 ms to minimize.
SMT process timed out in 82377ms, After SMT, problems are : Problem set: 0 solved, 10 unsolved
Fused 10 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 10309 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10309/10309 places, 20210/20210 transitions.
Applied a total of 0 rules in 5696 ms. Remains 10309 /10309 variables (removed 0) and now considering 20210/20210 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5697 ms. Remains : 10309/10309 places, 20210/20210 transitions.
Found 5 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p3) (NOT p2) (NOT p4)), (X (NOT p2)), (X (NOT p3)), (X (NOT p4)), (X (NOT (AND (NOT p1) p2 p3))), (X (NOT (AND p0 p1 (NOT p2) (NOT p3) (NOT p4)))), (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3) p4))), (X (NOT (AND p0 p1 (NOT p2) (NOT p3) p4))), (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) p3)))), (X (NOT (AND p0 (NOT p1) p2 p3 p4))), (X (NOT (AND (NOT p1) p3))), (X (NOT (AND p0 p1 p2 p3 p4))), (X (NOT (AND (NOT p0) (NOT p1) p2 p3 (NOT p4)))), (X (NOT (AND (NOT p0) p1 p2 (NOT p3) (NOT p4)))), (X (NOT (AND p0 p1 p2 p3 (NOT p4)))), (X (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) p3))), (X (NOT (AND (NOT p0) p1 p2 p3 p4))), (X (NOT (AND (NOT p0) p1 p2 p3 (NOT p4)))), (X (OR (AND p0 (NOT p1) (NOT p3) (NOT p4)) (AND p0 (NOT p2) p3))), (X (NOT (AND p0 (NOT p1) p2 p3))), (X (NOT (AND p0 (NOT p1) p2 (NOT p3) p4))), (X (NOT (AND p0 p1 p2 (NOT p3) p4))), (X (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p2) p3))), (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p2) p3 (NOT p4))))), (X (AND (NOT p1) (NOT p3))), (X (NOT (AND p0 p1 p2 (NOT p3) (NOT p4)))), (X (NOT (AND (NOT p0) p1 p2 (NOT p3) p4))), (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3) p4))), (X (NOT (AND p0 (NOT p1) p2 p3 (NOT p4)))), (X (NOT (AND (NOT p0) (NOT p1) p2 p3 p4))), (X (NOT (AND (NOT p0) (NOT p1) p2 p3))), (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3) (NOT p4)))), (X p0), (X (NOT p1)), (X (X (NOT p4))), (X (X (NOT (AND p0 p1 (NOT p2) (NOT p3) (NOT p4))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3) p4)))), (X (X (NOT (AND p0 p1 (NOT p2) (NOT p3) p4)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) p3))))), (X (X (NOT (AND p0 (NOT p1) p2 p3 p4)))), (X (X (NOT (AND p0 p1 p2 p3 p4)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2 p3 (NOT p4))))), (X (X (NOT (AND (NOT p0) p1 p2 (NOT p3) (NOT p4))))), (X (X (NOT (AND p0 p1 p2 p3 (NOT p4))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 p2 p3 p4)))), (X (X (NOT (AND (NOT p0) p1 p2 p3 (NOT p4))))), (X (X (NOT (AND p0 (NOT p1) p2 (NOT p3) p4)))), (X (X (NOT (AND p0 p1 p2 (NOT p3) p4)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p2) p3 (NOT p4)))))), (X (X (NOT (AND p0 p1 p2 (NOT p3) (NOT p4))))), (X (X (NOT (AND (NOT p0) (NOT p1) p3)))), (X (X (NOT (AND (NOT p0) p1 p2 (NOT p3) p4)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3) p4)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2 p3 p4)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2 p3)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3) (NOT p4))))), (X (X p0)), (X (X (NOT p1))), (G (OR (NOT p1) p3 (NOT p2) (NOT p0) (NOT p4))), (G (OR p1 p3 (NOT p2) (NOT p0) (NOT p4))), (G (OR (NOT p1) p3 (NOT p2) p0 p4)), (G (OR (NOT p1) p3 (NOT p2) p0 (NOT p4))), (G (OR (NOT p1) p3 (NOT p2) (NOT p0) p4))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT p3))), (X (X (AND (NOT p1) p2 p3))), (X (X (NOT (AND (NOT p1) p2 p3)))), (X (X (AND p0 (NOT p1) p3))), (X (X (NOT (AND p0 (NOT p1) p3)))), (X (X (AND (NOT p1) p3))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (AND p0 (NOT p1) p3 (NOT p4)))), (X (X (NOT (AND p0 (NOT p1) p3 (NOT p4))))), (X (X (AND p0 (NOT p1) (NOT p3)))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) p3)))), (X (X (NOT (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) p3))))), (X (X (OR (AND p0 (NOT p1) (NOT p3) (NOT p4)) (AND p0 (NOT p2) p3)))), (X (X (NOT (OR (AND p0 (NOT p1) (NOT p3) (NOT p4)) (AND p0 (NOT p2) p3))))), (X (X (AND p0 (NOT p1) p2 p3))), (X (X (NOT (AND p0 (NOT p1) p2 p3)))), (X (X (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p2) p3)))), (X (X (NOT (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p2) p3))))), (X (X (AND p0 (NOT p1) (NOT p3) (NOT p4)))), (X (X (NOT (AND p0 (NOT p1) (NOT p3) (NOT p4))))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (AND p0 (NOT p1) p2 p3 (NOT p4)))), (X (X (NOT (AND p0 (NOT p1) p2 p3 (NOT p4))))), (F (NOT (OR p1 (NOT p3) (NOT p2)))), (F p4), (F (NOT (OR p1 (NOT p3) (NOT p2) (NOT p0) p4))), (F p3), (F (NOT (AND (NOT p1) (NOT p3)))), (F p2), (F (NOT (OR p1 (NOT p3) (NOT p2) (NOT p0)))), (F (NOT (OR p1 p3 p2 (NOT p0) (NOT p4)))), (F (NOT (OR (AND (NOT p1) (NOT p3) p0 (NOT p4)) (AND p3 (NOT p2) p0)))), (F (NOT (OR p1 p3 p0))), (F (NOT (OR p1 (NOT p3) (NOT p0) p4))), (F (NOT (OR (AND (NOT p1) (NOT p3)) (AND p3 (NOT p2))))), (F (NOT (AND (OR p1 p3 p0 p4) (OR (NOT p3) p2 p0 p4)))), (F (NOT (OR p1 (NOT p3) (NOT p0)))), (F (NOT (AND (NOT p1) (NOT p3) p0 (NOT p4)))), (F (NOT (OR (AND (NOT p1) (NOT p3) p0) (AND p3 (NOT p2) p0)))), (F (NOT (OR (AND p1 (NOT p3)) (AND p3 p2) p0))), (F p1), (F (NOT p0)), (F (NOT (OR p1 (NOT p3) (NOT p2) (NOT p0) (NOT p4)))), (F (NOT (AND (NOT p1) (NOT p3) p0))), (F (NOT (OR p1 (NOT p3)))), (F (NOT (AND (OR p1 p3 p0) (OR (NOT p3) p2 p0)))), (F (NOT (OR (NOT p1) (NOT p3) (NOT p2) (NOT p0) p4)))]
Knowledge based reduction with 64 factoid took 3179 ms. Reduced automaton from 25 states, 94 edges and 5 AP (stutter insensitive) to 25 states, 94 edges and 5 AP (stutter insensitive).
Stuttering acceptance computed with spot in 1543 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p2) p3)), (OR (AND (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p2) p3 (NOT p4)) (AND p0 (NOT p2) p3)), (AND p0 (NOT p1) (NOT p3) (NOT p4)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) p3)), (AND (NOT p0) (NOT p1) (NOT p3)), false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]
Stuttering acceptance computed with spot in 1418 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p2) p3)), (OR (AND (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p2) p3 (NOT p4)) (AND p0 (NOT p2) p3)), (AND p0 (NOT p1) (NOT p3) (NOT p4)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) p3)), (AND (NOT p0) (NOT p1) (NOT p3)), false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]
// Phase 1: matrix 20406 rows 10505 cols
[2025-05-31 22:45:34] [INFO ] Computed 101 invariants in 714 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
Could not prove EG (AND (NOT p1) (NOT p3) (NOT p4))
Stuttering acceptance computed with spot in 1420 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p2) p3)), (OR (AND (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p2) p3 (NOT p4)) (AND p0 (NOT p2) p3)), (AND p0 (NOT p1) (NOT p3) (NOT p4)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) p3)), (AND (NOT p0) (NOT p1) (NOT p3)), false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]
Stuttering criterion allowed to conclude after 32057 steps with 41 reset in 1173 ms.
FORMULA CANConstruction-PT-100-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-100-LTLFireability-08 finished in 668690 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0&&(p1 U p2)&&(F(!p2)||G(p0))))))'
Support contains 4 out of 11320 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11320/11320 places, 21236/21236 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 863 transitions
Trivial Post-agglo rules discarded 863 transitions
Performed 863 trivial Post agglomeration. Transition count delta: 863
Iterating post reduction 0 with 863 rules applied. Total rules applied 863 place count 11320 transition count 20373
Reduce places removed 863 places and 0 transitions.
Iterating post reduction 1 with 863 rules applied. Total rules applied 1726 place count 10457 transition count 20373
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 1726 place count 10457 transition count 20273
Deduced a syphon composed of 100 places in 6 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 1926 place count 10357 transition count 20273
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 1943 place count 10340 transition count 20240
Iterating global reduction 2 with 17 rules applied. Total rules applied 1960 place count 10340 transition count 20240
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 2 with 30 rules applied. Total rules applied 1990 place count 10340 transition count 20210
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 3 with 30 rules applied. Total rules applied 2020 place count 10310 transition count 20210
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 2028 place count 10306 transition count 20206
Applied a total of 2028 rules in 19237 ms. Remains 10306 /11320 variables (removed 1014) and now considering 20206/21236 (removed 1030) transitions.
// Phase 1: matrix 20206 rows 10306 cols
[2025-05-31 22:46:12] [INFO ] Computed 101 invariants in 1060 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:46:45] [INFO ] Implicit Places using invariants in 33420 ms returned []
Implicit Place search using SMT only with invariants took 33422 ms to find 0 implicit places.
Running 20106 sub problems to find dead transitions.
[2025-05-31 22:46:45] [INFO ] Invariant cache hit.
[2025-05-31 22:46:45] [INFO ] State equation strengthened by 19900 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/10305 variables, 101/101 constraints. Problems are: Problem set: 0 solved, 20106 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 10305/30512 variables, and 101 constraints, problems are : Problem set: 0 solved, 20106 unsolved in 30440 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 0/10306 constraints, ReadFeed: 0/19900 constraints, PredecessorRefiner: 20106/20106 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20106 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/10305 variables, 101/101 constraints. Problems are: Problem set: 0 solved, 20106 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 10305/30512 variables, and 101 constraints, problems are : Problem set: 0 solved, 20106 unsolved in 30385 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 0/10306 constraints, ReadFeed: 0/19900 constraints, PredecessorRefiner: 0/20106 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 109196ms problems are : Problem set: 0 solved, 20106 unsolved
Search for dead transitions found 0 dead transitions in 109232ms
Starting structural reductions in SI_LTL mode, iteration 1 : 10306/11320 places, 20206/21236 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 161915 ms. Remains : 10306/11320 places, 20206/21236 transitions.
Stuttering acceptance computed with spot in 181 ms :[(OR (NOT p0) (NOT p2)), (NOT p2), (AND p2 (NOT p0)), (AND p2 (NOT p0))]
Running random walk in product with property : CANConstruction-PT-100-LTLFireability-09
Stuttering criterion allowed to conclude after 679 steps with 0 reset in 33 ms.
FORMULA CANConstruction-PT-100-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-100-LTLFireability-09 finished in 162177 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&(p1||X(X(X(X(X(F(p2))))))))))'
Support contains 4 out of 11320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11320/11320 places, 21236/21236 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 11304 transition count 21204
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 11304 transition count 21204
Applied a total of 32 rules in 389 ms. Remains 11304 /11320 variables (removed 16) and now considering 21204/21236 (removed 32) transitions.
// Phase 1: matrix 21204 rows 11304 cols
[2025-05-31 22:48:35] [INFO ] Computed 101 invariants in 766 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:49:08] [INFO ] Performed 9846/11304 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-05-31 22:49:11] [INFO ] Implicit Places using invariants in 36372 ms returned []
Implicit Place search using SMT only with invariants took 36372 ms to find 0 implicit places.
Running 21104 sub problems to find dead transitions.
[2025-05-31 22:49:11] [INFO ] Invariant cache hit.
[2025-05-31 22:49:11] [INFO ] State equation strengthened by 19900 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/11303 variables, 101/101 constraints. Problems are: Problem set: 0 solved, 21104 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 11303/32508 variables, and 101 constraints, problems are : Problem set: 0 solved, 21104 unsolved in 30498 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 0/11304 constraints, ReadFeed: 0/19900 constraints, PredecessorRefiner: 21104/21104 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21104 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/11303 variables, 101/101 constraints. Problems are: Problem set: 0 solved, 21104 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 11303/32508 variables, and 101 constraints, problems are : Problem set: 0 solved, 21104 unsolved in 30470 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 0/11304 constraints, ReadFeed: 0/19900 constraints, PredecessorRefiner: 0/21104 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 113824ms problems are : Problem set: 0 solved, 21104 unsolved
Search for dead transitions found 0 dead transitions in 113869ms
Starting structural reductions in LTL mode, iteration 1 : 11304/11320 places, 21204/21236 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 150657 ms. Remains : 11304/11320 places, 21204/21236 transitions.
Stuttering acceptance computed with spot in 321 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : CANConstruction-PT-100-LTLFireability-11
Stuttering criterion allowed to conclude after 2414 steps with 2 reset in 68 ms.
FORMULA CANConstruction-PT-100-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-100-LTLFireability-11 finished in 151141 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((p0&&F(p1))) U (X(p2)&&G(p3)))))'
Support contains 4 out of 11320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11320/11320 places, 21236/21236 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 11304 transition count 21204
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 11304 transition count 21204
Applied a total of 32 rules in 389 ms. Remains 11304 /11320 variables (removed 16) and now considering 21204/21236 (removed 32) transitions.
// Phase 1: matrix 21204 rows 11304 cols
[2025-05-31 22:51:06] [INFO ] Computed 101 invariants in 750 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:51:39] [INFO ] Performed 9729/11304 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-05-31 22:51:42] [INFO ] Implicit Places using invariants in 36483 ms returned []
Implicit Place search using SMT only with invariants took 36487 ms to find 0 implicit places.
Running 21104 sub problems to find dead transitions.
[2025-05-31 22:51:42] [INFO ] Invariant cache hit.
[2025-05-31 22:51:42] [INFO ] State equation strengthened by 19900 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/11303 variables, 101/101 constraints. Problems are: Problem set: 0 solved, 21104 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 11303/32508 variables, and 101 constraints, problems are : Problem set: 0 solved, 21104 unsolved in 30735 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 0/11304 constraints, ReadFeed: 0/19900 constraints, PredecessorRefiner: 21104/21104 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21104 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 11303/32508 variables, and 101 constraints, problems are : Problem set: 0 solved, 21104 unsolved in 30328 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 0/11304 constraints, ReadFeed: 0/19900 constraints, PredecessorRefiner: 0/21104 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 116640ms problems are : Problem set: 0 solved, 21104 unsolved
Search for dead transitions found 0 dead transitions in 116680ms
Starting structural reductions in LTL mode, iteration 1 : 11304/11320 places, 21204/21236 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 153580 ms. Remains : 11304/11320 places, 21204/21236 transitions.
Stuttering acceptance computed with spot in 409 ms :[(OR (NOT p3) (NOT p2)), (OR (NOT p3) (NOT p2)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p2), (NOT p3), (OR (AND (NOT p0) (NOT p2) p3) (AND (NOT p1) (NOT p2) p3)), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) p3))]
Running random walk in product with property : CANConstruction-PT-100-LTLFireability-12
Stuttering criterion allowed to conclude after 1795 steps with 0 reset in 49 ms.
FORMULA CANConstruction-PT-100-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-100-LTLFireability-12 finished in 154142 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 11320 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11320/11320 places, 21236/21236 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 864 transitions
Trivial Post-agglo rules discarded 864 transitions
Performed 864 trivial Post agglomeration. Transition count delta: 864
Iterating post reduction 0 with 864 rules applied. Total rules applied 864 place count 11320 transition count 20372
Reduce places removed 864 places and 0 transitions.
Iterating post reduction 1 with 864 rules applied. Total rules applied 1728 place count 10456 transition count 20372
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 1728 place count 10456 transition count 20272
Deduced a syphon composed of 100 places in 7 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 1928 place count 10356 transition count 20272
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 1947 place count 10337 transition count 20235
Iterating global reduction 2 with 19 rules applied. Total rules applied 1966 place count 10337 transition count 20235
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 2 with 34 rules applied. Total rules applied 2000 place count 10337 transition count 20201
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 3 with 34 rules applied. Total rules applied 2034 place count 10303 transition count 20201
Applied a total of 2034 rules in 13565 ms. Remains 10303 /11320 variables (removed 1017) and now considering 20201/21236 (removed 1035) transitions.
// Phase 1: matrix 20201 rows 10303 cols
[2025-05-31 22:53:54] [INFO ] Computed 101 invariants in 958 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:54:26] [INFO ] Performed 9368/10303 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-05-31 22:54:28] [INFO ] Implicit Places using invariants in 34998 ms returned []
Implicit Place search using SMT only with invariants took 34999 ms to find 0 implicit places.
Running 20101 sub problems to find dead transitions.
[2025-05-31 22:54:28] [INFO ] Invariant cache hit.
[2025-05-31 22:54:28] [INFO ] State equation strengthened by 19900 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/10302 variables, 101/101 constraints. Problems are: Problem set: 0 solved, 20101 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 10302/30504 variables, and 101 constraints, problems are : Problem set: 0 solved, 20101 unsolved in 30717 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 0/10303 constraints, ReadFeed: 0/19900 constraints, PredecessorRefiner: 20101/20101 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20101 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/10302 variables, 101/101 constraints. Problems are: Problem set: 0 solved, 20101 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 10302/30504 variables, and 101 constraints, problems are : Problem set: 0 solved, 20101 unsolved in 30653 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 0/10303 constraints, ReadFeed: 0/19900 constraints, PredecessorRefiner: 0/20101 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 107353ms problems are : Problem set: 0 solved, 20101 unsolved
Search for dead transitions found 0 dead transitions in 107386ms
Starting structural reductions in SI_LTL mode, iteration 1 : 10303/11320 places, 20201/21236 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 155975 ms. Remains : 10303/11320 places, 20201/21236 transitions.
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-100-LTLFireability-13
Stuttering criterion allowed to conclude after 707 steps with 0 reset in 21 ms.
FORMULA CANConstruction-PT-100-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-100-LTLFireability-13 finished in 156161 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 11320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11320/11320 places, 21236/21236 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 11302 transition count 21200
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 11302 transition count 21200
Applied a total of 36 rules in 272 ms. Remains 11302 /11320 variables (removed 18) and now considering 21200/21236 (removed 36) transitions.
// Phase 1: matrix 21200 rows 11302 cols
[2025-05-31 22:56:17] [INFO ] Computed 101 invariants in 705 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:56:49] [INFO ] Performed 8668/11302 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-05-31 22:56:55] [INFO ] Implicit Places using invariants in 39090 ms returned []
Implicit Place search using SMT only with invariants took 39092 ms to find 0 implicit places.
Running 21100 sub problems to find dead transitions.
[2025-05-31 22:56:55] [INFO ] Invariant cache hit.
[2025-05-31 22:56:55] [INFO ] State equation strengthened by 19900 read => feed constraints.
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CANConstruction-PT-100"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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-5832"
echo " Executing tool itstools"
echo " Input is CANConstruction-PT-100, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r030-smll-174853813600244"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CANConstruction-PT-100.tgz
mv CANConstruction-PT-100 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.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 '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;