Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r070-tall-171620505000027.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is CANConstruction-PT-030, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r070-tall-171620505000027
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.8M
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 17:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.0K Apr 12 18:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 65K Apr 12 18:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Apr 12 18:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Apr 12 18:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.4M May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716216987150

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANConstruction-PT-030
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-20 14:56:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-20 14:56:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-20 14:56:28] [INFO ] Load time of PNML (sax parser for PT used): 172 ms
[2024-05-20 14:56:28] [INFO ] Transformed 2162 places.
[2024-05-20 14:56:28] [INFO ] Transformed 3840 transitions.
[2024-05-20 14:56:28] [INFO ] Parsed PT model containing 2162 places and 3840 transitions and 11400 arcs in 286 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Support contains 54 out of 2162 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2162/2162 places, 3840/3840 transitions.
Discarding 819 places :
Symmetric choice reduction at 0 with 819 rule applications. Total rules 819 place count 1343 transition count 2202
Iterating global reduction 0 with 819 rules applied. Total rules applied 1638 place count 1343 transition count 2202
Applied a total of 1638 rules in 270 ms. Remains 1343 /2162 variables (removed 819) and now considering 2202/3840 (removed 1638) transitions.
// Phase 1: matrix 2202 rows 1343 cols
[2024-05-20 14:56:29] [INFO ] Computed 61 invariants in 40 ms
[2024-05-20 14:56:33] [INFO ] Implicit Places using invariants in 4253 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]
Discarding 30 places :
Implicit Place search using SMT only with invariants took 4287 ms to find 30 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1313/2162 places, 2202/3840 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 1284 transition count 2173
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 1284 transition count 2173
Applied a total of 58 rules in 174 ms. Remains 1284 /1313 variables (removed 29) and now considering 2173/2202 (removed 29) transitions.
// Phase 1: matrix 2173 rows 1284 cols
[2024-05-20 14:56:33] [INFO ] Computed 31 invariants in 19 ms
[2024-05-20 14:56:34] [INFO ] Implicit Places using invariants in 597 ms returned []
[2024-05-20 14:56:34] [INFO ] Invariant cache hit.
[2024-05-20 14:56:34] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2024-05-20 14:56:42] [INFO ] Implicit Places using invariants and state equation in 8115 ms returned []
Implicit Place search using SMT with State Equation took 8720 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1284/2162 places, 2173/3840 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 13466 ms. Remains : 1284/2162 places, 2173/3840 transitions.
Support contains 54 out of 1284 places after structural reductions.
[2024-05-20 14:56:42] [INFO ] Flatten gal took : 151 ms
[2024-05-20 14:56:42] [INFO ] Flatten gal took : 95 ms
[2024-05-20 14:56:42] [INFO ] Input system was already deterministic with 2173 transitions.
RANDOM walk for 40000 steps (74 resets) in 2302 ms. (17 steps per ms) remains 9/33 properties
BEST_FIRST walk for 40004 steps (8 resets) in 90 ms. (439 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 96 ms. (412 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 98 ms. (404 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 91 ms. (434 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 169 ms. (235 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 76 ms. (519 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 146 ms. (272 steps per ms) remains 9/9 properties
[2024-05-20 14:56:43] [INFO ] Invariant cache hit.
[2024-05-20 14:56:43] [INFO ] State equation strengthened by 1770 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp28 is UNSAT
At refinement iteration 1 (OVERLAPS) 1250/1263 variables, 11/11 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1263 variables, 0/11 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 20/1283 variables, 20/31 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1283 variables, 0/31 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2173/3456 variables, 1283/1314 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3456 variables, 1770/3084 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3456 variables, 0/3084 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/3457 variables, 1/3085 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3457 variables, 0/3085 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/3457 variables, 0/3085 constraints. Problems are: Problem set: 8 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3457/3457 variables, and 3085 constraints, problems are : Problem set: 8 solved, 1 unsolved in 1052 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, State Equation: 1284/1284 constraints, ReadFeed: 1770/1770 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 8 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1252/1256 variables, 4/4 constraints. Problems are: Problem set: 8 solved, 1 unsolved
[2024-05-20 14:56:45] [INFO ] Deduced a trap composed of 5 places in 648 ms of which 62 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1256 variables, 1/5 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1256 variables, 0/5 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 27/1283 variables, 27/32 constraints. Problems are: Problem set: 8 solved, 1 unsolved
[2024-05-20 14:56:46] [INFO ] Deduced a trap composed of 54 places in 645 ms of which 9 ms to minimize.
[2024-05-20 14:56:47] [INFO ] Deduced a trap composed of 45 places in 633 ms of which 9 ms to minimize.
[2024-05-20 14:56:48] [INFO ] Deduced a trap composed of 48 places in 902 ms of which 8 ms to minimize.
[2024-05-20 14:56:48] [INFO ] Deduced a trap composed of 49 places in 658 ms of which 8 ms to minimize.
[2024-05-20 14:56:49] [INFO ] Deduced a trap composed of 50 places in 630 ms of which 8 ms to minimize.
[2024-05-20 14:56:50] [INFO ] Deduced a trap composed of 42 places in 652 ms of which 8 ms to minimize.
SMT process timed out in 6309ms, After SMT, problems are : Problem set: 8 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 1284 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1284/1284 places, 2173/2173 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 194 transitions
Trivial Post-agglo rules discarded 194 transitions
Performed 194 trivial Post agglomeration. Transition count delta: 194
Iterating post reduction 0 with 194 rules applied. Total rules applied 194 place count 1284 transition count 1979
Reduce places removed 194 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 195 rules applied. Total rules applied 389 place count 1090 transition count 1978
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 390 place count 1089 transition count 1978
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 30 Pre rules applied. Total rules applied 390 place count 1089 transition count 1948
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 450 place count 1059 transition count 1948
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 469 place count 1040 transition count 1910
Iterating global reduction 3 with 19 rules applied. Total rules applied 488 place count 1040 transition count 1910
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 3 with 13 rules applied. Total rules applied 501 place count 1040 transition count 1897
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 4 with 13 rules applied. Total rules applied 514 place count 1027 transition count 1897
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 5 with 62 rules applied. Total rules applied 576 place count 996 transition count 1866
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 577 place count 996 transition count 1866
Applied a total of 577 rules in 517 ms. Remains 996 /1284 variables (removed 288) and now considering 1866/2173 (removed 307) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 517 ms. Remains : 996/1284 places, 1866/2173 transitions.
RANDOM walk for 30952 steps (146 resets) in 385 ms. (80 steps per ms) remains 0/1 properties
FORMULA CANConstruction-PT-030-LTLCardinality-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 8 atomic propositions for a total of 15 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA CANConstruction-PT-030-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-030-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-030-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-030-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 92 stabilizing places and 121 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X((G(p1)||G(p0)))))'
Support contains 3 out of 1284 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1284/1284 places, 2173/2173 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 1263 transition count 2132
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 1263 transition count 2132
Applied a total of 42 rules in 106 ms. Remains 1263 /1284 variables (removed 21) and now considering 2132/2173 (removed 41) transitions.
// Phase 1: matrix 2132 rows 1263 cols
[2024-05-20 14:56:51] [INFO ] Computed 31 invariants in 15 ms
[2024-05-20 14:56:52] [INFO ] Implicit Places using invariants in 604 ms returned []
[2024-05-20 14:56:52] [INFO ] Invariant cache hit.
[2024-05-20 14:56:52] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2024-05-20 14:56:59] [INFO ] Implicit Places using invariants and state equation in 7705 ms returned []
Implicit Place search using SMT with State Equation took 8312 ms to find 0 implicit places.
Running 2102 sub problems to find dead transitions.
[2024-05-20 14:56:59] [INFO ] Invariant cache hit.
[2024-05-20 14:56:59] [INFO ] State equation strengthened by 1770 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1262 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 2102 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1262/3395 variables, and 31 constraints, problems are : Problem set: 0 solved, 2102 unsolved in 30071 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, State Equation: 0/1263 constraints, ReadFeed: 0/1770 constraints, PredecessorRefiner: 2102/2102 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2102 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1262 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 2102 unsolved
[2024-05-20 14:57:42] [INFO ] Deduced a trap composed of 42 places in 319 ms of which 6 ms to minimize.
[2024-05-20 14:57:42] [INFO ] Deduced a trap composed of 42 places in 331 ms of which 7 ms to minimize.
[2024-05-20 14:57:43] [INFO ] Deduced a trap composed of 42 places in 316 ms of which 6 ms to minimize.
[2024-05-20 14:57:43] [INFO ] Deduced a trap composed of 42 places in 290 ms of which 6 ms to minimize.
[2024-05-20 14:57:43] [INFO ] Deduced a trap composed of 42 places in 284 ms of which 6 ms to minimize.
[2024-05-20 14:57:44] [INFO ] Deduced a trap composed of 48 places in 280 ms of which 5 ms to minimize.
[2024-05-20 14:57:44] [INFO ] Deduced a trap composed of 45 places in 284 ms of which 6 ms to minimize.
[2024-05-20 14:57:44] [INFO ] Deduced a trap composed of 42 places in 264 ms of which 5 ms to minimize.
[2024-05-20 14:57:45] [INFO ] Deduced a trap composed of 42 places in 255 ms of which 5 ms to minimize.
[2024-05-20 14:57:45] [INFO ] Deduced a trap composed of 42 places in 229 ms of which 5 ms to minimize.
[2024-05-20 14:57:45] [INFO ] Deduced a trap composed of 42 places in 249 ms of which 5 ms to minimize.
[2024-05-20 14:57:45] [INFO ] Deduced a trap composed of 42 places in 265 ms of which 5 ms to minimize.
[2024-05-20 14:57:46] [INFO ] Deduced a trap composed of 42 places in 265 ms of which 8 ms to minimize.
[2024-05-20 14:57:46] [INFO ] Deduced a trap composed of 45 places in 279 ms of which 5 ms to minimize.
[2024-05-20 14:57:46] [INFO ] Deduced a trap composed of 45 places in 270 ms of which 6 ms to minimize.
[2024-05-20 14:57:46] [INFO ] Deduced a trap composed of 45 places in 266 ms of which 5 ms to minimize.
[2024-05-20 14:57:47] [INFO ] Deduced a trap composed of 42 places in 248 ms of which 6 ms to minimize.
[2024-05-20 14:57:47] [INFO ] Deduced a trap composed of 42 places in 261 ms of which 5 ms to minimize.
[2024-05-20 14:57:47] [INFO ] Deduced a trap composed of 42 places in 246 ms of which 5 ms to minimize.
[2024-05-20 14:57:48] [INFO ] Deduced a trap composed of 42 places in 243 ms of which 5 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1262 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 2102 unsolved
[2024-05-20 14:57:49] [INFO ] Deduced a trap composed of 42 places in 297 ms of which 6 ms to minimize.
[2024-05-20 14:57:49] [INFO ] Deduced a trap composed of 42 places in 290 ms of which 6 ms to minimize.
[2024-05-20 14:57:49] [INFO ] Deduced a trap composed of 42 places in 267 ms of which 6 ms to minimize.
[2024-05-20 14:57:51] [INFO ] Deduced a trap composed of 42 places in 656 ms of which 9 ms to minimize.
[2024-05-20 14:57:51] [INFO ] Deduced a trap composed of 53 places in 682 ms of which 8 ms to minimize.
[2024-05-20 14:57:52] [INFO ] Deduced a trap composed of 48 places in 602 ms of which 7 ms to minimize.
[2024-05-20 14:57:53] [INFO ] Deduced a trap composed of 49 places in 612 ms of which 7 ms to minimize.
[2024-05-20 14:57:53] [INFO ] Deduced a trap composed of 42 places in 592 ms of which 8 ms to minimize.
[2024-05-20 14:57:54] [INFO ] Deduced a trap composed of 50 places in 601 ms of which 8 ms to minimize.
[2024-05-20 14:57:55] [INFO ] Deduced a trap composed of 42 places in 621 ms of which 7 ms to minimize.
[2024-05-20 14:57:55] [INFO ] Deduced a trap composed of 45 places in 610 ms of which 7 ms to minimize.
[2024-05-20 14:57:56] [INFO ] Deduced a trap composed of 42 places in 579 ms of which 8 ms to minimize.
[2024-05-20 14:57:56] [INFO ] Deduced a trap composed of 45 places in 564 ms of which 9 ms to minimize.
[2024-05-20 14:57:57] [INFO ] Deduced a trap composed of 49 places in 526 ms of which 7 ms to minimize.
[2024-05-20 14:57:57] [INFO ] Deduced a trap composed of 52 places in 569 ms of which 7 ms to minimize.
[2024-05-20 14:57:58] [INFO ] Deduced a trap composed of 52 places in 547 ms of which 8 ms to minimize.
[2024-05-20 14:57:59] [INFO ] Deduced a trap composed of 42 places in 541 ms of which 7 ms to minimize.
[2024-05-20 14:57:59] [INFO ] Deduced a trap composed of 42 places in 524 ms of which 7 ms to minimize.
[2024-05-20 14:58:00] [INFO ] Deduced a trap composed of 42 places in 487 ms of which 6 ms to minimize.
[2024-05-20 14:58:00] [INFO ] Deduced a trap composed of 45 places in 534 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1262 variables, 20/71 constraints. Problems are: Problem set: 0 solved, 2102 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1262/3395 variables, and 71 constraints, problems are : Problem set: 0 solved, 2102 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, State Equation: 0/1263 constraints, ReadFeed: 0/1770 constraints, PredecessorRefiner: 0/2102 constraints, Known Traps: 40/40 constraints]
After SMT, in 61174ms problems are : Problem set: 0 solved, 2102 unsolved
Search for dead transitions found 0 dead transitions in 61199ms
Starting structural reductions in LTL mode, iteration 1 : 1263/1284 places, 2132/2173 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 69638 ms. Remains : 1263/1284 places, 2132/2173 transitions.
Stuttering acceptance computed with spot in 304 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CANConstruction-PT-030-LTLCardinality-00
Stuttering criterion allowed to conclude after 5152 steps with 10 reset in 65 ms.
FORMULA CANConstruction-PT-030-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-030-LTLCardinality-00 finished in 70092 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 1284 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1284/1284 places, 2173/2173 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 1263 transition count 2132
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 1263 transition count 2132
Applied a total of 42 rules in 90 ms. Remains 1263 /1284 variables (removed 21) and now considering 2132/2173 (removed 41) transitions.
// Phase 1: matrix 2132 rows 1263 cols
[2024-05-20 14:58:01] [INFO ] Computed 31 invariants in 18 ms
[2024-05-20 14:58:02] [INFO ] Implicit Places using invariants in 601 ms returned []
[2024-05-20 14:58:02] [INFO ] Invariant cache hit.
[2024-05-20 14:58:02] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2024-05-20 14:58:10] [INFO ] Implicit Places using invariants and state equation in 8664 ms returned []
Implicit Place search using SMT with State Equation took 9272 ms to find 0 implicit places.
Running 2102 sub problems to find dead transitions.
[2024-05-20 14:58:10] [INFO ] Invariant cache hit.
[2024-05-20 14:58:10] [INFO ] State equation strengthened by 1770 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 2.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 1.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 1.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 1.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 1.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 1.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 1.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 1.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 1.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 1.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 0.0)
(s606 0.0)
(s607 0.0)
(s608 0.0)
(s609 0.0)
(s610 0.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 1.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 0.0)
(s636 0.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s642 0.0)
(s643 0.0)
(s644 0.0)
(s645 1.0)
(s646 0.0)
(s647 0.0)
(s648 0.0)
(s649 0.0)
(s650 0.0)
(s651 0.0)
(s652 0.0)
(s653 0.0)
(s654 0.0)
(s655 0.0)
(s656 0.0)
(s657 0.0)
(s658 0.0)
(s659 0.0)
(s660 0.0)
(s661 0.0)
(s662 0.0)
(s663 0.0)
(s664 0.0)
(s665 0.0)
(s666 0.0)
(s667 0.0)
(s668 0.0)
(s669 0.0)
(s670 0.0)
(s671 0.0)
(s672 0.0)
(s673 0.0)
(s674 1.0)
(s675 0.0)
(s676 0.0)
(s677 0.0)
(s678 0.0)
(s679 0.0)
(s680 0.0)
(s681 0.0)
(s682 0.0)
(s683 0.0)
(s684 0.0)
(s685 0.0)
(s686 0.0)
(s687 0.0)
(s688 0.0)
(s689 0.0)
(s690 0.0)
(s691 0.0)
(s692 0.0)
(s693 0.0)
(s694 0.0)
(s695 0.0)
(s696 0.0)
(s697 0.0)
(s698 0.0)
(s699 0.0)
(s700 0.0)
(s701 0.0)
(s702 0.0)
(s703 1.0)
(s704 0.0)
(s705 0.0)
(s706 0.0)
(s707 0.0)
(s708 timeout
0.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1262 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 2102 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1262/3395 variables, and 31 constraints, problems are : Problem set: 0 solved, 2102 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, State Equation: 0/1263 constraints, ReadFeed: 0/1770 constraints, PredecessorRefiner: 2102/2102 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2102 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1262 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 2102 unsolved
[2024-05-20 14:58:52] [INFO ] Deduced a trap composed of 42 places in 309 ms of which 7 ms to minimize.
[2024-05-20 14:58:53] [INFO ] Deduced a trap composed of 42 places in 337 ms of which 6 ms to minimize.
[2024-05-20 14:58:53] [INFO ] Deduced a trap composed of 43 places in 315 ms of which 6 ms to minimize.
[2024-05-20 14:58:53] [INFO ] Deduced a trap composed of 42 places in 322 ms of which 7 ms to minimize.
[2024-05-20 14:58:54] [INFO ] Deduced a trap composed of 42 places in 325 ms of which 7 ms to minimize.
[2024-05-20 14:58:54] [INFO ] Deduced a trap composed of 42 places in 307 ms of which 6 ms to minimize.
[2024-05-20 14:58:55] [INFO ] Deduced a trap composed of 42 places in 318 ms of which 6 ms to minimize.
[2024-05-20 14:58:55] [INFO ] Deduced a trap composed of 42 places in 331 ms of which 6 ms to minimize.
[2024-05-20 14:58:55] [INFO ] Deduced a trap composed of 42 places in 317 ms of which 6 ms to minimize.
[2024-05-20 14:58:56] [INFO ] Deduced a trap composed of 42 places in 317 ms of which 9 ms to minimize.
[2024-05-20 14:58:56] [INFO ] Deduced a trap composed of 42 places in 319 ms of which 7 ms to minimize.
[2024-05-20 14:58:57] [INFO ] Deduced a trap composed of 42 places in 320 ms of which 6 ms to minimize.
[2024-05-20 14:58:57] [INFO ] Deduced a trap composed of 42 places in 325 ms of which 6 ms to minimize.
[2024-05-20 14:58:57] [INFO ] Deduced a trap composed of 42 places in 317 ms of which 7 ms to minimize.
[2024-05-20 14:58:58] [INFO ] Deduced a trap composed of 42 places in 325 ms of which 6 ms to minimize.
[2024-05-20 14:58:58] [INFO ] Deduced a trap composed of 42 places in 324 ms of which 6 ms to minimize.
[2024-05-20 14:58:58] [INFO ] Deduced a trap composed of 42 places in 325 ms of which 7 ms to minimize.
[2024-05-20 14:58:59] [INFO ] Deduced a trap composed of 42 places in 319 ms of which 6 ms to minimize.
[2024-05-20 14:58:59] [INFO ] Deduced a trap composed of 42 places in 292 ms of which 7 ms to minimize.
[2024-05-20 14:58:59] [INFO ] Deduced a trap composed of 42 places in 321 ms of which 7 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1262 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 2102 unsolved
[2024-05-20 14:59:10] [INFO ] Deduced a trap composed of 42 places in 336 ms of which 7 ms to minimize.
[2024-05-20 14:59:11] [INFO ] Deduced a trap composed of 42 places in 324 ms of which 7 ms to minimize.
[2024-05-20 14:59:11] [INFO ] Deduced a trap composed of 42 places in 302 ms of which 6 ms to minimize.
SMT process timed out in 61060ms, After SMT, problems are : Problem set: 0 solved, 2102 unsolved
Search for dead transitions found 0 dead transitions in 61085ms
Starting structural reductions in LTL mode, iteration 1 : 1263/1284 places, 2132/2173 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70454 ms. Remains : 1263/1284 places, 2132/2173 transitions.
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-030-LTLCardinality-03
Product exploration explored 100000 steps with 50000 reset in 590 ms.
Product exploration explored 100000 steps with 50000 reset in 576 ms.
Computed a total of 91 stabilizing places and 120 stable transitions
Computed a total of 91 stabilizing places and 120 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 24 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANConstruction-PT-030-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANConstruction-PT-030-LTLCardinality-03 finished in 71785 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((G(p0) U X(p1)))&&F((F(p1)&&X(G(p2)))))))'
Support contains 5 out of 1284 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1284/1284 places, 2173/2173 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 195 transitions
Trivial Post-agglo rules discarded 195 transitions
Performed 195 trivial Post agglomeration. Transition count delta: 195
Iterating post reduction 0 with 195 rules applied. Total rules applied 195 place count 1284 transition count 1978
Reduce places removed 195 places and 0 transitions.
Iterating post reduction 1 with 195 rules applied. Total rules applied 390 place count 1089 transition count 1978
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 390 place count 1089 transition count 1948
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 450 place count 1059 transition count 1948
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 471 place count 1038 transition count 1907
Iterating global reduction 2 with 21 rules applied. Total rules applied 492 place count 1038 transition count 1907
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 2 with 14 rules applied. Total rules applied 506 place count 1038 transition count 1893
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 520 place count 1024 transition count 1893
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 522 place count 1023 transition count 1892
Applied a total of 522 rules in 203 ms. Remains 1023 /1284 variables (removed 261) and now considering 1892/2173 (removed 281) transitions.
// Phase 1: matrix 1892 rows 1023 cols
[2024-05-20 14:59:13] [INFO ] Computed 31 invariants in 12 ms
[2024-05-20 14:59:13] [INFO ] Implicit Places using invariants in 540 ms returned []
[2024-05-20 14:59:13] [INFO ] Invariant cache hit.
[2024-05-20 14:59:14] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2024-05-20 14:59:20] [INFO ] Implicit Places using invariants and state equation in 6434 ms returned []
Implicit Place search using SMT with State Equation took 6977 ms to find 0 implicit places.
[2024-05-20 14:59:20] [INFO ] Redundant transitions in 104 ms returned []
Running 1862 sub problems to find dead transitions.
[2024-05-20 14:59:20] [INFO ] Invariant cache hit.
[2024-05-20 14:59:20] [INFO ] State equation strengthened by 1770 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1022 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 1862 unsolved
[2024-05-20 14:59:51] [INFO ] Deduced a trap composed of 35 places in 534 ms of which 7 ms to minimize.
[2024-05-20 14:59:51] [INFO ] Deduced a trap composed of 35 places in 528 ms of which 7 ms to minimize.
SMT process timed out in 31321ms, After SMT, problems are : Problem set: 0 solved, 1862 unsolved
Search for dead transitions found 0 dead transitions in 31338ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1023/1284 places, 1892/2173 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 38641 ms. Remains : 1023/1284 places, 1892/2173 transitions.
Stuttering acceptance computed with spot in 440 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (NOT p1), (NOT p2), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) p2)]
Running random walk in product with property : CANConstruction-PT-030-LTLCardinality-05
Stuttering criterion allowed to conclude after 238 steps with 1 reset in 4 ms.
FORMULA CANConstruction-PT-030-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-030-LTLCardinality-05 finished in 39122 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 1284 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1284/1284 places, 2173/2173 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 1263 transition count 2132
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 1263 transition count 2132
Applied a total of 42 rules in 91 ms. Remains 1263 /1284 variables (removed 21) and now considering 2132/2173 (removed 41) transitions.
// Phase 1: matrix 2132 rows 1263 cols
[2024-05-20 14:59:52] [INFO ] Computed 31 invariants in 17 ms
[2024-05-20 14:59:53] [INFO ] Implicit Places using invariants in 598 ms returned []
[2024-05-20 14:59:53] [INFO ] Invariant cache hit.
[2024-05-20 14:59:53] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2024-05-20 15:00:00] [INFO ] Implicit Places using invariants and state equation in 7697 ms returned []
Implicit Place search using SMT with State Equation took 8296 ms to find 0 implicit places.
Running 2102 sub problems to find dead transitions.
[2024-05-20 15:00:00] [INFO ] Invariant cache hit.
[2024-05-20 15:00:00] [INFO ] State equation strengthened by 1770 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1262 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 2102 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1262/3395 variables, and 31 constraints, problems are : Problem set: 0 solved, 2102 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, State Equation: 0/1263 constraints, ReadFeed: 0/1770 constraints, PredecessorRefiner: 2102/2102 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2102 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1262 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 2102 unsolved
[2024-05-20 15:00:43] [INFO ] Deduced a trap composed of 43 places in 313 ms of which 6 ms to minimize.
[2024-05-20 15:00:43] [INFO ] Deduced a trap composed of 42 places in 287 ms of which 6 ms to minimize.
[2024-05-20 15:00:43] [INFO ] Deduced a trap composed of 42 places in 273 ms of which 6 ms to minimize.
[2024-05-20 15:00:44] [INFO ] Deduced a trap composed of 43 places in 273 ms of which 6 ms to minimize.
[2024-05-20 15:00:44] [INFO ] Deduced a trap composed of 43 places in 258 ms of which 6 ms to minimize.
[2024-05-20 15:00:44] [INFO ] Deduced a trap composed of 43 places in 240 ms of which 5 ms to minimize.
[2024-05-20 15:00:45] [INFO ] Deduced a trap composed of 43 places in 252 ms of which 5 ms to minimize.
[2024-05-20 15:00:45] [INFO ] Deduced a trap composed of 43 places in 246 ms of which 5 ms to minimize.
[2024-05-20 15:00:45] [INFO ] Deduced a trap composed of 43 places in 229 ms of which 5 ms to minimize.
[2024-05-20 15:00:45] [INFO ] Deduced a trap composed of 43 places in 221 ms of which 5 ms to minimize.
[2024-05-20 15:00:46] [INFO ] Deduced a trap composed of 43 places in 222 ms of which 4 ms to minimize.
[2024-05-20 15:00:46] [INFO ] Deduced a trap composed of 43 places in 234 ms of which 5 ms to minimize.
[2024-05-20 15:00:46] [INFO ] Deduced a trap composed of 43 places in 240 ms of which 5 ms to minimize.
[2024-05-20 15:00:46] [INFO ] Deduced a trap composed of 43 places in 225 ms of which 5 ms to minimize.
[2024-05-20 15:00:47] [INFO ] Deduced a trap composed of 43 places in 218 ms of which 5 ms to minimize.
[2024-05-20 15:00:47] [INFO ] Deduced a trap composed of 43 places in 226 ms of which 5 ms to minimize.
[2024-05-20 15:00:47] [INFO ] Deduced a trap composed of 43 places in 208 ms of which 4 ms to minimize.
[2024-05-20 15:00:47] [INFO ] Deduced a trap composed of 43 places in 205 ms of which 4 ms to minimize.
[2024-05-20 15:00:48] [INFO ] Deduced a trap composed of 42 places in 265 ms of which 7 ms to minimize.
[2024-05-20 15:00:48] [INFO ] Deduced a trap composed of 43 places in 253 ms of which 11 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1262 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 2102 unsolved
[2024-05-20 15:00:50] [INFO ] Deduced a trap composed of 48 places in 686 ms of which 8 ms to minimize.
[2024-05-20 15:00:51] [INFO ] Deduced a trap composed of 45 places in 684 ms of which 8 ms to minimize.
[2024-05-20 15:00:51] [INFO ] Deduced a trap composed of 42 places in 664 ms of which 8 ms to minimize.
[2024-05-20 15:00:52] [INFO ] Deduced a trap composed of 49 places in 685 ms of which 7 ms to minimize.
[2024-05-20 15:00:53] [INFO ] Deduced a trap composed of 45 places in 611 ms of which 8 ms to minimize.
[2024-05-20 15:00:53] [INFO ] Deduced a trap composed of 42 places in 638 ms of which 8 ms to minimize.
[2024-05-20 15:00:54] [INFO ] Deduced a trap composed of 42 places in 594 ms of which 8 ms to minimize.
[2024-05-20 15:00:54] [INFO ] Deduced a trap composed of 53 places in 607 ms of which 8 ms to minimize.
[2024-05-20 15:00:55] [INFO ] Deduced a trap composed of 45 places in 605 ms of which 7 ms to minimize.
[2024-05-20 15:00:56] [INFO ] Deduced a trap composed of 45 places in 620 ms of which 8 ms to minimize.
[2024-05-20 15:00:56] [INFO ] Deduced a trap composed of 45 places in 615 ms of which 8 ms to minimize.
[2024-05-20 15:00:57] [INFO ] Deduced a trap composed of 42 places in 601 ms of which 7 ms to minimize.
[2024-05-20 15:00:58] [INFO ] Deduced a trap composed of 45 places in 556 ms of which 7 ms to minimize.
[2024-05-20 15:00:58] [INFO ] Deduced a trap composed of 45 places in 610 ms of which 8 ms to minimize.
[2024-05-20 15:00:59] [INFO ] Deduced a trap composed of 42 places in 554 ms of which 8 ms to minimize.
[2024-05-20 15:00:59] [INFO ] Deduced a trap composed of 45 places in 559 ms of which 7 ms to minimize.
[2024-05-20 15:01:00] [INFO ] Deduced a trap composed of 45 places in 569 ms of which 8 ms to minimize.
[2024-05-20 15:01:01] [INFO ] Deduced a trap composed of 42 places in 568 ms of which 8 ms to minimize.
[2024-05-20 15:01:01] [INFO ] Deduced a trap composed of 49 places in 581 ms of which 7 ms to minimize.
[2024-05-20 15:01:02] [INFO ] Deduced a trap composed of 45 places in 579 ms of which 7 ms to minimize.
SMT process timed out in 61513ms, After SMT, problems are : Problem set: 0 solved, 2102 unsolved
Search for dead transitions found 0 dead transitions in 61536ms
Starting structural reductions in LTL mode, iteration 1 : 1263/1284 places, 2132/2173 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 69928 ms. Remains : 1263/1284 places, 2132/2173 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-030-LTLCardinality-07
Stuttering criterion allowed to conclude after 499 steps with 0 reset in 4 ms.
FORMULA CANConstruction-PT-030-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-030-LTLCardinality-07 finished in 70039 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 1284 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1284/1284 places, 2173/2173 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 197 transitions
Trivial Post-agglo rules discarded 197 transitions
Performed 197 trivial Post agglomeration. Transition count delta: 197
Iterating post reduction 0 with 197 rules applied. Total rules applied 197 place count 1284 transition count 1976
Reduce places removed 197 places and 0 transitions.
Iterating post reduction 1 with 197 rules applied. Total rules applied 394 place count 1087 transition count 1976
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 394 place count 1087 transition count 1946
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 454 place count 1057 transition count 1946
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 474 place count 1037 transition count 1906
Iterating global reduction 2 with 20 rules applied. Total rules applied 494 place count 1037 transition count 1906
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 2 with 14 rules applied. Total rules applied 508 place count 1037 transition count 1892
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 522 place count 1023 transition count 1892
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 4 with 60 rules applied. Total rules applied 582 place count 993 transition count 1862
Applied a total of 582 rules in 193 ms. Remains 993 /1284 variables (removed 291) and now considering 1862/2173 (removed 311) transitions.
// Phase 1: matrix 1862 rows 993 cols
[2024-05-20 15:01:02] [INFO ] Computed 31 invariants in 13 ms
[2024-05-20 15:01:03] [INFO ] Implicit Places using invariants in 531 ms returned []
[2024-05-20 15:01:03] [INFO ] Invariant cache hit.
[2024-05-20 15:01:03] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2024-05-20 15:01:10] [INFO ] Implicit Places using invariants and state equation in 7125 ms returned []
Implicit Place search using SMT with State Equation took 7658 ms to find 0 implicit places.
[2024-05-20 15:01:10] [INFO ] Redundant transitions in 85 ms returned []
Running 1832 sub problems to find dead transitions.
[2024-05-20 15:01:10] [INFO ] Invariant cache hit.
[2024-05-20 15:01:10] [INFO ] State equation strengthened by 1770 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/992 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 1832 unsolved
[2024-05-20 15:01:36] [INFO ] Deduced a trap composed of 33 places in 283 ms of which 6 ms to minimize.
[2024-05-20 15:01:38] [INFO ] Deduced a trap composed of 33 places in 275 ms of which 6 ms to minimize.
[2024-05-20 15:01:38] [INFO ] Deduced a trap composed of 33 places in 266 ms of which 6 ms to minimize.
[2024-05-20 15:01:39] [INFO ] Deduced a trap composed of 34 places in 270 ms of which 6 ms to minimize.
[2024-05-20 15:01:39] [INFO ] Deduced a trap composed of 34 places in 263 ms of which 6 ms to minimize.
[2024-05-20 15:01:40] [INFO ] Deduced a trap composed of 33 places in 259 ms of which 5 ms to minimize.
[2024-05-20 15:01:40] [INFO ] Deduced a trap composed of 33 places in 254 ms of which 5 ms to minimize.
[2024-05-20 15:01:40] [INFO ] Deduced a trap composed of 33 places in 267 ms of which 7 ms to minimize.
[2024-05-20 15:01:41] [INFO ] Deduced a trap composed of 33 places in 507 ms of which 6 ms to minimize.
SMT process timed out in 31021ms, After SMT, problems are : Problem set: 0 solved, 1832 unsolved
Search for dead transitions found 0 dead transitions in 31037ms
Starting structural reductions in SI_LTL mode, iteration 1 : 993/1284 places, 1862/2173 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 38984 ms. Remains : 993/1284 places, 1862/2173 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-030-LTLCardinality-08
Stuttering criterion allowed to conclude after 234 steps with 0 reset in 2 ms.
FORMULA CANConstruction-PT-030-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-030-LTLCardinality-08 finished in 39097 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 1284 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1284/1284 places, 2173/2173 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 197 transitions
Trivial Post-agglo rules discarded 197 transitions
Performed 197 trivial Post agglomeration. Transition count delta: 197
Iterating post reduction 0 with 197 rules applied. Total rules applied 197 place count 1284 transition count 1976
Reduce places removed 197 places and 0 transitions.
Iterating post reduction 1 with 197 rules applied. Total rules applied 394 place count 1087 transition count 1976
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 394 place count 1087 transition count 1946
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 454 place count 1057 transition count 1946
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 475 place count 1036 transition count 1904
Iterating global reduction 2 with 21 rules applied. Total rules applied 496 place count 1036 transition count 1904
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 2 with 15 rules applied. Total rules applied 511 place count 1036 transition count 1889
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 3 with 15 rules applied. Total rules applied 526 place count 1021 transition count 1889
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 4 with 58 rules applied. Total rules applied 584 place count 992 transition count 1860
Applied a total of 584 rules in 167 ms. Remains 992 /1284 variables (removed 292) and now considering 1860/2173 (removed 313) transitions.
// Phase 1: matrix 1860 rows 992 cols
[2024-05-20 15:01:41] [INFO ] Computed 31 invariants in 18 ms
[2024-05-20 15:01:42] [INFO ] Implicit Places using invariants in 538 ms returned []
[2024-05-20 15:01:42] [INFO ] Invariant cache hit.
[2024-05-20 15:01:42] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2024-05-20 15:01:48] [INFO ] Implicit Places using invariants and state equation in 6642 ms returned []
Implicit Place search using SMT with State Equation took 7182 ms to find 0 implicit places.
[2024-05-20 15:01:48] [INFO ] Redundant transitions in 31 ms returned []
Running 1830 sub problems to find dead transitions.
[2024-05-20 15:01:48] [INFO ] Invariant cache hit.
[2024-05-20 15:01:48] [INFO ] State equation strengthened by 1770 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/991 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 1830 unsolved
[2024-05-20 15:02:16] [INFO ] Deduced a trap composed of 33 places in 531 ms of which 6 ms to minimize.
[2024-05-20 15:02:17] [INFO ] Deduced a trap composed of 33 places in 476 ms of which 6 ms to minimize.
[2024-05-20 15:02:17] [INFO ] Deduced a trap composed of 33 places in 501 ms of which 6 ms to minimize.
[2024-05-20 15:02:18] [INFO ] Deduced a trap composed of 33 places in 482 ms of which 6 ms to minimize.
[2024-05-20 15:02:18] [INFO ] Deduced a trap composed of 36 places in 477 ms of which 6 ms to minimize.
[2024-05-20 15:02:19] [INFO ] Deduced a trap composed of 33 places in 429 ms of which 6 ms to minimize.
[2024-05-20 15:02:19] [INFO ] Deduced a trap composed of 37 places in 453 ms of which 6 ms to minimize.
SMT process timed out in 30999ms, After SMT, problems are : Problem set: 0 solved, 1830 unsolved
Search for dead transitions found 0 dead transitions in 31017ms
Starting structural reductions in SI_LTL mode, iteration 1 : 992/1284 places, 1860/2173 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 38407 ms. Remains : 992/1284 places, 1860/2173 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : CANConstruction-PT-030-LTLCardinality-09
Product exploration explored 100000 steps with 484 reset in 651 ms.
Stack based approach found an accepted trace after 36230 steps with 177 reset with depth 201 and stack size 201 in 256 ms.
FORMULA CANConstruction-PT-030-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property CANConstruction-PT-030-LTLCardinality-09 finished in 39391 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0)||(p0&&F(p1))) U ((p2||G(p3)) U X(p4))))'
Support contains 8 out of 1284 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1284/1284 places, 2173/2173 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 1267 transition count 2139
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 1267 transition count 2139
Applied a total of 34 rules in 94 ms. Remains 1267 /1284 variables (removed 17) and now considering 2139/2173 (removed 34) transitions.
// Phase 1: matrix 2139 rows 1267 cols
[2024-05-20 15:02:20] [INFO ] Computed 31 invariants in 15 ms
[2024-05-20 15:02:21] [INFO ] Implicit Places using invariants in 580 ms returned []
[2024-05-20 15:02:21] [INFO ] Invariant cache hit.
[2024-05-20 15:02:22] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2024-05-20 15:02:29] [INFO ] Implicit Places using invariants and state equation in 7876 ms returned []
Implicit Place search using SMT with State Equation took 8458 ms to find 0 implicit places.
Running 2109 sub problems to find dead transitions.
[2024-05-20 15:02:29] [INFO ] Invariant cache hit.
[2024-05-20 15:02:29] [INFO ] State equation strengthened by 1770 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1266 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 2109 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1266/3406 variables, and 31 constraints, problems are : Problem set: 0 solved, 2109 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, State Equation: 0/1267 constraints, ReadFeed: 0/1770 constraints, PredecessorRefiner: 2109/2109 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2109 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1266 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 2109 unsolved
[2024-05-20 15:03:11] [INFO ] Deduced a trap composed of 42 places in 343 ms of which 7 ms to minimize.
[2024-05-20 15:03:11] [INFO ] Deduced a trap composed of 42 places in 327 ms of which 6 ms to minimize.
[2024-05-20 15:03:12] [INFO ] Deduced a trap composed of 43 places in 323 ms of which 6 ms to minimize.
[2024-05-20 15:03:13] [INFO ] Deduced a trap composed of 43 places in 292 ms of which 6 ms to minimize.
[2024-05-20 15:03:13] [INFO ] Deduced a trap composed of 43 places in 291 ms of which 6 ms to minimize.
[2024-05-20 15:03:13] [INFO ] Deduced a trap composed of 43 places in 278 ms of which 6 ms to minimize.
[2024-05-20 15:03:13] [INFO ] Deduced a trap composed of 43 places in 291 ms of which 6 ms to minimize.
[2024-05-20 15:03:14] [INFO ] Deduced a trap composed of 42 places in 292 ms of which 5 ms to minimize.
[2024-05-20 15:03:14] [INFO ] Deduced a trap composed of 43 places in 289 ms of which 6 ms to minimize.
[2024-05-20 15:03:14] [INFO ] Deduced a trap composed of 42 places in 289 ms of which 6 ms to minimize.
[2024-05-20 15:03:15] [INFO ] Deduced a trap composed of 43 places in 286 ms of which 6 ms to minimize.
[2024-05-20 15:03:15] [INFO ] Deduced a trap composed of 43 places in 294 ms of which 6 ms to minimize.
[2024-05-20 15:03:15] [INFO ] Deduced a trap composed of 42 places in 317 ms of which 6 ms to minimize.
[2024-05-20 15:03:16] [INFO ] Deduced a trap composed of 42 places in 322 ms of which 7 ms to minimize.
[2024-05-20 15:03:16] [INFO ] Deduced a trap composed of 42 places in 338 ms of which 6 ms to minimize.
[2024-05-20 15:03:17] [INFO ] Deduced a trap composed of 42 places in 332 ms of which 6 ms to minimize.
[2024-05-20 15:03:17] [INFO ] Deduced a trap composed of 42 places in 318 ms of which 7 ms to minimize.
[2024-05-20 15:03:17] [INFO ] Deduced a trap composed of 42 places in 341 ms of which 7 ms to minimize.
[2024-05-20 15:03:18] [INFO ] Deduced a trap composed of 42 places in 291 ms of which 6 ms to minimize.
[2024-05-20 15:03:18] [INFO ] Deduced a trap composed of 42 places in 272 ms of which 5 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1266 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 2109 unsolved
[2024-05-20 15:03:26] [INFO ] Deduced a trap composed of 42 places in 299 ms of which 6 ms to minimize.
[2024-05-20 15:03:26] [INFO ] Deduced a trap composed of 42 places in 312 ms of which 6 ms to minimize.
[2024-05-20 15:03:27] [INFO ] Deduced a trap composed of 42 places in 299 ms of which 7 ms to minimize.
[2024-05-20 15:03:27] [INFO ] Deduced a trap composed of 42 places in 311 ms of which 7 ms to minimize.
[2024-05-20 15:03:27] [INFO ] Deduced a trap composed of 42 places in 311 ms of which 6 ms to minimize.
[2024-05-20 15:03:28] [INFO ] Deduced a trap composed of 42 places in 303 ms of which 6 ms to minimize.
[2024-05-20 15:03:29] [INFO ] Deduced a trap composed of 5 places in 657 ms of which 8 ms to minimize.
[2024-05-20 15:03:29] [INFO ] Deduced a trap composed of 5 places in 660 ms of which 8 ms to minimize.
[2024-05-20 15:03:30] [INFO ] Deduced a trap composed of 5 places in 681 ms of which 8 ms to minimize.
SMT process timed out in 61170ms, After SMT, problems are : Problem set: 0 solved, 2109 unsolved
Search for dead transitions found 0 dead transitions in 61187ms
Starting structural reductions in LTL mode, iteration 1 : 1267/1284 places, 2139/2173 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 69744 ms. Remains : 1267/1284 places, 2139/2173 transitions.
Stuttering acceptance computed with spot in 570 ms :[(NOT p4), (NOT p4), (AND (NOT p1) (NOT p0) (NOT p4)), (NOT p4), (AND (NOT p3) (NOT p4)), (NOT p4), (AND (NOT p1) (NOT p3) (NOT p0) (NOT p4)), true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p3), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p0) (NOT p3))]
Running random walk in product with property : CANConstruction-PT-030-LTLCardinality-10
Product exploration explored 100000 steps with 50000 reset in 579 ms.
Product exploration explored 100000 steps with 50000 reset in 582 ms.
Computed a total of 92 stabilizing places and 121 stable transitions
Computed a total of 92 stabilizing places and 121 stable transitions
Knowledge obtained : [(AND p2 (NOT p3) p0 (NOT p1) p4), (X p2), (X (NOT p3)), (X (NOT (AND (NOT p2) p3 (NOT p4)))), (X (NOT (AND (NOT p2) p3 p0 (NOT p1) (NOT p4)))), (X (NOT (AND p3 (NOT p0) (NOT p1) (NOT p4)))), (X (NOT (AND (NOT p2) (NOT p3) (NOT p4)))), (X (NOT (AND p0 (NOT p1) (NOT p4)))), (X (NOT (AND p3 p0 (NOT p1) (NOT p4)))), (X (NOT (OR (AND p2 (NOT p0) (NOT p4)) (AND p3 (NOT p0) (NOT p4))))), (X (NOT (AND (NOT p3) (NOT p4)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p4)))), (X (NOT (AND (NOT p2) p3 (NOT p0) (NOT p4)))), (X (NOT (AND (NOT p3) (NOT p0) (NOT p1) (NOT p4)))), (X (NOT (AND (NOT p2) (NOT p3) (NOT p0) (NOT p4)))), (X (NOT (AND p0 (NOT p4)))), (X p4), (X (NOT (AND (NOT p3) p0 (NOT p1) (NOT p4)))), (X (NOT (AND p3 (NOT p4)))), (X (NOT (OR (AND p2 (NOT p4)) (AND p3 (NOT p4))))), (X p0), (X (NOT p1)), (X (NOT (AND (NOT p2) (NOT p3) p0 (NOT p1) (NOT p4)))), (X (X p2)), (X (X (NOT p3))), (X (X (NOT (AND (NOT p2) p3 (NOT p4))))), (X (X (AND (NOT p3) p0 (NOT p1)))), (X (X (NOT (AND p3 (NOT p0) (NOT p1) (NOT p4))))), (X (X (AND (NOT p3) (NOT p1)))), (X (X (NOT (AND p3 (NOT p0) (NOT p1))))), (X (X (NOT (AND p3 p0 (NOT p1) (NOT p4))))), (X (X (NOT (AND (NOT p3) (NOT p4))))), (X (X (NOT (AND (NOT p2) p3 (NOT p0) (NOT p4))))), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p1) (NOT p4))))), (X (X (NOT (AND p0 (NOT p4))))), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p4)), (X (X (NOT (AND (NOT p3) p0 (NOT p1) (NOT p4))))), (X (X (NOT (OR (AND p2 (NOT p4)) (AND p3 (NOT p4)))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p2) p3 p0 (NOT p1) (NOT p4))))), (X (X (NOT (AND p3 p0 (NOT p1))))), (X (X (NOT (AND p3 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p4))))), (X (X (NOT (AND p0 (NOT p1) (NOT p4))))), (X (X (NOT (OR (AND p2 (NOT p0) (NOT p4)) (AND p3 (NOT p0) (NOT p4)))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p4))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p0) (NOT p4))))), (X (X (NOT (AND p3 (NOT p4))))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p3) p0 (NOT p1) (NOT p4)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 53 factoid took 27 ms. Reduced automaton from 13 states, 36 edges and 5 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANConstruction-PT-030-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANConstruction-PT-030-LTLCardinality-10 finished in 71569 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(p1)))'
Support contains 4 out of 1284 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1284/1284 places, 2173/2173 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 1263 transition count 2132
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 1263 transition count 2132
Applied a total of 42 rules in 114 ms. Remains 1263 /1284 variables (removed 21) and now considering 2132/2173 (removed 41) transitions.
// Phase 1: matrix 2132 rows 1263 cols
[2024-05-20 15:03:32] [INFO ] Computed 31 invariants in 11 ms
[2024-05-20 15:03:33] [INFO ] Implicit Places using invariants in 591 ms returned []
[2024-05-20 15:03:33] [INFO ] Invariant cache hit.
[2024-05-20 15:03:33] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2024-05-20 15:03:41] [INFO ] Implicit Places using invariants and state equation in 8434 ms returned []
Implicit Place search using SMT with State Equation took 9032 ms to find 0 implicit places.
Running 2102 sub problems to find dead transitions.
[2024-05-20 15:03:41] [INFO ] Invariant cache hit.
[2024-05-20 15:03:41] [INFO ] State equation strengthened by 1770 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1262 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 2102 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1262/3395 variables, and 31 constraints, problems are : Problem set: 0 solved, 2102 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, State Equation: 0/1263 constraints, ReadFeed: 0/1770 constraints, PredecessorRefiner: 2102/2102 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2102 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1262 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 2102 unsolved
[2024-05-20 15:04:24] [INFO ] Deduced a trap composed of 42 places in 320 ms of which 8 ms to minimize.
[2024-05-20 15:04:24] [INFO ] Deduced a trap composed of 42 places in 292 ms of which 7 ms to minimize.
[2024-05-20 15:04:24] [INFO ] Deduced a trap composed of 42 places in 270 ms of which 6 ms to minimize.
[2024-05-20 15:04:24] [INFO ] Deduced a trap composed of 42 places in 266 ms of which 5 ms to minimize.
[2024-05-20 15:04:25] [INFO ] Deduced a trap composed of 42 places in 249 ms of which 5 ms to minimize.
[2024-05-20 15:04:25] [INFO ] Deduced a trap composed of 42 places in 240 ms of which 5 ms to minimize.
[2024-05-20 15:04:25] [INFO ] Deduced a trap composed of 42 places in 237 ms of which 6 ms to minimize.
[2024-05-20 15:04:25] [INFO ] Deduced a trap composed of 42 places in 231 ms of which 5 ms to minimize.
[2024-05-20 15:04:26] [INFO ] Deduced a trap composed of 42 places in 214 ms of which 5 ms to minimize.
[2024-05-20 15:04:26] [INFO ] Deduced a trap composed of 42 places in 230 ms of which 5 ms to minimize.
[2024-05-20 15:04:26] [INFO ] Deduced a trap composed of 42 places in 216 ms of which 5 ms to minimize.
[2024-05-20 15:04:26] [INFO ] Deduced a trap composed of 42 places in 215 ms of which 4 ms to minimize.
[2024-05-20 15:04:27] [INFO ] Deduced a trap composed of 42 places in 210 ms of which 4 ms to minimize.
[2024-05-20 15:04:27] [INFO ] Deduced a trap composed of 42 places in 225 ms of which 5 ms to minimize.
[2024-05-20 15:04:27] [INFO ] Deduced a trap composed of 42 places in 214 ms of which 4 ms to minimize.
[2024-05-20 15:04:27] [INFO ] Deduced a trap composed of 42 places in 214 ms of which 5 ms to minimize.
[2024-05-20 15:04:28] [INFO ] Deduced a trap composed of 42 places in 202 ms of which 5 ms to minimize.
[2024-05-20 15:04:28] [INFO ] Deduced a trap composed of 42 places in 187 ms of which 4 ms to minimize.
[2024-05-20 15:04:28] [INFO ] Deduced a trap composed of 42 places in 219 ms of which 5 ms to minimize.
[2024-05-20 15:04:28] [INFO ] Deduced a trap composed of 42 places in 220 ms of which 5 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1262 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 2102 unsolved
[2024-05-20 15:04:37] [INFO ] Deduced a trap composed of 42 places in 288 ms of which 6 ms to minimize.
[2024-05-20 15:04:37] [INFO ] Deduced a trap composed of 42 places in 235 ms of which 5 ms to minimize.
[2024-05-20 15:04:37] [INFO ] Deduced a trap composed of 42 places in 219 ms of which 4 ms to minimize.
[2024-05-20 15:04:37] [INFO ] Deduced a trap composed of 42 places in 229 ms of which 5 ms to minimize.
[2024-05-20 15:04:38] [INFO ] Deduced a trap composed of 42 places in 212 ms of which 4 ms to minimize.
[2024-05-20 15:04:38] [INFO ] Deduced a trap composed of 42 places in 197 ms of which 4 ms to minimize.
[2024-05-20 15:04:41] [INFO ] Deduced a trap composed of 42 places in 202 ms of which 4 ms to minimize.
[2024-05-20 15:04:41] [INFO ] Deduced a trap composed of 42 places in 196 ms of which 4 ms to minimize.
[2024-05-20 15:04:41] [INFO ] Deduced a trap composed of 42 places in 246 ms of which 5 ms to minimize.
[2024-05-20 15:04:42] [INFO ] Deduced a trap composed of 42 places in 253 ms of which 5 ms to minimize.
[2024-05-20 15:04:42] [INFO ] Deduced a trap composed of 42 places in 223 ms of which 4 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1262/3395 variables, and 62 constraints, problems are : Problem set: 0 solved, 2102 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, State Equation: 0/1263 constraints, ReadFeed: 0/1770 constraints, PredecessorRefiner: 0/2102 constraints, Known Traps: 31/31 constraints]
After SMT, in 60933ms problems are : Problem set: 0 solved, 2102 unsolved
Search for dead transitions found 0 dead transitions in 60954ms
Starting structural reductions in LTL mode, iteration 1 : 1263/1284 places, 2132/2173 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70114 ms. Remains : 1263/1284 places, 2132/2173 transitions.
Stuttering acceptance computed with spot in 157 ms :[(NOT p1), true, (NOT p1), (NOT p1)]
Running random walk in product with property : CANConstruction-PT-030-LTLCardinality-12
Product exploration explored 100000 steps with 50000 reset in 556 ms.
Product exploration explored 100000 steps with 50000 reset in 564 ms.
Computed a total of 91 stabilizing places and 120 stable transitions
Computed a total of 91 stabilizing places and 120 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 18 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANConstruction-PT-030-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANConstruction-PT-030-LTLCardinality-12 finished in 71436 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U p1))))'
Support contains 4 out of 1284 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1284/1284 places, 2173/2173 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 194 transitions
Trivial Post-agglo rules discarded 194 transitions
Performed 194 trivial Post agglomeration. Transition count delta: 194
Iterating post reduction 0 with 194 rules applied. Total rules applied 194 place count 1284 transition count 1979
Reduce places removed 194 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 195 rules applied. Total rules applied 389 place count 1090 transition count 1978
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 390 place count 1089 transition count 1978
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 30 Pre rules applied. Total rules applied 390 place count 1089 transition count 1948
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 450 place count 1059 transition count 1948
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 469 place count 1040 transition count 1910
Iterating global reduction 3 with 19 rules applied. Total rules applied 488 place count 1040 transition count 1910
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 3 with 13 rules applied. Total rules applied 501 place count 1040 transition count 1897
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 4 with 13 rules applied. Total rules applied 514 place count 1027 transition count 1897
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 5 with 62 rules applied. Total rules applied 576 place count 996 transition count 1866
Applied a total of 576 rules in 169 ms. Remains 996 /1284 variables (removed 288) and now considering 1866/2173 (removed 307) transitions.
// Phase 1: matrix 1866 rows 996 cols
[2024-05-20 15:04:44] [INFO ] Computed 31 invariants in 11 ms
[2024-05-20 15:04:44] [INFO ] Implicit Places using invariants in 523 ms returned []
[2024-05-20 15:04:44] [INFO ] Invariant cache hit.
[2024-05-20 15:04:45] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2024-05-20 15:04:50] [INFO ] Implicit Places using invariants and state equation in 6203 ms returned []
Implicit Place search using SMT with State Equation took 6730 ms to find 0 implicit places.
[2024-05-20 15:04:50] [INFO ] Redundant transitions in 29 ms returned []
Running 1836 sub problems to find dead transitions.
[2024-05-20 15:04:50] [INFO ] Invariant cache hit.
[2024-05-20 15:04:50] [INFO ] State equation strengthened by 1770 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/995 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 1836 unsolved
[2024-05-20 15:05:18] [INFO ] Deduced a trap composed of 34 places in 262 ms of which 6 ms to minimize.
[2024-05-20 15:05:19] [INFO ] Deduced a trap composed of 33 places in 244 ms of which 6 ms to minimize.
[2024-05-20 15:05:19] [INFO ] Deduced a trap composed of 33 places in 503 ms of which 7 ms to minimize.
[2024-05-20 15:05:20] [INFO ] Deduced a trap composed of 33 places in 492 ms of which 8 ms to minimize.
[2024-05-20 15:05:20] [INFO ] Deduced a trap composed of 33 places in 492 ms of which 6 ms to minimize.
[2024-05-20 15:05:21] [INFO ] Deduced a trap composed of 33 places in 474 ms of which 7 ms to minimize.
[2024-05-20 15:05:21] [INFO ] Deduced a trap composed of 37 places in 438 ms of which 6 ms to minimize.
SMT process timed out in 31032ms, After SMT, problems are : Problem set: 0 solved, 1836 unsolved
Search for dead transitions found 0 dead transitions in 31049ms
Starting structural reductions in SI_LTL mode, iteration 1 : 996/1284 places, 1866/2173 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 37992 ms. Remains : 996/1284 places, 1866/2173 transitions.
Stuttering acceptance computed with spot in 104 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : CANConstruction-PT-030-LTLCardinality-13
Product exploration explored 100000 steps with 481 reset in 599 ms.
Product exploration explored 100000 steps with 479 reset in 582 ms.
Computed a total of 31 stabilizing places and 60 stable transitions
Computed a total of 31 stabilizing places and 60 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (OR p1 p0)), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (OR p1 p0))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 106 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p1), (NOT p1)]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 40000 steps (189 resets) in 789 ms. (50 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 133 ms. (298 steps per ms) remains 1/1 properties
[2024-05-20 15:05:23] [INFO ] Invariant cache hit.
[2024-05-20 15:05:23] [INFO ] State equation strengthened by 1770 read => feed constraints.
Problem apf1 is UNSAT
After SMT solving in domain Real declared 4/2862 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 59 ms.
Refiners :[Positive P Invariants (semi-flows): 0/31 constraints, State Equation: 0/996 constraints, ReadFeed: 0/1770 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 118ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (OR p1 p0)), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (OR p1 p0))), (X (X p0)), (X (X p1)), (G (OR (NOT p0) p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT (OR p0 p1))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 12 factoid took 264 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p1)]
Support contains 4 out of 996 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 996/996 places, 1866/1866 transitions.
Applied a total of 0 rules in 49 ms. Remains 996 /996 variables (removed 0) and now considering 1866/1866 (removed 0) transitions.
[2024-05-20 15:05:24] [INFO ] Invariant cache hit.
[2024-05-20 15:05:24] [INFO ] Implicit Places using invariants in 735 ms returned []
[2024-05-20 15:05:24] [INFO ] Invariant cache hit.
[2024-05-20 15:05:25] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2024-05-20 15:05:31] [INFO ] Implicit Places using invariants and state equation in 6845 ms returned []
Implicit Place search using SMT with State Equation took 7582 ms to find 0 implicit places.
[2024-05-20 15:05:31] [INFO ] Redundant transitions in 28 ms returned []
Running 1836 sub problems to find dead transitions.
[2024-05-20 15:05:31] [INFO ] Invariant cache hit.
[2024-05-20 15:05:31] [INFO ] State equation strengthened by 1770 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/995 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 1836 unsolved
[2024-05-20 15:06:01] [INFO ] Deduced a trap composed of 34 places in 266 ms of which 5 ms to minimize.
[2024-05-20 15:06:02] [INFO ] Deduced a trap composed of 33 places in 252 ms of which 6 ms to minimize.
[2024-05-20 15:06:03] [INFO ] Deduced a trap composed of 33 places in 499 ms of which 6 ms to minimize.
SMT process timed out in 31214ms, After SMT, problems are : Problem set: 0 solved, 1836 unsolved
Search for dead transitions found 0 dead transitions in 31243ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 38925 ms. Remains : 996/996 places, 1866/1866 transitions.
Computed a total of 31 stabilizing places and 60 stable transitions
Computed a total of 31 stabilizing places and 60 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 111 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p1)]
RANDOM walk for 27922 steps (132 resets) in 276 ms. (100 steps per ms) remains 0/1 properties
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p1)]
Product exploration explored 100000 steps with 478 reset in 561 ms.
Product exploration explored 100000 steps with 478 reset in 572 ms.
Built C files in :
/tmp/ltsmin17914339449122065998
[2024-05-20 15:06:04] [INFO ] Too many transitions (1866) to apply POR reductions. Disabling POR matrices.
[2024-05-20 15:06:04] [INFO ] Built C files in 47ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17914339449122065998
Running compilation step : cd /tmp/ltsmin17914339449122065998;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin17914339449122065998;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin17914339449122065998;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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:840)
Support contains 4 out of 996 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 996/996 places, 1866/1866 transitions.
Applied a total of 0 rules in 76 ms. Remains 996 /996 variables (removed 0) and now considering 1866/1866 (removed 0) transitions.
[2024-05-20 15:06:07] [INFO ] Invariant cache hit.
[2024-05-20 15:06:08] [INFO ] Implicit Places using invariants in 527 ms returned []
[2024-05-20 15:06:08] [INFO ] Invariant cache hit.
[2024-05-20 15:06:08] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2024-05-20 15:06:15] [INFO ] Implicit Places using invariants and state equation in 6756 ms returned []
Implicit Place search using SMT with State Equation took 7285 ms to find 0 implicit places.
[2024-05-20 15:06:15] [INFO ] Redundant transitions in 27 ms returned []
Running 1836 sub problems to find dead transitions.
[2024-05-20 15:06:15] [INFO ] Invariant cache hit.
[2024-05-20 15:06:15] [INFO ] State equation strengthened by 1770 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/995 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 1836 unsolved
[2024-05-20 15:06:43] [INFO ] Deduced a trap composed of 34 places in 258 ms of which 5 ms to minimize.
[2024-05-20 15:06:44] [INFO ] Deduced a trap composed of 33 places in 267 ms of which 5 ms to minimize.
[2024-05-20 15:06:44] [INFO ] Deduced a trap composed of 33 places in 498 ms of which 6 ms to minimize.
[2024-05-20 15:06:45] [INFO ] Deduced a trap composed of 33 places in 464 ms of which 6 ms to minimize.
[2024-05-20 15:06:45] [INFO ] Deduced a trap composed of 33 places in 449 ms of which 5 ms to minimize.
[2024-05-20 15:06:46] [INFO ] Deduced a trap composed of 33 places in 415 ms of which 5 ms to minimize.
SMT process timed out in 30922ms, After SMT, problems are : Problem set: 0 solved, 1836 unsolved
Search for dead transitions found 0 dead transitions in 30939ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 38346 ms. Remains : 996/996 places, 1866/1866 transitions.
Built C files in :
/tmp/ltsmin4110709704765054445
[2024-05-20 15:06:46] [INFO ] Too many transitions (1866) to apply POR reductions. Disabling POR matrices.
[2024-05-20 15:06:46] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4110709704765054445
Running compilation step : cd /tmp/ltsmin4110709704765054445;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin4110709704765054445;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin4110709704765054445;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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:840)
[2024-05-20 15:06:49] [INFO ] Flatten gal took : 148 ms
[2024-05-20 15:06:49] [INFO ] Flatten gal took : 113 ms
[2024-05-20 15:06:49] [INFO ] Time to serialize gal into /tmp/LTL17927814864216959898.gal : 44 ms
[2024-05-20 15:06:49] [INFO ] Time to serialize properties into /tmp/LTL5259750870280205891.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17927814864216959898.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10339070394764312210.hoa' '-atoms' '/tmp/LTL5259750870280205891.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL5259750870280205891.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10339070394764312210.hoa
Detected timeout of ITS tools.
[2024-05-20 15:07:04] [INFO ] Flatten gal took : 127 ms
[2024-05-20 15:07:04] [INFO ] Flatten gal took : 52 ms
[2024-05-20 15:07:04] [INFO ] Time to serialize gal into /tmp/LTL11279122932861389635.gal : 29 ms
[2024-05-20 15:07:04] [INFO ] Time to serialize properties into /tmp/LTL2777894232473400706.ltl : 2 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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11279122932861389635.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2777894232473400706.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G(("(Node20GiveAnswer7<=Node29GiveAnswer1)")U("((Node5Bootstrap<=Node5requestsent23)||(Node20GiveAnswer7<=Node29GiveAnswer1))")))...157
Formula 0 simplified : GF(!"(Node20GiveAnswer7<=Node29GiveAnswer1)" R !"((Node5Bootstrap<=Node5requestsent23)||(Node20GiveAnswer7<=Node29GiveAnswer1))")
Detected timeout of ITS tools.
[2024-05-20 15:07:20] [INFO ] Flatten gal took : 46 ms
[2024-05-20 15:07:20] [INFO ] Applying decomposition
[2024-05-20 15:07:20] [INFO ] Flatten gal took : 76 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph984016976744971886.txt' '-o' '/tmp/graph984016976744971886.bin' '-w' '/tmp/graph984016976744971886.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph984016976744971886.bin' '-l' '-1' '-v' '-w' '/tmp/graph984016976744971886.weights' '-q' '0' '-e' '0.001'
[2024-05-20 15:07:20] [INFO ] Decomposing Gal with order
[2024-05-20 15:07:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 15:07:21] [INFO ] Removed a total of 1773 redundant transitions.
[2024-05-20 15:07:21] [INFO ] Flatten gal took : 780 ms
[2024-05-20 15:07:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 1674 labels/synchronizations in 189 ms.
[2024-05-20 15:07:22] [INFO ] Time to serialize gal into /tmp/LTL7195636581069541208.gal : 26 ms
[2024-05-20 15:07:22] [INFO ] Time to serialize properties into /tmp/LTL15258243638652694558.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7195636581069541208.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15258243638652694558.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G(("(gu32.Node20GiveAnswer7<=gu32.Node29GiveAnswer1)")U("((gu31.Node5Bootstrap<=gu31.Node5requestsent23)||(gu32.Node20GiveAnswer7...187
Formula 0 simplified : GF(!"(gu32.Node20GiveAnswer7<=gu32.Node29GiveAnswer1)" R !"((gu31.Node5Bootstrap<=gu31.Node5requestsent23)||(gu32.Node20GiveAnswer7<...182
Detected timeout of ITS tools.
Treatment of property CANConstruction-PT-030-LTLCardinality-13 finished in 173220 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 1284 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1284/1284 places, 2173/2173 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 197 transitions
Trivial Post-agglo rules discarded 197 transitions
Performed 197 trivial Post agglomeration. Transition count delta: 197
Iterating post reduction 0 with 197 rules applied. Total rules applied 197 place count 1284 transition count 1976
Reduce places removed 197 places and 0 transitions.
Iterating post reduction 1 with 197 rules applied. Total rules applied 394 place count 1087 transition count 1976
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 394 place count 1087 transition count 1946
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 454 place count 1057 transition count 1946
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 474 place count 1037 transition count 1906
Iterating global reduction 2 with 20 rules applied. Total rules applied 494 place count 1037 transition count 1906
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 2 with 14 rules applied. Total rules applied 508 place count 1037 transition count 1892
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 522 place count 1023 transition count 1892
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 4 with 60 rules applied. Total rules applied 582 place count 993 transition count 1862
Applied a total of 582 rules in 176 ms. Remains 993 /1284 variables (removed 291) and now considering 1862/2173 (removed 311) transitions.
// Phase 1: matrix 1862 rows 993 cols
[2024-05-20 15:07:37] [INFO ] Computed 31 invariants in 13 ms
[2024-05-20 15:07:37] [INFO ] Implicit Places using invariants in 657 ms returned []
[2024-05-20 15:07:37] [INFO ] Invariant cache hit.
[2024-05-20 15:07:38] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2024-05-20 15:07:44] [INFO ] Implicit Places using invariants and state equation in 6475 ms returned []
Implicit Place search using SMT with State Equation took 7156 ms to find 0 implicit places.
[2024-05-20 15:07:44] [INFO ] Redundant transitions in 30 ms returned []
Running 1832 sub problems to find dead transitions.
[2024-05-20 15:07:44] [INFO ] Invariant cache hit.
[2024-05-20 15:07:44] [INFO ] State equation strengthened by 1770 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/992 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 1832 unsolved
[2024-05-20 15:08:09] [INFO ] Deduced a trap composed of 33 places in 278 ms of which 5 ms to minimize.
[2024-05-20 15:08:11] [INFO ] Deduced a trap composed of 33 places in 271 ms of which 9 ms to minimize.
[2024-05-20 15:08:11] [INFO ] Deduced a trap composed of 33 places in 271 ms of which 5 ms to minimize.
[2024-05-20 15:08:12] [INFO ] Deduced a trap composed of 33 places in 276 ms of which 5 ms to minimize.
[2024-05-20 15:08:12] [INFO ] Deduced a trap composed of 34 places in 253 ms of which 5 ms to minimize.
[2024-05-20 15:08:12] [INFO ] Deduced a trap composed of 33 places in 261 ms of which 5 ms to minimize.
[2024-05-20 15:08:12] [INFO ] Deduced a trap composed of 34 places in 252 ms of which 5 ms to minimize.
[2024-05-20 15:08:13] [INFO ] Deduced a trap composed of 34 places in 238 ms of which 4 ms to minimize.
[2024-05-20 15:08:13] [INFO ] Deduced a trap composed of 33 places in 248 ms of which 5 ms to minimize.
[2024-05-20 15:08:13] [INFO ] Deduced a trap composed of 33 places in 454 ms of which 6 ms to minimize.
[2024-05-20 15:08:14] [INFO ] Deduced a trap composed of 33 places in 420 ms of which 5 ms to minimize.
[2024-05-20 15:08:14] [INFO ] Deduced a trap composed of 33 places in 417 ms of which 6 ms to minimize.
[2024-05-20 15:08:15] [INFO ] Deduced a trap composed of 36 places in 418 ms of which 5 ms to minimize.
SMT process timed out in 30849ms, After SMT, problems are : Problem set: 0 solved, 1832 unsolved
Search for dead transitions found 0 dead transitions in 30865ms
Starting structural reductions in SI_LTL mode, iteration 1 : 993/1284 places, 1862/2173 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 38234 ms. Remains : 993/1284 places, 1862/2173 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : CANConstruction-PT-030-LTLCardinality-14
Product exploration explored 100000 steps with 489 reset in 523 ms.
Stack based approach found an accepted trace after 65427 steps with 316 reset with depth 153 and stack size 153 in 347 ms.
FORMULA CANConstruction-PT-030-LTLCardinality-14 FALSE TECHNIQUES STACK_TEST
Treatment of property CANConstruction-PT-030-LTLCardinality-14 finished in 39161 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 1284 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1284/1284 places, 2173/2173 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 1262 transition count 2130
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 1262 transition count 2130
Applied a total of 44 rules in 87 ms. Remains 1262 /1284 variables (removed 22) and now considering 2130/2173 (removed 43) transitions.
// Phase 1: matrix 2130 rows 1262 cols
[2024-05-20 15:08:16] [INFO ] Computed 31 invariants in 13 ms
[2024-05-20 15:08:16] [INFO ] Implicit Places using invariants in 574 ms returned []
[2024-05-20 15:08:16] [INFO ] Invariant cache hit.
[2024-05-20 15:08:17] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2024-05-20 15:08:24] [INFO ] Implicit Places using invariants and state equation in 7989 ms returned []
Implicit Place search using SMT with State Equation took 8602 ms to find 0 implicit places.
Running 2100 sub problems to find dead transitions.
[2024-05-20 15:08:24] [INFO ] Invariant cache hit.
[2024-05-20 15:08:24] [INFO ] State equation strengthened by 1770 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1261 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 2100 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1261/3392 variables, and 31 constraints, problems are : Problem set: 0 solved, 2100 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, State Equation: 0/1262 constraints, ReadFeed: 0/1770 constraints, PredecessorRefiner: 2100/2100 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1261 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 2100 unsolved
[2024-05-20 15:09:07] [INFO ] Deduced a trap composed of 42 places in 308 ms of which 6 ms to minimize.
[2024-05-20 15:09:07] [INFO ] Deduced a trap composed of 42 places in 326 ms of which 6 ms to minimize.
[2024-05-20 15:09:08] [INFO ] Deduced a trap composed of 42 places in 314 ms of which 5 ms to minimize.
[2024-05-20 15:09:08] [INFO ] Deduced a trap composed of 42 places in 291 ms of which 6 ms to minimize.
[2024-05-20 15:09:08] [INFO ] Deduced a trap composed of 42 places in 276 ms of which 6 ms to minimize.
[2024-05-20 15:09:09] [INFO ] Deduced a trap composed of 42 places in 270 ms of which 5 ms to minimize.
[2024-05-20 15:09:09] [INFO ] Deduced a trap composed of 42 places in 261 ms of which 5 ms to minimize.
[2024-05-20 15:09:09] [INFO ] Deduced a trap composed of 42 places in 280 ms of which 5 ms to minimize.
[2024-05-20 15:09:09] [INFO ] Deduced a trap composed of 52 places in 270 ms of which 5 ms to minimize.
[2024-05-20 15:09:10] [INFO ] Deduced a trap composed of 45 places in 277 ms of which 5 ms to minimize.
[2024-05-20 15:09:10] [INFO ] Deduced a trap composed of 42 places in 267 ms of which 5 ms to minimize.
[2024-05-20 15:09:10] [INFO ] Deduced a trap composed of 45 places in 246 ms of which 5 ms to minimize.
[2024-05-20 15:09:11] [INFO ] Deduced a trap composed of 42 places in 263 ms of which 5 ms to minimize.
[2024-05-20 15:09:11] [INFO ] Deduced a trap composed of 49 places in 236 ms of which 4 ms to minimize.
[2024-05-20 15:09:11] [INFO ] Deduced a trap composed of 42 places in 283 ms of which 5 ms to minimize.
[2024-05-20 15:09:11] [INFO ] Deduced a trap composed of 45 places in 274 ms of which 5 ms to minimize.
[2024-05-20 15:09:12] [INFO ] Deduced a trap composed of 45 places in 253 ms of which 5 ms to minimize.
[2024-05-20 15:09:12] [INFO ] Deduced a trap composed of 45 places in 243 ms of which 5 ms to minimize.
[2024-05-20 15:09:12] [INFO ] Deduced a trap composed of 45 places in 275 ms of which 5 ms to minimize.
[2024-05-20 15:09:13] [INFO ] Deduced a trap composed of 42 places in 239 ms of which 5 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1261 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 2100 unsolved
[2024-05-20 15:09:14] [INFO ] Deduced a trap composed of 42 places in 312 ms of which 6 ms to minimize.
[2024-05-20 15:09:14] [INFO ] Deduced a trap composed of 42 places in 305 ms of which 5 ms to minimize.
[2024-05-20 15:09:14] [INFO ] Deduced a trap composed of 42 places in 316 ms of which 5 ms to minimize.
[2024-05-20 15:09:15] [INFO ] Deduced a trap composed of 42 places in 281 ms of which 12 ms to minimize.
[2024-05-20 15:09:15] [INFO ] Deduced a trap composed of 42 places in 306 ms of which 6 ms to minimize.
[2024-05-20 15:09:23] [INFO ] Deduced a trap composed of 45 places in 321 ms of which 6 ms to minimize.
[2024-05-20 15:09:23] [INFO ] Deduced a trap composed of 42 places in 305 ms of which 6 ms to minimize.
[2024-05-20 15:09:23] [INFO ] Deduced a trap composed of 42 places in 306 ms of which 6 ms to minimize.
[2024-05-20 15:09:24] [INFO ] Deduced a trap composed of 42 places in 302 ms of which 6 ms to minimize.
[2024-05-20 15:09:24] [INFO ] Deduced a trap composed of 42 places in 302 ms of which 6 ms to minimize.
[2024-05-20 15:09:24] [INFO ] Deduced a trap composed of 42 places in 321 ms of which 7 ms to minimize.
[2024-05-20 15:09:25] [INFO ] Deduced a trap composed of 42 places in 306 ms of which 6 ms to minimize.
[2024-05-20 15:09:25] [INFO ] Deduced a trap composed of 42 places in 283 ms of which 5 ms to minimize.
[2024-05-20 15:09:25] [INFO ] Deduced a trap composed of 42 places in 275 ms of which 5 ms to minimize.
[2024-05-20 15:09:26] [INFO ] Deduced a trap composed of 42 places in 317 ms of which 6 ms to minimize.
SMT process timed out in 61116ms, After SMT, problems are : Problem set: 0 solved, 2100 unsolved
Search for dead transitions found 0 dead transitions in 61154ms
Starting structural reductions in LTL mode, iteration 1 : 1262/1284 places, 2130/2173 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 69849 ms. Remains : 1262/1284 places, 2130/2173 transitions.
Stuttering acceptance computed with spot in 97 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-030-LTLCardinality-15
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CANConstruction-PT-030-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-030-LTLCardinality-15 finished in 69966 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U p1))))'
[2024-05-20 15:09:26] [INFO ] Flatten gal took : 174 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin11236778033860701188
[2024-05-20 15:09:26] [INFO ] Too many transitions (2173) to apply POR reductions. Disabling POR matrices.
[2024-05-20 15:09:26] [INFO ] Applying decomposition
[2024-05-20 15:09:26] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11236778033860701188
Running compilation step : cd /tmp/ltsmin11236778033860701188;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-20 15:09:26] [INFO ] Flatten gal took : 143 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12827688611131338860.txt' '-o' '/tmp/graph12827688611131338860.bin' '-w' '/tmp/graph12827688611131338860.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12827688611131338860.bin' '-l' '-1' '-v' '-w' '/tmp/graph12827688611131338860.weights' '-q' '0' '-e' '0.001'
[2024-05-20 15:09:27] [INFO ] Decomposing Gal with order
[2024-05-20 15:09:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 15:09:27] [INFO ] Removed a total of 1805 redundant transitions.
[2024-05-20 15:09:27] [INFO ] Flatten gal took : 319 ms
[2024-05-20 15:09:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 1677 labels/synchronizations in 204 ms.
[2024-05-20 15:09:28] [INFO ] Time to serialize gal into /tmp/LTLCardinality838772504988716936.gal : 70 ms
[2024-05-20 15:09:28] [INFO ] Time to serialize properties into /tmp/LTLCardinality6713305325975050080.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality838772504988716936.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality6713305325975050080.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...296
Read 1 LTL properties
Checking formula 0 : !((F(G(("(gu144.Node20GiveAnswer7<=gu144.Node29GiveAnswer1)")U("((gu141.Node5Bootstrap<=gu141.Node5requestsent23)||(gu144.Node20GiveAn...193
Formula 0 simplified : GF(!"(gu144.Node20GiveAnswer7<=gu144.Node29GiveAnswer1)" R !"((gu141.Node5Bootstrap<=gu141.Node5requestsent23)||(gu144.Node20GiveAns...188
Compilation finished in 6070 ms.
Running link step : cd /tmp/ltsmin11236778033860701188;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 113 ms.
Running LTSmin : cd /tmp/ltsmin11236778033860701188;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([](((LTLAPp0==true) U (LTLAPp1==true))))' '--buchi-type=spotba'
ITS-tools command line returned an error code 137
[2024-05-20 15:32:52] [INFO ] Flatten gal took : 145 ms
[2024-05-20 15:32:52] [INFO ] Time to serialize gal into /tmp/LTLCardinality13485400605711989520.gal : 19 ms
[2024-05-20 15:32:52] [INFO ] Time to serialize properties into /tmp/LTLCardinality8477017023683251058.ltl : 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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality13485400605711989520.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality8477017023683251058.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 1 LTL properties
Checking formula 0 : !((F(G(("(Node20GiveAnswer7<=Node29GiveAnswer1)")U("((Node5Bootstrap<=Node5requestsent23)||(Node20GiveAnswer7<=Node29GiveAnswer1))")))...157
Formula 0 simplified : GF(!"(Node20GiveAnswer7<=Node29GiveAnswer1)" R !"((Node5Bootstrap<=Node5requestsent23)||(Node20GiveAnswer7<=Node29GiveAnswer1))")
ITS-tools command line returned an error code 137
[2024-05-20 15:56:16] [INFO ] Flatten gal took : 120 ms
[2024-05-20 15:56:17] [INFO ] Input system was already deterministic with 2173 transitions.
[2024-05-20 15:56:17] [INFO ] Transformed 1284 places.
[2024-05-20 15:56:17] [INFO ] Transformed 2173 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-20 15:56:17] [INFO ] Time to serialize gal into /tmp/LTLCardinality990789849750954154.gal : 24 ms
[2024-05-20 15:56:17] [INFO ] Time to serialize properties into /tmp/LTLCardinality7418841902736983664.ltl : 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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality990789849750954154.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality7418841902736983664.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...341
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(G(("(Node20GiveAnswer7<=Node29GiveAnswer1)")U("((Node5Bootstrap<=Node5requestsent23)||(Node20GiveAnswer7<=Node29GiveAnswer1))")))...157
Formula 0 simplified : GF(!"(Node20GiveAnswer7<=Node29GiveAnswer1)" R !"((Node5Bootstrap<=Node5requestsent23)||(Node20GiveAnswer7<=Node29GiveAnswer1))")

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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CANConstruction-PT-030"
export BK_EXAMINATION="LTLCardinality"
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-5568"
echo " Executing tool itstools"
echo " Input is CANConstruction-PT-030, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r070-tall-171620505000027"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CANConstruction-PT-030.tgz
mv CANConstruction-PT-030 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;