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.r472-tajo-171620399100228.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 ltsminxred
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 r472-tajo-171620399100228
=====================================================================

--------------------
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 1717220590332

Invoking MCC driver with
BK_TOOL=ltsminxred
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 ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 05:43:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 05:43:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 05:43:11] [INFO ] Load time of PNML (sax parser for PT used): 138 ms
[2024-06-01 05:43:11] [INFO ] Transformed 128 places.
[2024-06-01 05:43:11] [INFO ] Transformed 1328 transitions.
[2024-06-01 05:43:11] [INFO ] Parsed PT model containing 128 places and 1328 transitions and 10010 arcs in 247 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 19 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 38 ms. Remains 126 /128 variables (removed 2) and now considering 1328/1328 (removed 0) transitions.
Running 1325 sub problems to find dead transitions.
[2024-06-01 05:43:12] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 126 cols
[2024-06-01 05:43:12] [INFO ] Computed 5 invariants in 15 ms
[2024-06-01 05:43:12] [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
[2024-06-01 05:43:23] [INFO ] Deduced a trap composed of 5 places in 217 ms of which 11 ms to minimize.
[2024-06-01 05:43:28] [INFO ] Deduced a trap composed of 15 places in 129 ms of which 1 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-06-01 05:43:32] [INFO ] Deduced a trap composed of 14 places in 166 ms of which 2 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
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 126/376 variables, and 8 constraints, problems are : Problem set: 100 solved, 1225 unsolved in 20099 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: 3/3 constraints]
Escalating to Integer solving :Problem set: 100 solved, 1225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 5/5 constraints. Problems are: Problem set: 100 solved, 1225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 3/8 constraints. Problems are: Problem set: 100 solved, 1225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/8 constraints. Problems are: Problem set: 100 solved, 1225 unsolved
Problem TDEAD50 is UNSAT
Problem TDEAD155 is UNSAT
At refinement iteration 3 (OVERLAPS) 250/376 variables, 126/134 constraints. Problems are: Problem set: 102 solved, 1223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/376 variables, 22/156 constraints. Problems are: Problem set: 102 solved, 1223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 376/376 variables, and 1379 constraints, problems are : Problem set: 102 solved, 1223 unsolved in 21710 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 126/126 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 1223/1325 constraints, Known Traps: 3/3 constraints]
After SMT, in 48167ms problems are : Problem set: 102 solved, 1223 unsolved
Search for dead transitions found 102 dead transitions in 48210ms
Found 102 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 102 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 102 transitions.
[2024-06-01 05:44:00] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
// Phase 1: matrix 246 rows 126 cols
[2024-06-01 05:44:00] [INFO ] Computed 7 invariants in 6 ms
[2024-06-01 05:44:00] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-06-01 05:44:00] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2024-06-01 05:44:00] [INFO ] Invariant cache hit.
[2024-06-01 05:44:00] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:44:00] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 126/128 places, 1226/1328 transitions.
Applied a total of 0 rules in 10 ms. Remains 126 /126 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48488 ms. Remains : 126/128 places, 1226/1328 transitions.
Support contains 126 out of 126 places after structural reductions.
[2024-06-01 05:44:00] [INFO ] Flatten gal took : 134 ms
[2024-06-01 05:44:01] [INFO ] Flatten gal took : 125 ms
[2024-06-01 05:44:01] [INFO ] Input system was already deterministic with 1226 transitions.
Reduction of identical properties reduced properties to check from 19 to 16
RANDOM walk for 40001 steps (88 resets) in 3134 ms. (12 steps per ms) remains 1/16 properties
BEST_FIRST walk for 40003 steps (36 resets) in 289 ms. (137 steps per ms) remains 1/1 properties
[2024-06-01 05:44:02] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2024-06-01 05:44:02] [INFO ] Invariant cache hit.
[2024-06-01 05:44:02] [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) 116/120 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/121 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 244/365 variables, 121/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 20/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 7/372 variables, 5/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/372 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/372 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/372 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 372/372 variables, and 153 constraints, problems are : Problem set: 0 solved, 1 unsolved in 229 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 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) 116/120 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/121 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 244/365 variables, 121/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 20/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 7/372 variables, 5/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/372 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/372 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/372 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/372 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 372/372 variables, and 154 constraints, problems are : Problem set: 0 solved, 1 unsolved in 256 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 126/126 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 509ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 34 ms.
Support contains 4 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 1226/1226 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 125 transition count 1225
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 125 transition count 1225
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 1224
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 1222
Applied a total of 9 rules in 175 ms. Remains 121 /126 variables (removed 5) and now considering 1222/1226 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 176 ms. Remains : 121/126 places, 1222/1226 transitions.
RANDOM walk for 40000 steps (126 resets) in 500 ms. (79 steps per ms) remains 1/1 properties
BEST_FIRST walk for 38457 steps (65 resets) in 235 ms. (162 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 202 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, 1226/1226 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 125 transition count 1225
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 125 transition count 1225
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 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 1224
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 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 1222
Applied a total of 9 rules in 150 ms. Remains 121 /126 variables (removed 5) and now considering 1222/1226 (removed 4) transitions.
[2024-06-01 05:44:03] [INFO ] Flow matrix only has 242 transitions (discarded 980 similar events)
// Phase 1: matrix 242 rows 121 cols
[2024-06-01 05:44:04] [INFO ] Computed 6 invariants in 12 ms
[2024-06-01 05:44:04] [INFO ] Implicit Places using invariants in 168 ms returned [52, 106]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 173 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 119/126 places, 1222/1226 transitions.
Applied a total of 0 rules in 87 ms. Remains 119 /119 variables (removed 0) and now considering 1222/1222 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 410 ms. Remains : 119/126 places, 1222/1226 transitions.
Stuttering acceptance computed with spot in 217 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 681 reset in 3455 ms.
Product exploration explored 100000 steps with 681 reset in 3413 ms.
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 375 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 80 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 3605 steps (11 resets) in 291 ms. (12 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 482 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 89 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-06-01 05:44:12] [INFO ] Flow matrix only has 242 transitions (discarded 980 similar events)
// Phase 1: matrix 242 rows 119 cols
[2024-06-01 05:44:12] [INFO ] Computed 4 invariants in 5 ms
[2024-06-01 05:44:20] [INFO ] [Real]Absence check using 4 positive place invariants in 9 ms returned sat
[2024-06-01 05:44:20] [INFO ] [Real]Absence check using state equation in 105 ms returned sat
[2024-06-01 05:44:20] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:44:27] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2024-06-01 05:44:27] [INFO ] [Nat]Absence check using state equation in 95 ms returned sat
[2024-06-01 05:44:27] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:44:27] [INFO ] [Nat]Added 20 Read/Feed constraints in 18 ms returned sat
[2024-06-01 05:44:27] [INFO ] Computed and/alt/rep : 108/216/108 causal constraints (skipped 131 transitions) in 66 ms.
[2024-06-01 05:44:27] [INFO ] Added : 37 causal constraints over 9 iterations in 298 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, 1222/1222 transitions.
Applied a total of 0 rules in 86 ms. Remains 119 /119 variables (removed 0) and now considering 1222/1222 (removed 0) transitions.
[2024-06-01 05:44:27] [INFO ] Flow matrix only has 242 transitions (discarded 980 similar events)
[2024-06-01 05:44:27] [INFO ] Invariant cache hit.
[2024-06-01 05:44:27] [INFO ] Implicit Places using invariants in 126 ms returned []
[2024-06-01 05:44:27] [INFO ] Flow matrix only has 242 transitions (discarded 980 similar events)
[2024-06-01 05:44:27] [INFO ] Invariant cache hit.
[2024-06-01 05:44:28] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:44:28] [INFO ] Implicit Places using invariants and state equation in 306 ms returned []
Implicit Place search using SMT with State Equation took 441 ms to find 0 implicit places.
[2024-06-01 05:44:28] [INFO ] Redundant transitions in 82 ms returned []
Running 1219 sub problems to find dead transitions.
[2024-06-01 05:44:28] [INFO ] Flow matrix only has 242 transitions (discarded 980 similar events)
[2024-06-01 05:44:28] [INFO ] Invariant cache hit.
[2024-06-01 05:44:28] [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 30078 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 30026 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 65499ms problems are : Problem set: 0 solved, 1219 unsolved
Search for dead transitions found 0 dead transitions in 65527ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 66157 ms. Remains : 119/119 places, 1222/1222 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 375 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 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 767 steps (1 resets) in 25 ms. (29 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 505 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 93 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-06-01 05:45:35] [INFO ] Flow matrix only has 242 transitions (discarded 980 similar events)
[2024-06-01 05:45:35] [INFO ] Invariant cache hit.
[2024-06-01 05:45:42] [INFO ] [Real]Absence check using 4 positive place invariants in 8 ms returned sat
[2024-06-01 05:45:42] [INFO ] [Real]Absence check using state equation in 105 ms returned sat
[2024-06-01 05:45:42] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:45:49] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2024-06-01 05:45:49] [INFO ] [Nat]Absence check using state equation in 101 ms returned sat
[2024-06-01 05:45:49] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:45:49] [INFO ] [Nat]Added 20 Read/Feed constraints in 42 ms returned sat
[2024-06-01 05:45:50] [INFO ] Computed and/alt/rep : 108/216/108 causal constraints (skipped 131 transitions) in 56 ms.
[2024-06-01 05:45:50] [INFO ] Added : 37 causal constraints over 8 iterations in 453 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 679 reset in 3329 ms.
Product exploration explored 100000 steps with 682 reset in 3042 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 57 ms. Remains 119 /119 variables (removed 0) and now considering 1222/1222 (removed 0) transitions.
[2024-06-01 05:45:57] [INFO ] Flow matrix only has 242 transitions (discarded 980 similar events)
[2024-06-01 05:45:57] [INFO ] Invariant cache hit.
[2024-06-01 05:45:57] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-06-01 05:45:57] [INFO ] Flow matrix only has 242 transitions (discarded 980 similar events)
[2024-06-01 05:45:57] [INFO ] Invariant cache hit.
[2024-06-01 05:45:57] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:45:57] [INFO ] Implicit Places using invariants and state equation in 329 ms returned []
Implicit Place search using SMT with State Equation took 455 ms to find 0 implicit places.
[2024-06-01 05:45:57] [INFO ] Redundant transitions in 74 ms returned []
Running 1219 sub problems to find dead transitions.
[2024-06-01 05:45:57] [INFO ] Flow matrix only has 242 transitions (discarded 980 similar events)
[2024-06-01 05:45:57] [INFO ] Invariant cache hit.
[2024-06-01 05:45:57] [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 30032 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 30041 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 65487ms problems are : Problem set: 0 solved, 1219 unsolved
Search for dead transitions found 0 dead transitions in 65517ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 66117 ms. Remains : 119/119 places, 1222/1222 transitions.
Treatment of property BridgeAndVehicles-PT-V50P20N10-LTLFireability-00 finished in 179526 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, 1226/1226 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 125 transition count 1225
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 125 transition count 1225
Applied a total of 2 rules in 15 ms. Remains 125 /126 variables (removed 1) and now considering 1225/1226 (removed 1) transitions.
Running 1222 sub problems to find dead transitions.
[2024-06-01 05:47:03] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
// Phase 1: matrix 245 rows 125 cols
[2024-06-01 05:47:03] [INFO ] Computed 7 invariants in 6 ms
[2024-06-01 05:47:03] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-06-01 05:47:12] [INFO ] Deduced a trap composed of 5 places in 160 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 125/370 variables, and 8 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/125 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/125 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (OVERLAPS) 245/370 variables, 125/133 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/370 variables, 20/153 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/370 variables, 1222/1375 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 370/370 variables, and 1375 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20038 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 125/125 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
After SMT, in 44790ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 44808ms
[2024-06-01 05:47:48] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 05:47:48] [INFO ] Invariant cache hit.
[2024-06-01 05:47:48] [INFO ] Implicit Places using invariants in 146 ms returned [52, 108]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 150 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 123/126 places, 1225/1226 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 44982 ms. Remains : 123/126 places, 1225/1226 transitions.
Stuttering acceptance computed with spot in 501 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 1753 reset in 1467 ms.
Product exploration explored 100000 steps with 1667 reset in 1264 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 316 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 495 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 1722 ms. (23 steps per ms) remains 6/20 properties
BEST_FIRST walk for 40001 steps (40 resets) in 1887 ms. (21 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (40 resets) in 1304 ms. (30 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (40 resets) in 1027 ms. (38 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (40 resets) in 990 ms. (40 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (40 resets) in 1352 ms. (29 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (40 resets) in 970 ms. (41 steps per ms) remains 6/6 properties
[2024-06-01 05:47:55] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
// Phase 1: matrix 245 rows 123 cols
[2024-06-01 05:47:55] [INFO ] Computed 5 invariants in 2 ms
[2024-06-01 05:47:55] [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 61 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 361ms 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 961 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 248 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 243 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 6 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Running 1222 sub problems to find dead transitions.
[2024-06-01 05:47:57] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 05:47:57] [INFO ] Invariant cache hit.
[2024-06-01 05:47:57] [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-06-01 05:48:07] [INFO ] Deduced a trap composed of 5 places in 133 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 20024 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 20044 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 46237ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 46255ms
[2024-06-01 05:48:43] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 05:48:43] [INFO ] Invariant cache hit.
[2024-06-01 05:48:43] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-06-01 05:48:43] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 05:48:43] [INFO ] Invariant cache hit.
[2024-06-01 05:48:43] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:48:43] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
Running 1222 sub problems to find dead transitions.
[2024-06-01 05:48:43] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 05:48:43] [INFO ] Invariant cache hit.
[2024-06-01 05:48:43] [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-06-01 05:48:53] [INFO ] Deduced a trap composed of 5 places in 140 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
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
[2024-06-01 05:49:16] [INFO ] Deduced a trap composed of 15 places in 120 ms of which 1 ms to minimize.
[2024-06-01 05:49:17] [INFO ] Deduced a trap composed of 14 places in 115 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 368/368 variables, and 151 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 30034 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: 3/3 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, 3/8 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 245/368 variables, 123/131 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/368 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 1222/1373 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 1373 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 30025 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: 3/3 constraints]
After SMT, in 65933ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 65950ms
Finished structural reductions in LTL mode , in 1 iterations and 112462 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 238 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 221 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 740 steps (0 resets) in 16 ms. (43 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 497 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 226 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 212 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 210 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 1146 reset in 859 ms.
Product exploration explored 100000 steps with 1118 reset in 867 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 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-06-01 05:49:53] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 05:49:53] [INFO ] Invariant cache hit.
[2024-06-01 05:49:53] [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-06-01 05:50:02] [INFO ] Deduced a trap composed of 5 places in 133 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 25465ms, After SMT, problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 25477ms
[2024-06-01 05:50:19] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 05:50:19] [INFO ] Invariant cache hit.
[2024-06-01 05:50:19] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-06-01 05:50:19] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 05:50:19] [INFO ] Invariant cache hit.
[2024-06-01 05:50:19] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:50:19] [INFO ] Implicit Places using invariants and state equation in 284 ms returned []
Implicit Place search using SMT with State Equation took 369 ms to find 0 implicit places.
Running 1222 sub problems to find dead transitions.
[2024-06-01 05:50:19] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 05:50:19] [INFO ] Invariant cache hit.
[2024-06-01 05:50: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-06-01 05:50:28] [INFO ] Deduced a trap composed of 5 places in 152 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
[2024-06-01 05:50:53] [INFO ] Deduced a trap composed of 15 places in 133 ms of which 1 ms to minimize.
[2024-06-01 05:50:54] [INFO ] Deduced a trap composed of 14 places in 114 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 368/368 variables, and 151 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 30021 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: 3/3 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, 3/8 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 245/368 variables, 123/131 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/368 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 1222/1373 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 1373 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 30030 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: 3/3 constraints]
After SMT, in 65719ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 65737ms
Finished structural reductions in LTL mode , in 1 iterations and 91600 ms. Remains : 123/123 places, 1225/1225 transitions.
Treatment of property BridgeAndVehicles-PT-V50P20N10-LTLFireability-02 finished in 261934 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, 1226/1226 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 125 transition count 1225
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 125 transition count 1225
Applied a total of 2 rules in 10 ms. Remains 125 /126 variables (removed 1) and now considering 1225/1226 (removed 1) transitions.
Running 1222 sub problems to find dead transitions.
[2024-06-01 05:51:25] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
// Phase 1: matrix 245 rows 125 cols
[2024-06-01 05:51:25] [INFO ] Computed 7 invariants in 6 ms
[2024-06-01 05:51:25] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-06-01 05:51:36] [INFO ] Deduced a trap composed of 5 places in 166 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 125/370 variables, and 8 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20037 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/125 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/125 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (OVERLAPS) 245/370 variables, 125/133 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/370 variables, 20/153 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 370/370 variables, and 1375 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20111 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 125/125 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
After SMT, in 46813ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 46832ms
[2024-06-01 05:52:12] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 05:52:12] [INFO ] Invariant cache hit.
[2024-06-01 05:52:12] [INFO ] Implicit Places using invariants in 170 ms returned [52]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 187 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 124/126 places, 1225/1226 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 47039 ms. Remains : 124/126 places, 1225/1226 transitions.
Stuttering acceptance computed with spot in 372 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 25042 reset in 580 ms.
Product exploration explored 100000 steps with 24992 reset in 555 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 203 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 255 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 646 steps (0 resets) in 16 ms. (38 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 431 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 49510 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, 1226/1226 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 1225
Applied a total of 2 rules in 167 ms. Remains 125 /126 variables (removed 1) and now considering 1225/1226 (removed 1) transitions.
Running 1222 sub problems to find dead transitions.
[2024-06-01 05:52:14] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
// Phase 1: matrix 245 rows 125 cols
[2024-06-01 05:52:14] [INFO ] Computed 7 invariants in 4 ms
[2024-06-01 05:52:14] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-06-01 05:52:26] [INFO ] Deduced a trap composed of 5 places in 179 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 125/370 variables, and 8 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/125 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/125 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (OVERLAPS) 245/370 variables, 125/133 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/370 variables, 20/153 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/370 variables, 1222/1375 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 370/370 variables, and 1375 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20044 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 125/125 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
After SMT, in 46819ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 46833ms
[2024-06-01 05:53:01] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 05:53:01] [INFO ] Invariant cache hit.
[2024-06-01 05:53:01] [INFO ] Implicit Places using invariants in 169 ms returned [52, 107]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 172 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 123/126 places, 1225/1226 transitions.
Applied a total of 0 rules in 64 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 47239 ms. Remains : 123/126 places, 1225/1226 transitions.
Stuttering acceptance computed with spot in 228 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 650 ms.
Product exploration explored 100000 steps with 268 reset in 622 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 672 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 167 ms :[(OR p3 p0), (OR p3 p0), p3, false]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 584 steps (0 resets) in 11 ms. (48 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 890 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 155 ms :[(OR p3 p0), (OR p3 p0), p3, false]
Stuttering acceptance computed with spot in 144 ms :[(OR p3 p0), (OR p3 p0), p3, false]
[2024-06-01 05:53:05] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
// Phase 1: matrix 245 rows 123 cols
[2024-06-01 05:53:05] [INFO ] Computed 5 invariants in 2 ms
[2024-06-01 05:53:06] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2024-06-01 05:53:06] [INFO ] [Real]Absence check using state equation in 169 ms returned sat
[2024-06-01 05:53:06] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:53:07] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-06-01 05:53:07] [INFO ] [Nat]Absence check using state equation in 102 ms returned sat
[2024-06-01 05:53:07] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:53:07] [INFO ] [Nat]Added 20 Read/Feed constraints in 25 ms returned sat
[2024-06-01 05:53:07] [INFO ] Deduced a trap composed of 14 places in 111 ms of which 1 ms to minimize.
[2024-06-01 05:53:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 148 ms
[2024-06-01 05:53:07] [INFO ] Computed and/alt/rep : 108/216/108 causal constraints (skipped 134 transitions) in 26 ms.
[2024-06-01 05:53:07] [INFO ] Added : 27 causal constraints over 7 iterations in 191 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 62 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Running 1222 sub problems to find dead transitions.
[2024-06-01 05:53:07] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 05:53:07] [INFO ] Invariant cache hit.
[2024-06-01 05:53:07] [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-06-01 05:53:17] [INFO ] Deduced a trap composed of 5 places in 162 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 20030 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 20030 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 45636ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 45648ms
[2024-06-01 05:53:53] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 05:53:53] [INFO ] Invariant cache hit.
[2024-06-01 05:53:53] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-06-01 05:53:53] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 05:53:53] [INFO ] Invariant cache hit.
[2024-06-01 05:53:53] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:53:53] [INFO ] Implicit Places using invariants and state equation in 368 ms returned []
Implicit Place search using SMT with State Equation took 494 ms to find 0 implicit places.
[2024-06-01 05:53:53] [INFO ] Redundant transitions in 12 ms returned []
Running 1222 sub problems to find dead transitions.
[2024-06-01 05:53:53] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 05:53:53] [INFO ] Invariant cache hit.
[2024-06-01 05:53:53] [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-06-01 05:54:02] [INFO ] Deduced a trap composed of 5 places in 182 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
[2024-06-01 05:54:25] [INFO ] Deduced a trap composed of 15 places in 153 ms of which 1 ms to minimize.
[2024-06-01 05:54:27] [INFO ] Deduced a trap composed of 14 places in 151 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 368/368 variables, and 151 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 30028 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: 3/3 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, 3/8 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 245/368 variables, 123/131 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/368 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 1222/1373 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 1373 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: 3/3 constraints]
After SMT, in 65191ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 65208ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 111437 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 285 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 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 629 steps (0 resets) in 19 ms. (31 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 456 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 191 ms :[(OR p3 p0), (OR p3 p0), p3, false]
Stuttering acceptance computed with spot in 169 ms :[(OR p3 p0), (OR p3 p0), p3, false]
[2024-06-01 05:55:00] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 05:55:00] [INFO ] Invariant cache hit.
[2024-06-01 05:55:00] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-06-01 05:55:01] [INFO ] [Real]Absence check using state equation in 146 ms returned sat
[2024-06-01 05:55:01] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:55:01] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-06-01 05:55:01] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2024-06-01 05:55:01] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:55:01] [INFO ] [Nat]Added 20 Read/Feed constraints in 18 ms returned sat
[2024-06-01 05:55:01] [INFO ] Deduced a trap composed of 14 places in 164 ms of which 1 ms to minimize.
[2024-06-01 05:55:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 227 ms
[2024-06-01 05:55:02] [INFO ] Computed and/alt/rep : 108/216/108 causal constraints (skipped 134 transitions) in 33 ms.
[2024-06-01 05:55:02] [INFO ] Added : 27 causal constraints over 10 iterations in 343 ms. Result :sat
Could not prove EG p3
Stuttering acceptance computed with spot in 188 ms :[(OR p3 p0), (OR p3 p0), p3, false]
Product exploration explored 100000 steps with 268 reset in 839 ms.
Product exploration explored 100000 steps with 268 reset in 837 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 94 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Running 1222 sub problems to find dead transitions.
[2024-06-01 05:55:04] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 05:55:04] [INFO ] Invariant cache hit.
[2024-06-01 05:55:04] [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-06-01 05:55:14] [INFO ] Deduced a trap composed of 5 places in 131 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 20026 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 20034 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 46027ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 46047ms
[2024-06-01 05:55:50] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 05:55:50] [INFO ] Invariant cache hit.
[2024-06-01 05:55:50] [INFO ] Implicit Places using invariants in 143 ms returned []
[2024-06-01 05:55:50] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 05:55:50] [INFO ] Invariant cache hit.
[2024-06-01 05:55:50] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:55:50] [INFO ] Implicit Places using invariants and state equation in 369 ms returned []
Implicit Place search using SMT with State Equation took 526 ms to find 0 implicit places.
[2024-06-01 05:55:50] [INFO ] Redundant transitions in 19 ms returned []
Running 1222 sub problems to find dead transitions.
[2024-06-01 05:55:50] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 05:55:50] [INFO ] Invariant cache hit.
[2024-06-01 05:55:50] [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-06-01 05:56:00] [INFO ] Deduced a trap composed of 5 places in 147 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
[2024-06-01 05:56:26] [INFO ] Deduced a trap composed of 15 places in 115 ms of which 0 ms to minimize.
[2024-06-01 05:56:27] [INFO ] Deduced a trap composed of 14 places in 102 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 368/368 variables, and 151 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 30020 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: 3/3 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, 3/8 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 245/368 variables, 123/131 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/368 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 1222/1373 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 1373 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 30020 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: 3/3 constraints]
After SMT, in 66285ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 66304ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 113006 ms. Remains : 123/123 places, 1225/1225 transitions.
Treatment of property BridgeAndVehicles-PT-V50P20N10-LTLFireability-04 finished in 282543 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, 1226/1226 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 125 transition count 1225
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 125 transition count 1225
Applied a total of 2 rules in 13 ms. Remains 125 /126 variables (removed 1) and now considering 1225/1226 (removed 1) transitions.
Running 1222 sub problems to find dead transitions.
[2024-06-01 05:56:57] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
// Phase 1: matrix 245 rows 125 cols
[2024-06-01 05:56:57] [INFO ] Computed 7 invariants in 4 ms
[2024-06-01 05:56:57] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-06-01 05:57:06] [INFO ] Deduced a trap composed of 5 places in 158 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 125/370 variables, and 8 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/125 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/125 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (OVERLAPS) 245/370 variables, 125/133 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/370 variables, 20/153 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/370 variables, 1222/1375 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 370/370 variables, and 1375 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20067 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 125/125 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
After SMT, in 44670ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 44686ms
[2024-06-01 05:57:42] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 05:57:42] [INFO ] Invariant cache hit.
[2024-06-01 05:57:42] [INFO ] Implicit Places using invariants in 212 ms returned [52]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 217 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 124/126 places, 1225/1226 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 44928 ms. Remains : 124/126 places, 1225/1226 transitions.
Stuttering acceptance computed with spot in 208 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 1457 reset in 639 ms.
Product exploration explored 100000 steps with 1430 reset in 643 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 110 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 93 ms :[p1, p1]
RANDOM walk for 179 steps (0 resets) in 6 ms. (25 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 103 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 96 ms :[p1, p1]
Stuttering acceptance computed with spot in 83 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 47 ms. Remains 124 /124 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Running 1222 sub problems to find dead transitions.
[2024-06-01 05:57:44] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
// Phase 1: matrix 245 rows 124 cols
[2024-06-01 05:57:44] [INFO ] Computed 6 invariants in 3 ms
[2024-06-01 05:57:44] [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-06-01 05:57:54] [INFO ] Deduced a trap composed of 5 places in 171 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 20027 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 20029 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 46350ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 46361ms
[2024-06-01 05:58:30] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 05:58:30] [INFO ] Invariant cache hit.
[2024-06-01 05:58:30] [INFO ] Implicit Places using invariants in 153 ms returned []
[2024-06-01 05:58:30] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 05:58:30] [INFO ] Invariant cache hit.
[2024-06-01 05:58:30] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:58:31] [INFO ] Implicit Places using invariants and state equation in 288 ms returned []
Implicit Place search using SMT with State Equation took 445 ms to find 0 implicit places.
[2024-06-01 05:58:31] [INFO ] Redundant transitions in 13 ms returned []
Running 1222 sub problems to find dead transitions.
[2024-06-01 05:58:31] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 05:58:31] [INFO ] Invariant cache hit.
[2024-06-01 05:58:31] [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-06-01 05:58:40] [INFO ] Deduced a trap composed of 5 places in 111 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
[2024-06-01 05:59:05] [INFO ] Deduced a trap composed of 14 places in 131 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 369/369 variables, and 152 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 30027 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: 2/2 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, 2/8 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 245/369 variables, 124/132 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/369 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/369 variables, 1222/1374 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 1374 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 30044 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: 2/2 constraints]
After SMT, in 64985ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 64997ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 111874 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 91 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 77 ms :[p1, p1]
RANDOM walk for 240 steps (0 resets) in 8 ms. (26 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 151 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 112 ms :[p1, p1]
Stuttering acceptance computed with spot in 100 ms :[p1, p1]
Stuttering acceptance computed with spot in 120 ms :[p1, p1]
Product exploration explored 100000 steps with 1434 reset in 846 ms.
Product exploration explored 100000 steps with 1483 reset in 629 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 59 ms. Remains 124 /124 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Running 1222 sub problems to find dead transitions.
[2024-06-01 05:59:38] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 05:59:38] [INFO ] Invariant cache hit.
[2024-06-01 05:59:38] [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-06-01 05:59:48] [INFO ] Deduced a trap composed of 5 places in 173 ms of which 2 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 20038 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 20655 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 46993ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 47009ms
[2024-06-01 06:00:25] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 06:00:25] [INFO ] Invariant cache hit.
[2024-06-01 06:00:25] [INFO ] Implicit Places using invariants in 243 ms returned []
[2024-06-01 06:00:25] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 06:00:25] [INFO ] Invariant cache hit.
[2024-06-01 06:00:25] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 06:00:26] [INFO ] Implicit Places using invariants and state equation in 429 ms returned []
Implicit Place search using SMT with State Equation took 676 ms to find 0 implicit places.
[2024-06-01 06:00:26] [INFO ] Redundant transitions in 18 ms returned []
Running 1222 sub problems to find dead transitions.
[2024-06-01 06:00:26] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 06:00:26] [INFO ] Invariant cache hit.
[2024-06-01 06:00:26] [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-06-01 06:00:35] [INFO ] Deduced a trap composed of 5 places in 156 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
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 30023 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 30029 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 65477ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 65490ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 113266 ms. Remains : 124/124 places, 1225/1225 transitions.
Treatment of property BridgeAndVehicles-PT-V50P20N10-LTLFireability-07 finished in 274406 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, 1226/1226 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 125 transition count 1225
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 125 transition count 1225
Applied a total of 2 rules in 12 ms. Remains 125 /126 variables (removed 1) and now considering 1225/1226 (removed 1) transitions.
Running 1222 sub problems to find dead transitions.
[2024-06-01 06:01:31] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
// Phase 1: matrix 245 rows 125 cols
[2024-06-01 06:01:31] [INFO ] Computed 7 invariants in 2 ms
[2024-06-01 06:01:31] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-06-01 06:01:42] [INFO ] Deduced a trap composed of 5 places in 162 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 125/370 variables, and 8 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/125 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/125 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (OVERLAPS) 245/370 variables, 125/133 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/370 variables, 20/153 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/370 variables, 1222/1375 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 370/370 variables, and 1375 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20050 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 125/125 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
After SMT, in 45742ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 45762ms
[2024-06-01 06:02:17] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 06:02:17] [INFO ] Invariant cache hit.
[2024-06-01 06:02:17] [INFO ] Implicit Places using invariants in 237 ms returned [108]
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/1226 transitions.
Applied a total of 0 rules in 19 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 46039 ms. Remains : 124/126 places, 1225/1226 transitions.
Stuttering acceptance computed with spot in 165 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 591 ms.
Product exploration explored 100000 steps with 50000 reset in 484 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 23 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 47355 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, 1226/1226 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 125 transition count 1225
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 125 transition count 1225
Applied a total of 2 rules in 11 ms. Remains 125 /126 variables (removed 1) and now considering 1225/1226 (removed 1) transitions.
Running 1222 sub problems to find dead transitions.
[2024-06-01 06:02:19] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 06:02:19] [INFO ] Invariant cache hit.
[2024-06-01 06:02:19] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-06-01 06:02:28] [INFO ] Deduced a trap composed of 5 places in 118 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 125/370 variables, and 8 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/125 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/125 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (OVERLAPS) 245/370 variables, 125/133 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/370 variables, 20/153 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 370/370 variables, and 1375 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20404 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 125/125 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
After SMT, in 45682ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 45699ms
[2024-06-01 06:03:04] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 06:03:04] [INFO ] Invariant cache hit.
[2024-06-01 06:03:05] [INFO ] Implicit Places using invariants in 285 ms returned [52, 108]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 287 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 123/126 places, 1225/1226 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 46007 ms. Remains : 123/126 places, 1225/1226 transitions.
Stuttering acceptance computed with spot in 122 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 154 steps with 0 reset in 0 ms.
FORMULA BridgeAndVehicles-PT-V50P20N10-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V50P20N10-LTLFireability-12 finished in 46154 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, 1226/1226 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 125 transition count 1225
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 125 transition count 1225
Applied a total of 2 rules in 11 ms. Remains 125 /126 variables (removed 1) and now considering 1225/1226 (removed 1) transitions.
Running 1222 sub problems to find dead transitions.
[2024-06-01 06:03:05] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 06:03:05] [INFO ] Invariant cache hit.
[2024-06-01 06:03:05] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-06-01 06:03:15] [INFO ] Deduced a trap composed of 5 places in 119 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 125/370 variables, and 8 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/125 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/125 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (OVERLAPS) 245/370 variables, 125/133 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/370 variables, 20/153 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 370/370 variables, and 1375 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20219 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 125/125 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
After SMT, in 46370ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 46383ms
[2024-06-01 06:03:51] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 06:03:51] [INFO ] Invariant cache hit.
[2024-06-01 06:03:51] [INFO ] Implicit Places using invariants in 181 ms returned [52]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 183 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 124/126 places, 1225/1226 transitions.
Applied a total of 0 rules in 4 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 46585 ms. Remains : 124/126 places, 1225/1226 transitions.
Stuttering acceptance computed with spot in 133 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N10-LTLFireability-13
Stuttering criterion allowed to conclude after 422 steps with 0 reset in 3 ms.
FORMULA BridgeAndVehicles-PT-V50P20N10-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V50P20N10-LTLFireability-13 finished in 46733 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, 1226/1226 transitions.
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 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 125 transition count 1225
Applied a total of 2 rules in 104 ms. Remains 125 /126 variables (removed 1) and now considering 1225/1226 (removed 1) transitions.
Running 1222 sub problems to find dead transitions.
[2024-06-01 06:03:52] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
// Phase 1: matrix 245 rows 125 cols
[2024-06-01 06:03:52] [INFO ] Computed 7 invariants in 3 ms
[2024-06-01 06:03:52] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-06-01 06:04:01] [INFO ] Deduced a trap composed of 5 places in 183 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 125/370 variables, and 8 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/125 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/125 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (OVERLAPS) 245/370 variables, 125/133 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/370 variables, 20/153 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/370 variables, 1222/1375 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 370/370 variables, and 1375 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20042 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 125/125 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
After SMT, in 45313ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 45332ms
[2024-06-01 06:04:37] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 06:04:37] [INFO ] Invariant cache hit.
[2024-06-01 06:04:37] [INFO ] Implicit Places using invariants in 323 ms returned [52, 108]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 325 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 123/126 places, 1225/1226 transitions.
Applied a total of 0 rules in 71 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 45839 ms. Remains : 123/126 places, 1225/1226 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N10-LTLFireability-15
Product exploration explored 100000 steps with 5081 reset in 423 ms.
Product exploration explored 100000 steps with 5385 reset in 328 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 111 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 40 ms :[(NOT p0)]
RANDOM walk for 102 steps (0 resets) in 6 ms. (14 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 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 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
[2024-06-01 06:04:39] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
// Phase 1: matrix 245 rows 123 cols
[2024-06-01 06:04:39] [INFO ] Computed 5 invariants in 2 ms
[2024-06-01 06:04:39] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-06-01 06:04:39] [INFO ] [Real]Absence check using state equation in 331 ms returned sat
[2024-06-01 06:04:39] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:04:40] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-06-01 06:04:40] [INFO ] [Nat]Absence check using state equation in 89 ms returned sat
[2024-06-01 06:04:40] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 06:04:40] [INFO ] [Nat]Added 20 Read/Feed constraints in 42 ms returned sat
[2024-06-01 06:04:40] [INFO ] Computed and/alt/rep : 108/216/108 causal constraints (skipped 134 transitions) in 34 ms.
[2024-06-01 06:04:40] [INFO ] Added : 12 causal constraints over 4 iterations in 193 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 101 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Running 1222 sub problems to find dead transitions.
[2024-06-01 06:04:40] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 06:04:40] [INFO ] Invariant cache hit.
[2024-06-01 06:04: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-06-01 06:04:49] [INFO ] Deduced a trap composed of 5 places in 203 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 20022 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 20127 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 45710ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 45731ms
[2024-06-01 06:05:26] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 06:05:26] [INFO ] Invariant cache hit.
[2024-06-01 06:05:26] [INFO ] Implicit Places using invariants in 273 ms returned []
[2024-06-01 06:05:26] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 06:05:26] [INFO ] Invariant cache hit.
[2024-06-01 06:05:26] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 06:05:27] [INFO ] Implicit Places using invariants and state equation in 521 ms returned []
Implicit Place search using SMT with State Equation took 799 ms to find 0 implicit places.
[2024-06-01 06:05:27] [INFO ] Redundant transitions in 18 ms returned []
Running 1222 sub problems to find dead transitions.
[2024-06-01 06:05:27] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 06:05:27] [INFO ] Invariant cache hit.
[2024-06-01 06:05:27] [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-06-01 06:05:36] [INFO ] Deduced a trap composed of 5 places in 161 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
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 368/368 variables, and 149 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 30029 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 30036 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 65957ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 65970ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 112637 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 117 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 71 ms :[(NOT p0)]
RANDOM walk for 87 steps (0 resets) in 6 ms. (12 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 145 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 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
[2024-06-01 06:06:33] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 06:06:33] [INFO ] Invariant cache hit.
[2024-06-01 06:06:34] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-06-01 06:06:34] [INFO ] [Real]Absence check using state equation in 332 ms returned sat
[2024-06-01 06:06:34] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:06:35] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2024-06-01 06:06:35] [INFO ] [Nat]Absence check using state equation in 144 ms returned sat
[2024-06-01 06:06:35] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 06:06:35] [INFO ] [Nat]Added 20 Read/Feed constraints in 60 ms returned sat
[2024-06-01 06:06:35] [INFO ] Computed and/alt/rep : 108/216/108 causal constraints (skipped 134 transitions) in 43 ms.
[2024-06-01 06:06:35] [INFO ] Added : 12 causal constraints over 4 iterations in 258 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Product exploration explored 100000 steps with 5209 reset in 440 ms.
Product exploration explored 100000 steps with 5147 reset in 399 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 43 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Running 1222 sub problems to find dead transitions.
[2024-06-01 06:06:36] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 06:06:36] [INFO ] Invariant cache hit.
[2024-06-01 06:06:36] [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-06-01 06:06:44] [INFO ] Deduced a trap composed of 5 places in 171 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 20024 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 20043 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 43987ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 43999ms
[2024-06-01 06:07:20] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 06:07:20] [INFO ] Invariant cache hit.
[2024-06-01 06:07:20] [INFO ] Implicit Places using invariants in 199 ms returned []
[2024-06-01 06:07:20] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 06:07:20] [INFO ] Invariant cache hit.
[2024-06-01 06:07:20] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 06:07:21] [INFO ] Implicit Places using invariants and state equation in 403 ms returned []
Implicit Place search using SMT with State Equation took 621 ms to find 0 implicit places.
[2024-06-01 06:07:21] [INFO ] Redundant transitions in 13 ms returned []
Running 1222 sub problems to find dead transitions.
[2024-06-01 06:07:21] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 06:07:21] [INFO ] Invariant cache hit.
[2024-06-01 06:07: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-06-01 06:07:29] [INFO ] Deduced a trap composed of 5 places in 166 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 30027 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 30029 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 64992ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 65004ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 109692 ms. Remains : 123/123 places, 1225/1225 transitions.
Treatment of property BridgeAndVehicles-PT-V50P20N10-LTLFireability-15 finished in 274287 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 474 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, 1226/1226 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 125 transition count 1225
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 125 transition count 1225
Applied a total of 2 rules in 21 ms. Remains 125 /126 variables (removed 1) and now considering 1225/1226 (removed 1) transitions.
Running 1222 sub problems to find dead transitions.
[2024-06-01 06:08:27] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
// Phase 1: matrix 245 rows 125 cols
[2024-06-01 06:08:27] [INFO ] Computed 7 invariants in 2 ms
[2024-06-01 06:08:27] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-06-01 06:08:37] [INFO ] Deduced a trap composed of 5 places in 137 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 125/370 variables, and 8 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/125 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/125 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (OVERLAPS) 245/370 variables, 125/133 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/370 variables, 20/153 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 370/370 variables, and 1375 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20367 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 125/125 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
After SMT, in 45766ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 45780ms
[2024-06-01 06:09:13] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 06:09:13] [INFO ] Invariant cache hit.
[2024-06-01 06:09:13] [INFO ] Implicit Places using invariants in 155 ms returned [52, 108]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 159 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 123/126 places, 1225/1226 transitions.
Applied a total of 0 rules in 15 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 45979 ms. Remains : 123/126 places, 1225/1226 transitions.
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N10-LTLFireability-02
Product exploration explored 100000 steps with 1702 reset in 1589 ms.
Product exploration explored 100000 steps with 1687 reset in 1528 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 264 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 496 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 1756 ms. (22 steps per ms) remains 6/20 properties
BEST_FIRST walk for 40001 steps (40 resets) in 1417 ms. (28 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (40 resets) in 2104 ms. (19 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (40 resets) in 2039 ms. (19 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (40 resets) in 1757 ms. (22 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (40 resets) in 1840 ms. (21 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (40 resets) in 1840 ms. (21 steps per ms) remains 6/6 properties
[2024-06-01 06:09:20] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
// Phase 1: matrix 245 rows 123 cols
[2024-06-01 06:09:20] [INFO ] Computed 5 invariants in 1 ms
[2024-06-01 06:09:20] [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 90 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 353ms 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 1121 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 270 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 291 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-06-01 06:09:22] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 06:09:22] [INFO ] Invariant cache hit.
[2024-06-01 06:09:22] [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-06-01 06:09:33] [INFO ] Deduced a trap composed of 5 places in 150 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 20022 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 20022 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 45797ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 45810ms
[2024-06-01 06:10:08] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 06:10:08] [INFO ] Invariant cache hit.
[2024-06-01 06:10:08] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-06-01 06:10:08] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 06:10:08] [INFO ] Invariant cache hit.
[2024-06-01 06:10:08] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 06:10:09] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 263 ms to find 0 implicit places.
Running 1222 sub problems to find dead transitions.
[2024-06-01 06:10:09] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 06:10:09] [INFO ] Invariant cache hit.
[2024-06-01 06:10: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-06-01 06:10:19] [INFO ] Deduced a trap composed of 5 places in 123 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
[2024-06-01 06:10:43] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 1 ms to minimize.
[2024-06-01 06:10:44] [INFO ] Deduced a trap composed of 14 places in 138 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 368/368 variables, and 151 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: 3/3 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, 3/8 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 245/368 variables, 123/131 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/368 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 1222/1373 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 1373 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 30048 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: 3/3 constraints]
After SMT, in 66752ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 66766ms
Finished structural reductions in LTL mode , in 1 iterations and 112849 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 222 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 317 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 756 steps (0 resets) in 29 ms. (25 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 844 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 375 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 272 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 280 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 1168 reset in 1093 ms.
Product exploration explored 100000 steps with 1122 reset in 825 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-06-01 06:11:20] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 06:11:20] [INFO ] Invariant cache hit.
[2024-06-01 06:11:20] [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-06-01 06:11:31] [INFO ] Deduced a trap composed of 5 places in 129 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 20035 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 20475 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 46169ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 46191ms
[2024-06-01 06:12:06] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 06:12:06] [INFO ] Invariant cache hit.
[2024-06-01 06:12:06] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-06-01 06:12:06] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 06:12:06] [INFO ] Invariant cache hit.
[2024-06-01 06:12:06] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 06:12:06] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 300 ms to find 0 implicit places.
Running 1222 sub problems to find dead transitions.
[2024-06-01 06:12:06] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 06:12:06] [INFO ] Invariant cache hit.
[2024-06-01 06:12:06] [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-06-01 06:12:16] [INFO ] Deduced a trap composed of 5 places in 128 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
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 30045 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 30039 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 65687ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 65705ms
Finished structural reductions in LTL mode , in 1 iterations and 112215 ms. Remains : 123/123 places, 1225/1225 transitions.
Treatment of property BridgeAndVehicles-PT-V50P20N10-LTLFireability-02 finished in 286190 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-06-01 06:13:13] [INFO ] Flatten gal took : 129 ms
[2024-06-01 06:13:13] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/LTLFireability.sr.xml took 48 ms.
[2024-06-01 06:13:13] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 126 places, 1226 transitions and 9200 arcs took 14 ms.
Total runtime 1801722 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : BridgeAndVehicles-PT-V50P20N10-LTLFireability-00
Could not compute solution for formula : BridgeAndVehicles-PT-V50P20N10-LTLFireability-02
Could not compute solution for formula : BridgeAndVehicles-PT-V50P20N10-LTLFireability-04
Could not compute solution for formula : BridgeAndVehicles-PT-V50P20N10-LTLFireability-07
FORMULA BridgeAndVehicles-PT-V50P20N10-LTLFireability-15 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717222465267

