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-171620398700068.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-COL-V50P20N10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r472-tajo-171620398700068
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 444K
-rw-r--r-- 1 mcc users 7.7K Apr 13 00:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Apr 13 00:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Apr 13 00:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 13 00:33 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 4.4K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 22 14:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.0K Apr 13 01:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K Apr 13 01:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Apr 13 01:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 13 01:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_pt
-rw-r--r-- 1 mcc users 10 May 18 16:42 instance
-rw-r--r-- 1 mcc users 5 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 42K 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-COL-V50P20N10-LTLFireability-00
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-LTLFireability-01
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-LTLFireability-02
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-LTLFireability-03
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-LTLFireability-04
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-LTLFireability-05
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-LTLFireability-06
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-LTLFireability-07
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-LTLFireability-08
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-LTLFireability-09
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-LTLFireability-10
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-LTLFireability-11
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-LTLFireability-12
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-LTLFireability-13
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-LTLFireability-14
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717218297364

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-COL-V50P20N10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 05:04:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 05:04:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 05:04:58] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-06-01 05:04:59] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 05:04:59] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 594 ms
[2024-06-01 05:04:59] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 128 PT places and 114798.0 transition bindings in 20 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
[2024-06-01 05:04:59] [INFO ] Built PT skeleton of HLPN with 15 places and 11 transitions 56 arcs in 4 ms.
[2024-06-01 05:04:59] [INFO ] Skeletonized 11 HLPN properties in 2 ms. Removed 5 properties that had guard overlaps.
Initial state reduction rules removed 2 formulas.
FORMULA BridgeAndVehicles-COL-V50P20N10-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V50P20N10-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 12 stabilizing places and 6 stable transitions
Graph (complete) has 51 edges and 15 vertex of which 13 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Remains 4 properties that can be checked using skeleton over-approximation.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Computed a total of 9 stabilizing places and 6 stable transitions
Graph (complete) has 22 edges and 12 vertex of which 10 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
RANDOM walk for 379 steps (0 resets) in 12 ms. (29 steps per ms) remains 0/3 properties
[2024-06-01 05:04:59] [INFO ] Flatten gal took : 13 ms
[2024-06-01 05:04:59] [INFO ] Flatten gal took : 2 ms
Arc [1:1*[(MOD (ADD $cA 1) 51)]] contains successor/predecessor on variables of sort voitureA
Arc [6:1*[(MOD (ADD (MOD (MINUS $cB 1) 51) 51) 51)]] contains successor/predecessor on variables of sort voitureB
Arc [13:1*[(MOD (ADD $cpt 1) 11)]] contains successor/predecessor on variables of sort compteur
Arc [14:1*[(MOD (ADD $s 1) 2)]] contains successor/predecessor on variables of sort sens
[2024-06-01 05:04:59] [INFO ] Unfolded HLPN to a Petri net with 128 places and 1328 transitions 10010 arcs in 90 ms.
[2024-06-01 05:04:59] [INFO ] Unfolded 14 HLPN properties in 1 ms.
Initial state reduction rules removed 4 formulas.
FORMULA BridgeAndVehicles-COL-V50P20N10-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V50P20N10-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V50P20N10-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V50P20N10-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 124 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 33 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:05:00] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 126 cols
[2024-06-01 05:05:00] [INFO ] Computed 5 invariants in 19 ms
[2024-06-01 05:05:00] [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:05:12] [INFO ] Deduced a trap composed of 5 places in 184 ms of which 10 ms to minimize.
[2024-06-01 05:05:17] [INFO ] Deduced a trap composed of 15 places in 184 ms of which 2 ms to minimize.
Problem TDEAD728 is UNSAT
Problem TDEAD729 is UNSAT
Problem TDEAD730 is UNSAT
Problem TDEAD731 is UNSAT
Problem TDEAD732 is UNSAT
Problem TDEAD733 is UNSAT
Problem TDEAD734 is UNSAT
Problem TDEAD735 is UNSAT
Problem TDEAD736 is UNSAT
Problem TDEAD737 is UNSAT
Problem TDEAD738 is UNSAT
Problem TDEAD739 is UNSAT
Problem TDEAD740 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD742 is UNSAT
Problem TDEAD743 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD745 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD754 is UNSAT
Problem TDEAD755 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD758 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD760 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD764 is UNSAT
Problem TDEAD765 is UNSAT
Problem TDEAD766 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD769 is UNSAT
Problem TDEAD770 is UNSAT
Problem TDEAD771 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD774 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD776 is UNSAT
Problem TDEAD777 is UNSAT
[2024-06-01 05:05:21] [INFO ] Deduced a trap composed of 14 places in 130 ms of which 2 ms to minimize.
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 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 20118 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 21168 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 48299ms problems are : Problem set: 102 solved, 1223 unsolved
Search for dead transitions found 102 dead transitions in 48344ms
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:05:48] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
// Phase 1: matrix 246 rows 126 cols
[2024-06-01 05:05:48] [INFO ] Computed 7 invariants in 6 ms
[2024-06-01 05:05:48] [INFO ] Implicit Places using invariants in 101 ms returned [53]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 108 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 125/128 places, 1226/1328 transitions.
Applied a total of 0 rules in 31 ms. Remains 125 /125 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 48561 ms. Remains : 125/128 places, 1226/1328 transitions.
Support contains 124 out of 125 places after structural reductions.
[2024-06-01 05:05:48] [INFO ] Flatten gal took : 296 ms
[2024-06-01 05:05:49] [INFO ] Flatten gal took : 141 ms
[2024-06-01 05:05:49] [INFO ] Input system was already deterministic with 1226 transitions.
Reduction of identical properties reduced properties to check from 10 to 8
RANDOM walk for 3428 steps (7 resets) in 591 ms. (5 steps per ms) remains 0/8 properties
FORMULA BridgeAndVehicles-COL-V50P20N10-LTLFireability-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA BridgeAndVehicles-COL-V50P20N10-LTLFireability-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 108 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 125 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 125/125 places, 1226/1226 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 124 transition count 1225
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 124 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 122 transition count 1224
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 120 transition count 1222
Applied a total of 9 rules in 204 ms. Remains 120 /125 variables (removed 5) and now considering 1222/1226 (removed 4) transitions.
[2024-06-01 05:05:50] [INFO ] Flow matrix only has 242 transitions (discarded 980 similar events)
// Phase 1: matrix 242 rows 120 cols
[2024-06-01 05:05:50] [INFO ] Computed 5 invariants in 4 ms
[2024-06-01 05:05:50] [INFO ] Implicit Places using invariants in 195 ms returned [103]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 199 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 119/125 places, 1222/1226 transitions.
Applied a total of 0 rules in 85 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 491 ms. Remains : 119/125 places, 1222/1226 transitions.
Stuttering acceptance computed with spot in 243 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BridgeAndVehicles-COL-V50P20N10-LTLFireability-00
Product exploration explored 100000 steps with 680 reset in 3559 ms.
Product exploration explored 100000 steps with 682 reset in 3729 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 (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 7 factoid took 381 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 103 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 1732 steps (5 resets) in 402 ms. (4 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (F p1), (F (NOT (OR (NOT p0) p1))), (F p0), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 7 factoid took 517 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 94 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-06-01 05:05:59] [INFO ] Flow matrix only has 242 transitions (discarded 980 similar events)
// Phase 1: matrix 242 rows 119 cols
[2024-06-01 05:05:59] [INFO ] Computed 4 invariants in 3 ms
[2024-06-01 05:06:07] [INFO ] [Real]Absence check using 4 positive place invariants in 7 ms returned sat
[2024-06-01 05:06:07] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2024-06-01 05:06:07] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:06:14] [INFO ] [Nat]Absence check using 4 positive place invariants in 7 ms returned sat
[2024-06-01 05:06:14] [INFO ] [Nat]Absence check using state equation in 101 ms returned sat
[2024-06-01 05:06:14] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:06:14] [INFO ] [Nat]Added 20 Read/Feed constraints in 28 ms returned sat
[2024-06-01 05:06:14] [INFO ] Computed and/alt/rep : 108/216/108 causal constraints (skipped 131 transitions) in 92 ms.
[2024-06-01 05:06:14] [INFO ] Added : 31 causal constraints over 7 iterations in 318 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 82 ms. Remains 119 /119 variables (removed 0) and now considering 1222/1222 (removed 0) transitions.
[2024-06-01 05:06:14] [INFO ] Flow matrix only has 242 transitions (discarded 980 similar events)
[2024-06-01 05:06:14] [INFO ] Invariant cache hit.
[2024-06-01 05:06:14] [INFO ] Implicit Places using invariants in 132 ms returned []
[2024-06-01 05:06:14] [INFO ] Flow matrix only has 242 transitions (discarded 980 similar events)
[2024-06-01 05:06:14] [INFO ] Invariant cache hit.
[2024-06-01 05:06:14] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:06:15] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 363 ms to find 0 implicit places.
[2024-06-01 05:06:15] [INFO ] Redundant transitions in 84 ms returned []
Running 1219 sub problems to find dead transitions.
[2024-06-01 05:06:15] [INFO ] Flow matrix only has 242 transitions (discarded 980 similar events)
[2024-06-01 05:06:15] [INFO ] Invariant cache hit.
[2024-06-01 05:06:15] [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 30027 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 30031 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 65028ms problems are : Problem set: 0 solved, 1219 unsolved
Search for dead transitions found 0 dead transitions in 65047ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 65598 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 (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 7 factoid took 368 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 101 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 1728 steps (5 resets) in 212 ms. (8 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (F p1), (F (NOT (OR (NOT p0) p1))), (F p0), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 7 factoid took 492 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 97 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-06-01 05:07:21] [INFO ] Flow matrix only has 242 transitions (discarded 980 similar events)
[2024-06-01 05:07:21] [INFO ] Invariant cache hit.
[2024-06-01 05:07:29] [INFO ] [Real]Absence check using 4 positive place invariants in 7 ms returned sat
[2024-06-01 05:07:29] [INFO ] [Real]Absence check using state equation in 100 ms returned sat
[2024-06-01 05:07:29] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:07:36] [INFO ] [Nat]Absence check using 4 positive place invariants in 7 ms returned sat
[2024-06-01 05:07:36] [INFO ] [Nat]Absence check using state equation in 99 ms returned sat
[2024-06-01 05:07:36] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:07:36] [INFO ] [Nat]Added 20 Read/Feed constraints in 19 ms returned sat
[2024-06-01 05:07:36] [INFO ] Computed and/alt/rep : 108/216/108 causal constraints (skipped 131 transitions) in 46 ms.
[2024-06-01 05:07:37] [INFO ] Added : 32 causal constraints over 8 iterations in 257 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 683 reset in 3745 ms.
Product exploration explored 100000 steps with 677 reset in 3432 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 70 ms. Remains 119 /119 variables (removed 0) and now considering 1222/1222 (removed 0) transitions.
[2024-06-01 05:07:44] [INFO ] Flow matrix only has 242 transitions (discarded 980 similar events)
[2024-06-01 05:07:44] [INFO ] Invariant cache hit.
[2024-06-01 05:07:44] [INFO ] Implicit Places using invariants in 142 ms returned []
[2024-06-01 05:07:44] [INFO ] Flow matrix only has 242 transitions (discarded 980 similar events)
[2024-06-01 05:07:44] [INFO ] Invariant cache hit.
[2024-06-01 05:07:44] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:07:44] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 383 ms to find 0 implicit places.
[2024-06-01 05:07:44] [INFO ] Redundant transitions in 22 ms returned []
Running 1219 sub problems to find dead transitions.
[2024-06-01 05:07:44] [INFO ] Flow matrix only has 242 transitions (discarded 980 similar events)
[2024-06-01 05:07:44] [INFO ] Invariant cache hit.
[2024-06-01 05:07:45] [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
At refinement iteration 5 (OVERLAPS) 0/361 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1219 unsolved
No progress, stopping.
After SMT solving in domain Real declared 361/361 variables, and 143 constraints, problems are : Problem set: 0 solved, 1219 unsolved in 30018 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 30051 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 66367ms problems are : Problem set: 0 solved, 1219 unsolved
Search for dead transitions found 0 dead transitions in 66386ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 66875 ms. Remains : 119/119 places, 1222/1222 transitions.
Treatment of property BridgeAndVehicles-COL-V50P20N10-LTLFireability-00 finished in 181599 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(((X(!p0) U (X(G(!p0))||(!p1&&X(!p0))))&&(p2||G(F(!p3))))))'
Support contains 119 out of 125 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 125/125 places, 1226/1226 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 124 transition count 1225
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 124 transition count 1225
Applied a total of 2 rules in 13 ms. Remains 124 /125 variables (removed 1) and now considering 1225/1226 (removed 1) transitions.
Running 1222 sub problems to find dead transitions.
[2024-06-01 05:08:51] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
// Phase 1: matrix 245 rows 124 cols
[2024-06-01 05:08:51] [INFO ] Computed 6 invariants in 5 ms
[2024-06-01 05:08:51] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-06-01 05:09:01] [INFO ] Deduced a trap composed of 5 places in 160 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 20023 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 20568 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 45781ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 45798ms
[2024-06-01 05:09:37] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 05:09:37] [INFO ] Invariant cache hit.
[2024-06-01 05:09:37] [INFO ] Implicit Places using invariants in 106 ms returned [105]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 109 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 123/125 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 45932 ms. Remains : 123/125 places, 1225/1226 transitions.
Stuttering acceptance computed with spot in 570 ms :[(OR p0 (AND (NOT p2) p3)), p0, (OR (AND (NOT p2) p3) (AND p0 p3)), (OR (AND (NOT p2) p3) (AND p0 p3)), false, (AND p0 p3), (AND p0 p3), (AND p0 (NOT p2) p3), (AND p0 (NOT p2) p3)]
Running random walk in product with property : BridgeAndVehicles-COL-V50P20N10-LTLFireability-02
Product exploration explored 100000 steps with 1733 reset in 1267 ms.
Product exploration explored 100000 steps with 1636 reset in 1355 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 p2) (NOT p3) p1 (NOT p0)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p2) p3))), (X (NOT (AND p2 p3))), (X (NOT (AND p1 p2 p3))), (X (NOT (AND p1 p2))), (X (NOT p0)), (X (NOT (AND (NOT p2) p3 p0))), (X p1), (X (AND p1 (NOT p0))), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT (AND p2 p3 p0)))), (X (X (NOT (AND p1 p2 p3)))), (X (X (NOT (AND p1 (NOT p2) p3 p0)))), (X (X (NOT (AND p1 p2 p3 p0)))), (X (X (NOT (AND (NOT p2) p3 p0)))), (X (X (NOT (AND p3 (NOT p0))))), (X (X (NOT (AND p1 p3 (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p2 p3)))), (X (X (NOT (AND p2 p0)))), (X (X (OR (AND p1 (NOT p2)) (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 p2 p0)))), (X (X (NOT p0))), (X (X (OR (NOT p2) (NOT p0)))), (X (X p1)), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 36 factoid took 362 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 514 ms :[(OR (AND (NOT p2) p3) (AND p0 p3)), p0, (OR (AND (NOT p2) p3) (AND p0 p3)), (OR (AND (NOT p2) p3) (AND p0 p3)), false, (AND p0 p3), (AND p0 p3), (AND p0 (NOT p2) p3), (AND p0 (NOT p2) p3)]
Reduction of identical properties reduced properties to check from 21 to 20
RANDOM walk for 40000 steps (88 resets) in 1222 ms. (32 steps per ms) remains 6/20 properties
BEST_FIRST walk for 40001 steps (40 resets) in 1287 ms. (31 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (40 resets) in 842 ms. (47 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (40 resets) in 1069 ms. (37 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (40 resets) in 1087 ms. (36 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (40 resets) in 820 ms. (48 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (40 resets) in 739 ms. (54 steps per ms) remains 6/6 properties
[2024-06-01 05:09:43] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
// Phase 1: matrix 245 rows 123 cols
[2024-06-01 05:09:43] [INFO ] Computed 5 invariants in 7 ms
[2024-06-01 05:09:43] [INFO ] State equation strengthened by 20 read => feed constraints.
Problem apf4 is UNSAT
Problem apf8 is UNSAT
Problem apf9 is UNSAT
Problem apf13 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 apf3 is UNSAT
Problem apf19 is UNSAT
After SMT solving in domain Real declared 123/368 variables, and 5 constraints, problems are : Problem set: 6 solved, 0 unsolved in 120 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 450ms problems are : Problem set: 6 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 7 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p3) p1 (NOT p0)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p2) p3))), (X (NOT (AND p2 p3))), (X (NOT (AND p1 p2 p3))), (X (NOT (AND p1 p2))), (X (NOT p0)), (X (NOT (AND (NOT p2) p3 p0))), (X p1), (X (AND p1 (NOT p0))), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT (AND p2 p3 p0)))), (X (X (NOT (AND p1 p2 p3)))), (X (X (NOT (AND p1 (NOT p2) p3 p0)))), (X (X (NOT (AND p1 p2 p3 p0)))), (X (X (NOT (AND (NOT p2) p3 p0)))), (X (X (NOT (AND p3 (NOT p0))))), (X (X (NOT (AND p1 p3 (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p2 p3)))), (X (X (NOT (AND p2 p0)))), (X (X (OR (AND p1 (NOT p2)) (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 p2 p0)))), (X (X (NOT p0))), (X (X (OR (NOT p2) (NOT p0)))), (X (X p1)), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p1) (G (NOT p1)))), (G (OR (NOT p1) (NOT p2) (NOT p3))), (G (OR (NOT p0) (NOT p1) (NOT p2) (NOT p3))), (G (OR (NOT p0) (NOT p1) (NOT p2))), (G (OR (NOT p0) (NOT p2))), (G (OR (NOT p1) (NOT p2))), (G (OR (NOT p0) (NOT p2) (NOT p3))), (G (OR (NOT p0) (NOT p2)))]
False Knowledge obtained : [(F (NOT (OR (AND (NOT p0) p1) (AND p1 (NOT p2))))), (F (NOT (OR p0 (NOT p1) (NOT p3)))), (F (NOT (OR (NOT p0) (NOT p1) p2 (NOT p3)))), (F (NOT (OR (NOT p0) p2))), (F (NOT (OR (NOT p2) (NOT p3)))), (F (NOT (OR p2 (NOT p3)))), (F p2), (F (NOT p1)), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) p1))), (F p0), (F p3), (F (NOT (OR (NOT p0) p2 (NOT p3)))), (F (NOT (OR p0 (NOT p3))))]
Knowledge based reduction with 43 factoid took 1332 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 484 ms :[(OR (AND (NOT p2) p3) (AND p0 p3)), p0, (OR (AND (NOT p2) p3) (AND p0 p3)), (OR (AND (NOT p2) p3) (AND p0 p3)), false, (AND p0 p3), (AND p0 p3)]
Stuttering acceptance computed with spot in 326 ms :[(OR (AND (NOT p2) p3) (AND p0 p3)), p0, (OR (AND (NOT p2) p3) (AND p0 p3)), (OR (AND (NOT p2) p3) (AND p0 p3)), false, (AND p0 p3), (AND p0 p3)]
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:09:46] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 05:09:46] [INFO ] Invariant cache hit.
[2024-06-01 05:09:46] [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:09:56] [INFO ] Deduced a trap composed of 5 places in 116 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 20132 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 45877ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 45893ms
[2024-06-01 05:10:32] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 05:10:32] [INFO ] Invariant cache hit.
[2024-06-01 05:10:32] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-06-01 05:10:32] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 05:10:32] [INFO ] Invariant cache hit.
[2024-06-01 05:10:32] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:10:32] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 277 ms to find 0 implicit places.
Running 1222 sub problems to find dead transitions.
[2024-06-01 05:10:32] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 05:10:32] [INFO ] Invariant cache hit.
[2024-06-01 05:10:32] [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:10:42] [INFO ] Deduced a trap composed of 5 places in 165 ms of which 5 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 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: 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 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]
After SMT, in 66262ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 66283ms
Finished structural reductions in LTL mode , in 1 iterations and 112467 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 p0) (NOT p3) p1 (NOT p2)), (X (NOT p3)), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p2) p3))), (X (NOT (AND p2 p3))), (X (NOT p0)), (X (NOT p2)), (X p1), (X (X (NOT p3))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT (AND p2 p3)))), (X (X (NOT (AND p0 p3)))), (X (X (NOT p0))), (X (X (NOT p2))), (X (X (NOT (AND p0 p1)))), (X (X p1)), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 251 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 285 ms :[(OR (AND (NOT p2) p3) (AND p0 p3)), p0, (OR (AND (NOT p2) p3) (AND p0 p3)), (OR (AND (NOT p2) p3) (AND p0 p3)), false, (AND p0 p3), (AND p0 p3)]
RANDOM walk for 688 steps (0 resets) in 17 ms. (38 steps per ms) remains 0/9 properties
Knowledge obtained : [(AND (NOT p0) (NOT p3) p1 (NOT p2)), (X (NOT p3)), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p2) p3))), (X (NOT (AND p2 p3))), (X (NOT p0)), (X (NOT p2)), (X p1), (X (X (NOT p3))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT (AND p2 p3)))), (X (X (NOT (AND p0 p3)))), (X (X (NOT p0))), (X (X (NOT p2))), (X (X (NOT (AND p0 p1)))), (X (X p1)), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (OR (NOT p2) (NOT p3)))), (F (NOT (OR (NOT p3) (NOT p0)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F p0), (F p3), (F (NOT (OR p2 (NOT p3)))), (F (NOT (AND (NOT p0) p1))), (F p2), (F (NOT p1))]
Knowledge based reduction with 19 factoid took 598 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 249 ms :[(OR (AND (NOT p2) p3) (AND p0 p3)), p0, (OR (AND (NOT p2) p3) (AND p0 p3)), (OR (AND (NOT p2) p3) (AND p0 p3)), false, (AND p0 p3), (AND p0 p3)]
Stuttering acceptance computed with spot in 230 ms :[(OR (AND (NOT p2) p3) (AND p0 p3)), p0, (OR (AND (NOT p2) p3) (AND p0 p3)), (OR (AND (NOT p2) p3) (AND p0 p3)), false, (AND p0 p3), (AND p0 p3)]
Stuttering acceptance computed with spot in 216 ms :[(OR (AND (NOT p2) p3) (AND p0 p3)), p0, (OR (AND (NOT p2) p3) (AND p0 p3)), (OR (AND (NOT p2) p3) (AND p0 p3)), false, (AND p0 p3), (AND p0 p3)]
Product exploration explored 100000 steps with 1176 reset in 801 ms.
Product exploration explored 100000 steps with 1153 reset in 826 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:11:42] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 05:11:42] [INFO ] Invariant cache hit.
[2024-06-01 05:11:42] [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:11:51] [INFO ] Deduced a trap composed of 5 places in 111 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 123/368 variables, and 6 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/123 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 245/368 variables, 123/129 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/368 variables, 20/149 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 368/368 variables, and 1371 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20387 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 45956ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 45969ms
[2024-06-01 05:12:28] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 05:12:28] [INFO ] Invariant cache hit.
[2024-06-01 05:12:28] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-06-01 05:12:28] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 05:12:28] [INFO ] Invariant cache hit.
[2024-06-01 05:12:28] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:12:28] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 248 ms to find 0 implicit places.
Running 1222 sub problems to find dead transitions.
[2024-06-01 05:12:28] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 05:12:28] [INFO ] Invariant cache hit.
[2024-06-01 05:12:29] [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:12:38] [INFO ] Deduced a trap composed of 5 places in 158 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
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 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: 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 30049 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 64225ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 64239ms
Finished structural reductions in LTL mode , in 1 iterations and 110466 ms. Remains : 123/123 places, 1225/1225 transitions.
Treatment of property BridgeAndVehicles-COL-V50P20N10-LTLFireability-02 finished in 281713 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 125 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 125/125 places, 1226/1226 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 124 transition count 1225
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 124 transition count 1225
Applied a total of 2 rules in 11 ms. Remains 124 /125 variables (removed 1) and now considering 1225/1226 (removed 1) transitions.
Running 1222 sub problems to find dead transitions.
[2024-06-01 05:13:33] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
// Phase 1: matrix 245 rows 124 cols
[2024-06-01 05:13:33] [INFO ] Computed 6 invariants in 2 ms
[2024-06-01 05:13:33] [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:13:42] [INFO ] Deduced a trap composed of 5 places in 171 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 124/369 variables, and 7 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 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 20026 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 45004ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 45019ms
[2024-06-01 05:14:18] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 05:14:18] [INFO ] Invariant cache hit.
[2024-06-01 05:14:18] [INFO ] Implicit Places using invariants in 175 ms returned []
[2024-06-01 05:14:18] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 05:14:18] [INFO ] Invariant cache hit.
[2024-06-01 05:14:18] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:14:18] [INFO ] Implicit Places using invariants and state equation in 307 ms returned []
Implicit Place search using SMT with State Equation took 484 ms to find 0 implicit places.
Running 1222 sub problems to find dead transitions.
[2024-06-01 05:14:18] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 05:14:18] [INFO ] Invariant cache hit.
[2024-06-01 05:14:18] [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:14:28] [INFO ] Deduced a trap composed of 5 places in 149 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 30022 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 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 124/124 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
After SMT, in 65938ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 65952ms
Starting structural reductions in LTL mode, iteration 1 : 124/125 places, 1225/1226 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 111472 ms. Remains : 124/125 places, 1225/1226 transitions.
Stuttering acceptance computed with spot in 224 ms :[(NOT p1), (NOT p1), (NOT p2), (NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V50P20N10-LTLFireability-03
Product exploration explored 100000 steps with 24979 reset in 478 ms.
Product exploration explored 100000 steps with 24961 reset in 488 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 p1)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) 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 133 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 179 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 812 steps (0 resets) in 12 ms. (62 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 p1)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p2))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1)), (F p0), (F p2), (F (NOT (AND p1 (NOT p0)))), (F (NOT (OR p1 p0))), (F (NOT (OR p1 (NOT 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 318 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-COL-V50P20N10-LTLFireability-03 FALSE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-COL-V50P20N10-LTLFireability-03 finished in 113366 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)&&F((p1&&G(!p2)))))'
Support contains 65 out of 125 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 125/125 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 124 transition count 1225
Applied a total of 2 rules in 179 ms. Remains 124 /125 variables (removed 1) and now considering 1225/1226 (removed 1) transitions.
Running 1222 sub problems to find dead transitions.
[2024-06-01 05:15:26] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
// Phase 1: matrix 245 rows 124 cols
[2024-06-01 05:15:26] [INFO ] Computed 6 invariants in 1 ms
[2024-06-01 05:15: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 05:15:36] [INFO ] Deduced a trap composed of 5 places in 135 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 124/369 variables, and 7 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20023 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 20239 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 46207ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 46219ms
[2024-06-01 05:16:13] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 05:16:13] [INFO ] Invariant cache hit.
[2024-06-01 05:16:13] [INFO ] Implicit Places using invariants in 177 ms returned [105]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 192 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 123/125 places, 1225/1226 transitions.
Applied a total of 0 rules in 66 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 46672 ms. Remains : 123/125 places, 1225/1226 transitions.
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p1) (NOT p0) p2), (NOT p0), (OR (NOT p1) p2), p2]
Running random walk in product with property : BridgeAndVehicles-COL-V50P20N10-LTLFireability-04
Product exploration explored 100000 steps with 268 reset in 631 ms.
Product exploration explored 100000 steps with 268 reset in 621 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/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 p2), (X p2), (X (OR (NOT p1) p2)), (X (NOT (AND p1 (NOT p2)))), (X p1), (X (X p2)), (X (X (OR (NOT p1) p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 11 factoid took 404 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter insensitive) to 4 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 144 ms :[(OR (NOT p1) p2), (OR (NOT p1) p2), p2, false]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 583 steps (0 resets) in 35 ms. (16 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p1 p2), (X p2), (X (OR (NOT p1) p2)), (X (NOT (AND p1 (NOT p2)))), (X p1), (X (X p2)), (X (X (OR (NOT p1) p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p1)), (F (NOT p2)), (F (NOT (OR (NOT p1) p2))), (F (NOT (OR (NOT p1) p2)))]
Knowledge based reduction with 11 factoid took 654 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 140 ms :[(OR (NOT p1) p2), (OR (NOT p1) p2), p2, false]
Stuttering acceptance computed with spot in 133 ms :[(OR (NOT p1) p2), (OR (NOT p1) p2), p2, false]
[2024-06-01 05:16:16] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
// Phase 1: matrix 245 rows 123 cols
[2024-06-01 05:16:16] [INFO ] Computed 5 invariants in 2 ms
[2024-06-01 05:16:16] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-06-01 05:16:17] [INFO ] [Real]Absence check using state equation in 130 ms returned sat
[2024-06-01 05:16:17] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:16:17] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-06-01 05:16:17] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2024-06-01 05:16:17] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:16:17] [INFO ] [Nat]Added 20 Read/Feed constraints in 34 ms returned sat
[2024-06-01 05:16:17] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 1 ms to minimize.
[2024-06-01 05:16:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 151 ms
[2024-06-01 05:16:17] [INFO ] Computed and/alt/rep : 108/216/108 causal constraints (skipped 134 transitions) in 33 ms.
[2024-06-01 05:16:17] [INFO ] Added : 19 causal constraints over 5 iterations in 195 ms. Result :sat
Could not prove EG p2
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 63 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:16:18] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 05:16:18] [INFO ] Invariant cache hit.
[2024-06-01 05:16:18] [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:16:28] [INFO ] Deduced a trap composed of 5 places in 162 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 123/368 variables, and 6 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/123 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 245/368 variables, 123/129 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/368 variables, 20/149 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 368/368 variables, and 1371 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20448 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 46699ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 46711ms
[2024-06-01 05:17:04] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 05:17:04] [INFO ] Invariant cache hit.
[2024-06-01 05:17:04] [INFO ] Implicit Places using invariants in 142 ms returned []
[2024-06-01 05:17:04] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 05:17:04] [INFO ] Invariant cache hit.
[2024-06-01 05:17:05] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:17:05] [INFO ] Implicit Places using invariants and state equation in 503 ms returned []
Implicit Place search using SMT with State Equation took 672 ms to find 0 implicit places.
[2024-06-01 05:17:05] [INFO ] Redundant transitions in 14 ms returned []
Running 1222 sub problems to find dead transitions.
[2024-06-01 05:17:05] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 05:17:05] [INFO ] Invariant cache hit.
[2024-06-01 05:17:05] [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:17:14] [INFO ] Deduced a trap composed of 5 places in 117 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 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: 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 30031 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 65490ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 65503ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 112974 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 p1 p2), (X p2), (X (OR (NOT p1) p2)), (X (NOT (AND p1 (NOT p2)))), (X p1), (X (X p2)), (X (X (OR (NOT p1) p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 210 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 184 ms :[(OR (NOT p1) p2), (OR (NOT p1) p2), p2, false]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 648 steps (0 resets) in 12 ms. (49 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p1 p2), (X p2), (X (OR (NOT p1) p2)), (X (NOT (AND p1 (NOT p2)))), (X p1), (X (X p2)), (X (X (OR (NOT p1) p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p2)), (F (NOT (OR (NOT p1) p2))), (F (NOT (OR (NOT p1) p2)))]
Knowledge based reduction with 11 factoid took 465 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 (NOT p1) p2), (OR (NOT p1) p2), p2, false]
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p1) p2), (OR (NOT p1) p2), p2, false]
[2024-06-01 05:18:12] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 05:18:12] [INFO ] Invariant cache hit.
[2024-06-01 05:18:12] [INFO ] [Real]Absence check using 5 positive place invariants in 9 ms returned sat
[2024-06-01 05:18:13] [INFO ] [Real]Absence check using state equation in 183 ms returned sat
[2024-06-01 05:18:13] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:18:13] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-06-01 05:18:13] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2024-06-01 05:18:13] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:18:13] [INFO ] [Nat]Added 20 Read/Feed constraints in 39 ms returned sat
[2024-06-01 05:18:13] [INFO ] Deduced a trap composed of 15 places in 124 ms of which 1 ms to minimize.
[2024-06-01 05:18:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 180 ms
[2024-06-01 05:18:13] [INFO ] Computed and/alt/rep : 108/216/108 causal constraints (skipped 134 transitions) in 52 ms.
[2024-06-01 05:18:14] [INFO ] Added : 49 causal constraints over 10 iterations in 331 ms. Result :sat
Could not prove EG p2
Stuttering acceptance computed with spot in 184 ms :[(OR (NOT p1) p2), (OR (NOT p1) p2), p2, false]
Product exploration explored 100000 steps with 268 reset in 675 ms.
Product exploration explored 100000 steps with 268 reset in 639 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 58 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:18:15] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 05:18:15] [INFO ] Invariant cache hit.
[2024-06-01 05:18:15] [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:18:25] [INFO ] Deduced a trap composed of 5 places in 135 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 20050 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 20019 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 46290ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 46302ms
[2024-06-01 05:19:02] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 05:19:02] [INFO ] Invariant cache hit.
[2024-06-01 05:19:02] [INFO ] Implicit Places using invariants in 115 ms returned []
[2024-06-01 05:19:02] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 05:19:02] [INFO ] Invariant cache hit.
[2024-06-01 05:19:02] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:19:02] [INFO ] Implicit Places using invariants and state equation in 438 ms returned []
Implicit Place search using SMT with State Equation took 567 ms to find 0 implicit places.
[2024-06-01 05:19:02] [INFO ] Redundant transitions in 11 ms returned []
Running 1222 sub problems to find dead transitions.
[2024-06-01 05:19:02] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 05:19:02] [INFO ] Invariant cache hit.
[2024-06-01 05:19:02] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-06-01 05:19:11] [INFO ] Deduced a trap composed of 5 places in 135 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 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 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
After SMT, in 64995ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 65007ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 111969 ms. Remains : 123/123 places, 1225/1225 transitions.
Treatment of property BridgeAndVehicles-COL-V50P20N10-LTLFireability-04 finished in 281104 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 125 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 125/125 places, 1226/1226 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 124 transition count 1225
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 124 transition count 1225
Applied a total of 2 rules in 18 ms. Remains 124 /125 variables (removed 1) and now considering 1225/1226 (removed 1) transitions.
Running 1222 sub problems to find dead transitions.
[2024-06-01 05:20:07] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
// Phase 1: matrix 245 rows 124 cols
[2024-06-01 05:20:07] [INFO ] Computed 6 invariants in 2 ms
[2024-06-01 05:20:07] [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:20:19] [INFO ] Deduced a trap composed of 5 places in 191 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 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 20278 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 47149ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 47169ms
[2024-06-01 05:20:55] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 05:20:55] [INFO ] Invariant cache hit.
[2024-06-01 05:20:55] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-06-01 05:20:55] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 05:20:55] [INFO ] Invariant cache hit.
[2024-06-01 05:20:55] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:20:55] [INFO ] Implicit Places using invariants and state equation in 509 ms returned []
Implicit Place search using SMT with State Equation took 651 ms to find 0 implicit places.
Running 1222 sub problems to find dead transitions.
[2024-06-01 05:20:55] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 05:20:55] [INFO ] Invariant cache hit.
[2024-06-01 05:20:55] [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:21:06] [INFO ] Deduced a trap composed of 5 places in 126 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 30041 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 30024 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 66462ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 66482ms
Starting structural reductions in LTL mode, iteration 1 : 124/125 places, 1225/1226 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 114328 ms. Remains : 124/125 places, 1225/1226 transitions.
Stuttering acceptance computed with spot in 219 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), true, p1, p1]
Running random walk in product with property : BridgeAndVehicles-COL-V50P20N10-LTLFireability-07
Product exploration explored 100000 steps with 1428 reset in 836 ms.
Product exploration explored 100000 steps with 1473 reset in 676 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 p0), (X (NOT (AND p0 p1))), (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 102 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 53 ms :[p1, p1]
RANDOM walk for 192 steps (0 resets) in 7 ms. (24 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (NOT (AND p0 p1))), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 5 factoid took 94 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 62 ms :[p1, p1]
Stuttering acceptance computed with spot in 57 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 90 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:22:04] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 05:22:04] [INFO ] Invariant cache hit.
[2024-06-01 05:22:04] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-06-01 05:22:14] [INFO ] Deduced a trap composed of 5 places in 642 ms of which 26 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 20030 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 20775 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 46473ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 46486ms
[2024-06-01 05:22:50] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 05:22:50] [INFO ] Invariant cache hit.
[2024-06-01 05:22:51] [INFO ] Implicit Places using invariants in 195 ms returned []
[2024-06-01 05:22:51] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 05:22:51] [INFO ] Invariant cache hit.
[2024-06-01 05:22:51] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:22:51] [INFO ] Implicit Places using invariants and state equation in 493 ms returned []
Implicit Place search using SMT with State Equation took 698 ms to find 0 implicit places.
[2024-06-01 05:22:51] [INFO ] Redundant transitions in 12 ms returned []
Running 1222 sub problems to find dead transitions.
[2024-06-01 05:22:51] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 05:22:51] [INFO ] Invariant cache hit.
[2024-06-01 05:22:51] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-06-01 05:23:01] [INFO ] Deduced a trap composed of 5 places in 151 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
SMT process timed out in 35910ms, After SMT, problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 35927ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 83225 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 69 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 64 ms :[p1, p1]
RANDOM walk for 265 steps (0 resets) in 6 ms. (37 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 86 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 52 ms :[p1, p1]
Stuttering acceptance computed with spot in 56 ms :[p1, p1]
Stuttering acceptance computed with spot in 56 ms :[p1, p1]
Product exploration explored 100000 steps with 1457 reset in 569 ms.
Product exploration explored 100000 steps with 1469 reset in 579 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 48 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:23:29] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 05:23:29] [INFO ] Invariant cache hit.
[2024-06-01 05:23:29] [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:23:39] [INFO ] Deduced a trap composed of 5 places in 143 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 20.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 1.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 1.0)
(s53 0.0)
(s54 1.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
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 20031 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 20024 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 45780ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 45792ms
[2024-06-01 05:24:14] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 05:24:14] [INFO ] Invariant cache hit.
[2024-06-01 05:24:15] [INFO ] Implicit Places using invariants in 124 ms returned []
[2024-06-01 05:24:15] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 05:24:15] [INFO ] Invariant cache hit.
[2024-06-01 05:24:15] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:24:15] [INFO ] Implicit Places using invariants and state equation in 339 ms returned []
Implicit Place search using SMT with State Equation took 516 ms to find 0 implicit places.
[2024-06-01 05:24:15] [INFO ] Redundant transitions in 11 ms returned []
Running 1222 sub problems to find dead transitions.
[2024-06-01 05:24:15] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 05:24:15] [INFO ] Invariant cache hit.
[2024-06-01 05:24:15] [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:24:25] [INFO ] Deduced a trap composed of 5 places in 133 ms of which 18 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:24:49] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 1 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 30019 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 30037 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 66310ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 66321ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 112699 ms. Remains : 124/124 places, 1225/1225 transitions.
Treatment of property BridgeAndVehicles-COL-V50P20N10-LTLFireability-07 finished in 314087 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((X(X(G(p0)))&&(!p1||G(F(p1))))))'
Support contains 52 out of 125 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 : 125/125 places, 1226/1226 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 124 transition count 1225
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 124 transition count 1225
Applied a total of 2 rules in 75 ms. Remains 124 /125 variables (removed 1) and now considering 1225/1226 (removed 1) transitions.
Running 1222 sub problems to find dead transitions.
[2024-06-01 05:25:22] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 05:25:22] [INFO ] Invariant cache hit.
[2024-06-01 05:25:22] [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:25:32] [INFO ] Deduced a trap composed of 5 places in 135 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
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 124/369 variables, and 7 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20043 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 20081 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 45848ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 45859ms
[2024-06-01 05:26:07] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 05:26:07] [INFO ] Invariant cache hit.
[2024-06-01 05:26:07] [INFO ] Implicit Places using invariants in 132 ms returned [105]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 143 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 123/125 places, 1225/1226 transitions.
Applied a total of 0 rules in 70 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 46150 ms. Remains : 123/125 places, 1225/1226 transitions.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V50P20N10-LTLFireability-08
Stuttering criterion allowed to conclude after 421 steps with 0 reset in 3 ms.
FORMULA BridgeAndVehicles-COL-V50P20N10-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V50P20N10-LTLFireability-08 finished in 46201 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(!p0)))'
Support contains 1 out of 125 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 125/125 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 124 transition count 1225
Applied a total of 2 rules in 67 ms. Remains 124 /125 variables (removed 1) and now considering 1225/1226 (removed 1) transitions.
Running 1222 sub problems to find dead transitions.
[2024-06-01 05:26:08] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
// Phase 1: matrix 245 rows 124 cols
[2024-06-01 05:26:08] [INFO ] Computed 6 invariants in 2 ms
[2024-06-01 05:26:08] [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:26:18] [INFO ] Deduced a trap composed of 5 places in 132 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 124/369 variables, and 7 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20018 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 20030 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 45932ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 45945ms
[2024-06-01 05:26:54] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 05:26:54] [INFO ] Invariant cache hit.
[2024-06-01 05:26:54] [INFO ] Implicit Places using invariants in 493 ms returned [105]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 498 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 123/125 places, 1225/1226 transitions.
Applied a total of 0 rules in 65 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 46580 ms. Remains : 123/125 places, 1225/1226 transitions.
Stuttering acceptance computed with spot in 68 ms :[p0]
Running random walk in product with property : BridgeAndVehicles-COL-V50P20N10-LTLFireability-09
Stuttering criterion allowed to conclude after 374 steps with 0 reset in 2 ms.
FORMULA BridgeAndVehicles-COL-V50P20N10-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V50P20N10-LTLFireability-09 finished in 46664 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(X(X(F(!p0)))))'
Support contains 52 out of 125 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 125/125 places, 1226/1226 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 124 transition count 1225
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 124 transition count 1225
Applied a total of 2 rules in 10 ms. Remains 124 /125 variables (removed 1) and now considering 1225/1226 (removed 1) transitions.
Running 1222 sub problems to find dead transitions.
[2024-06-01 05:26:54] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
// Phase 1: matrix 245 rows 124 cols
[2024-06-01 05:26:54] [INFO ] Computed 6 invariants in 2 ms
[2024-06-01 05:26:54] [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:27:05] [INFO ] Deduced a trap composed of 5 places in 148 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 124/369 variables, and 7 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20025 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 20018 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 46115ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 46132ms
[2024-06-01 05:27:40] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 05:27:40] [INFO ] Invariant cache hit.
[2024-06-01 05:27:41] [INFO ] Implicit Places using invariants in 151 ms returned [105]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 160 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 123/125 places, 1225/1226 transitions.
Applied a total of 0 rules in 12 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 46319 ms. Remains : 123/125 places, 1225/1226 transitions.
Stuttering acceptance computed with spot in 169 ms :[p0, p0, p0, p0]
Running random walk in product with property : BridgeAndVehicles-COL-V50P20N10-LTLFireability-14
Product exploration explored 100000 steps with 601 reset in 388 ms.
Product exploration explored 100000 steps with 604 reset in 397 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 : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 94 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[p0, p0, p0, p0]
RANDOM walk for 723 steps (0 resets) in 8 ms. (80 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 77 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[p0, p0, p0, p0]
Stuttering acceptance computed with spot in 106 ms :[p0, p0, p0, p0]
[2024-06-01 05:27:42] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
// Phase 1: matrix 245 rows 123 cols
[2024-06-01 05:27:42] [INFO ] Computed 5 invariants in 1 ms
[2024-06-01 05:27:43] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-06-01 05:27:43] [INFO ] [Real]Absence check using state equation in 161 ms returned sat
[2024-06-01 05:27:43] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:27:43] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-06-01 05:27:44] [INFO ] [Nat]Absence check using state equation in 126 ms returned sat
[2024-06-01 05:27:44] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:27:44] [INFO ] [Nat]Added 20 Read/Feed constraints in 34 ms returned sat
[2024-06-01 05:27:44] [INFO ] Computed and/alt/rep : 108/216/108 causal constraints (skipped 134 transitions) in 31 ms.
[2024-06-01 05:27:44] [INFO ] Added : 40 causal constraints over 9 iterations in 229 ms. Result :sat
Could not prove EG p0
Support contains 52 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 1225/1225 transitions.
Applied a total of 0 rules in 5 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Running 1222 sub problems to find dead transitions.
[2024-06-01 05:27:44] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 05:27:44] [INFO ] Invariant cache hit.
[2024-06-01 05:27:44] [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:27:55] [INFO ] Deduced a trap composed of 5 places in 147 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
(s68 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 20.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 1.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 123/368 variables, and 6 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/123 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 245/368 variables, 123/129 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/368 variables, 20/149 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 368/368 variables, and 1371 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20261 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 46553ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 46566ms
[2024-06-01 05:28:30] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 05:28:30] [INFO ] Invariant cache hit.
[2024-06-01 05:28:31] [INFO ] Implicit Places using invariants in 187 ms returned []
[2024-06-01 05:28:31] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 05:28:31] [INFO ] Invariant cache hit.
[2024-06-01 05:28:31] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:28:31] [INFO ] Implicit Places using invariants and state equation in 347 ms returned []
Implicit Place search using SMT with State Equation took 558 ms to find 0 implicit places.
Running 1222 sub problems to find dead transitions.
[2024-06-01 05:28:31] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 05:28:31] [INFO ] Invariant cache hit.
[2024-06-01 05:28:31] [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:28:40] [INFO ] Deduced a trap composed of 5 places in 168 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
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 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 245/368 variables, 123/129 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/368 variables, 20/149 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 1222/1371 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 368/368 variables, and 1371 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 30035 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 65129ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 65144ms
Finished structural reductions in LTL mode , in 1 iterations and 112280 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 : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 72 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[p0, p0, p0, p0]
RANDOM walk for 635 steps (0 resets) in 8 ms. (70 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 85 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[p0, p0, p0, p0]
Stuttering acceptance computed with spot in 127 ms :[p0, p0, p0, p0]
[2024-06-01 05:29:37] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 05:29:37] [INFO ] Invariant cache hit.
[2024-06-01 05:29:37] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-06-01 05:29:37] [INFO ] [Real]Absence check using state equation in 104 ms returned sat
[2024-06-01 05:29:37] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:29:38] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-06-01 05:29:38] [INFO ] [Nat]Absence check using state equation in 94 ms returned sat
[2024-06-01 05:29:38] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:29:38] [INFO ] [Nat]Added 20 Read/Feed constraints in 48 ms returned sat
[2024-06-01 05:29:38] [INFO ] Deduced a trap composed of 15 places in 195 ms of which 1 ms to minimize.
[2024-06-01 05:29:38] [INFO ] Deduced a trap composed of 14 places in 191 ms of which 3 ms to minimize.
[2024-06-01 05:29:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 489 ms
[2024-06-01 05:29:38] [INFO ] Computed and/alt/rep : 108/216/108 causal constraints (skipped 134 transitions) in 39 ms.
[2024-06-01 05:29:39] [INFO ] Added : 29 causal constraints over 7 iterations in 246 ms. Result :sat
Could not prove EG p0
Stuttering acceptance computed with spot in 123 ms :[p0, p0, p0, p0]
Product exploration explored 100000 steps with 599 reset in 551 ms.
Product exploration explored 100000 steps with 603 reset in 573 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 145 ms :[p0, p0, p0, p0]
Support contains 52 out of 123 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 123/123 places, 1225/1225 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 2 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 123 transition count 1225
Deduced a syphon composed of 1 places in 2 ms
Applied a total of 1 rules in 91 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:29:40] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
// Phase 1: matrix 245 rows 123 cols
[2024-06-01 05:29:40] [INFO ] Computed 5 invariants in 3 ms
[2024-06-01 05:29: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 05:29:50] [INFO ] Deduced a trap composed of 5 places in 163 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
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
Problem TDEAD50 is UNSAT
At refinement iteration 3 (OVERLAPS) 245/368 variables, 123/129 constraints. Problems are: Problem set: 1 solved, 1221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/368 variables, 20/149 constraints. Problems are: Problem set: 1 solved, 1221 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 368/368 variables, and 1370 constraints, problems are : Problem set: 1 solved, 1221 unsolved in 20135 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1221/1222 constraints, Known Traps: 1/1 constraints]
After SMT, in 46040ms problems are : Problem set: 1 solved, 1221 unsolved
Search for dead transitions found 1 dead transitions in 46060ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 1 transitions.
[2024-06-01 05:30:26] [INFO ] Redundant transitions in 11 ms returned []
Starting structural reductions in SI_LTL mode, iteration 1 : 123/123 places, 1224/1225 transitions.
Graph (complete) has 2427 edges and 123 vertex of which 122 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 2 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 121 transition count 1224
Deduced a syphon composed of 2 places in 1 ms
Applied a total of 3 rules in 103 ms. Remains 121 /123 variables (removed 2) and now considering 1224/1224 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 121/123 places, 1224/1225 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 46293 ms. Remains : 121/123 places, 1224/1225 transitions.
Support contains 52 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:30:26] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
// Phase 1: matrix 245 rows 123 cols
[2024-06-01 05:30:27] [INFO ] Computed 5 invariants in 1 ms
[2024-06-01 05:30: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 05:30:37] [INFO ] Deduced a trap composed of 5 places in 140 ms of which 13 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 20023 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 21190 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 47263ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 47275ms
[2024-06-01 05:31:14] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 05:31:14] [INFO ] Invariant cache hit.
[2024-06-01 05:31:14] [INFO ] Implicit Places using invariants in 155 ms returned []
[2024-06-01 05:31:14] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 05:31:14] [INFO ] Invariant cache hit.
[2024-06-01 05:31:14] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:31:14] [INFO ] Implicit Places using invariants and state equation in 402 ms returned []
Implicit Place search using SMT with State Equation took 569 ms to find 0 implicit places.
Running 1222 sub problems to find dead transitions.
[2024-06-01 05:31:14] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 05:31:14] [INFO ] Invariant cache hit.
[2024-06-01 05:31:14] [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:31:23] [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
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 30022 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 65025ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 65037ms
Finished structural reductions in LTL mode , in 1 iterations and 112891 ms. Remains : 123/123 places, 1225/1225 transitions.
Treatment of property BridgeAndVehicles-COL-V50P20N10-LTLFireability-14 finished in 325206 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(((X(!p0) U (X(G(!p0))||(!p1&&X(!p0))))&&(p2||G(F(!p3))))))'
Found a Shortening insensitive property : BridgeAndVehicles-COL-V50P20N10-LTLFireability-02
Stuttering acceptance computed with spot in 396 ms :[(OR p0 (AND (NOT p2) p3)), p0, (OR (AND (NOT p2) p3) (AND p0 p3)), (OR (AND (NOT p2) p3) (AND p0 p3)), false, (AND p0 p3), (AND p0 p3), (AND p0 (NOT p2) p3), (AND p0 (NOT p2) p3)]
Support contains 119 out of 125 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 125/125 places, 1226/1226 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 124 transition count 1225
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 124 transition count 1225
Applied a total of 2 rules in 20 ms. Remains 124 /125 variables (removed 1) and now considering 1225/1226 (removed 1) transitions.
Running 1222 sub problems to find dead transitions.
[2024-06-01 05:32:20] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
// Phase 1: matrix 245 rows 124 cols
[2024-06-01 05:32:20] [INFO ] Computed 6 invariants in 1 ms
[2024-06-01 05:32:20] [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:32:30] [INFO ] Deduced a trap composed of 5 places in 177 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 20.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 1.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 1.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
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 20020 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 20144 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 45080ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 45094ms
[2024-06-01 05:33:05] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 05:33:05] [INFO ] Invariant cache hit.
[2024-06-01 05:33:06] [INFO ] Implicit Places using invariants in 150 ms returned [105]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 153 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 123/125 places, 1225/1226 transitions.
Applied a total of 0 rules in 16 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 45286 ms. Remains : 123/125 places, 1225/1226 transitions.
Running random walk in product with property : BridgeAndVehicles-COL-V50P20N10-LTLFireability-02
Product exploration explored 100000 steps with 1671 reset in 1354 ms.
Product exploration explored 100000 steps with 1695 reset in 1110 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 p2) (NOT p3) p1 (NOT p0)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p2) p3))), (X (NOT (AND p2 p3))), (X (NOT (AND p1 p2 p3))), (X (NOT (AND p1 p2))), (X (NOT p0)), (X (NOT (AND (NOT p2) p3 p0))), (X p1), (X (AND p1 (NOT p0))), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT (AND p2 p3 p0)))), (X (X (NOT (AND p1 p2 p3)))), (X (X (NOT (AND p1 (NOT p2) p3 p0)))), (X (X (NOT (AND p1 p2 p3 p0)))), (X (X (NOT (AND (NOT p2) p3 p0)))), (X (X (NOT (AND p3 (NOT p0))))), (X (X (NOT (AND p1 p3 (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p2 p3)))), (X (X (NOT (AND p2 p0)))), (X (X (OR (AND p1 (NOT p2)) (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 p2 p0)))), (X (X (NOT p0))), (X (X (OR (NOT p2) (NOT p0)))), (X (X p1)), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 36 factoid took 353 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 473 ms :[(OR (AND (NOT p2) p3) (AND p0 p3)), p0, (OR (AND (NOT p2) p3) (AND p0 p3)), (OR (AND (NOT p2) p3) (AND p0 p3)), false, (AND p0 p3), (AND p0 p3), (AND p0 (NOT p2) p3), (AND p0 (NOT p2) p3)]
Reduction of identical properties reduced properties to check from 21 to 20
RANDOM walk for 40000 steps (88 resets) in 3045 ms. (13 steps per ms) remains 6/20 properties
BEST_FIRST walk for 40002 steps (40 resets) in 1592 ms. (25 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (40 resets) in 1805 ms. (22 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (40 resets) in 1369 ms. (29 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (40 resets) in 1850 ms. (21 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (40 resets) in 1765 ms. (22 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (40 resets) in 1832 ms. (21 steps per ms) remains 6/6 properties
[2024-06-01 05:33:13] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
// Phase 1: matrix 245 rows 123 cols
[2024-06-01 05:33:13] [INFO ] Computed 5 invariants in 4 ms
[2024-06-01 05:33:13] [INFO ] State equation strengthened by 20 read => feed constraints.
Problem apf4 is UNSAT
Problem apf8 is UNSAT
Problem apf9 is UNSAT
Problem apf13 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 apf3 is UNSAT
Problem apf19 is UNSAT
After SMT solving in domain Real declared 123/368 variables, and 5 constraints, problems are : Problem set: 6 solved, 0 unsolved in 108 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 390ms problems are : Problem set: 6 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 7 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p3) p1 (NOT p0)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p2) p3))), (X (NOT (AND p2 p3))), (X (NOT (AND p1 p2 p3))), (X (NOT (AND p1 p2))), (X (NOT p0)), (X (NOT (AND (NOT p2) p3 p0))), (X p1), (X (AND p1 (NOT p0))), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT (AND p2 p3 p0)))), (X (X (NOT (AND p1 p2 p3)))), (X (X (NOT (AND p1 (NOT p2) p3 p0)))), (X (X (NOT (AND p1 p2 p3 p0)))), (X (X (NOT (AND (NOT p2) p3 p0)))), (X (X (NOT (AND p3 (NOT p0))))), (X (X (NOT (AND p1 p3 (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p2 p3)))), (X (X (NOT (AND p2 p0)))), (X (X (OR (AND p1 (NOT p2)) (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 p2 p0)))), (X (X (NOT p0))), (X (X (OR (NOT p2) (NOT p0)))), (X (X p1)), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p1) (G (NOT p1)))), (G (OR (NOT p1) (NOT p2) (NOT p3))), (G (OR (NOT p0) (NOT p1) (NOT p2) (NOT p3))), (G (OR (NOT p0) (NOT p1) (NOT p2))), (G (OR (NOT p0) (NOT p2))), (G (OR (NOT p1) (NOT p2))), (G (OR (NOT p0) (NOT p2) (NOT p3))), (G (OR (NOT p0) (NOT p2)))]
False Knowledge obtained : [(F (NOT (OR (AND (NOT p0) p1) (AND p1 (NOT p2))))), (F (NOT (OR p0 (NOT p1) (NOT p3)))), (F (NOT (OR (NOT p0) (NOT p1) p2 (NOT p3)))), (F (NOT (OR (NOT p0) p2))), (F (NOT (OR (NOT p2) (NOT p3)))), (F (NOT (OR p2 (NOT p3)))), (F p2), (F (NOT p1)), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) p1))), (F p0), (F p3), (F (NOT (OR (NOT p0) p2 (NOT p3)))), (F (NOT (OR p0 (NOT p3))))]
Knowledge based reduction with 43 factoid took 1065 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 274 ms :[(OR (AND (NOT p2) p3) (AND p0 p3)), p0, (OR (AND (NOT p2) p3) (AND p0 p3)), (OR (AND (NOT p2) p3) (AND p0 p3)), false, (AND p0 p3), (AND p0 p3)]
Stuttering acceptance computed with spot in 277 ms :[(OR (AND (NOT p2) p3) (AND p0 p3)), p0, (OR (AND (NOT p2) p3) (AND p0 p3)), (OR (AND (NOT p2) p3) (AND p0 p3)), false, (AND p0 p3), (AND p0 p3)]
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 05:33:15] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 05:33:15] [INFO ] Invariant cache hit.
[2024-06-01 05:33:15] [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:33:25] [INFO ] Deduced a trap composed of 5 places in 164 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 123/368 variables, and 6 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20018 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 20324 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 46804ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 46829ms
[2024-06-01 05:34:01] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 05:34:01] [INFO ] Invariant cache hit.
[2024-06-01 05:34:01] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-06-01 05:34:01] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 05:34:01] [INFO ] Invariant cache hit.
[2024-06-01 05:34:02] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:34:02] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 291 ms to find 0 implicit places.
Running 1222 sub problems to find dead transitions.
[2024-06-01 05:34:02] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 05:34:02] [INFO ] Invariant cache hit.
[2024-06-01 05:34:02] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-06-01 05:34:12] [INFO ] Deduced a trap composed of 5 places in 217 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 35525ms, After SMT, problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 35544ms
Finished structural reductions in LTL mode , in 1 iterations and 82683 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 p0) (NOT p3) p1 (NOT p2)), (X (NOT p3)), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p2) p3))), (X (NOT (AND p2 p3))), (X (NOT p0)), (X (NOT p2)), (X p1), (X (X (NOT p3))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT (AND p2 p3)))), (X (X (NOT (AND p0 p3)))), (X (X (NOT p0))), (X (X (NOT p2))), (X (X (NOT (AND p0 p1)))), (X (X p1)), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 149 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 232 ms :[(OR (AND (NOT p2) p3) (AND p0 p3)), p0, (OR (AND (NOT p2) p3) (AND p0 p3)), (OR (AND (NOT p2) p3) (AND p0 p3)), false, (AND p0 p3), (AND p0 p3)]
RANDOM walk for 735 steps (0 resets) in 25 ms. (28 steps per ms) remains 0/9 properties
Knowledge obtained : [(AND (NOT p0) (NOT p3) p1 (NOT p2)), (X (NOT p3)), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p2) p3))), (X (NOT (AND p2 p3))), (X (NOT p0)), (X (NOT p2)), (X p1), (X (X (NOT p3))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT (AND p2 p3)))), (X (X (NOT (AND p0 p3)))), (X (X (NOT p0))), (X (X (NOT p2))), (X (X (NOT (AND p0 p1)))), (X (X p1)), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (OR (NOT p2) (NOT p3)))), (F (NOT (OR (NOT p3) (NOT p0)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F p0), (F p3), (F (NOT (OR p2 (NOT p3)))), (F (NOT (AND (NOT p0) p1))), (F p2), (F (NOT p1))]
Knowledge based reduction with 19 factoid took 510 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 209 ms :[(OR (AND (NOT p2) p3) (AND p0 p3)), p0, (OR (AND (NOT p2) p3) (AND p0 p3)), (OR (AND (NOT p2) p3) (AND p0 p3)), false, (AND p0 p3), (AND p0 p3)]
Stuttering acceptance computed with spot in 215 ms :[(OR (AND (NOT p2) p3) (AND p0 p3)), p0, (OR (AND (NOT p2) p3) (AND p0 p3)), (OR (AND (NOT p2) p3) (AND p0 p3)), false, (AND p0 p3), (AND p0 p3)]
Stuttering acceptance computed with spot in 249 ms :[(OR (AND (NOT p2) p3) (AND p0 p3)), p0, (OR (AND (NOT p2) p3) (AND p0 p3)), (OR (AND (NOT p2) p3) (AND p0 p3)), false, (AND p0 p3), (AND p0 p3)]
Product exploration explored 100000 steps with 1102 reset in 799 ms.
Product exploration explored 100000 steps with 1156 reset in 807 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 10 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:34:41] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 05:34:41] [INFO ] Invariant cache hit.
[2024-06-01 05:34:41] [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:34:50] [INFO ] Deduced a trap composed of 5 places in 121 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 20020 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 20395 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 46185ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 46209ms
[2024-06-01 05:35:27] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 05:35:27] [INFO ] Invariant cache hit.
[2024-06-01 05:35:27] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-06-01 05:35:27] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 05:35:27] [INFO ] Invariant cache hit.
[2024-06-01 05:35:27] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:35:27] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
Running 1222 sub problems to find dead transitions.
[2024-06-01 05:35:27] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 05:35:27] [INFO ] Invariant cache hit.
[2024-06-01 05:35: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 05:35:36] [INFO ] Deduced a trap composed of 5 places in 146 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 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: 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 65401ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 65413ms
Finished structural reductions in LTL mode , in 1 iterations and 111861 ms. Remains : 123/123 places, 1225/1225 transitions.
Treatment of property BridgeAndVehicles-COL-V50P20N10-LTLFireability-02 finished in 252947 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)&&F((p1&&G(!p2)))))'
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' '!(X(X(X(F(!p0)))))'
Found a Shortening insensitive property : BridgeAndVehicles-COL-V50P20N10-LTLFireability-14
Stuttering acceptance computed with spot in 172 ms :[p0, p0, p0, p0]
Support contains 52 out of 125 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 125/125 places, 1226/1226 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 124 transition count 1225
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 124 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 122 transition count 1224
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 120 transition count 1222
Applied a total of 9 rules in 51 ms. Remains 120 /125 variables (removed 5) and now considering 1222/1226 (removed 4) transitions.
[2024-06-01 05:36:33] [INFO ] Flow matrix only has 242 transitions (discarded 980 similar events)
// Phase 1: matrix 242 rows 120 cols
[2024-06-01 05:36:33] [INFO ] Computed 5 invariants in 2 ms
[2024-06-01 05:36:33] [INFO ] Implicit Places using invariants in 182 ms returned [103]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 197 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 119/125 places, 1222/1226 transitions.
Applied a total of 0 rules in 12 ms. Remains 119 /119 variables (removed 0) and now considering 1222/1222 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 260 ms. Remains : 119/125 places, 1222/1226 transitions.
Running random walk in product with property : BridgeAndVehicles-COL-V50P20N10-LTLFireability-14
Product exploration explored 100000 steps with 681 reset in 435 ms.
Product exploration explored 100000 steps with 680 reset in 349 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/1 atomic propositions.
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 96 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[p0, p0, p0, p0]
RANDOM walk for 586 steps (0 resets) in 8 ms. (65 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 73 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[p0, p0, p0, p0]
Stuttering acceptance computed with spot in 131 ms :[p0, p0, p0, p0]
[2024-06-01 05:36:35] [INFO ] Flow matrix only has 242 transitions (discarded 980 similar events)
// Phase 1: matrix 242 rows 119 cols
[2024-06-01 05:36:35] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 05:36:36] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-06-01 05:36:36] [INFO ] [Real]Absence check using state equation in 148 ms returned sat
[2024-06-01 05:36:36] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:36:36] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-06-01 05:36:36] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2024-06-01 05:36:36] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:36:36] [INFO ] [Nat]Added 20 Read/Feed constraints in 32 ms returned sat
[2024-06-01 05:36:36] [INFO ] Deduced a trap composed of 13 places in 163 ms of which 2 ms to minimize.
[2024-06-01 05:36:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 210 ms
[2024-06-01 05:36:36] [INFO ] Computed and/alt/rep : 108/216/108 causal constraints (skipped 131 transitions) in 36 ms.
[2024-06-01 05:36:37] [INFO ] Added : 15 causal constraints over 5 iterations in 249 ms. Result :sat
Could not prove EG p0
Support contains 52 out of 119 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 1222/1222 transitions.
Applied a total of 0 rules in 7 ms. Remains 119 /119 variables (removed 0) and now considering 1222/1222 (removed 0) transitions.
[2024-06-01 05:36:37] [INFO ] Flow matrix only has 242 transitions (discarded 980 similar events)
[2024-06-01 05:36:37] [INFO ] Invariant cache hit.
[2024-06-01 05:36:37] [INFO ] Implicit Places using invariants in 215 ms returned []
[2024-06-01 05:36:37] [INFO ] Flow matrix only has 242 transitions (discarded 980 similar events)
[2024-06-01 05:36:37] [INFO ] Invariant cache hit.
[2024-06-01 05:36:37] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:36:37] [INFO ] Implicit Places using invariants and state equation in 293 ms returned []
Implicit Place search using SMT with State Equation took 510 ms to find 0 implicit places.
Running 1219 sub problems to find dead transitions.
[2024-06-01 05:36:37] [INFO ] Flow matrix only has 242 transitions (discarded 980 similar events)
[2024-06-01 05:36:37] [INFO ] Invariant cache hit.
[2024-06-01 05:36:37] [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
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 361/361 variables, and 143 constraints, problems are : Problem set: 0 solved, 1219 unsolved in 30028 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 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]
After SMT, in 65017ms problems are : Problem set: 0 solved, 1219 unsolved
Search for dead transitions found 0 dead transitions in 65033ms
Finished structural reductions in LTL mode , in 1 iterations and 65554 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/1 atomic propositions.
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 94 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[p0, p0, p0, p0]
RANDOM walk for 606 steps (0 resets) in 8 ms. (67 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 170 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 162 ms :[p0, p0, p0, p0]
Stuttering acceptance computed with spot in 143 ms :[p0, p0, p0, p0]
[2024-06-01 05:37:43] [INFO ] Flow matrix only has 242 transitions (discarded 980 similar events)
[2024-06-01 05:37:43] [INFO ] Invariant cache hit.
[2024-06-01 05:37:44] [INFO ] [Real]Absence check using 4 positive place invariants in 10 ms returned sat
[2024-06-01 05:37:44] [INFO ] [Real]Absence check using state equation in 285 ms returned sat
[2024-06-01 05:37:45] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:37:45] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-06-01 05:37:45] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2024-06-01 05:37:45] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:37:45] [INFO ] [Nat]Added 20 Read/Feed constraints in 40 ms returned sat
[2024-06-01 05:37:45] [INFO ] Deduced a trap composed of 13 places in 176 ms of which 1 ms to minimize.
[2024-06-01 05:37:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 287 ms
[2024-06-01 05:37:46] [INFO ] Computed and/alt/rep : 108/216/108 causal constraints (skipped 131 transitions) in 46 ms.
[2024-06-01 05:37:46] [INFO ] Added : 15 causal constraints over 4 iterations in 318 ms. Result :sat
Could not prove EG p0
Stuttering acceptance computed with spot in 213 ms :[p0, p0, p0, p0]
Product exploration explored 100000 steps with 683 reset in 476 ms.
Product exploration explored 100000 steps with 676 reset in 349 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 159 ms :[p0, p0, p0, p0]
Support contains 52 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 81 ms. Remains 119 /119 variables (removed 0) and now considering 1222/1222 (removed 0) transitions.
[2024-06-01 05:37:47] [INFO ] Redundant transitions in 19 ms returned []
Running 1219 sub problems to find dead transitions.
[2024-06-01 05:37:47] [INFO ] Flow matrix only has 242 transitions (discarded 980 similar events)
[2024-06-01 05:37:47] [INFO ] Invariant cache hit.
[2024-06-01 05:37:47] [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
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 361/361 variables, and 143 constraints, problems are : Problem set: 0 solved, 1219 unsolved in 30030 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 30023 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 65769ms problems are : Problem set: 0 solved, 1219 unsolved
Search for dead transitions found 0 dead transitions in 65784ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 65910 ms. Remains : 119/119 places, 1222/1222 transitions.
Support contains 52 out of 119 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 1222/1222 transitions.
Applied a total of 0 rules in 5 ms. Remains 119 /119 variables (removed 0) and now considering 1222/1222 (removed 0) transitions.
[2024-06-01 05:38:53] [INFO ] Flow matrix only has 242 transitions (discarded 980 similar events)
[2024-06-01 05:38:53] [INFO ] Invariant cache hit.
[2024-06-01 05:38:53] [INFO ] Implicit Places using invariants in 146 ms returned []
[2024-06-01 05:38:53] [INFO ] Flow matrix only has 242 transitions (discarded 980 similar events)
[2024-06-01 05:38:53] [INFO ] Invariant cache hit.
[2024-06-01 05:38:53] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:38:53] [INFO ] Implicit Places using invariants and state equation in 282 ms returned []
Implicit Place search using SMT with State Equation took 441 ms to find 0 implicit places.
Running 1219 sub problems to find dead transitions.
[2024-06-01 05:38:54] [INFO ] Flow matrix only has 242 transitions (discarded 980 similar events)
[2024-06-01 05:38:54] [INFO ] Invariant cache hit.
[2024-06-01 05:38:54] [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 30024 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 30024 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 65191ms problems are : Problem set: 0 solved, 1219 unsolved
Search for dead transitions found 0 dead transitions in 65212ms
Finished structural reductions in LTL mode , in 1 iterations and 65662 ms. Remains : 119/119 places, 1222/1222 transitions.
Treatment of property BridgeAndVehicles-COL-V50P20N10-LTLFireability-14 finished in 205921 ms.
[2024-06-01 05:39:59] [INFO ] Flatten gal took : 88 ms
[2024-06-01 05:39:59] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/LTLFireability.sr.xml took 30 ms.
[2024-06-01 05:39:59] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 125 places, 1226 transitions and 9100 arcs took 12 ms.
Total runtime 2100749 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : BridgeAndVehicles-COL-V50P20N10-LTLFireability-00
Could not compute solution for formula : BridgeAndVehicles-COL-V50P20N10-LTLFireability-02
Could not compute solution for formula : BridgeAndVehicles-COL-V50P20N10-LTLFireability-04
Could not compute solution for formula : BridgeAndVehicles-COL-V50P20N10-LTLFireability-07
Could not compute solution for formula : BridgeAndVehicles-COL-V50P20N10-LTLFireability-14

BK_STOP 1717220426241

--------------------
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-COL-V50P20N10-LTLFireability-00
ltl formula formula --ltl=/tmp/2770/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 125 places, 1226 transitions and 9100 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.250 real 0.070 user 0.040 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2770/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2770/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2770/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2770/ltl_0_
pnml2lts-mc( 3/ 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-COL-V50P20N10-LTLFireability-02
ltl formula formula --ltl=/tmp/2770/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 125 places, 1226 transitions and 9100 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.150 real 0.060 user 0.040 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2770/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2770/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2770/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2770/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(): unaligned fastbin chunk detected
ltl formula name BridgeAndVehicles-COL-V50P20N10-LTLFireability-04
ltl formula formula --ltl=/tmp/2770/ltl_2_
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 125 places, 1226 transitions and 9100 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.150 real 0.040 user 0.050 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2770/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2770/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2770/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2770/ltl_2_
pnml2lts-mc( 0/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
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:
*** 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
malloc_consolidate(): unaligned fastbin chunk detected
ltl formula name BridgeAndVehicles-COL-V50P20N10-LTLFireability-07
ltl formula formula --ltl=/tmp/2770/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 125 places, 1226 transitions and 9100 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.150 real 0.070 user 0.030 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2770/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2770/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2770/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2770/ltl_3_
pnml2lts-mc( 2/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
pnml2lts-mc( 3/ 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:
*** 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
malloc_consolidate(): unaligned fastbin chunk detected
ltl formula name BridgeAndVehicles-COL-V50P20N10-LTLFireability-14
ltl formula formula --ltl=/tmp/2770/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 125 places, 1226 transitions and 9100 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.240 real 0.050 user 0.060 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2770/ltl_4_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2770/ltl_4_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2770/ltl_4_
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

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-COL-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-COL-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-171620398700068"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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