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-171620399000195.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is BridgeAndVehicles-PT-V20P10N50, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r472-tajo-171620399000195
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.8M
-rw-r--r-- 1 mcc users 16K Apr 13 02:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 101K Apr 13 02:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 400K Apr 13 02:37 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.5M Apr 13 02:37 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 8.4K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 42K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 144K Apr 22 14:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 406K Apr 22 14:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 30K Apr 13 03:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 206K Apr 13 03:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 227K Apr 13 03:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 886K Apr 13 03:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.6K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.8K Apr 22 14:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.8M May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717219786430

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-PT-V20P10N50
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 05:29:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 05:29:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 05:29:48] [INFO ] Load time of PNML (sax parser for PT used): 241 ms
[2024-06-01 05:29:48] [INFO ] Transformed 108 places.
[2024-06-01 05:29:48] [INFO ] Transformed 2228 transitions.
[2024-06-01 05:29:48] [INFO ] Parsed PT model containing 108 places and 2228 transitions and 17190 arcs in 367 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA BridgeAndVehicles-PT-V20P10N50-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P10N50-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P10N50-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P10N50-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 19 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 2228/2228 transitions.
Applied a total of 0 rules in 42 ms. Remains 108 /108 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
Running 2225 sub problems to find dead transitions.
[2024-06-01 05:29:48] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 108 cols
[2024-06-01 05:29:48] [INFO ] Computed 7 invariants in 30 ms
[2024-06-01 05:29:48] [INFO ] State equation strengthened by 102 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2225 unsolved
[2024-06-01 05:30:14] [INFO ] Deduced a trap composed of 5 places in 216 ms of which 11 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 106/398 variables, and 6 constraints, problems are : Problem set: 0 solved, 2225 unsolved in 20106 ms.
Refiners :[Positive P Invariants (semi-flows): 5/7 constraints, State Equation: 0/108 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 2225/2225 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2225 unsolved
[2024-06-01 05:30:43] [INFO ] Deduced a trap composed of 55 places in 258 ms of which 2 ms to minimize.
Problem TDEAD1188 is UNSAT
Problem TDEAD1189 is UNSAT
Problem TDEAD1190 is UNSAT
Problem TDEAD1191 is UNSAT
Problem TDEAD1192 is UNSAT
Problem TDEAD1193 is UNSAT
Problem TDEAD1194 is UNSAT
Problem TDEAD1195 is UNSAT
Problem TDEAD1196 is UNSAT
Problem TDEAD1197 is UNSAT
Problem TDEAD1198 is UNSAT
Problem TDEAD1199 is UNSAT
Problem TDEAD1200 is UNSAT
Problem TDEAD1201 is UNSAT
Problem TDEAD1202 is UNSAT
Problem TDEAD1203 is UNSAT
Problem TDEAD1204 is UNSAT
Problem TDEAD1205 is UNSAT
Problem TDEAD1206 is UNSAT
Problem TDEAD1207 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 106/398 variables, and 7 constraints, problems are : Problem set: 20 solved, 2205 unsolved in 20045 ms.
Refiners :[Positive P Invariants (semi-flows): 5/7 constraints, State Equation: 0/108 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 0/2225 constraints, Known Traps: 2/2 constraints]
After SMT, in 58772ms problems are : Problem set: 20 solved, 2205 unsolved
Search for dead transitions found 20 dead transitions in 58841ms
Found 20 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 20 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 20 transitions.
[2024-06-01 05:30:47] [INFO ] Flow matrix only has 289 transitions (discarded 1919 similar events)
// Phase 1: matrix 289 rows 108 cols
[2024-06-01 05:30:47] [INFO ] Computed 7 invariants in 8 ms
[2024-06-01 05:30:47] [INFO ] Implicit Places using invariants in 277 ms returned []
[2024-06-01 05:30:47] [INFO ] Flow matrix only has 289 transitions (discarded 1919 similar events)
[2024-06-01 05:30:47] [INFO ] Invariant cache hit.
[2024-06-01 05:30:47] [INFO ] State equation strengthened by 101 read => feed constraints.
[2024-06-01 05:30:48] [INFO ] Implicit Places using invariants and state equation in 858 ms returned []
Implicit Place search using SMT with State Equation took 1141 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 108/108 places, 2208/2228 transitions.
Applied a total of 0 rules in 20 ms. Remains 108 /108 variables (removed 0) and now considering 2208/2208 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60134 ms. Remains : 108/108 places, 2208/2228 transitions.
Support contains 19 out of 108 places after structural reductions.
[2024-06-01 05:30:49] [INFO ] Flatten gal took : 173 ms
[2024-06-01 05:30:49] [INFO ] Flatten gal took : 123 ms
[2024-06-01 05:30:49] [INFO ] Input system was already deterministic with 2208 transitions.
RANDOM walk for 40001 steps (228 resets) in 1612 ms. (24 steps per ms) remains 5/24 properties
BEST_FIRST walk for 40004 steps (81 resets) in 339 ms. (117 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (80 resets) in 205 ms. (194 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40006 steps (73 resets) in 210 ms. (189 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40002 steps (72 resets) in 250 ms. (159 steps per ms) remains 3/3 properties
[2024-06-01 05:30:50] [INFO ] Flow matrix only has 289 transitions (discarded 1919 similar events)
[2024-06-01 05:30:50] [INFO ] Invariant cache hit.
[2024-06-01 05:30:50] [INFO ] State equation strengthened by 101 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp18 is UNSAT
After SMT solving in domain Real declared 78/397 variables, and 3 constraints, problems are : Problem set: 3 solved, 0 unsolved in 35 ms.
Refiners :[Positive P Invariants (semi-flows): 3/7 constraints, State Equation: 0/108 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 74ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA BridgeAndVehicles-PT-V20P10N50-LTLCardinality-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA BridgeAndVehicles-PT-V20P10N50-LTLCardinality-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 3 atomic propositions for a total of 10 simplifications.
Computed a total of 51 stabilizing places and 84 stable transitions
Graph (complete) has 3168 edges and 108 vertex of which 106 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.22 ms
FORMULA BridgeAndVehicles-PT-V20P10N50-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 2208/2208 transitions.
Graph (complete) has 3168 edges and 108 vertex of which 106 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.10 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 105 transition count 2207
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 105 transition count 2207
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 103 transition count 2206
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 10 place count 101 transition count 2204
Applied a total of 10 rules in 387 ms. Remains 101 /108 variables (removed 7) and now considering 2204/2208 (removed 4) transitions.
[2024-06-01 05:30:51] [INFO ] Flow matrix only has 285 transitions (discarded 1919 similar events)
// Phase 1: matrix 285 rows 101 cols
[2024-06-01 05:30:51] [INFO ] Computed 4 invariants in 11 ms
[2024-06-01 05:30:51] [INFO ] Implicit Places using invariants in 371 ms returned []
[2024-06-01 05:30:51] [INFO ] Flow matrix only has 285 transitions (discarded 1919 similar events)
[2024-06-01 05:30:51] [INFO ] Invariant cache hit.
[2024-06-01 05:30:51] [INFO ] State equation strengthened by 101 read => feed constraints.
[2024-06-01 05:30:52] [INFO ] Implicit Places using invariants and state equation in 806 ms returned [22, 46]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1190 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 99/108 places, 2204/2208 transitions.
Applied a total of 0 rules in 257 ms. Remains 99 /99 variables (removed 0) and now considering 2204/2204 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1834 ms. Remains : 99/108 places, 2204/2208 transitions.
Stuttering acceptance computed with spot in 258 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V20P10N50-LTLCardinality-00
Stuttering criterion allowed to conclude after 123 steps with 0 reset in 14 ms.
FORMULA BridgeAndVehicles-PT-V20P10N50-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V20P10N50-LTLCardinality-00 finished in 2192 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((p0&&G(F(!p0)))))'
Support contains 3 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 2208/2208 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 106 transition count 2208
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 105 transition count 2207
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 105 transition count 2207
Applied a total of 4 rules in 27 ms. Remains 105 /108 variables (removed 3) and now considering 2207/2208 (removed 1) transitions.
Running 2204 sub problems to find dead transitions.
[2024-06-01 05:30:52] [INFO ] Flow matrix only has 288 transitions (discarded 1919 similar events)
// Phase 1: matrix 288 rows 105 cols
[2024-06-01 05:30:52] [INFO ] Computed 5 invariants in 2 ms
[2024-06-01 05:30:52] [INFO ] State equation strengthened by 101 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2204 unsolved
[2024-06-01 05:31:18] [INFO ] Deduced a trap composed of 5 places in 291 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 1.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 1.0)
(s23 0.0)
(s24 10.0)
(s25 1.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 1.0)
(s48 1.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 1.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 105/393 variables, and 6 constraints, problems are : Problem set: 0 solved, 2204 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/105 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 2204/2204 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2204 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2204 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 105/393 variables, and 6 constraints, problems are : Problem set: 0 solved, 2204 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/105 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 0/2204 constraints, Known Traps: 1/1 constraints]
After SMT, in 58745ms problems are : Problem set: 0 solved, 2204 unsolved
Search for dead transitions found 0 dead transitions in 58782ms
[2024-06-01 05:31:51] [INFO ] Flow matrix only has 288 transitions (discarded 1919 similar events)
[2024-06-01 05:31:51] [INFO ] Invariant cache hit.
[2024-06-01 05:31:52] [INFO ] Implicit Places using invariants in 333 ms returned []
[2024-06-01 05:31:52] [INFO ] Flow matrix only has 288 transitions (discarded 1919 similar events)
[2024-06-01 05:31:52] [INFO ] Invariant cache hit.
[2024-06-01 05:31:52] [INFO ] State equation strengthened by 101 read => feed constraints.
[2024-06-01 05:31:53] [INFO ] Implicit Places using invariants and state equation in 1634 ms returned [22, 48]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1980 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 103/108 places, 2207/2208 transitions.
Applied a total of 0 rules in 15 ms. Remains 103 /103 variables (removed 0) and now considering 2207/2207 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60817 ms. Remains : 103/108 places, 2207/2208 transitions.
Stuttering acceptance computed with spot in 144 ms :[true, true, true, p0, p0]
Running random walk in product with property : BridgeAndVehicles-PT-V20P10N50-LTLCardinality-02
Product exploration explored 100000 steps with 1494 reset in 633 ms.
Product exploration explored 100000 steps with 1476 reset in 535 ms.
Computed a total of 46 stabilizing places and 83 stable transitions
Computed a total of 46 stabilizing places and 83 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 75 ms. Reduced automaton from 5 states, 8 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 57 ms :[p0, p0]
RANDOM walk for 269 steps (0 resets) in 9 ms. (26 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
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 57 ms :[p0, p0]
Stuttering acceptance computed with spot in 51 ms :[p0, p0]
[2024-06-01 05:31:55] [INFO ] Flow matrix only has 288 transitions (discarded 1919 similar events)
// Phase 1: matrix 288 rows 103 cols
[2024-06-01 05:31:55] [INFO ] Computed 5 invariants in 1 ms
[2024-06-01 05:31:56] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-06-01 05:31:56] [INFO ] [Real]Absence check using state equation in 125 ms returned sat
[2024-06-01 05:31:56] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:31:56] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-06-01 05:31:56] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2024-06-01 05:31:56] [INFO ] State equation strengthened by 101 read => feed constraints.
[2024-06-01 05:31:56] [INFO ] [Nat]Added 101 Read/Feed constraints in 109 ms returned sat
[2024-06-01 05:31:57] [INFO ] Computed and/alt/rep : 90/178/90 causal constraints (skipped 195 transitions) in 168 ms.
[2024-06-01 05:31:57] [INFO ] Added : 38 causal constraints over 8 iterations in 502 ms. Result :sat
Could not prove EG p0
Support contains 3 out of 103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 103/103 places, 2207/2207 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 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 101 transition count 2206
Applied a total of 3 rules in 246 ms. Remains 101 /103 variables (removed 2) and now considering 2206/2207 (removed 1) transitions.
[2024-06-01 05:31:57] [INFO ] Flow matrix only has 287 transitions (discarded 1919 similar events)
// Phase 1: matrix 287 rows 101 cols
[2024-06-01 05:31:57] [INFO ] Computed 4 invariants in 2 ms
[2024-06-01 05:31:58] [INFO ] Implicit Places using invariants in 288 ms returned []
[2024-06-01 05:31:58] [INFO ] Flow matrix only has 287 transitions (discarded 1919 similar events)
[2024-06-01 05:31:58] [INFO ] Invariant cache hit.
[2024-06-01 05:31:58] [INFO ] State equation strengthened by 101 read => feed constraints.
[2024-06-01 05:31:59] [INFO ] Implicit Places using invariants and state equation in 1013 ms returned []
Implicit Place search using SMT with State Equation took 1304 ms to find 0 implicit places.
[2024-06-01 05:31:59] [INFO ] Redundant transitions in 159 ms returned []
Running 2203 sub problems to find dead transitions.
[2024-06-01 05:31:59] [INFO ] Flow matrix only has 287 transitions (discarded 1919 similar events)
[2024-06-01 05:31:59] [INFO ] Invariant cache hit.
[2024-06-01 05:31:59] [INFO ] State equation strengthened by 101 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2203 unsolved
[2024-06-01 05:32:20] [INFO ] Deduced a trap composed of 5 places in 314 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 101/388 variables, and 5 constraints, problems are : Problem set: 0 solved, 2203 unsolved in 30057 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/101 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 2203/2203 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2203 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2203 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2203 unsolved
Problem TDEAD20 is UNSAT
Problem TDEAD43 is UNSAT
At refinement iteration 3 (OVERLAPS) 287/388 variables, 101/106 constraints. Problems are: Problem set: 2 solved, 2201 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/388 variables, 101/207 constraints. Problems are: Problem set: 2 solved, 2201 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 388/388 variables, and 2408 constraints, problems are : Problem set: 2 solved, 2201 unsolved in 35411 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 101/101 constraints, ReadFeed: 101/101 constraints, PredecessorRefiner: 2201/2203 constraints, Known Traps: 1/1 constraints]
After SMT, in 80875ms problems are : Problem set: 2 solved, 2201 unsolved
Search for dead transitions found 2 dead transitions in 80903ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 101/103 places, 2204/2207 transitions.
Applied a total of 0 rules in 247 ms. Remains 101 /101 variables (removed 0) and now considering 2204/2204 (removed 0) transitions.
[2024-06-01 05:33:20] [INFO ] Redundant transitions in 61 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 82947 ms. Remains : 101/103 places, 2204/2207 transitions.
Computed a total of 44 stabilizing places and 80 stable transitions
Computed a total of 44 stabilizing places and 80 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 122 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 91 ms :[p0, p0]
RANDOM walk for 229 steps (0 resets) in 9 ms. (22 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 116 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 75 ms :[p0, p0]
Stuttering acceptance computed with spot in 83 ms :[p0, p0]
[2024-06-01 05:33:21] [INFO ] Flow matrix only has 285 transitions (discarded 1919 similar events)
// Phase 1: matrix 285 rows 101 cols
[2024-06-01 05:33:21] [INFO ] Computed 4 invariants in 6 ms
[2024-06-01 05:33:21] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-06-01 05:33:21] [INFO ] [Real]Absence check using state equation in 116 ms returned sat
[2024-06-01 05:33:21] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:33:22] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-01 05:33:22] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2024-06-01 05:33:22] [INFO ] State equation strengthened by 101 read => feed constraints.
[2024-06-01 05:33:23] [INFO ] [Nat]Added 101 Read/Feed constraints in 680 ms returned sat
[2024-06-01 05:33:23] [INFO ] Deduced a trap composed of 5 places in 323 ms of which 2 ms to minimize.
[2024-06-01 05:33:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 529 ms
[2024-06-01 05:33:23] [INFO ] Computed and/alt/rep : 88/176/88 causal constraints (skipped 194 transitions) in 127 ms.
[2024-06-01 05:33:24] [INFO ] Added : 29 causal constraints over 7 iterations in 780 ms. Result :sat
Could not prove EG p0
Stuttering acceptance computed with spot in 105 ms :[p0, p0]
Product exploration explored 100000 steps with 1680 reset in 684 ms.
Product exploration explored 100000 steps with 1698 reset in 573 ms.
Support contains 3 out of 101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 101/101 places, 2204/2204 transitions.
Applied a total of 0 rules in 213 ms. Remains 101 /101 variables (removed 0) and now considering 2204/2204 (removed 0) transitions.
[2024-06-01 05:33:26] [INFO ] Flow matrix only has 285 transitions (discarded 1919 similar events)
[2024-06-01 05:33:26] [INFO ] Invariant cache hit.
[2024-06-01 05:33:26] [INFO ] Implicit Places using invariants in 382 ms returned []
[2024-06-01 05:33:26] [INFO ] Flow matrix only has 285 transitions (discarded 1919 similar events)
[2024-06-01 05:33:26] [INFO ] Invariant cache hit.
[2024-06-01 05:33:26] [INFO ] State equation strengthened by 101 read => feed constraints.
[2024-06-01 05:33:27] [INFO ] Implicit Places using invariants and state equation in 1170 ms returned []
Implicit Place search using SMT with State Equation took 1553 ms to find 0 implicit places.
[2024-06-01 05:33:27] [INFO ] Redundant transitions in 141 ms returned []
Running 2201 sub problems to find dead transitions.
[2024-06-01 05:33:27] [INFO ] Flow matrix only has 285 transitions (discarded 1919 similar events)
[2024-06-01 05:33:27] [INFO ] Invariant cache hit.
[2024-06-01 05:33:27] [INFO ] State equation strengthened by 101 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2201 unsolved
[2024-06-01 05:33:47] [INFO ] Deduced a trap composed of 51 places in 248 ms of which 3 ms to minimize.
[2024-06-01 05:33:48] [INFO ] Deduced a trap composed of 5 places in 328 ms of which 1 ms to minimize.
[2024-06-01 05:33:50] [INFO ] Deduced a trap composed of 54 places in 232 ms of which 1 ms to minimize.
Problem TDEAD144 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD654 is UNSAT
Problem TDEAD705 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD807 is UNSAT
Problem TDEAD858 is UNSAT
Problem TDEAD909 is UNSAT
Problem TDEAD960 is UNSAT
Problem TDEAD1011 is UNSAT
Problem TDEAD1062 is UNSAT
Problem TDEAD1113 is UNSAT
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 101/386 variables, and 7 constraints, problems are : Problem set: 20 solved, 2181 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/101 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 2201/2201 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 20 solved, 2181 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 4/4 constraints. Problems are: Problem set: 20 solved, 2181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 3/7 constraints. Problems are: Problem set: 20 solved, 2181 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 Int declared 101/386 variables, and 7 constraints, problems are : Problem set: 20 solved, 2181 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/101 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 0/2201 constraints, Known Traps: 3/3 constraints]
After SMT, in 74664ms problems are : Problem set: 20 solved, 2181 unsolved
Search for dead transitions found 20 dead transitions in 74689ms
Found 20 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 20 transitions
Dead transitions reduction (with SMT) removed 20 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 101/101 places, 2184/2204 transitions.
Applied a total of 0 rules in 164 ms. Remains 101 /101 variables (removed 0) and now considering 2184/2184 (removed 0) transitions.
[2024-06-01 05:34:42] [INFO ] Redundant transitions in 42 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 76832 ms. Remains : 101/101 places, 2184/2204 transitions.
Treatment of property BridgeAndVehicles-PT-V20P10N50-LTLCardinality-02 finished in 230136 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(p0)) U (p1||G(!p0)))))'
Support contains 2 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 2208/2208 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 106 transition count 2208
Applied a total of 2 rules in 11 ms. Remains 106 /108 variables (removed 2) and now considering 2208/2208 (removed 0) transitions.
Running 2205 sub problems to find dead transitions.
[2024-06-01 05:34:43] [INFO ] Flow matrix only has 289 transitions (discarded 1919 similar events)
// Phase 1: matrix 289 rows 106 cols
[2024-06-01 05:34:43] [INFO ] Computed 5 invariants in 2 ms
[2024-06-01 05:34:43] [INFO ] State equation strengthened by 101 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2205 unsolved
[2024-06-01 05:35:05] [INFO ] Deduced a trap composed of 5 places in 250 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 106/395 variables, and 6 constraints, problems are : Problem set: 0 solved, 2205 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/106 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 2205/2205 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2205 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2205 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2205 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 106/395 variables, and 6 constraints, problems are : Problem set: 0 solved, 2205 unsolved in 20039 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/106 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 0/2205 constraints, Known Traps: 1/1 constraints]
After SMT, in 56270ms problems are : Problem set: 0 solved, 2205 unsolved
Search for dead transitions found 0 dead transitions in 56295ms
[2024-06-01 05:35:39] [INFO ] Flow matrix only has 289 transitions (discarded 1919 similar events)
[2024-06-01 05:35:39] [INFO ] Invariant cache hit.
[2024-06-01 05:35:39] [INFO ] Implicit Places using invariants in 393 ms returned []
[2024-06-01 05:35:39] [INFO ] Flow matrix only has 289 transitions (discarded 1919 similar events)
[2024-06-01 05:35:39] [INFO ] Invariant cache hit.
[2024-06-01 05:35:39] [INFO ] State equation strengthened by 101 read => feed constraints.
[2024-06-01 05:35:41] [INFO ] Implicit Places using invariants and state equation in 1477 ms returned [22, 48]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1876 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/108 places, 2208/2208 transitions.
Applied a total of 0 rules in 12 ms. Remains 104 /104 variables (removed 0) and now considering 2208/2208 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 58202 ms. Remains : 104/108 places, 2208/2208 transitions.
Stuttering acceptance computed with spot in 183 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (NOT p0), false, (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V20P10N50-LTLCardinality-03
Stuttering criterion allowed to conclude after 1846 steps with 21 reset in 22 ms.
FORMULA BridgeAndVehicles-PT-V20P10N50-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V20P10N50-LTLCardinality-03 finished in 58434 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((((p0 U p1)||p2) U p0))) U p3)))'
Support contains 5 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 2208/2208 transitions.
Applied a total of 0 rules in 12 ms. Remains 108 /108 variables (removed 0) and now considering 2208/2208 (removed 0) transitions.
Running 2205 sub problems to find dead transitions.
[2024-06-01 05:35:41] [INFO ] Flow matrix only has 289 transitions (discarded 1919 similar events)
// Phase 1: matrix 289 rows 108 cols
[2024-06-01 05:35:41] [INFO ] Computed 7 invariants in 4 ms
[2024-06-01 05:35:41] [INFO ] State equation strengthened by 101 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2205 unsolved
[2024-06-01 05:36:01] [INFO ] Deduced a trap composed of 5 places in 235 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 106/397 variables, and 6 constraints, problems are : Problem set: 0 solved, 2205 unsolved in 20061 ms.
Refiners :[Positive P Invariants (semi-flows): 5/7 constraints, State Equation: 0/108 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 2205/2205 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2205 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2205 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2205 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 106/397 variables, and 6 constraints, problems are : Problem set: 0 solved, 2205 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 5/7 constraints, State Equation: 0/108 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 0/2205 constraints, Known Traps: 1/1 constraints]
After SMT, in 54946ms problems are : Problem set: 0 solved, 2205 unsolved
Search for dead transitions found 0 dead transitions in 54964ms
[2024-06-01 05:36:36] [INFO ] Flow matrix only has 289 transitions (discarded 1919 similar events)
[2024-06-01 05:36:36] [INFO ] Invariant cache hit.
[2024-06-01 05:36:36] [INFO ] Implicit Places using invariants in 269 ms returned []
[2024-06-01 05:36:36] [INFO ] Flow matrix only has 289 transitions (discarded 1919 similar events)
[2024-06-01 05:36:36] [INFO ] Invariant cache hit.
[2024-06-01 05:36:36] [INFO ] State equation strengthened by 101 read => feed constraints.
[2024-06-01 05:36:37] [INFO ] Implicit Places using invariants and state equation in 1064 ms returned [22, 49]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1341 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 106/108 places, 2208/2208 transitions.
Applied a total of 0 rules in 14 ms. Remains 106 /106 variables (removed 0) and now considering 2208/2208 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 56344 ms. Remains : 106/108 places, 2208/2208 transitions.
Stuttering acceptance computed with spot in 338 ms :[true, p3, p0, (AND p0 p3), p3, (AND p0 p3)]
Running random walk in product with property : BridgeAndVehicles-PT-V20P10N50-LTLCardinality-05
Product exploration explored 100000 steps with 23365 reset in 953 ms.
Product exploration explored 100000 steps with 23357 reset in 698 ms.
Computed a total of 49 stabilizing places and 84 stable transitions
Graph (complete) has 3080 edges and 106 vertex of which 104 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.6 ms
Computed a total of 49 stabilizing places and 84 stable transitions
Detected a total of 49/106 stabilizing places and 84/2208 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/4 atomic propositions.
Knowledge obtained : [(AND (NOT p3) (NOT p0) (NOT p2) (NOT p1)), (X (NOT p3)), (X (X (NOT p3))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 325 ms. Reduced automaton from 6 states, 10 edges and 4 AP (stutter sensitive) to 6 states, 8 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 272 ms :[true, p0, (AND p0 p3), (AND p0 p3), (AND p0 p3), (AND p0 p3)]
RANDOM walk for 928 steps (5 resets) in 18 ms. (48 steps per ms) remains 0/7 properties
Knowledge obtained : [(AND (NOT p3) (NOT p0) (NOT p2) (NOT p1)), (X (NOT p3)), (X (X (NOT p3))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (OR p0 (NOT p2)) (OR p0 (NOT p1))))), (F (NOT (AND (OR p3 (NOT p0)) (OR p3 (NOT p2)) (OR p3 (NOT p1))))), (F p1), (F p0), (F p2), (F p3), (F (NOT (AND (OR (NOT p3) (NOT p0)) (OR (NOT p3) (NOT p2)) (OR (NOT p3) (NOT p1)))))]
Knowledge based reduction with 6 factoid took 735 ms. Reduced automaton from 6 states, 8 edges and 4 AP (stutter sensitive) to 6 states, 8 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 281 ms :[true, p0, (AND p0 p3), (AND p0 p3), (AND p0 p3), (AND p0 p3)]
Stuttering acceptance computed with spot in 338 ms :[true, p0, (AND p0 p3), (AND p0 p3), (AND p0 p3), (AND p0 p3)]
Support contains 5 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 2208/2208 transitions.
Applied a total of 0 rules in 14 ms. Remains 106 /106 variables (removed 0) and now considering 2208/2208 (removed 0) transitions.
Running 2205 sub problems to find dead transitions.
[2024-06-01 05:36:41] [INFO ] Flow matrix only has 289 transitions (discarded 1919 similar events)
// Phase 1: matrix 289 rows 106 cols
[2024-06-01 05:36:41] [INFO ] Computed 5 invariants in 3 ms
[2024-06-01 05:36:41] [INFO ] State equation strengthened by 101 read => feed constraints.
FORMULA BridgeAndVehicles-PT-V20P10N50-LTLCardinality-00 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA BridgeAndVehicles-PT-V20P10N50-LTLCardinality-01 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA BridgeAndVehicles-PT-V20P10N50-LTLCardinality-02 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA BridgeAndVehicles-PT-V20P10N50-LTLCardinality-03 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA BridgeAndVehicles-PT-V20P10N50-LTLCardinality-04 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA BridgeAndVehicles-PT-V20P10N50-LTLCardinality-05 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA BridgeAndVehicles-PT-V20P10N50-LTLCardinality-06 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA BridgeAndVehicles-PT-V20P10N50-LTLCardinality-07 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA BridgeAndVehicles-PT-V20P10N50-LTLCardinality-08 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA BridgeAndVehicles-PT-V20P10N50-LTLCardinality-09 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : BridgeAndVehicles-PT-V20P10N50-LTLCardinality-10
FORMULA BridgeAndVehicles-PT-V20P10N50-LTLCardinality-11 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA BridgeAndVehicles-PT-V20P10N50-LTLCardinality-12 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA BridgeAndVehicles-PT-V20P10N50-LTLCardinality-13 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA BridgeAndVehicles-PT-V20P10N50-LTLCardinality-14 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA BridgeAndVehicles-PT-V20P10N50-LTLCardinality-15 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717220330792

