fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r048-tajo-171620399200276
Last Updated
July 7, 2024

About the Execution of ITS-Tools for BridgeAndVehicles-PT-V80P20N10

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 425425.00 0.00 0.00 ?F?FF??????F???? normal

Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r048-tajo-171620399200276.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is BridgeAndVehicles-PT-V80P20N10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r048-tajo-171620399200276
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 8.3M
-rw-r--r-- 1 mcc users 23K Apr 13 01:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 123K Apr 13 01:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 330K Apr 13 00:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.3M Apr 13 00:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 13K Apr 22 14:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 47K Apr 22 14:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 115K Apr 22 14:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 334K Apr 22 14:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Apr 13 01:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K Apr 13 01:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 885K Apr 13 01:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 3.4M Apr 13 01:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.3K Apr 22 14:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.0K Apr 22 14:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.7M 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 BridgeAndVehicles-PT-V80P20N10-LTLFireability-00
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-LTLFireability-01
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-LTLFireability-02
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-LTLFireability-03
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-LTLFireability-04
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-LTLFireability-05
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-LTLFireability-06
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-LTLFireability-07
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-LTLFireability-08
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-LTLFireability-09
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-LTLFireability-10
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-LTLFireability-11
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-LTLFireability-12
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-LTLFireability-13
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-LTLFireability-14
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716330360004

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-PT-V80P20N10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-21 22:26:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 22:26:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 22:26:01] [INFO ] Load time of PNML (sax parser for PT used): 151 ms
[2024-05-21 22:26:01] [INFO ] Transformed 188 places.
[2024-05-21 22:26:01] [INFO ] Transformed 2108 transitions.
[2024-05-21 22:26:01] [INFO ] Parsed PT model containing 188 places and 2108 transitions and 15950 arcs in 260 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA BridgeAndVehicles-PT-V80P20N10-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 186 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 2108/2108 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 186 transition count 2108
Applied a total of 2 rules in 62 ms. Remains 186 /188 variables (removed 2) and now considering 2108/2108 (removed 0) transitions.
Running 2105 sub problems to find dead transitions.
[2024-05-21 22:26:02] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 186 cols
[2024-05-21 22:26:02] [INFO ] Computed 5 invariants in 20 ms
[2024-05-21 22:26:02] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2105 unsolved
[2024-05-21 22:26:30] [INFO ] Deduced a trap composed of 5 places in 356 ms of which 13 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 186/556 variables, and 6 constraints, problems are : Problem set: 0 solved, 2105 unsolved in 20098 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/186 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 2105/2105 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2105 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/186 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2105 unsolved
[2024-05-21 22:26:57] [INFO ] Deduced a trap composed of 15 places in 210 ms of which 2 ms to minimize.
SMT process timed out in 55270ms, After SMT, problems are : Problem set: 0 solved, 2105 unsolved
Search for dead transitions found 0 dead transitions in 55341ms
[2024-05-21 22:26:57] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-05-21 22:26:57] [INFO ] Invariant cache hit.
[2024-05-21 22:26:57] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-21 22:26:57] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-05-21 22:26:57] [INFO ] Invariant cache hit.
[2024-05-21 22:26:57] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-21 22:26:57] [INFO ] Implicit Places using invariants and state equation in 228 ms returned []
Implicit Place search using SMT with State Equation took 283 ms to find 0 implicit places.
Running 2105 sub problems to find dead transitions.
[2024-05-21 22:26:57] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-05-21 22:26:57] [INFO ] Invariant cache hit.
[2024-05-21 22:26:57] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2105 unsolved
[2024-05-21 22:27:22] [INFO ] Deduced a trap composed of 5 places in 266 ms of which 2 ms to minimize.
[2024-05-21 22:27:38] [INFO ] Deduced a trap composed of 15 places in 172 ms of which 1 ms to minimize.
Problem TDEAD1148 is UNSAT
Problem TDEAD1159 is UNSAT
Problem TDEAD1170 is UNSAT
Problem TDEAD1181 is UNSAT
Problem TDEAD1192 is UNSAT
Problem TDEAD1203 is UNSAT
Problem TDEAD1214 is UNSAT
Problem TDEAD1225 is UNSAT
Problem TDEAD1236 is UNSAT
Problem TDEAD1247 is UNSAT
Problem TDEAD1258 is UNSAT
Problem TDEAD1269 is UNSAT
Problem TDEAD1280 is UNSAT
Problem TDEAD1291 is UNSAT
Problem TDEAD1302 is UNSAT
Problem TDEAD1313 is UNSAT
Problem TDEAD1324 is UNSAT
Problem TDEAD1335 is UNSAT
Problem TDEAD1346 is UNSAT
Problem TDEAD1357 is UNSAT
Problem TDEAD1368 is UNSAT
Problem TDEAD1379 is UNSAT
Problem TDEAD1390 is UNSAT
Problem TDEAD1401 is UNSAT
Problem TDEAD1412 is UNSAT
Problem TDEAD1423 is UNSAT
Problem TDEAD1434 is UNSAT
Problem TDEAD1445 is UNSAT
Problem TDEAD1456 is UNSAT
Problem TDEAD1467 is UNSAT
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 186/556 variables, and 7 constraints, problems are : Problem set: 30 solved, 2075 unsolved in 30091 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/186 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 2105/2105 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 30 solved, 2075 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 5/5 constraints. Problems are: Problem set: 30 solved, 2075 unsolved
Problem TDEAD1478 is UNSAT
Problem TDEAD1489 is UNSAT
Problem TDEAD1500 is UNSAT
Problem TDEAD1511 is UNSAT
Problem TDEAD1522 is UNSAT
Problem TDEAD1533 is UNSAT
Problem TDEAD1544 is UNSAT
Problem TDEAD1555 is UNSAT
Problem TDEAD1566 is UNSAT
Problem TDEAD1577 is UNSAT
Problem TDEAD1588 is UNSAT
Problem TDEAD1599 is UNSAT
Problem TDEAD1610 is UNSAT
Problem TDEAD1621 is UNSAT
Problem TDEAD1632 is UNSAT
Problem TDEAD1643 is UNSAT
Problem TDEAD1654 is UNSAT
Problem TDEAD1665 is UNSAT
Problem TDEAD1676 is UNSAT
Problem TDEAD1687 is UNSAT
Problem TDEAD1698 is UNSAT
Problem TDEAD1709 is UNSAT
Problem TDEAD1720 is UNSAT
Problem TDEAD1731 is UNSAT
Problem TDEAD1742 is UNSAT
Problem TDEAD1753 is UNSAT
Problem TDEAD1764 is UNSAT
Problem TDEAD1775 is UNSAT
Problem TDEAD1786 is UNSAT
Problem TDEAD1797 is UNSAT
Problem TDEAD1808 is UNSAT
Problem TDEAD1819 is UNSAT
Problem TDEAD1830 is UNSAT
Problem TDEAD1841 is UNSAT
Problem TDEAD1852 is UNSAT
Problem TDEAD1863 is UNSAT
Problem TDEAD1874 is UNSAT
Problem TDEAD1885 is UNSAT
Problem TDEAD1896 is UNSAT
Problem TDEAD1907 is UNSAT
Problem TDEAD1918 is UNSAT
Problem TDEAD1929 is UNSAT
Problem TDEAD1940 is UNSAT
Problem TDEAD1951 is UNSAT
Problem TDEAD1962 is UNSAT
Problem TDEAD1973 is UNSAT
Problem TDEAD1984 is UNSAT
Problem TDEAD1995 is UNSAT
Problem TDEAD2006 is UNSAT
Problem TDEAD2017 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/186 variables, 2/7 constraints. Problems are: Problem set: 80 solved, 2025 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 186/556 variables, and 7 constraints, problems are : Problem set: 80 solved, 2025 unsolved in 30062 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/186 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 0/2105 constraints, Known Traps: 2/2 constraints]
After SMT, in 75554ms problems are : Problem set: 80 solved, 2025 unsolved
Search for dead transitions found 80 dead transitions in 75590ms
Found 80 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 80 transitions
Dead transitions reduction (with SMT) removed 80 transitions
Starting structural reductions in LTL mode, iteration 1 : 186/188 places, 2028/2108 transitions.
Applied a total of 0 rules in 14 ms. Remains 186 /186 variables (removed 0) and now considering 2028/2028 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 131370 ms. Remains : 186/188 places, 2028/2108 transitions.
Support contains 186 out of 186 places after structural reductions.
[2024-05-21 22:28:14] [INFO ] Flatten gal took : 482 ms
[2024-05-21 22:28:15] [INFO ] Flatten gal took : 403 ms
[2024-05-21 22:28:16] [INFO ] Input system was already deterministic with 2028 transitions.
Reduction of identical properties reduced properties to check from 25 to 24
RANDOM walk for 40000 steps (56 resets) in 8836 ms. (4 steps per ms) remains 4/24 properties
BEST_FIRST walk for 40002 steps (20 resets) in 387 ms. (103 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40003 steps (20 resets) in 468 ms. (85 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (20 resets) in 360 ms. (110 steps per ms) remains 2/3 properties
[2024-05-21 22:28:19] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
// Phase 1: matrix 369 rows 186 cols
[2024-05-21 22:28:19] [INFO ] Computed 5 invariants in 4 ms
[2024-05-21 22:28:19] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 174/179 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 367/546 variables, 179/183 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/546 variables, 21/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/546 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 9/555 variables, 7/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/555 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/555 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/555 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 555/555 variables, and 212 constraints, problems are : Problem set: 0 solved, 2 unsolved in 657 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 186/186 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 174/179 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 367/546 variables, 179/183 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/546 variables, 21/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/546 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 9/555 variables, 7/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/555 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/555 variables, 2/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/555 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/555 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 555/555 variables, and 214 constraints, problems are : Problem set: 0 solved, 2 unsolved in 923 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 186/186 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1627ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 827 ms.
Support contains 5 out of 186 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 186/186 places, 2028/2028 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 185 transition count 2027
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 185 transition count 2027
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 183 transition count 2026
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 181 transition count 2024
Applied a total of 9 rules in 484 ms. Remains 181 /186 variables (removed 5) and now considering 2024/2028 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 485 ms. Remains : 181/186 places, 2024/2028 transitions.
RANDOM walk for 40000 steps (80 resets) in 684 ms. (58 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (40 resets) in 346 ms. (115 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (40 resets) in 303 ms. (131 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 324679 steps, run timeout after 3001 ms. (steps per millisecond=108 ) properties seen :1 out of 2
Probabilistic random walk after 324679 steps, saw 105942 distinct states, run finished after 3004 ms. (steps per millisecond=108 ) properties seen :1
[2024-05-21 22:28:26] [INFO ] Flow matrix only has 365 transitions (discarded 1659 similar events)
// Phase 1: matrix 365 rows 181 cols
[2024-05-21 22:28:26] [INFO ] Computed 4 invariants in 5 ms
[2024-05-21 22:28:26] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 173/177 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 365/542 variables, 177/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/542 variables, 21/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/542 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 4/546 variables, 4/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/546 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/546 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 546/546 variables, and 206 constraints, problems are : Problem set: 0 solved, 1 unsolved in 216 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 181/181 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 173/177 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 365/542 variables, 177/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/542 variables, 21/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/542 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 4/546 variables, 4/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/546 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/546 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/546 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 546/546 variables, and 207 constraints, problems are : Problem set: 0 solved, 1 unsolved in 871 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 181/181 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1117ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 124 ms.
Support contains 4 out of 181 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 181/181 places, 2024/2024 transitions.
Applied a total of 0 rules in 206 ms. Remains 181 /181 variables (removed 0) and now considering 2024/2024 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 207 ms. Remains : 181/181 places, 2024/2024 transitions.
RANDOM walk for 40000 steps (80 resets) in 745 ms. (53 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (37 resets) in 355 ms. (112 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 319739 steps, run timeout after 3001 ms. (steps per millisecond=106 ) properties seen :0 out of 1
Probabilistic random walk after 319739 steps, saw 104721 distinct states, run finished after 3001 ms. (steps per millisecond=106 ) properties seen :0
[2024-05-21 22:28:31] [INFO ] Flow matrix only has 365 transitions (discarded 1659 similar events)
[2024-05-21 22:28:31] [INFO ] Invariant cache hit.
[2024-05-21 22:28:31] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 173/177 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 365/542 variables, 177/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/542 variables, 21/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/542 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 4/546 variables, 4/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/546 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/546 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 546/546 variables, and 206 constraints, problems are : Problem set: 0 solved, 1 unsolved in 239 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 181/181 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 173/177 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 365/542 variables, 177/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/542 variables, 21/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/542 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 4/546 variables, 4/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/546 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/546 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/546 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 546/546 variables, and 207 constraints, problems are : Problem set: 0 solved, 1 unsolved in 389 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 181/181 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 697ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 101 ms.
Support contains 4 out of 181 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 181/181 places, 2024/2024 transitions.
Applied a total of 0 rules in 157 ms. Remains 181 /181 variables (removed 0) and now considering 2024/2024 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 157 ms. Remains : 181/181 places, 2024/2024 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 181/181 places, 2024/2024 transitions.
Applied a total of 0 rules in 156 ms. Remains 181 /181 variables (removed 0) and now considering 2024/2024 (removed 0) transitions.
[2024-05-21 22:28:32] [INFO ] Flow matrix only has 365 transitions (discarded 1659 similar events)
[2024-05-21 22:28:32] [INFO ] Invariant cache hit.
[2024-05-21 22:28:32] [INFO ] Implicit Places using invariants in 379 ms returned []
[2024-05-21 22:28:32] [INFO ] Flow matrix only has 365 transitions (discarded 1659 similar events)
[2024-05-21 22:28:32] [INFO ] Invariant cache hit.
[2024-05-21 22:28:32] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-21 22:28:33] [INFO ] Implicit Places using invariants and state equation in 1305 ms returned [82, 166]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1691 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 179/181 places, 2024/2024 transitions.
Applied a total of 0 rules in 150 ms. Remains 179 /179 variables (removed 0) and now considering 2024/2024 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1997 ms. Remains : 179/181 places, 2024/2024 transitions.
RANDOM walk for 40000 steps (80 resets) in 512 ms. (77 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (39 resets) in 268 ms. (148 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 304797 steps, run timeout after 3001 ms. (steps per millisecond=101 ) properties seen :0 out of 1
Probabilistic random walk after 304797 steps, saw 97483 distinct states, run finished after 3001 ms. (steps per millisecond=101 ) properties seen :0
[2024-05-21 22:28:37] [INFO ] Flow matrix only has 365 transitions (discarded 1659 similar events)
// Phase 1: matrix 365 rows 179 cols
[2024-05-21 22:28:37] [INFO ] Computed 4 invariants in 6 ms
[2024-05-21 22:28:37] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 173/177 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 365/542 variables, 177/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/542 variables, 21/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/542 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 2/544 variables, 2/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/544 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/544 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 544/544 variables, and 204 constraints, problems are : Problem set: 0 solved, 1 unsolved in 244 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 179/179 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 173/177 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 365/542 variables, 177/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/542 variables, 21/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/542 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/542 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/544 variables, 2/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/544 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/544 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 544/544 variables, and 205 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1312 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 179/179 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1593ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 234 ms.
Support contains 4 out of 179 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 179/179 places, 2024/2024 transitions.
Applied a total of 0 rules in 150 ms. Remains 179 /179 variables (removed 0) and now considering 2024/2024 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 152 ms. Remains : 179/179 places, 2024/2024 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 179/179 places, 2024/2024 transitions.
Applied a total of 0 rules in 149 ms. Remains 179 /179 variables (removed 0) and now considering 2024/2024 (removed 0) transitions.
[2024-05-21 22:28:39] [INFO ] Flow matrix only has 365 transitions (discarded 1659 similar events)
[2024-05-21 22:28:39] [INFO ] Invariant cache hit.
[2024-05-21 22:28:39] [INFO ] Implicit Places using invariants in 369 ms returned []
[2024-05-21 22:28:39] [INFO ] Flow matrix only has 365 transitions (discarded 1659 similar events)
[2024-05-21 22:28:39] [INFO ] Invariant cache hit.
[2024-05-21 22:28:40] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-21 22:28:41] [INFO ] Implicit Places using invariants and state equation in 1244 ms returned []
Implicit Place search using SMT with State Equation took 1617 ms to find 0 implicit places.
[2024-05-21 22:28:41] [INFO ] Redundant transitions in 142 ms returned []
Running 2021 sub problems to find dead transitions.
[2024-05-21 22:28:41] [INFO ] Flow matrix only has 365 transitions (discarded 1659 similar events)
[2024-05-21 22:28:41] [INFO ] Invariant cache hit.
[2024-05-21 22:28:41] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2021 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 179/544 variables, and 4 constraints, problems are : Problem set: 0 solved, 2021 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/179 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 2021/2021 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2021 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2021 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 179/544 variables, and 4 constraints, problems are : Problem set: 0 solved, 2021 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/179 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 0/2021 constraints, Known Traps: 0/0 constraints]
After SMT, in 76160ms problems are : Problem set: 0 solved, 2021 unsolved
Search for dead transitions found 0 dead transitions in 76186ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78140 ms. Remains : 179/179 places, 2024/2024 transitions.
FORMULA BridgeAndVehicles-PT-V80P20N10-LTLFireability-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA BridgeAndVehicles-PT-V80P20N10-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA BridgeAndVehicles-PT-V80P20N10-LTLFireability-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 169 stabilizing places and 324 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p1)||p0)))'
Support contains 85 out of 186 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 186/186 places, 2028/2028 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 185 transition count 2027
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 185 transition count 2027
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 183 transition count 2026
Applied a total of 5 rules in 525 ms. Remains 183 /186 variables (removed 3) and now considering 2026/2028 (removed 2) transitions.
[2024-05-21 22:29:58] [INFO ] Flow matrix only has 367 transitions (discarded 1659 similar events)
// Phase 1: matrix 367 rows 183 cols
[2024-05-21 22:29:58] [INFO ] Computed 4 invariants in 6 ms
[2024-05-21 22:29:58] [INFO ] Implicit Places using invariants in 257 ms returned []
[2024-05-21 22:29:58] [INFO ] Flow matrix only has 367 transitions (discarded 1659 similar events)
[2024-05-21 22:29:58] [INFO ] Invariant cache hit.
[2024-05-21 22:29:58] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-21 22:29:59] [INFO ] Implicit Places using invariants and state equation in 869 ms returned [82, 166]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1146 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 181/186 places, 2026/2028 transitions.
Applied a total of 0 rules in 174 ms. Remains 181 /181 variables (removed 0) and now considering 2026/2026 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1846 ms. Remains : 181/186 places, 2026/2028 transitions.
Stuttering acceptance computed with spot in 294 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : BridgeAndVehicles-PT-V80P20N10-LTLFireability-00
Product exploration explored 100000 steps with 1503 reset in 979 ms.
Product exploration explored 100000 steps with 1511 reset in 932 ms.
Computed a total of 164 stabilizing places and 322 stable transitions
Computed a total of 164 stabilizing places and 322 stable transitions
Detected a total of 164/181 stabilizing places and 322/2026 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 158 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p0) (NOT p1))]
RANDOM walk for 947 steps (0 resets) in 29 ms. (31 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND (NOT p0) p1))), (F p0), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 10 factoid took 273 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 53 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 42 ms :[(AND (NOT p0) (NOT p1))]
Support contains 85 out of 181 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 181/181 places, 2026/2026 transitions.
Applied a total of 0 rules in 205 ms. Remains 181 /181 variables (removed 0) and now considering 2026/2026 (removed 0) transitions.
[2024-05-21 22:30:02] [INFO ] Flow matrix only has 367 transitions (discarded 1659 similar events)
// Phase 1: matrix 367 rows 181 cols
[2024-05-21 22:30:03] [INFO ] Computed 4 invariants in 4 ms
[2024-05-21 22:30:03] [INFO ] Implicit Places using invariants in 299 ms returned []
[2024-05-21 22:30:03] [INFO ] Flow matrix only has 367 transitions (discarded 1659 similar events)
[2024-05-21 22:30:03] [INFO ] Invariant cache hit.
[2024-05-21 22:30:03] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-21 22:30:04] [INFO ] Implicit Places using invariants and state equation in 1693 ms returned []
Implicit Place search using SMT with State Equation took 1994 ms to find 0 implicit places.
[2024-05-21 22:30:05] [INFO ] Redundant transitions in 163 ms returned []
Running 2023 sub problems to find dead transitions.
[2024-05-21 22:30:05] [INFO ] Flow matrix only has 367 transitions (discarded 1659 similar events)
[2024-05-21 22:30:05] [INFO ] Invariant cache hit.
[2024-05-21 22:30:05] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2023 unsolved
[2024-05-21 22:30:30] [INFO ] Deduced a trap composed of 5 places in 277 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 181/548 variables, and 5 constraints, problems are : Problem set: 0 solved, 2023 unsolved in 30069 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/181 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 2023/2023 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2023 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2023 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/181 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2023 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 181/548 variables, and 5 constraints, problems are : Problem set: 0 solved, 2023 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/181 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 0/2023 constraints, Known Traps: 1/1 constraints]
After SMT, in 76407ms problems are : Problem set: 0 solved, 2023 unsolved
Search for dead transitions found 0 dead transitions in 76437ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 78817 ms. Remains : 181/181 places, 2026/2026 transitions.
Computed a total of 164 stabilizing places and 322 stable transitions
Computed a total of 164 stabilizing places and 322 stable transitions
Detected a total of 164/181 stabilizing places and 322/2026 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 176 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[(AND (NOT p0) (NOT p1))]
RANDOM walk for 877 steps (0 resets) in 26 ms. (32 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND (NOT p0) p1))), (F p0), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 10 factoid took 386 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 42 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 32 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1510 reset in 933 ms.
Product exploration explored 100000 steps with 1506 reset in 834 ms.
Built C files in :
/tmp/ltsmin13602609587767181536
[2024-05-21 22:31:24] [INFO ] Too many transitions (2026) to apply POR reductions. Disabling POR matrices.
[2024-05-21 22:31:24] [INFO ] Built C files in 51ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13602609587767181536
Running compilation step : cd /tmp/ltsmin13602609587767181536;'/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/ltsmin13602609587767181536;'/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/ltsmin13602609587767181536;'/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 85 out of 181 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 181/181 places, 2026/2026 transitions.
Applied a total of 0 rules in 158 ms. Remains 181 /181 variables (removed 0) and now considering 2026/2026 (removed 0) transitions.
[2024-05-21 22:31:27] [INFO ] Flow matrix only has 367 transitions (discarded 1659 similar events)
[2024-05-21 22:31:27] [INFO ] Invariant cache hit.
[2024-05-21 22:31:27] [INFO ] Implicit Places using invariants in 272 ms returned []
[2024-05-21 22:31:27] [INFO ] Flow matrix only has 367 transitions (discarded 1659 similar events)
[2024-05-21 22:31:27] [INFO ] Invariant cache hit.
[2024-05-21 22:31:27] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-21 22:31:29] [INFO ] Implicit Places using invariants and state equation in 1902 ms returned []
Implicit Place search using SMT with State Equation took 2177 ms to find 0 implicit places.
[2024-05-21 22:31:29] [INFO ] Redundant transitions in 61 ms returned []
Running 2023 sub problems to find dead transitions.
[2024-05-21 22:31:29] [INFO ] Flow matrix only has 367 transitions (discarded 1659 similar events)
[2024-05-21 22:31:29] [INFO ] Invariant cache hit.
[2024-05-21 22:31:29] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2023 unsolved
[2024-05-21 22:31:55] [INFO ] Deduced a trap composed of 5 places in 330 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 181/548 variables, and 5 constraints, problems are : Problem set: 0 solved, 2023 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/181 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 2023/2023 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2023 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2023 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/181 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2023 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 181/548 variables, and 5 constraints, problems are : Problem set: 0 solved, 2023 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/181 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 0/2023 constraints, Known Traps: 1/1 constraints]
After SMT, in 76852ms problems are : Problem set: 0 solved, 2023 unsolved
Search for dead transitions found 0 dead transitions in 76881ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 79288 ms. Remains : 181/181 places, 2026/2026 transitions.
Built C files in :
/tmp/ltsmin211389365909938113
[2024-05-21 22:32:46] [INFO ] Too many transitions (2026) to apply POR reductions. Disabling POR matrices.
[2024-05-21 22:32:46] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin211389365909938113
Running compilation step : cd /tmp/ltsmin211389365909938113;'/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/ltsmin211389365909938113;'/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/ltsmin211389365909938113;'/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-21 22:32:52] [INFO ] Flatten gal took : 55 ms
[2024-05-21 22:32:52] [INFO ] Flatten gal took : 53 ms
[2024-05-21 22:32:52] [INFO ] Time to serialize gal into /tmp/LTL7379194807600287152.gal : 23 ms
[2024-05-21 22:32:52] [INFO ] Time to serialize properties into /tmp/LTL13117193955514269692.prop : 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/LTL7379194807600287152.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10245910231423565704.hoa' '-atoms' '/tmp/LTL13117193955514269692.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/LTL13117193955514269692.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10245910231423565704.hoa

BK_STOP 1716330785429

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ 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 LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BridgeAndVehicles-PT-V80P20N10"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is BridgeAndVehicles-PT-V80P20N10, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r048-tajo-171620399200276"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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