Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r047-tajo-171620397800228.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 greatspnxred
Input is BridgeAndVehicles-PT-V50P20N10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r047-tajo-171620397800228
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.9M
-rw-r--r-- 1 mcc users 19K Apr 13 00:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 122K Apr 13 00:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 141K Apr 13 00:34 CTLFireability.txt
-rw-r--r-- 1 mcc users 554K Apr 13 00:34 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 11K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 42K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 43K Apr 22 14:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 131K Apr 22 14:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 34K Apr 13 01:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 193K Apr 13 01:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 315K Apr 13 01:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.2M Apr 13 01:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.8K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.8K Apr 22 14:29 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.1M 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-V50P20N10-LTLFireability-00
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-LTLFireability-01
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-LTLFireability-02
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-LTLFireability-03
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-LTLFireability-04
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-LTLFireability-05
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-LTLFireability-06
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-LTLFireability-07
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-LTLFireability-08
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-LTLFireability-09
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-LTLFireability-10
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-LTLFireability-11
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-LTLFireability-12
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-LTLFireability-13
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-LTLFireability-14
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716286838524

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-PT-V50P20N10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 10:20:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-21 10:20:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 10:20:40] [INFO ] Load time of PNML (sax parser for PT used): 184 ms
[2024-05-21 10:20:40] [INFO ] Transformed 128 places.
[2024-05-21 10:20:40] [INFO ] Transformed 1328 transitions.
[2024-05-21 10:20:40] [INFO ] Parsed PT model containing 128 places and 1328 transitions and 10010 arcs in 311 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 24 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA BridgeAndVehicles-PT-V50P20N10-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P20N10-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P20N10-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P20N10-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P20N10-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 126 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 1328/1328 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 126 transition count 1328
Applied a total of 2 rules in 40 ms. Remains 126 /128 variables (removed 2) and now considering 1328/1328 (removed 0) transitions.
Running 1325 sub problems to find dead transitions.
[2024-05-21 10:20:41] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 126 cols
[2024-05-21 10:20:41] [INFO ] Computed 5 invariants in 26 ms
[2024-05-21 10:20:41] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1325 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 126/376 variables, and 5 constraints, problems are : Problem set: 0 solved, 1325 unsolved in 20150 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/126 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 1325/1325 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1325 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1325 unsolved
[2024-05-21 10:21:10] [INFO ] Deduced a trap composed of 5 places in 262 ms of which 13 ms to minimize.
[2024-05-21 10:21:17] [INFO ] Deduced a trap composed of 15 places in 144 ms of which 2 ms to minimize.
Problem TDEAD728 is UNSAT
Problem TDEAD729 is UNSAT
Problem TDEAD730 is UNSAT
Problem TDEAD731 is UNSAT
Problem TDEAD732 is UNSAT
Problem TDEAD733 is UNSAT
Problem TDEAD734 is UNSAT
Problem TDEAD735 is UNSAT
Problem TDEAD736 is UNSAT
Problem TDEAD737 is UNSAT
Problem TDEAD738 is UNSAT
Problem TDEAD739 is UNSAT
Problem TDEAD740 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD742 is UNSAT
Problem TDEAD743 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD745 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD754 is UNSAT
Problem TDEAD755 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD758 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD760 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD764 is UNSAT
Problem TDEAD765 is UNSAT
Problem TDEAD766 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD769 is UNSAT
Problem TDEAD770 is UNSAT
Problem TDEAD771 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD774 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD776 is UNSAT
Problem TDEAD777 is UNSAT
[2024-05-21 10:21:22] [INFO ] Deduced a trap composed of 14 places in 220 ms of which 1 ms to minimize.
Problem TDEAD178 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD640 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD662 is UNSAT
Problem TDEAD673 is UNSAT
Problem TDEAD684 is UNSAT
Problem TDEAD695 is UNSAT
Problem TDEAD706 is UNSAT
Problem TDEAD717 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 3/8 constraints. Problems are: Problem set: 100 solved, 1225 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 1)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 1)
(s53 0)
(s54 19)
(s55 1)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 126/376 variables, and 8 constraints, problems are : Problem set: 100 solved, 1225 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/126 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 0/1325 constraints, Known Traps: 3/3 constraints]
After SMT, in 46602ms problems are : Problem set: 100 solved, 1225 unsolved
Search for dead transitions found 100 dead transitions in 46662ms
Found 100 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 100 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 100 transitions.
[2024-05-21 10:21:27] [INFO ] Flow matrix only has 248 transitions (discarded 980 similar events)
// Phase 1: matrix 248 rows 126 cols
[2024-05-21 10:21:27] [INFO ] Computed 5 invariants in 5 ms
[2024-05-21 10:21:27] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-21 10:21:27] [INFO ] Flow matrix only has 248 transitions (discarded 980 similar events)
[2024-05-21 10:21:27] [INFO ] Invariant cache hit.
[2024-05-21 10:21:28] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 10:21:28] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 247 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 126/128 places, 1228/1328 transitions.
Applied a total of 0 rules in 11 ms. Remains 126 /126 variables (removed 0) and now considering 1228/1228 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47032 ms. Remains : 126/128 places, 1228/1328 transitions.
Support contains 126 out of 126 places after structural reductions.
[2024-05-21 10:21:28] [INFO ] Flatten gal took : 171 ms
[2024-05-21 10:21:28] [INFO ] Flatten gal took : 127 ms
[2024-05-21 10:21:29] [INFO ] Input system was already deterministic with 1228 transitions.
Reduction of identical properties reduced properties to check from 19 to 16
RANDOM walk for 40000 steps (88 resets) in 2331 ms. (17 steps per ms) remains 1/16 properties
BEST_FIRST walk for 40002 steps (36 resets) in 156 ms. (254 steps per ms) remains 1/1 properties
[2024-05-21 10:21:29] [INFO ] Flow matrix only has 248 transitions (discarded 980 similar events)
[2024-05-21 10:21:29] [INFO ] Invariant cache hit.
[2024-05-21 10:21:29] [INFO ] State equation strengthened by 20 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) 115/119 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 246/365 variables, 119/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/365 variables, 20/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 9/374 variables, 7/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/374 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/374 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/374 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 374/374 variables, and 151 constraints, problems are : Problem set: 0 solved, 1 unsolved in 185 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 126/126 constraints, ReadFeed: 20/20 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) 115/119 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 246/365 variables, 119/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/365 variables, 20/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 9/374 variables, 7/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/374 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/374 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/374 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/374 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 374/374 variables, and 152 constraints, problems are : Problem set: 0 solved, 1 unsolved in 248 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 126/126 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 456ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 33 ms.
Support contains 4 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 1228/1228 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 125 transition count 1227
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 125 transition count 1227
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 123 transition count 1226
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 121 transition count 1224
Applied a total of 9 rules in 184 ms. Remains 121 /126 variables (removed 5) and now considering 1224/1228 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 185 ms. Remains : 121/126 places, 1224/1228 transitions.
RANDOM walk for 40000 steps (124 resets) in 512 ms. (77 steps per ms) remains 1/1 properties
BEST_FIRST walk for 39772 steps (66 resets) in 196 ms. (201 steps per ms) remains 0/1 properties
FORMULA BridgeAndVehicles-PT-V50P20N10-LTLFireability-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA BridgeAndVehicles-PT-V50P20N10-LTLFireability-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 109 stabilizing places and 204 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((F(p1)||p0))))'
Support contains 65 out of 126 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 126/126 places, 1228/1228 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 125 transition count 1227
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 125 transition count 1227
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 123 transition count 1226
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 121 transition count 1224
Applied a total of 9 rules in 173 ms. Remains 121 /126 variables (removed 5) and now considering 1224/1228 (removed 4) transitions.
[2024-05-21 10:21:31] [INFO ] Flow matrix only has 244 transitions (discarded 980 similar events)
// Phase 1: matrix 244 rows 121 cols
[2024-05-21 10:21:31] [INFO ] Computed 4 invariants in 2 ms
[2024-05-21 10:21:31] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-05-21 10:21:31] [INFO ] Flow matrix only has 244 transitions (discarded 980 similar events)
[2024-05-21 10:21:31] [INFO ] Invariant cache hit.
[2024-05-21 10:21:31] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 10:21:31] [INFO ] Implicit Places using invariants and state equation in 372 ms returned [52, 106]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 468 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 119/126 places, 1224/1228 transitions.
Applied a total of 0 rules in 75 ms. Remains 119 /119 variables (removed 0) and now considering 1224/1224 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 718 ms. Remains : 119/126 places, 1224/1228 transitions.
Stuttering acceptance computed with spot in 180 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N10-LTLFireability-00
Product exploration explored 100000 steps with 682 reset in 3453 ms.
Product exploration explored 100000 steps with 681 reset in 3670 ms.
Computed a total of 104 stabilizing places and 202 stable transitions
Computed a total of 104 stabilizing places and 202 stable transitions
Detected a total of 104/119 stabilizing places and 202/1224 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 7 factoid took 371 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 1045 steps (2 resets) in 119 ms. (8 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (NOT (OR (NOT p0) p1))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 7 factoid took 434 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-05-21 10:21:40] [INFO ] Flow matrix only has 244 transitions (discarded 980 similar events)
// Phase 1: matrix 244 rows 119 cols
[2024-05-21 10:21:40] [INFO ] Computed 4 invariants in 7 ms
[2024-05-21 10:21:48] [INFO ] [Real]Absence check using 4 positive place invariants in 21 ms returned sat
[2024-05-21 10:21:49] [INFO ] [Real]Absence check using state equation in 434 ms returned sat
[2024-05-21 10:21:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 10:21:56] [INFO ] [Nat]Absence check using 4 positive place invariants in 7 ms returned sat
[2024-05-21 10:21:56] [INFO ] [Nat]Absence check using state equation in 80 ms returned sat
[2024-05-21 10:21:56] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 10:21:57] [INFO ] [Nat]Added 20 Read/Feed constraints in 198 ms returned sat
[2024-05-21 10:21:57] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 131 transitions) in 68 ms.
[2024-05-21 10:21:57] [INFO ] Added : 21 causal constraints over 5 iterations in 221 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 65 out of 119 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 119/119 places, 1224/1224 transitions.
Applied a total of 0 rules in 111 ms. Remains 119 /119 variables (removed 0) and now considering 1224/1224 (removed 0) transitions.
[2024-05-21 10:21:57] [INFO ] Flow matrix only has 244 transitions (discarded 980 similar events)
[2024-05-21 10:21:57] [INFO ] Invariant cache hit.
[2024-05-21 10:21:57] [INFO ] Implicit Places using invariants in 216 ms returned []
[2024-05-21 10:21:57] [INFO ] Flow matrix only has 244 transitions (discarded 980 similar events)
[2024-05-21 10:21:57] [INFO ] Invariant cache hit.
[2024-05-21 10:21:57] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 10:21:58] [INFO ] Implicit Places using invariants and state equation in 303 ms returned []
Implicit Place search using SMT with State Equation took 522 ms to find 0 implicit places.
[2024-05-21 10:21:58] [INFO ] Redundant transitions in 115 ms returned []
Running 1221 sub problems to find dead transitions.
[2024-05-21 10:21:58] [INFO ] Flow matrix only has 244 transitions (discarded 980 similar events)
[2024-05-21 10:21:58] [INFO ] Invariant cache hit.
[2024-05-21 10:21:58] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1221 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1221 unsolved
Problem TDEAD50 is UNSAT
Problem TDEAD101 is UNSAT
At refinement iteration 2 (OVERLAPS) 244/363 variables, 119/123 constraints. Problems are: Problem set: 2 solved, 1219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/363 variables, 20/143 constraints. Problems are: Problem set: 2 solved, 1219 unsolved
[2024-05-21 10:22:28] [INFO ] Deduced a trap composed of 12 places in 150 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/363 variables, 1/144 constraints. Problems are: Problem set: 2 solved, 1219 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 363/363 variables, and 144 constraints, problems are : Problem set: 2 solved, 1219 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 119/119 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1221/1221 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 2 solved, 1219 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 4/4 constraints. Problems are: Problem set: 2 solved, 1219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 1/5 constraints. Problems are: Problem set: 2 solved, 1219 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 0/5 constraints. Problems are: Problem set: 2 solved, 1219 unsolved
At refinement iteration 3 (OVERLAPS) 244/363 variables, 119/124 constraints. Problems are: Problem set: 2 solved, 1219 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/363 variables, 20/144 constraints. Problems are: Problem set: 2 solved, 1219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 1219/1363 constraints. Problems are: Problem set: 2 solved, 1219 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 363/363 variables, and 1363 constraints, problems are : Problem set: 2 solved, 1219 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 119/119 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1219/1221 constraints, Known Traps: 1/1 constraints]
After SMT, in 65976ms problems are : Problem set: 2 solved, 1219 unsolved
Search for dead transitions found 2 dead transitions in 66002ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 119/119 places, 1222/1224 transitions.
Applied a total of 0 rules in 73 ms. Remains 119 /119 variables (removed 0) and now considering 1222/1222 (removed 0) transitions.
[2024-05-21 10:23:04] [INFO ] Redundant transitions in 18 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 66885 ms. Remains : 119/119 places, 1222/1224 transitions.
Computed a total of 104 stabilizing places and 200 stable transitions
Computed a total of 104 stabilizing places and 200 stable transitions
Detected a total of 104/119 stabilizing places and 200/1222 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 7 factoid took 379 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 928 steps (2 resets) in 110 ms. (8 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (NOT (OR (NOT p0) p1))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 7 factoid took 573 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-05-21 10:23:05] [INFO ] Flow matrix only has 242 transitions (discarded 980 similar events)
// Phase 1: matrix 242 rows 119 cols
[2024-05-21 10:23:05] [INFO ] Computed 4 invariants in 9 ms
[2024-05-21 10:23:13] [INFO ] [Real]Absence check using 4 positive place invariants in 8 ms returned sat
[2024-05-21 10:23:13] [INFO ] [Real]Absence check using state equation in 179 ms returned sat
[2024-05-21 10:23:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 10:23:20] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2024-05-21 10:23:20] [INFO ] [Nat]Absence check using state equation in 93 ms returned sat
[2024-05-21 10:23:20] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 10:23:20] [INFO ] [Nat]Added 20 Read/Feed constraints in 20 ms returned sat
[2024-05-21 10:23:20] [INFO ] Computed and/alt/rep : 108/216/108 causal constraints (skipped 131 transitions) in 80 ms.
[2024-05-21 10:23:21] [INFO ] Added : 37 causal constraints over 9 iterations in 349 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 682 reset in 3585 ms.
Product exploration explored 100000 steps with 676 reset in 3837 ms.
Support contains 65 out of 119 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 119/119 places, 1222/1222 transitions.
Applied a total of 0 rules in 71 ms. Remains 119 /119 variables (removed 0) and now considering 1222/1222 (removed 0) transitions.
[2024-05-21 10:23:28] [INFO ] Flow matrix only has 242 transitions (discarded 980 similar events)
[2024-05-21 10:23:28] [INFO ] Invariant cache hit.
[2024-05-21 10:23:29] [INFO ] Implicit Places using invariants in 155 ms returned []
[2024-05-21 10:23:29] [INFO ] Flow matrix only has 242 transitions (discarded 980 similar events)
[2024-05-21 10:23:29] [INFO ] Invariant cache hit.
[2024-05-21 10:23:29] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 10:23:29] [INFO ] Implicit Places using invariants and state equation in 353 ms returned []
Implicit Place search using SMT with State Equation took 531 ms to find 0 implicit places.
[2024-05-21 10:23:29] [INFO ] Redundant transitions in 13 ms returned []
Running 1219 sub problems to find dead transitions.
[2024-05-21 10:23:29] [INFO ] Flow matrix only has 242 transitions (discarded 980 similar events)
[2024-05-21 10:23:29] [INFO ] Invariant cache hit.
[2024-05-21 10:23:29] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1219 unsolved
At refinement iteration 2 (OVERLAPS) 242/361 variables, 119/123 constraints. Problems are: Problem set: 0 solved, 1219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 20/143 constraints. Problems are: Problem set: 0 solved, 1219 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/361 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1219 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 361/361 variables, and 143 constraints, problems are : Problem set: 0 solved, 1219 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 119/119 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1219/1219 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1219 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1219 unsolved
At refinement iteration 2 (OVERLAPS) 242/361 variables, 119/123 constraints. Problems are: Problem set: 0 solved, 1219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 20/143 constraints. Problems are: Problem set: 0 solved, 1219 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/361 variables, 1219/1362 constraints. Problems are: Problem set: 0 solved, 1219 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 361/361 variables, and 1362 constraints, problems are : Problem set: 0 solved, 1219 unsolved in 30065 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 119/119 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1219/1219 constraints, Known Traps: 0/0 constraints]
After SMT, in 65992ms problems are : Problem set: 0 solved, 1219 unsolved
Search for dead transitions found 0 dead transitions in 66011ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 66650 ms. Remains : 119/119 places, 1222/1222 transitions.
Treatment of property BridgeAndVehicles-PT-V50P20N10-LTLFireability-00 finished in 184731 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((p0||G(F(!p1)))&&(X(!p2) U ((!p3&&X(!p2))||X(G(!p2)))))))'
Support contains 119 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 1228/1228 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 125 transition count 1227
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 125 transition count 1227
Applied a total of 2 rules in 8 ms. Remains 125 /126 variables (removed 1) and now considering 1227/1228 (removed 1) transitions.
Running 1224 sub problems to find dead transitions.
[2024-05-21 10:24:35] [INFO ] Flow matrix only has 247 transitions (discarded 980 similar events)
// Phase 1: matrix 247 rows 125 cols
[2024-05-21 10:24:35] [INFO ] Computed 5 invariants in 2 ms
[2024-05-21 10:24:35] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
[2024-05-21 10:24:47] [INFO ] Deduced a trap composed of 5 places in 225 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 125/372 variables, and 6 constraints, problems are : Problem set: 0 solved, 1224 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/125 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1224/1224 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1224 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
Problem TDEAD50 is UNSAT
Problem TDEAD154 is UNSAT
At refinement iteration 3 (OVERLAPS) 247/372 variables, 125/131 constraints. Problems are: Problem set: 2 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/372 variables, 20/151 constraints. Problems are: Problem set: 2 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 372/372 variables, and 1373 constraints, problems are : Problem set: 2 solved, 1222 unsolved in 20773 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 125/125 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1224 constraints, Known Traps: 1/1 constraints]
After SMT, in 46928ms problems are : Problem set: 2 solved, 1222 unsolved
Search for dead transitions found 2 dead transitions in 46952ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 2 transitions.
[2024-05-21 10:25:22] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
// Phase 1: matrix 245 rows 125 cols
[2024-05-21 10:25:22] [INFO ] Computed 7 invariants in 1 ms
[2024-05-21 10:25:22] [INFO ] Implicit Places using invariants in 175 ms returned [52, 108]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 191 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 123/126 places, 1225/1228 transitions.
Applied a total of 0 rules in 4 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 47172 ms. Remains : 123/126 places, 1225/1228 transitions.
Stuttering acceptance computed with spot in 733 ms :[(OR p2 (AND (NOT p0) p1)), p2, (OR (AND (NOT p0) p1) (AND p1 p2)), (OR (AND (NOT p0) p1) (AND p1 p2)), false, (AND p1 p2), (AND p1 p2), (AND (NOT p0) p1 p2), (AND (NOT p0) p1 p2)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N10-LTLFireability-02
Product exploration explored 100000 steps with 1713 reset in 1552 ms.
Product exploration explored 100000 steps with 1611 reset in 1538 ms.
Computed a total of 106 stabilizing places and 201 stable transitions
Computed a total of 106 stabilizing places and 201 stable transitions
Detected a total of 106/123 stabilizing places and 201/1225 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/4 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p3 (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) p1 p2))), (X p3), (X (AND p3 (NOT p2))), (X (NOT (AND p0 p1))), (X (NOT (AND p3 p0))), (X (NOT (AND p3 p0 p1))), (X (NOT (AND (NOT p0) p2))), (X (NOT p0)), (X (NOT (AND p3 p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X p3)), (X (X (AND p3 (NOT p2)))), (X (X (OR (NOT p0) (NOT p2)))), (X (X (NOT (AND p3 p0 p1)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p3 (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p3 p0 p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p3 p1 (NOT p2))))), (X (X (NOT (AND p3 p0)))), (X (X (OR (AND p3 (NOT p0)) (AND p3 (NOT p2))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p3 p0 p1 p2)))), (X (X (NOT p0))), (X (X (NOT (AND p3 p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 36 factoid took 344 ms. Reduced automaton from 9 states, 36 edges and 4 AP (stutter sensitive) to 9 states, 34 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 502 ms :[(OR (AND (NOT p0) p1) (AND p1 p2)), p2, (OR (AND (NOT p0) p1) (AND p1 p2)), (OR (AND (NOT p0) p1) (AND p1 p2)), false, (AND p1 p2), (AND p1 p2), (AND (NOT p0) p1 p2), (AND (NOT p0) p1 p2)]
Reduction of identical properties reduced properties to check from 21 to 20
RANDOM walk for 40000 steps (88 resets) in 2456 ms. (16 steps per ms) remains 6/20 properties
BEST_FIRST walk for 40002 steps (40 resets) in 1903 ms. (21 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (40 resets) in 1683 ms. (23 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (40 resets) in 1720 ms. (23 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (40 resets) in 1409 ms. (28 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (40 resets) in 1310 ms. (30 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (40 resets) in 1310 ms. (30 steps per ms) remains 6/6 properties
[2024-05-21 10:25:31] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
// Phase 1: matrix 245 rows 123 cols
[2024-05-21 10:25:31] [INFO ] Computed 5 invariants in 2 ms
[2024-05-21 10:25:31] [INFO ] State equation strengthened by 20 read => feed constraints.
Problem apf8 is UNSAT
Problem apf10 is UNSAT
Problem apf16 is UNSAT
Problem apf17 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 2/2 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 0/2 constraints. Problems are: Problem set: 4 solved, 2 unsolved
Problem apf4 is UNSAT
Problem apf15 is UNSAT
After SMT solving in domain Real declared 123/368 variables, and 5 constraints, problems are : Problem set: 6 solved, 0 unsolved in 97 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/123 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 476ms problems are : Problem set: 6 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 7 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p3 (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) p1 p2))), (X p3), (X (AND p3 (NOT p2))), (X (NOT (AND p0 p1))), (X (NOT (AND p3 p0))), (X (NOT (AND p3 p0 p1))), (X (NOT (AND (NOT p0) p2))), (X (NOT p0)), (X (NOT (AND p3 p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X p3)), (X (X (AND p3 (NOT p2)))), (X (X (OR (NOT p0) (NOT p2)))), (X (X (NOT (AND p3 p0 p1)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p3 (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p3 p0 p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p3 p1 (NOT p2))))), (X (X (NOT (AND p3 p0)))), (X (X (OR (AND p3 (NOT p0)) (AND p3 (NOT p2))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p3 p0 p1 p2)))), (X (X (NOT p0))), (X (X (NOT (AND p3 p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p3) (G (NOT p3)))), (G (OR (NOT p0) (NOT p1) (NOT p2) (NOT p3))), (G (OR (NOT p0) (NOT p2))), (G (OR (NOT p0) (NOT p1) (NOT p2))), (G (OR (NOT p0) (NOT p2))), (G (OR (NOT p0) (NOT p2) (NOT p3))), (G (OR (NOT p0) (NOT p3))), (G (OR (NOT p0) (NOT p1) (NOT p3)))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p2)))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (AND (NOT p0) p3) (AND (NOT p2) p3)))), (F (NOT (OR (NOT p2) (NOT p3)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p1) p2 (NOT p3)))), (F (NOT (OR (NOT p1) p2))), (F (NOT (AND (NOT p2) p3))), (F p2), (F p0), (F (NOT p3)), (F (NOT (OR p0 (NOT p1) (NOT p2)))), (F (NOT (OR p0 (NOT p1) (NOT p2) (NOT p3)))), (F p1)]
Knowledge based reduction with 43 factoid took 1325 ms. Reduced automaton from 9 states, 34 edges and 4 AP (stutter sensitive) to 7 states, 17 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 362 ms :[(OR (AND (NOT p0) p1) (AND p1 p2)), p2, (OR (AND (NOT p0) p1) (AND p1 p2)), (OR (AND (NOT p0) p1) (AND p1 p2)), false, (AND p1 p2), (AND p1 p2)]
Stuttering acceptance computed with spot in 325 ms :[(OR (AND (NOT p0) p1) (AND p1 p2)), p2, (OR (AND (NOT p0) p1) (AND p1 p2)), (OR (AND (NOT p0) p1) (AND p1 p2)), false, (AND p1 p2), (AND p1 p2)]
Support contains 119 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 1225/1225 transitions.
Applied a total of 0 rules in 12 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Running 1222 sub problems to find dead transitions.
[2024-05-21 10:25:34] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 10:25:34] [INFO ] Invariant cache hit.
[2024-05-21 10:25:34] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-05-21 10:25:44] [INFO ] Deduced a trap composed of 5 places in 291 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 123/368 variables, and 6 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/123 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 245/368 variables, 123/129 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/368 variables, 20/149 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 368/368 variables, and 1371 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20351 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
After SMT, in 46457ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 46482ms
[2024-05-21 10:26:20] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 10:26:20] [INFO ] Invariant cache hit.
[2024-05-21 10:26:20] [INFO ] Implicit Places using invariants in 119 ms returned []
[2024-05-21 10:26:20] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 10:26:20] [INFO ] Invariant cache hit.
[2024-05-21 10:26:20] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 10:26:21] [INFO ] Implicit Places using invariants and state equation in 380 ms returned []
Implicit Place search using SMT with State Equation took 505 ms to find 0 implicit places.
Running 1222 sub problems to find dead transitions.
[2024-05-21 10:26:21] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 10:26:21] [INFO ] Invariant cache hit.
[2024-05-21 10:26:21] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-05-21 10:26:32] [INFO ] Deduced a trap composed of 5 places in 257 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 245/368 variables, 123/129 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/368 variables, 20/149 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 368/368 variables, and 149 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 245/368 variables, 123/129 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/368 variables, 20/149 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 1222/1371 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 368/368 variables, and 1371 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 30071 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
After SMT, in 66881ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 66914ms
Finished structural reductions in LTL mode , in 1 iterations and 113923 ms. Remains : 123/123 places, 1225/1225 transitions.
Computed a total of 106 stabilizing places and 201 stable transitions
Computed a total of 106 stabilizing places and 201 stable transitions
Detected a total of 106/123 stabilizing places and 201/1225 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/4 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p1) p3 (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X p3), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT p2)), (X (AND (NOT p2) p3)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p2))), (X (X p3)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p2 p3)))), (X (X (NOT p0))), (X (X (NOT (AND p2 p1)))), (X (X (AND (NOT p2) p3))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 337 ms. Reduced automaton from 7 states, 17 edges and 4 AP (stutter sensitive) to 7 states, 17 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 362 ms :[(OR (AND (NOT p0) p1) (AND p1 p2)), p2, (OR (AND (NOT p0) p1) (AND p1 p2)), (OR (AND (NOT p0) p1) (AND p1 p2)), false, (AND p1 p2), (AND p1 p2)]
RANDOM walk for 783 steps (0 resets) in 48 ms. (15 steps per ms) remains 0/9 properties
Knowledge obtained : [(AND (NOT p2) (NOT p1) p3 (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X p3), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT p2)), (X (AND (NOT p2) p3)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p2))), (X (X p3)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p2 p3)))), (X (X (NOT p0))), (X (X (NOT (AND p2 p1)))), (X (X (AND (NOT p2) p3))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(F (NOT (OR (NOT p2) (NOT p3)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p2) p3))), (F p0), (F p2), (F (NOT p3)), (F (NOT (OR p0 (NOT p1)))), (F p1), (F (NOT (OR (NOT p1) (NOT p2))))]
Knowledge based reduction with 19 factoid took 741 ms. Reduced automaton from 7 states, 17 edges and 4 AP (stutter sensitive) to 7 states, 17 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 408 ms :[(OR (AND (NOT p0) p1) (AND p1 p2)), p2, (OR (AND (NOT p0) p1) (AND p1 p2)), (OR (AND (NOT p0) p1) (AND p1 p2)), false, (AND p1 p2), (AND p1 p2)]
Stuttering acceptance computed with spot in 400 ms :[(OR (AND (NOT p0) p1) (AND p1 p2)), p2, (OR (AND (NOT p0) p1) (AND p1 p2)), (OR (AND (NOT p0) p1) (AND p1 p2)), false, (AND p1 p2), (AND p1 p2)]
Stuttering acceptance computed with spot in 424 ms :[(OR (AND (NOT p0) p1) (AND p1 p2)), p2, (OR (AND (NOT p0) p1) (AND p1 p2)), (OR (AND (NOT p0) p1) (AND p1 p2)), false, (AND p1 p2), (AND p1 p2)]
Product exploration explored 100000 steps with 1148 reset in 1022 ms.
Product exploration explored 100000 steps with 1155 reset in 1136 ms.
Support contains 119 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 1225/1225 transitions.
Applied a total of 0 rules in 9 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Running 1222 sub problems to find dead transitions.
[2024-05-21 10:27:33] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 10:27:33] [INFO ] Invariant cache hit.
[2024-05-21 10:27:33] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-05-21 10:27:42] [INFO ] Deduced a trap composed of 5 places in 165 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 123/368 variables, and 6 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/123 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 245/368 variables, 123/129 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/368 variables, 20/149 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 368/368 variables, and 1371 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20628 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
After SMT, in 45374ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 45402ms
[2024-05-21 10:28:18] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 10:28:18] [INFO ] Invariant cache hit.
[2024-05-21 10:28:18] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-05-21 10:28:18] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 10:28:18] [INFO ] Invariant cache hit.
[2024-05-21 10:28:19] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 10:28:19] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 340 ms to find 0 implicit places.
Running 1222 sub problems to find dead transitions.
[2024-05-21 10:28:19] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 10:28:19] [INFO ] Invariant cache hit.
[2024-05-21 10:28:19] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-05-21 10:28:29] [INFO ] Deduced a trap composed of 5 places in 186 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 245/368 variables, 123/129 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/368 variables, 20/149 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 368/368 variables, and 149 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 245/368 variables, 123/129 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/368 variables, 20/149 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 1222/1371 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 368/368 variables, and 1371 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
After SMT, in 66350ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 66367ms
Finished structural reductions in LTL mode , in 1 iterations and 112142 ms. Remains : 123/123 places, 1225/1225 transitions.
Treatment of property BridgeAndVehicles-PT-V50P20N10-LTLFireability-02 finished in 289922 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((G(p0) U X(p1))))&&G((G(p1)||X(F(p2))))))'
Support contains 107 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 1228/1228 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 125 transition count 1227
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 125 transition count 1227
Applied a total of 2 rules in 7 ms. Remains 125 /126 variables (removed 1) and now considering 1227/1228 (removed 1) transitions.
Running 1224 sub problems to find dead transitions.
[2024-05-21 10:29:25] [INFO ] Flow matrix only has 247 transitions (discarded 980 similar events)
// Phase 1: matrix 247 rows 125 cols
[2024-05-21 10:29:25] [INFO ] Computed 5 invariants in 5 ms
[2024-05-21 10:29:25] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
[2024-05-21 10:29:35] [INFO ] Deduced a trap composed of 5 places in 214 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 125/372 variables, and 6 constraints, problems are : Problem set: 0 solved, 1224 unsolved in 20077 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/125 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1224/1224 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1224 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
Problem TDEAD50 is UNSAT
Problem TDEAD154 is UNSAT
At refinement iteration 3 (OVERLAPS) 247/372 variables, 125/131 constraints. Problems are: Problem set: 2 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/372 variables, 20/151 constraints. Problems are: Problem set: 2 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 372/372 variables, and 1373 constraints, problems are : Problem set: 2 solved, 1222 unsolved in 21203 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 125/125 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1224 constraints, Known Traps: 1/1 constraints]
After SMT, in 47488ms problems are : Problem set: 2 solved, 1222 unsolved
Search for dead transitions found 2 dead transitions in 47500ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 2 transitions.
[2024-05-21 10:30:13] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
// Phase 1: matrix 245 rows 125 cols
[2024-05-21 10:30:13] [INFO ] Computed 7 invariants in 2 ms
[2024-05-21 10:30:13] [INFO ] Implicit Places using invariants in 172 ms returned [52]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 178 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 124/126 places, 1225/1228 transitions.
Applied a total of 0 rules in 10 ms. Remains 124 /124 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 47700 ms. Remains : 124/126 places, 1225/1228 transitions.
Stuttering acceptance computed with spot in 309 ms :[(NOT p1), (NOT p1), (NOT p2), (NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N10-LTLFireability-03
Product exploration explored 100000 steps with 24964 reset in 606 ms.
Product exploration explored 100000 steps with 24999 reset in 572 ms.
Computed a total of 107 stabilizing places and 201 stable transitions
Computed a total of 107 stabilizing places and 201 stable transitions
Detected a total of 107/124 stabilizing places and 201/1225 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2)), (X p1), (X (NOT p0)), (X (NOT p2)), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p2))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 238 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 399 ms :[(NOT p1), (NOT p2), (AND (NOT p1) p0), (NOT p1), true, (NOT p0)]
Reduction of identical properties reduced properties to check from 7 to 6
RANDOM walk for 741 steps (0 resets) in 30 ms. (23 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2)), (X p1), (X (NOT p0)), (X (NOT p2)), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p2))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p2), (F (NOT (AND p1 (NOT p0)))), (F (NOT p1)), (F p0), (F (NOT (OR p1 (NOT p0)))), (F (NOT (OR p1 p0))), (F (NOT (OR p1 p0)))]
Property proved to be false thanks to negative knowledge :(F (NOT (OR p1 p0)))
Knowledge based reduction with 10 factoid took 537 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA BridgeAndVehicles-PT-V50P20N10-LTLFireability-03 FALSE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-PT-V50P20N10-LTLFireability-03 finished in 50500 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 (F(p2)||p1))&&F((!p0&&G(!p3)))))'
Support contains 65 out of 126 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 126/126 places, 1228/1228 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 125 transition count 1227
Applied a total of 2 rules in 162 ms. Remains 125 /126 variables (removed 1) and now considering 1227/1228 (removed 1) transitions.
Running 1224 sub problems to find dead transitions.
[2024-05-21 10:30:16] [INFO ] Flow matrix only has 247 transitions (discarded 980 similar events)
// Phase 1: matrix 247 rows 125 cols
[2024-05-21 10:30:16] [INFO ] Computed 5 invariants in 4 ms
[2024-05-21 10:30:16] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
[2024-05-21 10:30:26] [INFO ] Deduced a trap composed of 5 places in 166 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
Problem TDEAD50 is UNSAT
Problem TDEAD154 is UNSAT
At refinement iteration 3 (OVERLAPS) 247/372 variables, 125/131 constraints. Problems are: Problem set: 2 solved, 1222 unsolved
SMT process timed out in 25851ms, After SMT, problems are : Problem set: 2 solved, 1222 unsolved
Search for dead transitions found 2 dead transitions in 25870ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 2 transitions.
[2024-05-21 10:30:42] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
// Phase 1: matrix 245 rows 125 cols
[2024-05-21 10:30:42] [INFO ] Computed 7 invariants in 4 ms
[2024-05-21 10:30:42] [INFO ] Implicit Places using invariants in 159 ms returned [52, 107]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 163 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 123/126 places, 1225/1228 transitions.
Applied a total of 0 rules in 75 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 26277 ms. Remains : 123/126 places, 1225/1228 transitions.
Stuttering acceptance computed with spot in 225 ms :[(OR p3 p0 (AND (NOT p1) (NOT p2))), (NOT p2), (OR p3 p0), p3, (AND (NOT p1) (NOT p2))]
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N10-LTLFireability-04
Product exploration explored 100000 steps with 268 reset in 735 ms.
Product exploration explored 100000 steps with 268 reset in 891 ms.
Computed a total of 106 stabilizing places and 201 stable transitions
Computed a total of 106 stabilizing places and 201 stable transitions
Detected a total of 106/123 stabilizing places and 201/1225 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/4 atomic propositions.
Knowledge obtained : [(AND p1 p2 (NOT p0) p3), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X p3), (X (OR p0 p3)), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT p0)), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X p3)), (X (X (OR p0 p3))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p2) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT p2)), (X p2), (X p1), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT p2))), (X (X p2)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 13 factoid took 861 ms. Reduced automaton from 5 states, 11 edges and 4 AP (stutter insensitive) to 4 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 185 ms :[(OR p3 p0), (OR p3 p0), p3, false]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 674 steps (0 resets) in 12 ms. (51 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p1 p2 (NOT p0) p3), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X p3), (X (OR p0 p3)), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT p0)), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X p3)), (X (X (OR p0 p3))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p2) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT p2)), (X p2), (X p1), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT p2))), (X (X p2)), (X (X p1)), (X (X (NOT p1))), (F p0), (F (NOT p3)), (F (NOT (OR p0 p3))), (F (NOT (OR p0 p3)))]
Knowledge based reduction with 13 factoid took 992 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter insensitive) to 4 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 237 ms :[(OR p3 p0), (OR p3 p0), p3, false]
Stuttering acceptance computed with spot in 235 ms :[(OR p3 p0), (OR p3 p0), p3, false]
[2024-05-21 10:30:46] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
// Phase 1: matrix 245 rows 123 cols
[2024-05-21 10:30:46] [INFO ] Computed 5 invariants in 2 ms
[2024-05-21 10:30:47] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-21 10:30:47] [INFO ] [Real]Absence check using state equation in 189 ms returned sat
[2024-05-21 10:30:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 10:30:48] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-05-21 10:30:48] [INFO ] [Nat]Absence check using state equation in 99 ms returned sat
[2024-05-21 10:30:48] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 10:30:48] [INFO ] [Nat]Added 20 Read/Feed constraints in 26 ms returned sat
[2024-05-21 10:30:48] [INFO ] Deduced a trap composed of 14 places in 183 ms of which 1 ms to minimize.
[2024-05-21 10:30:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 249 ms
[2024-05-21 10:30:48] [INFO ] Computed and/alt/rep : 108/216/108 causal constraints (skipped 134 transitions) in 50 ms.
[2024-05-21 10:30:49] [INFO ] Added : 27 causal constraints over 7 iterations in 331 ms. Result :sat
Could not prove EG p3
Support contains 53 out of 123 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 123/123 places, 1225/1225 transitions.
Applied a total of 0 rules in 89 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Running 1222 sub problems to find dead transitions.
[2024-05-21 10:30:49] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 10:30:49] [INFO ] Invariant cache hit.
[2024-05-21 10:30:49] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-05-21 10:30:59] [INFO ] Deduced a trap composed of 5 places in 226 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 123/368 variables, and 6 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/123 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 245/368 variables, 123/129 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/368 variables, 20/149 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 368/368 variables, and 1371 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 21032 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
After SMT, in 47171ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 47188ms
[2024-05-21 10:31:36] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 10:31:36] [INFO ] Invariant cache hit.
[2024-05-21 10:31:36] [INFO ] Implicit Places using invariants in 191 ms returned []
[2024-05-21 10:31:36] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 10:31:36] [INFO ] Invariant cache hit.
[2024-05-21 10:31:36] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 10:31:37] [INFO ] Implicit Places using invariants and state equation in 359 ms returned []
Implicit Place search using SMT with State Equation took 567 ms to find 0 implicit places.
[2024-05-21 10:31:37] [INFO ] Redundant transitions in 13 ms returned []
Running 1222 sub problems to find dead transitions.
[2024-05-21 10:31:37] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 10:31:37] [INFO ] Invariant cache hit.
[2024-05-21 10:31:37] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-05-21 10:31:49] [INFO ] Deduced a trap composed of 5 places in 130 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 245/368 variables, 123/129 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/368 variables, 20/149 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 368/368 variables, and 149 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 245/368 variables, 123/129 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/368 variables, 20/149 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 1222/1371 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 368/368 variables, and 1371 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
After SMT, in 66232ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 66248ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 114123 ms. Remains : 123/123 places, 1225/1225 transitions.
Computed a total of 106 stabilizing places and 201 stable transitions
Computed a total of 106 stabilizing places and 201 stable transitions
Detected a total of 106/123 stabilizing places and 201/1225 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p3), (X p3), (X (OR p0 p3)), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT p0)), (X (X p3)), (X (X (OR p0 p3))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 222 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter insensitive) to 4 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 180 ms :[(OR p3 p0), (OR p3 p0), p3, false]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 641 steps (0 resets) in 9 ms. (64 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) p3), (X p3), (X (OR p0 p3)), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT p0)), (X (X p3)), (X (X (OR p0 p3))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(F p0), (F (NOT p3)), (F (NOT (OR p0 p3))), (F (NOT (OR p0 p3)))]
Knowledge based reduction with 11 factoid took 360 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter insensitive) to 4 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 123 ms :[(OR p3 p0), (OR p3 p0), p3, false]
Stuttering acceptance computed with spot in 128 ms :[(OR p3 p0), (OR p3 p0), p3, false]
[2024-05-21 10:32:44] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 10:32:44] [INFO ] Invariant cache hit.
[2024-05-21 10:32:45] [INFO ] [Real]Absence check using 5 positive place invariants in 12 ms returned sat
[2024-05-21 10:32:45] [INFO ] [Real]Absence check using state equation in 267 ms returned sat
[2024-05-21 10:32:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 10:32:46] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-05-21 10:32:46] [INFO ] [Nat]Absence check using state equation in 87 ms returned sat
[2024-05-21 10:32:46] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 10:32:46] [INFO ] [Nat]Added 20 Read/Feed constraints in 42 ms returned sat
[2024-05-21 10:32:46] [INFO ] Deduced a trap composed of 14 places in 158 ms of which 2 ms to minimize.
[2024-05-21 10:32:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 234 ms
[2024-05-21 10:32:46] [INFO ] Computed and/alt/rep : 108/216/108 causal constraints (skipped 134 transitions) in 50 ms.
[2024-05-21 10:32:46] [INFO ] Added : 27 causal constraints over 10 iterations in 338 ms. Result :sat
Could not prove EG p3
Stuttering acceptance computed with spot in 175 ms :[(OR p3 p0), (OR p3 p0), p3, false]
Product exploration explored 100000 steps with 268 reset in 897 ms.
Product exploration explored 100000 steps with 268 reset in 759 ms.
Support contains 53 out of 123 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 123/123 places, 1225/1225 transitions.
Applied a total of 0 rules in 59 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Running 1222 sub problems to find dead transitions.
[2024-05-21 10:32:48] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 10:32:48] [INFO ] Invariant cache hit.
[2024-05-21 10:32:48] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-05-21 10:32:58] [INFO ] Deduced a trap composed of 5 places in 185 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 123/368 variables, and 6 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/123 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 245/368 variables, 123/129 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/368 variables, 20/149 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 368/368 variables, and 1371 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 21617 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
After SMT, in 47793ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 47808ms
[2024-05-21 10:33:36] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 10:33:36] [INFO ] Invariant cache hit.
[2024-05-21 10:33:37] [INFO ] Implicit Places using invariants in 361 ms returned []
[2024-05-21 10:33:37] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 10:33:37] [INFO ] Invariant cache hit.
[2024-05-21 10:33:37] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 10:33:37] [INFO ] Implicit Places using invariants and state equation in 608 ms returned []
Implicit Place search using SMT with State Equation took 983 ms to find 0 implicit places.
[2024-05-21 10:33:37] [INFO ] Redundant transitions in 30 ms returned []
Running 1222 sub problems to find dead transitions.
[2024-05-21 10:33:37] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 10:33:37] [INFO ] Invariant cache hit.
[2024-05-21 10:33:37] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-05-21 10:33:48] [INFO ] Deduced a trap composed of 5 places in 144 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 245/368 variables, 123/129 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
SMT process timed out in 36074ms, After SMT, problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 36106ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 85003 ms. Remains : 123/123 places, 1225/1225 transitions.
Treatment of property BridgeAndVehicles-PT-V50P20N10-LTLFireability-04 finished in 237719 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(F(!p1))&&p0)))'
Support contains 53 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 1228/1228 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 125 transition count 1227
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 125 transition count 1227
Applied a total of 2 rules in 21 ms. Remains 125 /126 variables (removed 1) and now considering 1227/1228 (removed 1) transitions.
Running 1224 sub problems to find dead transitions.
[2024-05-21 10:34:13] [INFO ] Flow matrix only has 247 transitions (discarded 980 similar events)
// Phase 1: matrix 247 rows 125 cols
[2024-05-21 10:34:13] [INFO ] Computed 5 invariants in 2 ms
[2024-05-21 10:34:14] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
[2024-05-21 10:34:23] [INFO ] Deduced a trap composed of 5 places in 177 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 125/372 variables, and 6 constraints, problems are : Problem set: 0 solved, 1224 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/125 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1224/1224 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1224 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
Problem TDEAD50 is UNSAT
Problem TDEAD154 is UNSAT
At refinement iteration 3 (OVERLAPS) 247/372 variables, 125/131 constraints. Problems are: Problem set: 2 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/372 variables, 20/151 constraints. Problems are: Problem set: 2 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 372/372 variables, and 1373 constraints, problems are : Problem set: 2 solved, 1222 unsolved in 22001 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 125/125 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1224 constraints, Known Traps: 1/1 constraints]
After SMT, in 47754ms problems are : Problem set: 2 solved, 1222 unsolved
Search for dead transitions found 2 dead transitions in 47771ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 2 transitions.
[2024-05-21 10:35:01] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
// Phase 1: matrix 245 rows 125 cols
[2024-05-21 10:35:01] [INFO ] Computed 7 invariants in 4 ms
[2024-05-21 10:35:01] [INFO ] Implicit Places using invariants in 226 ms returned [52]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 240 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 124/126 places, 1225/1228 transitions.
Applied a total of 0 rules in 6 ms. Remains 124 /124 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 48044 ms. Remains : 124/126 places, 1225/1228 transitions.
Stuttering acceptance computed with spot in 218 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), true, p1, p1]
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N10-LTLFireability-07
Product exploration explored 100000 steps with 1437 reset in 730 ms.
Product exploration explored 100000 steps with 1462 reset in 769 ms.
Computed a total of 107 stabilizing places and 201 stable transitions
Computed a total of 107 stabilizing places and 201 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X p0), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 132 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 153 ms :[p1, p1]
RANDOM walk for 243 steps (0 resets) in 11 ms. (20 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X p0), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 5 factoid took 174 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 134 ms :[p1, p1]
Stuttering acceptance computed with spot in 87 ms :[p1, p1]
Support contains 53 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 1225/1225 transitions.
Applied a total of 0 rules in 87 ms. Remains 124 /124 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Running 1222 sub problems to find dead transitions.
[2024-05-21 10:35:04] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
// Phase 1: matrix 245 rows 124 cols
[2024-05-21 10:35:04] [INFO ] Computed 6 invariants in 15 ms
[2024-05-21 10:35:04] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-05-21 10:35:14] [INFO ] Deduced a trap composed of 5 places in 150 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 124/369 variables, and 7 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20050 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/124 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 245/369 variables, 124/131 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
SMT process timed out in 45867ms, After SMT, problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 45885ms
[2024-05-21 10:35:50] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 10:35:50] [INFO ] Invariant cache hit.
[2024-05-21 10:35:50] [INFO ] Implicit Places using invariants in 234 ms returned []
[2024-05-21 10:35:50] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 10:35:50] [INFO ] Invariant cache hit.
[2024-05-21 10:35:50] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 10:35:51] [INFO ] Implicit Places using invariants and state equation in 421 ms returned []
Implicit Place search using SMT with State Equation took 676 ms to find 0 implicit places.
[2024-05-21 10:35:51] [INFO ] Redundant transitions in 14 ms returned []
Running 1222 sub problems to find dead transitions.
[2024-05-21 10:35:51] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 10:35:51] [INFO ] Invariant cache hit.
[2024-05-21 10:35:51] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-05-21 10:36:01] [INFO ] Deduced a trap composed of 5 places in 163 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 245/369 variables, 124/131 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/369 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 369/369 variables, and 151 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 124/124 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 245/369 variables, 124/131 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/369 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/369 variables, 1222/1373 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 369/369 variables, and 1373 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 30064 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 124/124 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
After SMT, in 64972ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 65009ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 111698 ms. Remains : 124/124 places, 1225/1225 transitions.
Computed a total of 107 stabilizing places and 201 stable transitions
Computed a total of 107 stabilizing places and 201 stable transitions
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 144 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 135 ms :[p1, p1]
RANDOM walk for 178 steps (0 resets) in 9 ms. (17 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 3 factoid took 185 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 132 ms :[p1, p1]
Stuttering acceptance computed with spot in 125 ms :[p1, p1]
Stuttering acceptance computed with spot in 138 ms :[p1, p1]
Product exploration explored 100000 steps with 1457 reset in 926 ms.
Product exploration explored 100000 steps with 1475 reset in 789 ms.
Support contains 53 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 1225/1225 transitions.
Applied a total of 0 rules in 62 ms. Remains 124 /124 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Running 1222 sub problems to find dead transitions.
[2024-05-21 10:36:58] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 10:36:58] [INFO ] Invariant cache hit.
[2024-05-21 10:36:58] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-05-21 10:37:09] [INFO ] Deduced a trap composed of 5 places in 249 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 124/369 variables, and 7 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20065 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/124 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 245/369 variables, 124/131 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/369 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 369/369 variables, and 1373 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20949 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 124/124 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
After SMT, in 46537ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 46551ms
[2024-05-21 10:37:45] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 10:37:45] [INFO ] Invariant cache hit.
[2024-05-21 10:37:45] [INFO ] Implicit Places using invariants in 308 ms returned []
[2024-05-21 10:37:45] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 10:37:45] [INFO ] Invariant cache hit.
[2024-05-21 10:37:45] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 10:37:46] [INFO ] Implicit Places using invariants and state equation in 419 ms returned []
Implicit Place search using SMT with State Equation took 745 ms to find 0 implicit places.
[2024-05-21 10:37:46] [INFO ] Redundant transitions in 21 ms returned []
Running 1222 sub problems to find dead transitions.
[2024-05-21 10:37:46] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 10:37:46] [INFO ] Invariant cache hit.
[2024-05-21 10:37:46] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-05-21 10:37:56] [INFO ] Deduced a trap composed of 5 places in 168 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 124/369 variables, and 7 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/124 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 245/369 variables, 124/131 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/369 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/369 variables, 1222/1373 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 369/369 variables, and 1373 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 30056 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 124/124 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
After SMT, in 66297ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 66312ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 113705 ms. Remains : 124/124 places, 1225/1225 transitions.
Treatment of property BridgeAndVehicles-PT-V50P20N10-LTLFireability-07 finished in 278713 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((G(p1)||p0))))'
Support contains 7 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 1228/1228 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 125 transition count 1227
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 125 transition count 1227
Applied a total of 2 rules in 14 ms. Remains 125 /126 variables (removed 1) and now considering 1227/1228 (removed 1) transitions.
Running 1224 sub problems to find dead transitions.
[2024-05-21 10:38:52] [INFO ] Flow matrix only has 247 transitions (discarded 980 similar events)
// Phase 1: matrix 247 rows 125 cols
[2024-05-21 10:38:52] [INFO ] Computed 5 invariants in 2 ms
[2024-05-21 10:38:52] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
[2024-05-21 10:39:03] [INFO ] Deduced a trap composed of 5 places in 160 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 125/372 variables, and 6 constraints, problems are : Problem set: 0 solved, 1224 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/125 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1224/1224 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1224 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
Problem TDEAD50 is UNSAT
Problem TDEAD154 is UNSAT
At refinement iteration 3 (OVERLAPS) 247/372 variables, 125/131 constraints. Problems are: Problem set: 2 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/372 variables, 20/151 constraints. Problems are: Problem set: 2 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 372/372 variables, and 1373 constraints, problems are : Problem set: 2 solved, 1222 unsolved in 21811 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 125/125 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1224 constraints, Known Traps: 1/1 constraints]
After SMT, in 48188ms problems are : Problem set: 2 solved, 1222 unsolved
Search for dead transitions found 2 dead transitions in 48210ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 2 transitions.
[2024-05-21 10:39:40] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
// Phase 1: matrix 245 rows 125 cols
[2024-05-21 10:39:40] [INFO ] Computed 7 invariants in 4 ms
[2024-05-21 10:39:41] [INFO ] Implicit Places using invariants in 268 ms returned [108]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 272 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 124/126 places, 1225/1228 transitions.
Applied a total of 0 rules in 6 ms. Remains 124 /124 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 48507 ms. Remains : 124/126 places, 1225/1228 transitions.
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N10-LTLFireability-09
Product exploration explored 100000 steps with 50000 reset in 517 ms.
Product exploration explored 100000 steps with 50000 reset in 527 ms.
Computed a total of 107 stabilizing places and 201 stable transitions
Computed a total of 107 stabilizing places and 201 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 24 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BridgeAndVehicles-PT-V50P20N10-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-PT-V50P20N10-LTLFireability-09 finished in 49710 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(X(G(p1)))))'
Support contains 3 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 1228/1228 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 125 transition count 1227
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 125 transition count 1227
Applied a total of 2 rules in 10 ms. Remains 125 /126 variables (removed 1) and now considering 1227/1228 (removed 1) transitions.
Running 1224 sub problems to find dead transitions.
[2024-05-21 10:39:42] [INFO ] Flow matrix only has 247 transitions (discarded 980 similar events)
// Phase 1: matrix 247 rows 125 cols
[2024-05-21 10:39:42] [INFO ] Computed 5 invariants in 3 ms
[2024-05-21 10:39:42] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
[2024-05-21 10:39:53] [INFO ] Deduced a trap composed of 5 places in 213 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 125/372 variables, and 6 constraints, problems are : Problem set: 0 solved, 1224 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/125 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1224/1224 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1224 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
Problem TDEAD50 is UNSAT
Problem TDEAD154 is UNSAT
At refinement iteration 3 (OVERLAPS) 247/372 variables, 125/131 constraints. Problems are: Problem set: 2 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/372 variables, 20/151 constraints. Problems are: Problem set: 2 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 372/372 variables, and 1373 constraints, problems are : Problem set: 2 solved, 1222 unsolved in 22051 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 125/125 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1224 constraints, Known Traps: 1/1 constraints]
After SMT, in 48470ms problems are : Problem set: 2 solved, 1222 unsolved
Search for dead transitions found 2 dead transitions in 48487ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 2 transitions.
[2024-05-21 10:40:30] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
// Phase 1: matrix 245 rows 125 cols
[2024-05-21 10:40:30] [INFO ] Computed 7 invariants in 2 ms
[2024-05-21 10:40:31] [INFO ] Implicit Places using invariants in 393 ms returned [52, 108]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 398 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 123/126 places, 1225/1228 transitions.
Applied a total of 0 rules in 6 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 48905 ms. Remains : 123/126 places, 1225/1228 transitions.
Stuttering acceptance computed with spot in 165 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), true]
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N10-LTLFireability-12
Entered a terminal (fully accepting) state of product in 95 steps with 0 reset in 1 ms.
FORMULA BridgeAndVehicles-PT-V50P20N10-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V50P20N10-LTLFireability-12 finished in 49095 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(p1)))'
Support contains 6 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 1228/1228 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 125 transition count 1227
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 125 transition count 1227
Applied a total of 2 rules in 15 ms. Remains 125 /126 variables (removed 1) and now considering 1227/1228 (removed 1) transitions.
Running 1224 sub problems to find dead transitions.
[2024-05-21 10:40:31] [INFO ] Flow matrix only has 247 transitions (discarded 980 similar events)
// Phase 1: matrix 247 rows 125 cols
[2024-05-21 10:40:31] [INFO ] Computed 5 invariants in 2 ms
[2024-05-21 10:40:31] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
[2024-05-21 10:40:42] [INFO ] Deduced a trap composed of 5 places in 183 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 125/372 variables, and 6 constraints, problems are : Problem set: 0 solved, 1224 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/125 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1224/1224 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1224 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
Problem TDEAD50 is UNSAT
Problem TDEAD154 is UNSAT
At refinement iteration 3 (OVERLAPS) 247/372 variables, 125/131 constraints. Problems are: Problem set: 2 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/372 variables, 20/151 constraints. Problems are: Problem set: 2 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 372/372 variables, and 1373 constraints, problems are : Problem set: 2 solved, 1222 unsolved in 21110 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 125/125 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1224 constraints, Known Traps: 1/1 constraints]
After SMT, in 46777ms problems are : Problem set: 2 solved, 1222 unsolved
Search for dead transitions found 2 dead transitions in 46789ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 2 transitions.
[2024-05-21 10:41:18] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
// Phase 1: matrix 245 rows 125 cols
[2024-05-21 10:41:18] [INFO ] Computed 7 invariants in 4 ms
[2024-05-21 10:41:18] [INFO ] Implicit Places using invariants in 368 ms returned [52]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 371 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 124/126 places, 1225/1228 transitions.
Applied a total of 0 rules in 5 ms. Remains 124 /124 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 47183 ms. Remains : 124/126 places, 1225/1228 transitions.
Stuttering acceptance computed with spot in 185 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N10-LTLFireability-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA BridgeAndVehicles-PT-V50P20N10-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V50P20N10-LTLFireability-13 finished in 47386 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 126 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 126/126 places, 1228/1228 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 125 transition count 1227
Applied a total of 2 rules in 85 ms. Remains 125 /126 variables (removed 1) and now considering 1227/1228 (removed 1) transitions.
Running 1224 sub problems to find dead transitions.
[2024-05-21 10:41:18] [INFO ] Flow matrix only has 247 transitions (discarded 980 similar events)
// Phase 1: matrix 247 rows 125 cols
[2024-05-21 10:41:18] [INFO ] Computed 5 invariants in 1 ms
[2024-05-21 10:41:18] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
[2024-05-21 10:41:28] [INFO ] Deduced a trap composed of 5 places in 138 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 125/372 variables, and 6 constraints, problems are : Problem set: 0 solved, 1224 unsolved in 20052 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/125 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1224/1224 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1224 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
Problem TDEAD50 is UNSAT
Problem TDEAD104 is UNSAT
At refinement iteration 3 (OVERLAPS) 247/372 variables, 125/131 constraints. Problems are: Problem set: 2 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/372 variables, 20/151 constraints. Problems are: Problem set: 2 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 372/372 variables, and 1373 constraints, problems are : Problem set: 2 solved, 1222 unsolved in 22059 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 125/125 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1224 constraints, Known Traps: 1/1 constraints]
After SMT, in 47881ms problems are : Problem set: 2 solved, 1222 unsolved
Search for dead transitions found 2 dead transitions in 47896ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 2 transitions.
[2024-05-21 10:42:06] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
// Phase 1: matrix 245 rows 125 cols
[2024-05-21 10:42:06] [INFO ] Computed 7 invariants in 3 ms
[2024-05-21 10:42:07] [INFO ] Implicit Places using invariants in 300 ms returned [52, 108]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 302 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 123/126 places, 1225/1228 transitions.
Applied a total of 0 rules in 104 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 48393 ms. Remains : 123/126 places, 1225/1228 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N10-LTLFireability-15
Product exploration explored 100000 steps with 5001 reset in 431 ms.
Product exploration explored 100000 steps with 5209 reset in 415 ms.
Computed a total of 106 stabilizing places and 201 stable transitions
Computed a total of 106 stabilizing places and 201 stable transitions
Detected a total of 106/123 stabilizing places and 201/1225 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 134 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
RANDOM walk for 108 steps (0 resets) in 4 ms. (21 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 128 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
[2024-05-21 10:42:08] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
// Phase 1: matrix 245 rows 123 cols
[2024-05-21 10:42:08] [INFO ] Computed 5 invariants in 6 ms
[2024-05-21 10:42:08] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-21 10:42:09] [INFO ] [Real]Absence check using state equation in 306 ms returned sat
[2024-05-21 10:42:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 10:42:09] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-21 10:42:09] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2024-05-21 10:42:09] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 10:42:09] [INFO ] [Nat]Added 20 Read/Feed constraints in 34 ms returned sat
[2024-05-21 10:42:09] [INFO ] Computed and/alt/rep : 108/216/108 causal constraints (skipped 134 transitions) in 36 ms.
[2024-05-21 10:42:09] [INFO ] Added : 12 causal constraints over 4 iterations in 158 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 123 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 123/123 places, 1225/1225 transitions.
Applied a total of 0 rules in 59 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Running 1222 sub problems to find dead transitions.
[2024-05-21 10:42:09] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 10:42:09] [INFO ] Invariant cache hit.
[2024-05-21 10:42:09] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-05-21 10:42:21] [INFO ] Deduced a trap composed of 5 places in 172 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 123/368 variables, and 6 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/123 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 245/368 variables, 123/129 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/368 variables, 20/149 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 368/368 variables, and 1371 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 21798 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
After SMT, in 48260ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 48277ms
[2024-05-21 10:42:58] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 10:42:58] [INFO ] Invariant cache hit.
[2024-05-21 10:42:58] [INFO ] Implicit Places using invariants in 274 ms returned []
[2024-05-21 10:42:58] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 10:42:58] [INFO ] Invariant cache hit.
[2024-05-21 10:42:58] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 10:42:59] [INFO ] Implicit Places using invariants and state equation in 781 ms returned []
Implicit Place search using SMT with State Equation took 1077 ms to find 0 implicit places.
[2024-05-21 10:42:59] [INFO ] Redundant transitions in 13 ms returned []
Running 1222 sub problems to find dead transitions.
[2024-05-21 10:42:59] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 10:42:59] [INFO ] Invariant cache hit.
[2024-05-21 10:42:59] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-05-21 10:43:11] [INFO ] Deduced a trap composed of 5 places in 246 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 123/368 variables, and 6 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/123 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 245/368 variables, 123/129 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/368 variables, 20/149 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 1222/1371 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 368/368 variables, and 1371 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
After SMT, in 67517ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 67533ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 116978 ms. Remains : 123/123 places, 1225/1225 transitions.
Computed a total of 106 stabilizing places and 201 stable transitions
Computed a total of 106 stabilizing places and 201 stable transitions
Detected a total of 106/123 stabilizing places and 201/1225 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 141 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(NOT p0)]
RANDOM walk for 22 steps (0 resets) in 5 ms. (3 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 143 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
[2024-05-21 10:44:07] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 10:44:07] [INFO ] Invariant cache hit.
[2024-05-21 10:44:07] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-21 10:44:08] [INFO ] [Real]Absence check using state equation in 266 ms returned sat
[2024-05-21 10:44:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 10:44:08] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-21 10:44:08] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2024-05-21 10:44:08] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 10:44:08] [INFO ] [Nat]Added 20 Read/Feed constraints in 33 ms returned sat
[2024-05-21 10:44:08] [INFO ] Computed and/alt/rep : 108/216/108 causal constraints (skipped 134 transitions) in 40 ms.
[2024-05-21 10:44:08] [INFO ] Added : 12 causal constraints over 4 iterations in 262 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Product exploration explored 100000 steps with 5216 reset in 602 ms.
Product exploration explored 100000 steps with 5164 reset in 484 ms.
Support contains 1 out of 123 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 123/123 places, 1225/1225 transitions.
Applied a total of 0 rules in 55 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Running 1222 sub problems to find dead transitions.
[2024-05-21 10:44:10] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 10:44:10] [INFO ] Invariant cache hit.
[2024-05-21 10:44:10] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-05-21 10:44:22] [INFO ] Deduced a trap composed of 5 places in 183 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 123/368 variables, and 6 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/123 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 245/368 variables, 123/129 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/368 variables, 20/149 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 368/368 variables, and 1371 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 21315 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
After SMT, in 48015ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 48030ms
[2024-05-21 10:44:58] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 10:44:58] [INFO ] Invariant cache hit.
[2024-05-21 10:44:58] [INFO ] Implicit Places using invariants in 389 ms returned []
[2024-05-21 10:44:58] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 10:44:58] [INFO ] Invariant cache hit.
[2024-05-21 10:44:58] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 10:45:02] [INFO ] Implicit Places using invariants and state equation in 4105 ms returned []
Implicit Place search using SMT with State Equation took 4499 ms to find 0 implicit places.
[2024-05-21 10:45:02] [INFO ] Redundant transitions in 29 ms returned []
Running 1222 sub problems to find dead transitions.
[2024-05-21 10:45:02] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 10:45:02] [INFO ] Invariant cache hit.
[2024-05-21 10:45:02] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-05-21 10:45:14] [INFO ] Deduced a trap composed of 5 places in 196 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 245/368 variables, 123/129 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
SMT process timed out in 37049ms, After SMT, problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 37068ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 89710 ms. Remains : 123/123 places, 1225/1225 transitions.
Treatment of property BridgeAndVehicles-PT-V50P20N10-LTLFireability-15 finished in 261081 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((F(p1)||p0))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((p0||G(F(!p1)))&&(X(!p2) U ((!p3&&X(!p2))||X(G(!p2)))))))'
Found a Shortening insensitive property : BridgeAndVehicles-PT-V50P20N10-LTLFireability-02
Stuttering acceptance computed with spot in 580 ms :[(OR p2 (AND (NOT p0) p1)), p2, (OR (AND (NOT p0) p1) (AND p1 p2)), (OR (AND (NOT p0) p1) (AND p1 p2)), false, (AND p1 p2), (AND p1 p2), (AND (NOT p0) p1 p2), (AND (NOT p0) p1 p2)]
Support contains 119 out of 126 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 126/126 places, 1228/1228 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 125 transition count 1227
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 125 transition count 1227
Applied a total of 2 rules in 37 ms. Remains 125 /126 variables (removed 1) and now considering 1227/1228 (removed 1) transitions.
Running 1224 sub problems to find dead transitions.
[2024-05-21 10:45:40] [INFO ] Flow matrix only has 247 transitions (discarded 980 similar events)
// Phase 1: matrix 247 rows 125 cols
[2024-05-21 10:45:41] [INFO ] Computed 5 invariants in 3 ms
[2024-05-21 10:45:41] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
[2024-05-21 10:45:51] [INFO ] Deduced a trap composed of 5 places in 171 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 125/372 variables, and 6 constraints, problems are : Problem set: 0 solved, 1224 unsolved in 20059 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/125 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1224/1224 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1224 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
Problem TDEAD50 is UNSAT
Problem TDEAD154 is UNSAT
At refinement iteration 3 (OVERLAPS) 247/372 variables, 125/131 constraints. Problems are: Problem set: 2 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/372 variables, 20/151 constraints. Problems are: Problem set: 2 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 372/372 variables, and 1373 constraints, problems are : Problem set: 2 solved, 1222 unsolved in 21729 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 125/125 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1224 constraints, Known Traps: 1/1 constraints]
After SMT, in 48052ms problems are : Problem set: 2 solved, 1222 unsolved
Search for dead transitions found 2 dead transitions in 48073ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 2 transitions.
[2024-05-21 10:46:29] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
// Phase 1: matrix 245 rows 125 cols
[2024-05-21 10:46:29] [INFO ] Computed 7 invariants in 2 ms
[2024-05-21 10:46:29] [INFO ] Implicit Places using invariants in 163 ms returned [52, 108]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 167 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 123/126 places, 1225/1228 transitions.
Applied a total of 0 rules in 25 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 48307 ms. Remains : 123/126 places, 1225/1228 transitions.
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N10-LTLFireability-02
Product exploration explored 100000 steps with 1659 reset in 1542 ms.
Product exploration explored 100000 steps with 1649 reset in 1725 ms.
Computed a total of 106 stabilizing places and 201 stable transitions
Computed a total of 106 stabilizing places and 201 stable transitions
Detected a total of 106/123 stabilizing places and 201/1225 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/4 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p3 (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) p1 p2))), (X p3), (X (AND p3 (NOT p2))), (X (NOT (AND p0 p1))), (X (NOT (AND p3 p0))), (X (NOT (AND p3 p0 p1))), (X (NOT (AND (NOT p0) p2))), (X (NOT p0)), (X (NOT (AND p3 p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X p3)), (X (X (AND p3 (NOT p2)))), (X (X (OR (NOT p0) (NOT p2)))), (X (X (NOT (AND p3 p0 p1)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p3 (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p3 p0 p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p3 p1 (NOT p2))))), (X (X (NOT (AND p3 p0)))), (X (X (OR (AND p3 (NOT p0)) (AND p3 (NOT p2))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p3 p0 p1 p2)))), (X (X (NOT p0))), (X (X (NOT (AND p3 p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 36 factoid took 380 ms. Reduced automaton from 9 states, 36 edges and 4 AP (stutter sensitive) to 9 states, 34 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 543 ms :[(OR (AND (NOT p0) p1) (AND p1 p2)), p2, (OR (AND (NOT p0) p1) (AND p1 p2)), (OR (AND (NOT p0) p1) (AND p1 p2)), false, (AND p1 p2), (AND p1 p2), (AND (NOT p0) p1 p2), (AND (NOT p0) p1 p2)]
Reduction of identical properties reduced properties to check from 21 to 20
RANDOM walk for 40001 steps (88 resets) in 2200 ms. (18 steps per ms) remains 6/20 properties
BEST_FIRST walk for 40002 steps (40 resets) in 1994 ms. (20 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (40 resets) in 2541 ms. (15 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (40 resets) in 2170 ms. (18 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (41 resets) in 1712 ms. (23 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (40 resets) in 2360 ms. (16 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (40 resets) in 2236 ms. (17 steps per ms) remains 6/6 properties
[2024-05-21 10:46:38] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
// Phase 1: matrix 245 rows 123 cols
[2024-05-21 10:46:38] [INFO ] Computed 5 invariants in 2 ms
[2024-05-21 10:46:38] [INFO ] State equation strengthened by 20 read => feed constraints.
Problem apf8 is UNSAT
Problem apf10 is UNSAT
Problem apf16 is UNSAT
Problem apf17 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 2/2 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 0/2 constraints. Problems are: Problem set: 4 solved, 2 unsolved
Problem apf4 is UNSAT
Problem apf15 is UNSAT
After SMT solving in domain Real declared 123/368 variables, and 5 constraints, problems are : Problem set: 6 solved, 0 unsolved in 112 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/123 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 400ms problems are : Problem set: 6 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 7 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p3 (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) p1 p2))), (X p3), (X (AND p3 (NOT p2))), (X (NOT (AND p0 p1))), (X (NOT (AND p3 p0))), (X (NOT (AND p3 p0 p1))), (X (NOT (AND (NOT p0) p2))), (X (NOT p0)), (X (NOT (AND p3 p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X p3)), (X (X (AND p3 (NOT p2)))), (X (X (OR (NOT p0) (NOT p2)))), (X (X (NOT (AND p3 p0 p1)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p3 (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p3 p0 p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p3 p1 (NOT p2))))), (X (X (NOT (AND p3 p0)))), (X (X (OR (AND p3 (NOT p0)) (AND p3 (NOT p2))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p3 p0 p1 p2)))), (X (X (NOT p0))), (X (X (NOT (AND p3 p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p3) (G (NOT p3)))), (G (OR (NOT p0) (NOT p1) (NOT p2) (NOT p3))), (G (OR (NOT p0) (NOT p2))), (G (OR (NOT p0) (NOT p1) (NOT p2))), (G (OR (NOT p0) (NOT p2))), (G (OR (NOT p0) (NOT p2) (NOT p3))), (G (OR (NOT p0) (NOT p3))), (G (OR (NOT p0) (NOT p1) (NOT p3)))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p2)))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (AND (NOT p0) p3) (AND (NOT p2) p3)))), (F (NOT (OR (NOT p2) (NOT p3)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p1) p2 (NOT p3)))), (F (NOT (OR (NOT p1) p2))), (F (NOT (AND (NOT p2) p3))), (F p2), (F p0), (F (NOT p3)), (F (NOT (OR p0 (NOT p1) (NOT p2)))), (F (NOT (OR p0 (NOT p1) (NOT p2) (NOT p3)))), (F p1)]
Knowledge based reduction with 43 factoid took 1029 ms. Reduced automaton from 9 states, 34 edges and 4 AP (stutter sensitive) to 7 states, 17 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 323 ms :[(OR (AND (NOT p0) p1) (AND p1 p2)), p2, (OR (AND (NOT p0) p1) (AND p1 p2)), (OR (AND (NOT p0) p1) (AND p1 p2)), false, (AND p1 p2), (AND p1 p2)]
Stuttering acceptance computed with spot in 313 ms :[(OR (AND (NOT p0) p1) (AND p1 p2)), p2, (OR (AND (NOT p0) p1) (AND p1 p2)), (OR (AND (NOT p0) p1) (AND p1 p2)), false, (AND p1 p2), (AND p1 p2)]
Support contains 119 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 1225/1225 transitions.
Applied a total of 0 rules in 4 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Running 1222 sub problems to find dead transitions.
[2024-05-21 10:46:40] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 10:46:40] [INFO ] Invariant cache hit.
[2024-05-21 10:46:40] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-05-21 10:46:51] [INFO ] Deduced a trap composed of 5 places in 157 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 123/368 variables, and 6 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20037 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/123 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 245/368 variables, 123/129 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/368 variables, 20/149 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 368/368 variables, and 1371 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 21793 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
After SMT, in 48093ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 48115ms
[2024-05-21 10:47:28] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 10:47:28] [INFO ] Invariant cache hit.
[2024-05-21 10:47:28] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-05-21 10:47:28] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 10:47:28] [INFO ] Invariant cache hit.
[2024-05-21 10:47:28] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 10:47:28] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 292 ms to find 0 implicit places.
Running 1222 sub problems to find dead transitions.
[2024-05-21 10:47:28] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 10:47:28] [INFO ] Invariant cache hit.
[2024-05-21 10:47:28] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-05-21 10:47:38] [INFO ] Deduced a trap composed of 5 places in 138 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 245/368 variables, 123/129 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
SMT process timed out in 35606ms, After SMT, problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 35620ms
Finished structural reductions in LTL mode , in 1 iterations and 84039 ms. Remains : 123/123 places, 1225/1225 transitions.
Computed a total of 106 stabilizing places and 201 stable transitions
Computed a total of 106 stabilizing places and 201 stable transitions
Detected a total of 106/123 stabilizing places and 201/1225 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/4 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p1) p3 (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X p3), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT p2)), (X (AND (NOT p2) p3)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p2))), (X (X p3)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p2 p3)))), (X (X (NOT p0))), (X (X (NOT (AND p2 p1)))), (X (X (AND (NOT p2) p3))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 300 ms. Reduced automaton from 7 states, 17 edges and 4 AP (stutter sensitive) to 7 states, 17 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 607 ms :[(OR (AND (NOT p0) p1) (AND p1 p2)), p2, (OR (AND (NOT p0) p1) (AND p1 p2)), (OR (AND (NOT p0) p1) (AND p1 p2)), false, (AND p1 p2), (AND p1 p2)]
RANDOM walk for 753 steps (0 resets) in 76 ms. (9 steps per ms) remains 0/9 properties
Knowledge obtained : [(AND (NOT p2) (NOT p1) p3 (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X p3), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT p2)), (X (AND (NOT p2) p3)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p2))), (X (X p3)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p2 p3)))), (X (X (NOT p0))), (X (X (NOT (AND p2 p1)))), (X (X (AND (NOT p2) p3))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(F (NOT (OR (NOT p2) (NOT p3)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p2) p3))), (F p0), (F p2), (F (NOT p3)), (F (NOT (OR p0 (NOT p1)))), (F p1), (F (NOT (OR (NOT p1) (NOT p2))))]
Knowledge based reduction with 19 factoid took 1055 ms. Reduced automaton from 7 states, 17 edges and 4 AP (stutter sensitive) to 7 states, 17 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 521 ms :[(OR (AND (NOT p0) p1) (AND p1 p2)), p2, (OR (AND (NOT p0) p1) (AND p1 p2)), (OR (AND (NOT p0) p1) (AND p1 p2)), false, (AND p1 p2), (AND p1 p2)]
Stuttering acceptance computed with spot in 279 ms :[(OR (AND (NOT p0) p1) (AND p1 p2)), p2, (OR (AND (NOT p0) p1) (AND p1 p2)), (OR (AND (NOT p0) p1) (AND p1 p2)), false, (AND p1 p2), (AND p1 p2)]
Stuttering acceptance computed with spot in 368 ms :[(OR (AND (NOT p0) p1) (AND p1 p2)), p2, (OR (AND (NOT p0) p1) (AND p1 p2)), (OR (AND (NOT p0) p1) (AND p1 p2)), false, (AND p1 p2), (AND p1 p2)]
Product exploration explored 100000 steps with 1174 reset in 1144 ms.
Product exploration explored 100000 steps with 1178 reset in 928 ms.
Support contains 119 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 1225/1225 transitions.
Applied a total of 0 rules in 5 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Running 1222 sub problems to find dead transitions.
[2024-05-21 10:48:09] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 10:48:09] [INFO ] Invariant cache hit.
[2024-05-21 10:48:09] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-05-21 10:48:22] [INFO ] Deduced a trap composed of 5 places in 154 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 123/368 variables, and 6 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/123 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 245/368 variables, 123/129 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/368 variables, 20/149 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 368/368 variables, and 1371 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 21252 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
After SMT, in 47877ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 47892ms
[2024-05-21 10:48:57] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 10:48:57] [INFO ] Invariant cache hit.
[2024-05-21 10:48:57] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-05-21 10:48:57] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 10:48:57] [INFO ] Invariant cache hit.
[2024-05-21 10:48:58] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 10:48:58] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 271 ms to find 0 implicit places.
Running 1222 sub problems to find dead transitions.
[2024-05-21 10:48:58] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 10:48:58] [INFO ] Invariant cache hit.
[2024-05-21 10:48:58] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-05-21 10:49:08] [INFO ] Deduced a trap composed of 5 places in 187 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 245/368 variables, 123/129 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
SMT process timed out in 35902ms, After SMT, problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 35913ms
Finished structural reductions in LTL mode , in 1 iterations and 84088 ms. Remains : 123/123 places, 1225/1225 transitions.
Treatment of property BridgeAndVehicles-PT-V50P20N10-LTLFireability-02 finished in 234013 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 (F(p2)||p1))&&F((!p0&&G(!p3)))))'
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(F(!p1))&&p0)))'
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))'
[2024-05-21 10:49:34] [INFO ] Flatten gal took : 107 ms
[2024-05-21 10:49:34] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/LTLFireability.sr.xml took 19 ms.
[2024-05-21 10:49:34] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 126 places, 1228 transitions and 9208 arcs took 14 ms.
Total runtime 1734389 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running BridgeAndVehicles-PT-V50P20N10

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/421/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 126
TRANSITIONS: 1228
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.029s, Sys 0.011s]


SAVING FILE /home/mcc/execution/421/model (.net / .def) ...
EXPORT TIME: [User 0.004s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 2498
MODEL NAME: /home/mcc/execution/421/model
126 places, 1228 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA BridgeAndVehicles-PT-V50P20N10-LTLFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V50P20N10-LTLFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
Error in allocating array of size 8388608 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

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-V50P20N10"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is BridgeAndVehicles-PT-V50P20N10, 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 r047-tajo-171620397800228"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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