--------------------
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 LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name BridgeAndVehicles-PT-V20P10N50-LTLCardinality-00
ltl formula formula --ltl=/tmp/983/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 108 places, 2228 transitions and 17190 arcs
pnml2lts-mc( 0/ 4): Petri net BridgeAndVehicles-PT-V20P10N50 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.380 real 0.080 user 0.080 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/983/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/983/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/983/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/983/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 109 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 109, there are 2233 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~165!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 500
pnml2lts-mc( 0/ 4): unique transitions count: 1403
pnml2lts-mc( 0/ 4): - self-loop count: 2
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 505
pnml2lts-mc( 0/ 4): - cum. max stack depth: 505
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 505 states 1422 transitions, fanout: 2.816
pnml2lts-mc( 0/ 4): Total exploration time 0.020 sec (0.020 sec minimum, 0.020 sec on average)
pnml2lts-mc( 0/ 4): States per second: 25250, Transitions per second: 71100
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 42.6 B/state, compr.: 9.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 2280 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name BridgeAndVehicles-PT-V20P10N50-LTLCardinality-01
ltl formula formula --ltl=/tmp/983/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 108 places, 2228 transitions and 17190 arcs
pnml2lts-mc( 0/ 4): Petri net BridgeAndVehicles-PT-V20P10N50 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.310 real 0.100 user 0.060 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/983/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/983/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/983/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/983/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 109 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 109, there are 2233 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~168!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 571
pnml2lts-mc( 0/ 4): unique transitions count: 1228
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 592
pnml2lts-mc( 0/ 4): - cum. max stack depth: 592
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 592 states 1272 transitions, fanout: 2.149
pnml2lts-mc( 0/ 4): Total exploration time 0.020 sec (0.020 sec minimum, 0.020 sec on average)
pnml2lts-mc( 0/ 4): States per second: 29600, Transitions per second: 63600
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 44.1 B/state, compr.: 10.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 2280 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name BridgeAndVehicles-PT-V20P10N50-LTLCardinality-02
ltl formula formula --ltl=/tmp/983/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 108 places, 2228 transitions and 17190 arcs
pnml2lts-mc( 0/ 4): Petri net BridgeAndVehicles-PT-V20P10N50 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.300 real 0.080 user 0.080 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/983/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/983/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/983/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/983/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 109 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 109, there are 2236 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~166!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 31
pnml2lts-mc( 0/ 4): unique states count: 594
pnml2lts-mc( 0/ 4): unique transitions count: 2808
pnml2lts-mc( 0/ 4): - self-loop count: 2
pnml2lts-mc( 0/ 4): - claim dead count: 2
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 610
pnml2lts-mc( 0/ 4): - cum. max stack depth: 579
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 610 states 2852 transitions, fanout: 4.675
pnml2lts-mc( 0/ 4): Total exploration time 0.030 sec (0.030 sec minimum, 0.030 sec on average)
pnml2lts-mc( 0/ 4): States per second: 20333, Transitions per second: 95067
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 28.0 B/state, compr.: 6.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 2280 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.1MB (~256.0MB paged-in)
ltl formula name BridgeAndVehicles-PT-V20P10N50-LTLCardinality-03
ltl formula formula --ltl=/tmp/983/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 108 places, 2228 transitions and 17190 arcs
pnml2lts-mc( 0/ 4): Petri net BridgeAndVehicles-PT-V20P10N50 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.300 real 0.070 user 0.090 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/983/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/983/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/983/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/983/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): There are 108 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 109, there are 2240 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~168!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 42
pnml2lts-mc( 0/ 4): unique states count: 664
pnml2lts-mc( 0/ 4): unique transitions count: 1759
pnml2lts-mc( 0/ 4): - self-loop count: 2
pnml2lts-mc( 0/ 4): - claim dead count: 35
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 677
pnml2lts-mc( 0/ 4): - cum. max stack depth: 643
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 677 states 1797 transitions, fanout: 2.654
pnml2lts-mc( 0/ 4): Total exploration time 0.030 sec (0.030 sec minimum, 0.030 sec on average)
pnml2lts-mc( 0/ 4): States per second: 22567, Transitions per second: 59900
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 42.9 B/state, compr.: 9.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 2280 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.1MB (~256.0MB paged-in)
ltl formula name BridgeAndVehicles-PT-V20P10N50-LTLCardinality-04
ltl formula formula --ltl=/tmp/983/ltl_4_
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 108 places, 2228 transitions and 17190 arcs
pnml2lts-mc( 0/ 4): Petri net BridgeAndVehicles-PT-V20P10N50 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.260 real 0.070 user 0.090 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/983/ltl_4_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/983/ltl_4_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/983/ltl_4_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/983/ltl_4_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 108 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 109, there are 2232 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~165!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 587
pnml2lts-mc( 0/ 4): unique transitions count: 1262
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 611
pnml2lts-mc( 0/ 4): - cum. max stack depth: 611
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 611 states 1319 transitions, fanout: 2.159
pnml2lts-mc( 0/ 4): Total exploration time 0.020 sec (0.020 sec minimum, 0.020 sec on average)
pnml2lts-mc( 0/ 4): States per second: 30550, Transitions per second: 65950
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 42.5 B/state, compr.: 9.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 2280 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name BridgeAndVehicles-PT-V20P10N50-LTLCardinality-05
ltl formula formula --ltl=/tmp/983/ltl_5_
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 108 places, 2228 transitions and 17190 arcs
pnml2lts-mc( 0/ 4): Petri net BridgeAndVehicles-PT-V20P10N50 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.270 real 0.070 user 0.080 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/983/ltl_5_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/983/ltl_5_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/983/ltl_5_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/983/ltl_5_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 109 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 109, there are 2243 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 857
pnml2lts-mc( 0/ 4): unique states count: 857
pnml2lts-mc( 0/ 4): unique transitions count: 1245
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 958
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 1426
pnml2lts-mc( 0/ 4): - cum. max stack depth: 171
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 1426 states 2608 transitions, fanout: 1.829
pnml2lts-mc( 0/ 4): Total exploration time 0.030 sec (0.030 sec minimum, 0.030 sec on average)
pnml2lts-mc( 0/ 4): States per second: 47533, Transitions per second: 86933
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 25.9 B/state, compr.: 5.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 2280 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name BridgeAndVehicles-PT-V20P10N50-LTLCardinality-06
ltl formula formula --ltl=/tmp/983/ltl_6_
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 108 places, 2228 transitions and 17190 arcs
pnml2lts-mc( 0/ 4): Petri net BridgeAndVehicles-PT-V20P10N50 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.270 real 0.100 user 0.050 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/983/ltl_6_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/983/ltl_6_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/983/ltl_6_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/983/ltl_6_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 109 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 109, there are 2234 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 3/ 4): Accepting cycle FOUND at depth ~165!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 563
pnml2lts-mc( 0/ 4): unique transitions count: 1313
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 570
pnml2lts-mc( 0/ 4): - cum. max stack depth: 570
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 570 states 1334 transitions, fanout: 2.340
pnml2lts-mc( 0/ 4): Total exploration time 0.020 sec (0.020 sec minimum, 0.020 sec on average)
pnml2lts-mc( 0/ 4): States per second: 28500, Transitions per second: 66700
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 43.6 B/state, compr.: 10.0%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 2280 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.1MB (~256.0MB paged-in)
ltl formula name BridgeAndVehicles-PT-V20P10N50-LTLCardinality-07
ltl formula formula --ltl=/tmp/983/ltl_7_
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 108 places, 2228 transitions and 17190 arcs
pnml2lts-mc( 0/ 4): Petri net BridgeAndVehicles-PT-V20P10N50 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.290 real 0.070 user 0.110 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/983/ltl_7_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/983/ltl_7_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/983/ltl_7_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/983/ltl_7_
pnml2lts-mc( 0/ 4): buchi has 9 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 109 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 109, there are 2254 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~165!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 6
pnml2lts-mc( 0/ 4): unique states count: 539
pnml2lts-mc( 0/ 4): unique transitions count: 1216
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 617
pnml2lts-mc( 0/ 4): - cum. max stack depth: 610
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 617 states 1375 transitions, fanout: 2.229
pnml2lts-mc( 0/ 4): Total exploration time 0.020 sec (0.020 sec minimum, 0.020 sec on average)
pnml2lts-mc( 0/ 4): States per second: 30850, Transitions per second: 68750
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 45.9 B/state, compr.: 10.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 2280 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name BridgeAndVehicles-PT-V20P10N50-LTLCardinality-08
ltl formula formula --ltl=/tmp/983/ltl_8_
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 108 places, 2228 transitions and 17190 arcs
pnml2lts-mc( 0/ 4): Petri net BridgeAndVehicles-PT-V20P10N50 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.310 real 0.130 user 0.080 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/983/ltl_8_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/983/ltl_8_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/983/ltl_8_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/983/ltl_8_
pnml2lts-mc( 0/ 4): buchi has 7 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 109 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 109, there are 2242 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 9
pnml2lts-mc( 0/ 4): unique states count: 9
pnml2lts-mc( 0/ 4): unique transitions count: 11
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 6
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 19
pnml2lts-mc( 0/ 4): - cum. max stack depth: 12
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 19 states 35 transitions, fanout: 1.842
pnml2lts-mc( 0/ 4): Total exploration time 0.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 104.9 B/state, compr.: 23.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 2280 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name BridgeAndVehicles-PT-V20P10N50-LTLCardinality-09
ltl formula formula --ltl=/tmp/983/ltl_9_
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 108 places, 2228 transitions and 17190 arcs
pnml2lts-mc( 0/ 4): Petri net BridgeAndVehicles-PT-V20P10N50 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.240 real 0.090 user 0.090 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/983/ltl_9_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/983/ltl_9_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/983/ltl_9_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/983/ltl_9_
pnml2lts-mc( 0/ 4): buchi has 10 states
pnml2lts-mc( 0/ 4): There are 108 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 109, there are 2266 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 4
pnml2lts-mc( 0/ 4): unique states count: 4
pnml2lts-mc( 0/ 4): unique transitions count: 3
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 4
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 10
pnml2lts-mc( 0/ 4): - cum. max stack depth: 8
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 10 states 16 transitions, fanout: 1.600
pnml2lts-mc( 0/ 4): Total exploration time 0.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 124.0 B/state, compr.: 28.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 2280 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name BridgeAndVehicles-PT-V20P10N50-LTLCardinality-10
ltl formula formula --ltl=/tmp/983/ltl_10_
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 108 places, 2228 transitions and 17190 arcs
pnml2lts-mc( 0/ 4): Petri net BridgeAndVehicles-PT-V20P10N50 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.260 real 0.100 user 0.060 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/983/ltl_10_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/983/ltl_10_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/983/ltl_10_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/983/ltl_10_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 108 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 109, there are 2238 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~171 levels ~10000 states ~29816 transitions
pnml2lts-mc( 3/ 4): ~171 levels ~20000 states ~62448 transitions
pnml2lts-mc( 3/ 4): ~171 levels ~40000 states ~122744 transitions
pnml2lts-mc( 3/ 4): ~171 levels ~80000 states ~271308 transitions
pnml2lts-mc( 3/ 4): ~171 levels ~160000 states ~609964 transitions
pnml2lts-mc( 0/ 4): ~207 levels ~320000 states ~993188 transitions
pnml2lts-mc( 1/ 4): ~171 levels ~640000 states ~2042524 transitions
pnml2lts-mc( 1/ 4): ~171 levels ~1280000 states ~4237060 transitions
pnml2lts-mc( 1/ 4): ~171 levels ~2560000 states ~8691832 transitions
pnml2lts-mc( 1/ 4): ~171 levels ~5120000 states ~17975748 transitions
pnml2lts-mc( 3/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 8131342
pnml2lts-mc( 0/ 4): unique states count: 8131619
pnml2lts-mc( 0/ 4): unique transitions count: 32257826
pnml2lts-mc( 0/ 4): - self-loop count: 40
pnml2lts-mc( 0/ 4): - claim dead count: 24227291
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 8186150
pnml2lts-mc( 0/ 4): - cum. max stack depth: 720
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 8186150 states 32492377 transitions, fanout: 3.969
pnml2lts-mc( 0/ 4): Total exploration time 109.430 sec (109.420 sec minimum, 109.423 sec on average)
pnml2lts-mc( 0/ 4): States per second: 74807, Transitions per second: 296924
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 126.0MB, 16.3 B/state, compr.: 3.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 24.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 2280 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 126.0MB (~256.0MB paged-in)
ltl formula name BridgeAndVehicles-PT-V20P10N50-LTLCardinality-11
ltl formula formula --ltl=/tmp/983/ltl_11_
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 108 places, 2228 transitions and 17190 arcs
pnml2lts-mc( 0/ 4): Petri net BridgeAndVehicles-PT-V20P10N50 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.270 real 0.100 user 0.090 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/983/ltl_11_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/983/ltl_11_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/983/ltl_11_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/983/ltl_11_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 109 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 109, there are 2234 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~97 levels ~10000 states ~27960 transitions
pnml2lts-mc( 2/ 4): ~95 levels ~20000 states ~68360 transitions
pnml2lts-mc( 2/ 4): ~95 levels ~40000 states ~140556 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 53873
pnml2lts-mc( 0/ 4): unique states count: 53873
pnml2lts-mc( 0/ 4): unique transitions count: 185478
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 133961
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 55382
pnml2lts-mc( 0/ 4): - cum. max stack depth: 381
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 55382 states 191113 transitions, fanout: 3.451
pnml2lts-mc( 0/ 4): Total exploration time 0.940 sec (0.940 sec minimum, 0.940 sec on average)
pnml2lts-mc( 0/ 4): States per second: 58917, Transitions per second: 203312
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 1.4MB, 27.3 B/state, compr.: 6.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/1.0%
pnml2lts-mc( 0/ 4): Stored 2280 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 1.4MB (~256.0MB paged-in)
ltl formula name BridgeAndVehicles-PT-V20P10N50-LTLCardinality-12
ltl formula formula --ltl=/tmp/983/ltl_12_
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 108 places, 2228 transitions and 17190 arcs
pnml2lts-mc( 0/ 4): Petri net BridgeAndVehicles-PT-V20P10N50 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.330 real 0.100 user 0.080 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/983/ltl_12_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/983/ltl_12_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/983/ltl_12_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/983/ltl_12_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 109 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 109, there are 2231 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~165!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 610
pnml2lts-mc( 0/ 4): unique transitions count: 1568
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 642
pnml2lts-mc( 0/ 4): - cum. max stack depth: 642
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 642 states 1638 transitions, fanout: 2.551
pnml2lts-mc( 0/ 4): Total exploration time 0.020 sec (0.020 sec minimum, 0.020 sec on average)
pnml2lts-mc( 0/ 4): States per second: 32100, Transitions per second: 81900
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 43.7 B/state, compr.: 10.0%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 2280 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.1MB (~256.0MB paged-in)
ltl formula name BridgeAndVehicles-PT-V20P10N50-LTLCardinality-13
ltl formula formula --ltl=/tmp/983/ltl_13_
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 108 places, 2228 transitions and 17190 arcs
pnml2lts-mc( 0/ 4): Petri net BridgeAndVehicles-PT-V20P10N50 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.250 real 0.080 user 0.070 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/983/ltl_13_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/983/ltl_13_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/983/ltl_13_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/983/ltl_13_
pnml2lts-mc( 0/ 4): buchi has 10 states
pnml2lts-mc( 0/ 4): There are 108 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 109, there are 2293 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~165!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 601
pnml2lts-mc( 0/ 4): unique transitions count: 1407
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 615
pnml2lts-mc( 0/ 4): - cum. max stack depth: 615
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 615 states 1438 transitions, fanout: 2.338
pnml2lts-mc( 0/ 4): Total exploration time 0.020 sec (0.020 sec minimum, 0.020 sec on average)
pnml2lts-mc( 0/ 4): States per second: 30750, Transitions per second: 71900
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 41.9 B/state, compr.: 9.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 2280 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.1MB (~256.0MB paged-in)
ltl formula name BridgeAndVehicles-PT-V20P10N50-LTLCardinality-14
ltl formula formula --ltl=/tmp/983/ltl_14_
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): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 108 places, 2228 transitions and 17190 arcs
pnml2lts-mc( 0/ 4): Petri net BridgeAndVehicles-PT-V20P10N50 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.260 real 0.070 user 0.080 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/983/ltl_14_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/983/ltl_14_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/983/ltl_14_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/983/ltl_14_
pnml2lts-mc( 0/ 4): buchi has 1 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 109 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 109, there are 2229 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 1
pnml2lts-mc( 0/ 4): unique states count: 1
pnml2lts-mc( 0/ 4): unique transitions count: 0
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 4
pnml2lts-mc( 0/ 4): - cum. max stack depth: 4
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 4 states 4 transitions, fanout: 1.000
pnml2lts-mc( 0/ 4): Total exploration time 0.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 160.0 B/state, compr.: 36.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 2280 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name BridgeAndVehicles-PT-V20P10N50-LTLCardinality-15
ltl formula formula --ltl=/tmp/983/ltl_15_
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 108 places, 2228 transitions and 17190 arcs
pnml2lts-mc( 0/ 4): Petri net BridgeAndVehicles-PT-V20P10N50 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.260 real 0.090 user 0.100 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/983/ltl_15_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/983/ltl_15_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/983/ltl_15_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/983/ltl_15_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 108 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 109, there are 2232 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 3/ 4): Accepting cycle FOUND at depth ~168!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 589
pnml2lts-mc( 0/ 4): unique transitions count: 1566
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 597
pnml2lts-mc( 0/ 4): - cum. max stack depth: 597
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 597 states 1589 transitions, fanout: 2.662
pnml2lts-mc( 0/ 4): Total exploration time 0.020 sec (0.020 sec minimum, 0.020 sec on average)
pnml2lts-mc( 0/ 4): States per second: 29850, Transitions per second: 79450
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 42.6 B/state, compr.: 9.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 2280 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.1MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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