--------------------
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
mcc2024
ltl formula name BridgeAndVehicles-PT-V50P20N10-LTLFireability-00
ltl formula formula --ltl=/tmp/2494/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 126 places, 1226 transitions and 9200 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.310 real 0.060 user 0.070 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2494/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2494/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2494/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2494/ltl_0_
pnml2lts-mc( 0/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): unaligned fastbin chunk detected
ltl formula name BridgeAndVehicles-PT-V50P20N10-LTLFireability-02
ltl formula formula --ltl=/tmp/2494/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 126 places, 1226 transitions and 9200 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2494/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2494/ltl_1_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.200 real 0.030 user 0.040 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2494/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2494/ltl_1_
pnml2lts-mc( 0/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size
ltl formula name BridgeAndVehicles-PT-V50P20N10-LTLFireability-04
ltl formula formula --ltl=/tmp/2494/ltl_2_
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 126 places, 1226 transitions and 9200 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2494/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2494/ltl_2_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.170 real 0.030 user 0.030 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2494/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2494/ltl_2_
pnml2lts-mc( 1/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): unaligned fastbin chunk detected
pnml2lts-mc( 2/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): unaligned fastbin chunk detected
ltl formula name BridgeAndVehicles-PT-V50P20N10-LTLFireability-07
ltl formula formula --ltl=/tmp/2494/ltl_3_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 126 places, 1226 transitions and 9200 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.180 real 0.040 user 0.030 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2494/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2494/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2494/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2494/ltl_3_
pnml2lts-mc( 2/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): unaligned fastbin chunk detected
pnml2lts-mc( 0/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): unaligned fastbin chunk detected
ltl formula name BridgeAndVehicles-PT-V50P20N10-LTLFireability-15
ltl formula formula --ltl=/tmp/2494/ltl_4_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 126 places, 1226 transitions and 9200 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2494/ltl_4_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2494/ltl_4_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.180 real 0.050 user 0.020 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2494/ltl_4_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2494/ltl_4_
pnml2lts-mc( 0/ 4): buchi has 1 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 129 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 127, there are 1227 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~118 levels ~10000 states ~15016 transitions
pnml2lts-mc( 0/ 4): ~118 levels ~20000 states ~35164 transitions
pnml2lts-mc( 0/ 4): ~118 levels ~40000 states ~93828 transitions
pnml2lts-mc( 0/ 4): ~127 levels ~80000 states ~189188 transitions
pnml2lts-mc( 0/ 4): ~136 levels ~160000 states ~383672 transitions
pnml2lts-mc( 0/ 4): ~136 levels ~320000 states ~817776 transitions
pnml2lts-mc( 2/ 4): ~173 levels ~640000 states ~2188596 transitions
pnml2lts-mc( 2/ 4): ~206 levels ~1280000 states ~4561096 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 1361412
pnml2lts-mc( 0/ 4): unique states count: 1361412
pnml2lts-mc( 0/ 4): unique transitions count: 4426611
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 3276229
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 1485688
pnml2lts-mc( 0/ 4): - cum. max stack depth: 998
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 1485688 states 4832426 transitions, fanout: 3.253
pnml2lts-mc( 0/ 4): Total exploration time 20.920 sec (20.900 sec minimum, 20.910 sec on average)
pnml2lts-mc( 0/ 4): States per second: 71018, Transitions per second: 230996
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 11.1MB, 8.5 B/state, compr.: 1.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 4.0%/1.0%
pnml2lts-mc( 0/ 4): Stored 1256 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 11.1MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is 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 r472-tajo-171620399100228"
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 ;