Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r476-tall-171620505100076.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is CANConstruction-PT-090, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r476-tall-171620505100076
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 13M
-rw-r--r-- 1 mcc users 9.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.7K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 15:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 12M 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 CANConstruction-PT-090-LTLFireability-00
FORMULA_NAME CANConstruction-PT-090-LTLFireability-01
FORMULA_NAME CANConstruction-PT-090-LTLFireability-02
FORMULA_NAME CANConstruction-PT-090-LTLFireability-03
FORMULA_NAME CANConstruction-PT-090-LTLFireability-04
FORMULA_NAME CANConstruction-PT-090-LTLFireability-05
FORMULA_NAME CANConstruction-PT-090-LTLFireability-06
FORMULA_NAME CANConstruction-PT-090-LTLFireability-07
FORMULA_NAME CANConstruction-PT-090-LTLFireability-08
FORMULA_NAME CANConstruction-PT-090-LTLFireability-09
FORMULA_NAME CANConstruction-PT-090-LTLFireability-10
FORMULA_NAME CANConstruction-PT-090-LTLFireability-11
FORMULA_NAME CANConstruction-PT-090-LTLFireability-12
FORMULA_NAME CANConstruction-PT-090-LTLFireability-13
FORMULA_NAME CANConstruction-PT-090-LTLFireability-14
FORMULA_NAME CANConstruction-PT-090-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717183574165

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANConstruction-PT-090
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 19:26:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 19:26:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 19:26:16] [INFO ] Load time of PNML (sax parser for PT used): 651 ms
[2024-05-31 19:26:16] [INFO ] Transformed 17282 places.
[2024-05-31 19:26:16] [INFO ] Transformed 33120 transitions.
[2024-05-31 19:26:16] [INFO ] Parsed PT model containing 17282 places and 33120 transitions and 99000 arcs in 860 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 20 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA CANConstruction-PT-090-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-090-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-090-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-090-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 40 out of 17282 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17282/17282 places, 33120/33120 transitions.
Discarding 7905 places :
Symmetric choice reduction at 0 with 7905 rule applications. Total rules 7905 place count 9377 transition count 17310
Iterating global reduction 0 with 7905 rules applied. Total rules applied 15810 place count 9377 transition count 17310
Applied a total of 15810 rules in 6400 ms. Remains 9377 /17282 variables (removed 7905) and now considering 17310/33120 (removed 15810) transitions.
// Phase 1: matrix 17310 rows 9377 cols
[2024-05-31 19:26:23] [INFO ] Computed 181 invariants in 214 ms
[2024-05-31 19:26:31] [INFO ] Implicit Places using invariants in 8957 ms returned [12, 26, 40, 54, 68, 82, 96, 110, 124, 138, 152, 166, 180, 194, 208, 222, 236, 250, 264, 278, 292, 306, 320, 334, 348, 362, 376, 390, 404, 418, 432, 446, 460, 474, 488, 502, 516, 530, 544, 558, 572, 586, 600, 614, 628, 642, 656, 670, 684, 698, 712, 726, 740, 754, 768, 782, 796, 810, 824, 838, 852, 866, 880, 894, 908, 922, 936, 950, 964, 978, 992, 1006, 1020, 1034, 1048, 1062, 1076, 1090, 1104, 1118, 1132, 1146, 1160, 1174, 1188, 1202, 1216, 1230, 1244, 1258]
Discarding 90 places :
Implicit Place search using SMT only with invariants took 9005 ms to find 90 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 9287/17282 places, 17310/33120 transitions.
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 90 place count 9197 transition count 17220
Iterating global reduction 0 with 90 rules applied. Total rules applied 180 place count 9197 transition count 17220
Applied a total of 180 rules in 6366 ms. Remains 9197 /9287 variables (removed 90) and now considering 17220/17310 (removed 90) transitions.
// Phase 1: matrix 17220 rows 9197 cols
[2024-05-31 19:26:38] [INFO ] Computed 91 invariants in 280 ms
[2024-05-31 19:26:46] [INFO ] Implicit Places using invariants in 8462 ms returned []
Implicit Place search using SMT only with invariants took 8467 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 9197/17282 places, 17220/33120 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 30259 ms. Remains : 9197/17282 places, 17220/33120 transitions.
Support contains 40 out of 9197 places after structural reductions.
[2024-05-31 19:26:47] [INFO ] Flatten gal took : 745 ms
[2024-05-31 19:26:48] [INFO ] Flatten gal took : 559 ms
[2024-05-31 19:26:49] [INFO ] Input system was already deterministic with 17220 transitions.
RANDOM walk for 40000 steps (24 resets) in 3049 ms. (13 steps per ms) remains 9/28 properties
BEST_FIRST walk for 40004 steps (8 resets) in 232 ms. (171 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 146 ms. (272 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 146 ms. (272 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 137 ms. (289 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 127 ms. (312 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 190 ms. (209 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 129 ms. (307 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 127 ms. (312 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 95 ms. (416 steps per ms) remains 9/9 properties
[2024-05-31 19:26:50] [INFO ] Invariant cache hit.
[2024-05-31 19:26:51] [INFO ] State equation strengthened by 16110 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 9106/9118 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-31 19:27:12] [INFO ] Deduced a trap composed of 5 places in 20387 ms of which 386 ms to minimize.
SMT process timed out in 21886ms, After SMT, problems are : Problem set: 0 solved, 9 unsolved
Fused 9 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 12 out of 9197 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 9197/9197 places, 17220/17220 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 616 transitions
Trivial Post-agglo rules discarded 616 transitions
Performed 616 trivial Post agglomeration. Transition count delta: 616
Iterating post reduction 0 with 616 rules applied. Total rules applied 616 place count 9197 transition count 16604
Reduce places removed 616 places and 0 transitions.
Iterating post reduction 1 with 616 rules applied. Total rules applied 1232 place count 8581 transition count 16604
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 90 Pre rules applied. Total rules applied 1232 place count 8581 transition count 16514
Deduced a syphon composed of 90 places in 6 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 1412 place count 8491 transition count 16514
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 1419 place count 8484 transition count 16500
Iterating global reduction 2 with 7 rules applied. Total rules applied 1426 place count 8484 transition count 16500
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 2 with 5 rules applied. Total rules applied 1431 place count 8484 transition count 16495
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 1436 place count 8479 transition count 16495
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 96
Deduced a syphon composed of 96 places in 11 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 4 with 192 rules applied. Total rules applied 1628 place count 8383 transition count 16399
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1630 place count 8383 transition count 16397
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1632 place count 8381 transition count 16397
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 1633 place count 8381 transition count 16397
Applied a total of 1633 rules in 15368 ms. Remains 8381 /9197 variables (removed 816) and now considering 16397/17220 (removed 823) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15371 ms. Remains : 8381/9197 places, 16397/17220 transitions.
RANDOM walk for 40000 steps (63 resets) in 1356 ms. (29 steps per ms) remains 3/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 105 ms. (377 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 127 ms. (312 steps per ms) remains 2/3 properties
// Phase 1: matrix 16397 rows 8381 cols
[2024-05-31 19:27:29] [INFO ] Computed 91 invariants in 508 ms
[2024-05-31 19:27:29] [INFO ] State equation strengthened by 16110 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 8290/8292 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 19:27:48] [INFO ] Deduced a trap composed of 2 places in 17849 ms of which 60 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/8292 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8292 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 88/8380 variables, 88/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 19:28:12] [INFO ] Deduced a trap composed of 93 places in 22672 ms of which 60 ms to minimize.
[2024-05-31 19:28:35] [INFO ] Deduced a trap composed of 93 places in 23155 ms of which 56 ms to minimize.
SMT process timed out in 66779ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 8381 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8381/8381 places, 16397/16397 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 8375 transition count 16385
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 8375 transition count 16385
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 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 8374 transition count 16384
Applied a total of 14 rules in 8102 ms. Remains 8374 /8381 variables (removed 7) and now considering 16384/16397 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8102 ms. Remains : 8374/8381 places, 16384/16397 transitions.
Computed a total of 271 stabilizing places and 360 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' '!(X((p0||(X((p0||G(p1)))&&F(p2)))))'
Support contains 4 out of 9197 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9197/9197 places, 17220/17220 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 9184 transition count 17194
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 9184 transition count 17194
Applied a total of 26 rules in 6621 ms. Remains 9184 /9197 variables (removed 13) and now considering 17194/17220 (removed 26) transitions.
// Phase 1: matrix 17194 rows 9184 cols
[2024-05-31 19:28:50] [INFO ] Computed 91 invariants in 231 ms
[2024-05-31 19:28:59] [INFO ] Implicit Places using invariants in 8893 ms returned []
Implicit Place search using SMT only with invariants took 8896 ms to find 0 implicit places.
Running 17104 sub problems to find dead transitions.
[2024-05-31 19:29:00] [INFO ] Invariant cache hit.
[2024-05-31 19:29:00] [INFO ] State equation strengthened by 16110 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9183 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 17104 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 9183/26378 variables, and 91 constraints, problems are : Problem set: 0 solved, 17104 unsolved in 30288 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 0/9184 constraints, ReadFeed: 0/16110 constraints, PredecessorRefiner: 17104/17104 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17104 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9183 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 17104 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 9183/26378 variables, and 91 constraints, problems are : Problem set: 0 solved, 17104 unsolved in 30238 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 0/9184 constraints, ReadFeed: 0/16110 constraints, PredecessorRefiner: 0/17104 constraints, Known Traps: 0/0 constraints]
After SMT, in 100652ms problems are : Problem set: 0 solved, 17104 unsolved
Search for dead transitions found 0 dead transitions in 100975ms
Starting structural reductions in LTL mode, iteration 1 : 9184/9197 places, 17194/17220 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 116570 ms. Remains : 9184/9197 places, 17194/17220 transitions.
Stuttering acceptance computed with spot in 380 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p0)), (NOT p2), true, (NOT p1)]
Running random walk in product with property : CANConstruction-PT-090-LTLFireability-00
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 4 ms.
FORMULA CANConstruction-PT-090-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-090-LTLFireability-00 finished in 117053 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&&(p1 U p2)))))'
Support contains 3 out of 9197 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9197/9197 places, 17220/17220 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 615 transitions
Trivial Post-agglo rules discarded 615 transitions
Performed 615 trivial Post agglomeration. Transition count delta: 615
Iterating post reduction 0 with 615 rules applied. Total rules applied 615 place count 9197 transition count 16605
Reduce places removed 615 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 616 rules applied. Total rules applied 1231 place count 8582 transition count 16604
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1232 place count 8581 transition count 16604
Performed 89 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 89 Pre rules applied. Total rules applied 1232 place count 8581 transition count 16515
Deduced a syphon composed of 89 places in 4 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 1410 place count 8492 transition count 16515
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1423 place count 8479 transition count 16489
Iterating global reduction 3 with 13 rules applied. Total rules applied 1436 place count 8479 transition count 16489
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 3 with 11 rules applied. Total rules applied 1447 place count 8479 transition count 16478
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 1458 place count 8468 transition count 16478
Performed 92 Post agglomeration using F-continuation condition.Transition count delta: 92
Deduced a syphon composed of 92 places in 4 ms
Reduce places removed 92 places and 0 transitions.
Iterating global reduction 5 with 184 rules applied. Total rules applied 1642 place count 8376 transition count 16386
Applied a total of 1642 rules in 9286 ms. Remains 8376 /9197 variables (removed 821) and now considering 16386/17220 (removed 834) transitions.
// Phase 1: matrix 16386 rows 8376 cols
[2024-05-31 19:30:50] [INFO ] Computed 91 invariants in 416 ms
[2024-05-31 19:30:58] [INFO ] Implicit Places using invariants in 8381 ms returned []
Implicit Place search using SMT only with invariants took 8382 ms to find 0 implicit places.
Running 16296 sub problems to find dead transitions.
[2024-05-31 19:30:58] [INFO ] Invariant cache hit.
[2024-05-31 19:30:59] [INFO ] State equation strengthened by 16110 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/8375 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 16296 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 8375/24762 variables, and 91 constraints, problems are : Problem set: 0 solved, 16296 unsolved in 30337 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 0/8376 constraints, ReadFeed: 0/16110 constraints, PredecessorRefiner: 16296/16296 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16296 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8375 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 16296 unsolved
[2024-05-31 19:32:34] [INFO ] Deduced a trap composed of 93 places in 10745 ms of which 54 ms to minimize.
[2024-05-31 19:32:44] [INFO ] Deduced a trap composed of 93 places in 10304 ms of which 48 ms to minimize.
SMT process timed out in 105589ms, After SMT, problems are : Problem set: 0 solved, 16296 unsolved
Search for dead transitions found 0 dead transitions in 105757ms
Starting structural reductions in SI_LTL mode, iteration 1 : 8376/9197 places, 16386/17220 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 123466 ms. Remains : 8376/9197 places, 16386/17220 transitions.
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
Running random walk in product with property : CANConstruction-PT-090-LTLFireability-01
Stuttering criterion allowed to conclude after 629 steps with 0 reset in 78 ms.
FORMULA CANConstruction-PT-090-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-090-LTLFireability-01 finished in 123727 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' '!((G(p0) U p1))'
Support contains 2 out of 9197 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9197/9197 places, 17220/17220 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 617 transitions
Trivial Post-agglo rules discarded 617 transitions
Performed 617 trivial Post agglomeration. Transition count delta: 617
Iterating post reduction 0 with 617 rules applied. Total rules applied 617 place count 9197 transition count 16603
Reduce places removed 617 places and 0 transitions.
Iterating post reduction 1 with 617 rules applied. Total rules applied 1234 place count 8580 transition count 16603
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 90 Pre rules applied. Total rules applied 1234 place count 8580 transition count 16513
Deduced a syphon composed of 90 places in 5 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 1414 place count 8490 transition count 16513
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 1427 place count 8477 transition count 16487
Iterating global reduction 2 with 13 rules applied. Total rules applied 1440 place count 8477 transition count 16487
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 2 with 11 rules applied. Total rules applied 1451 place count 8477 transition count 16476
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 1462 place count 8466 transition count 16476
Performed 92 Post agglomeration using F-continuation condition.Transition count delta: 92
Deduced a syphon composed of 92 places in 3 ms
Reduce places removed 92 places and 0 transitions.
Iterating global reduction 4 with 184 rules applied. Total rules applied 1646 place count 8374 transition count 16384
Applied a total of 1646 rules in 8780 ms. Remains 8374 /9197 variables (removed 823) and now considering 16384/17220 (removed 836) transitions.
// Phase 1: matrix 16384 rows 8374 cols
[2024-05-31 19:32:54] [INFO ] Computed 91 invariants in 456 ms
[2024-05-31 19:33:02] [INFO ] Implicit Places using invariants in 8517 ms returned []
Implicit Place search using SMT only with invariants took 8520 ms to find 0 implicit places.
Running 16294 sub problems to find dead transitions.
[2024-05-31 19:33:02] [INFO ] Invariant cache hit.
[2024-05-31 19:33:02] [INFO ] State equation strengthened by 16110 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8373 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 16294 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 8373/24758 variables, and 91 constraints, problems are : Problem set: 0 solved, 16294 unsolved in 30231 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 0/8374 constraints, ReadFeed: 0/16110 constraints, PredecessorRefiner: 16294/16294 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16294 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8373 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 16294 unsolved
[2024-05-31 19:34:34] [INFO ] Deduced a trap composed of 93 places in 10773 ms of which 71 ms to minimize.
[2024-05-31 19:34:45] [INFO ] Deduced a trap composed of 93 places in 10680 ms of which 53 ms to minimize.
SMT process timed out in 103205ms, After SMT, problems are : Problem set: 0 solved, 16294 unsolved
Search for dead transitions found 0 dead transitions in 103359ms
Starting structural reductions in SI_LTL mode, iteration 1 : 8374/9197 places, 16384/17220 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 120702 ms. Remains : 8374/9197 places, 16384/17220 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p1), true, (NOT p0)]
Running random walk in product with property : CANConstruction-PT-090-LTLFireability-02
Entered a terminal (fully accepting) state of product in 13097 steps with 20 reset in 417 ms.
FORMULA CANConstruction-PT-090-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-090-LTLFireability-02 finished in 121254 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(X(X((G(p0)||((p1 U X(p2))&&G(p1))))))))'
Support contains 5 out of 9197 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9197/9197 places, 17220/17220 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 615 transitions
Trivial Post-agglo rules discarded 615 transitions
Performed 615 trivial Post agglomeration. Transition count delta: 615
Iterating post reduction 0 with 615 rules applied. Total rules applied 615 place count 9197 transition count 16605
Reduce places removed 615 places and 0 transitions.
Iterating post reduction 1 with 615 rules applied. Total rules applied 1230 place count 8582 transition count 16605
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 90 Pre rules applied. Total rules applied 1230 place count 8582 transition count 16515
Deduced a syphon composed of 90 places in 4 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 1410 place count 8492 transition count 16515
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 1424 place count 8478 transition count 16487
Iterating global reduction 2 with 14 rules applied. Total rules applied 1438 place count 8478 transition count 16487
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 2 with 12 rules applied. Total rules applied 1450 place count 8478 transition count 16475
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 1462 place count 8466 transition count 16475
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 89
Deduced a syphon composed of 89 places in 3 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 4 with 178 rules applied. Total rules applied 1640 place count 8377 transition count 16386
Applied a total of 1640 rules in 9119 ms. Remains 8377 /9197 variables (removed 820) and now considering 16386/17220 (removed 834) transitions.
// Phase 1: matrix 16386 rows 8377 cols
[2024-05-31 19:34:55] [INFO ] Computed 91 invariants in 432 ms
[2024-05-31 19:35:03] [INFO ] Implicit Places using invariants in 8171 ms returned []
Implicit Place search using SMT only with invariants took 8172 ms to find 0 implicit places.
Running 16296 sub problems to find dead transitions.
[2024-05-31 19:35:03] [INFO ] Invariant cache hit.
[2024-05-31 19:35:03] [INFO ] State equation strengthened by 16110 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/8376 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 16296 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 8376/24763 variables, and 91 constraints, problems are : Problem set: 0 solved, 16296 unsolved in 30232 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 0/8377 constraints, ReadFeed: 0/16110 constraints, PredecessorRefiner: 16296/16296 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16296 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8376 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 16296 unsolved
[2024-05-31 19:36:36] [INFO ] Deduced a trap composed of 93 places in 9785 ms of which 54 ms to minimize.
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 8376/24763 variables, and 92 constraints, problems are : Problem set: 0 solved, 16296 unsolved in 30196 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 0/8377 constraints, ReadFeed: 0/16110 constraints, PredecessorRefiner: 0/16296 constraints, Known Traps: 1/1 constraints]
After SMT, in 94957ms problems are : Problem set: 0 solved, 16296 unsolved
Search for dead transitions found 0 dead transitions in 95102ms
Starting structural reductions in SI_LTL mode, iteration 1 : 8377/9197 places, 16386/17220 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 112415 ms. Remains : 8377/9197 places, 16386/17220 transitions.
Stuttering acceptance computed with spot in 145 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : CANConstruction-PT-090-LTLFireability-04
Stuttering criterion allowed to conclude after 600 steps with 0 reset in 16 ms.
FORMULA CANConstruction-PT-090-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-090-LTLFireability-04 finished in 112632 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((!p0||X(X((p1||(X(p0)&&p2))))))))'
Support contains 5 out of 9197 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9197/9197 places, 17220/17220 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 9183 transition count 17192
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 9183 transition count 17192
Applied a total of 28 rules in 6641 ms. Remains 9183 /9197 variables (removed 14) and now considering 17192/17220 (removed 28) transitions.
// Phase 1: matrix 17192 rows 9183 cols
[2024-05-31 19:36:45] [INFO ] Computed 91 invariants in 239 ms
[2024-05-31 19:36:53] [INFO ] Implicit Places using invariants in 8518 ms returned []
Implicit Place search using SMT only with invariants took 8520 ms to find 0 implicit places.
Running 17102 sub problems to find dead transitions.
[2024-05-31 19:36:54] [INFO ] Invariant cache hit.
[2024-05-31 19:36:54] [INFO ] State equation strengthened by 16110 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/9182 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 17102 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 9182/26375 variables, and 91 constraints, problems are : Problem set: 0 solved, 17102 unsolved in 30257 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 0/9183 constraints, ReadFeed: 0/16110 constraints, PredecessorRefiner: 17102/17102 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17102 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9182 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 17102 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 9182/26375 variables, and 91 constraints, problems are : Problem set: 0 solved, 17102 unsolved in 30255 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 0/9183 constraints, ReadFeed: 0/16110 constraints, PredecessorRefiner: 0/17102 constraints, Known Traps: 0/0 constraints]
After SMT, in 97171ms problems are : Problem set: 0 solved, 17102 unsolved
Search for dead transitions found 0 dead transitions in 97318ms
Starting structural reductions in LTL mode, iteration 1 : 9183/9197 places, 17192/17220 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 112499 ms. Remains : 9183/9197 places, 17192/17220 transitions.
Stuttering acceptance computed with spot in 257 ms :[(AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), true, (NOT p0)]
Running random walk in product with property : CANConstruction-PT-090-LTLFireability-06
Product exploration explored 100000 steps with 19996 reset in 2082 ms.
Product exploration explored 100000 steps with 19994 reset in 2011 ms.
Computed a total of 271 stabilizing places and 360 stable transitions
Computed a total of 271 stabilizing places and 360 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 82 ms. Reduced automaton from 6 states, 8 edges and 3 AP (stutter sensitive) to 6 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 211 ms :[(AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), true, (NOT p0)]
RANDOM walk for 40000 steps (24 resets) in 759 ms. (52 steps per ms) remains 2/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 177 ms. (224 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 104 ms. (380 steps per ms) remains 2/2 properties
[2024-05-31 19:38:36] [INFO ] Invariant cache hit.
[2024-05-31 19:38:36] [INFO ] State equation strengthened by 16110 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 9092/9097 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 19:39:00] [INFO ] Deduced a trap composed of 5 places in 22937 ms of which 52 ms to minimize.
SMT process timed out in 24274ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 9183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 9183/9183 places, 17192/17192 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 628 transitions
Trivial Post-agglo rules discarded 628 transitions
Performed 628 trivial Post agglomeration. Transition count delta: 628
Iterating post reduction 0 with 628 rules applied. Total rules applied 628 place count 9183 transition count 16564
Reduce places removed 628 places and 0 transitions.
Iterating post reduction 1 with 628 rules applied. Total rules applied 1256 place count 8555 transition count 16564
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 90 Pre rules applied. Total rules applied 1256 place count 8555 transition count 16474
Deduced a syphon composed of 90 places in 5 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 1436 place count 8465 transition count 16474
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 89
Deduced a syphon composed of 89 places in 4 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 2 with 178 rules applied. Total rules applied 1614 place count 8376 transition count 16385
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1616 place count 8376 transition count 16383
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1618 place count 8374 transition count 16383
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 1619 place count 8374 transition count 16383
Applied a total of 1619 rules in 11986 ms. Remains 8374 /9183 variables (removed 809) and now considering 16383/17192 (removed 809) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11986 ms. Remains : 8374/9183 places, 16383/17192 transitions.
RANDOM walk for 40000 steps (60 resets) in 1576 ms. (25 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 141 ms. (281 steps per ms) remains 1/1 properties
// Phase 1: matrix 16383 rows 8374 cols
[2024-05-31 19:39:13] [INFO ] Computed 91 invariants in 460 ms
[2024-05-31 19:39:13] [INFO ] State equation strengthened by 16110 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8283/8286 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 19:39:35] [INFO ] Deduced a trap composed of 2 places in 20490 ms of which 57 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/8286 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8286 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 87/8373 variables, 87/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 19:40:00] [INFO ] Deduced a trap composed of 93 places in 24132 ms of which 56 ms to minimize.
SMT process timed out in 46961ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 8374 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8374/8374 places, 16383/16383 transitions.
Applied a total of 0 rules in 2976 ms. Remains 8374 /8374 variables (removed 0) and now considering 16383/16383 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2976 ms. Remains : 8374/8374 places, 16383/16383 transitions.
RANDOM walk for 40000 steps (61 resets) in 1116 ms. (35 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 148 ms. (268 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 43049 steps, run timeout after 3001 ms. (steps per millisecond=14 ) properties seen :0 out of 1
Probabilistic random walk after 43049 steps, saw 33150 distinct states, run finished after 3005 ms. (steps per millisecond=14 ) properties seen :0
[2024-05-31 19:40:06] [INFO ] Invariant cache hit.
[2024-05-31 19:40:06] [INFO ] State equation strengthened by 16110 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8283/8286 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 19:40:27] [INFO ] Deduced a trap composed of 2 places in 19439 ms of which 52 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/8286 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8286 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 87/8373 variables, 87/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 19:40:50] [INFO ] Deduced a trap composed of 93 places in 23000 ms of which 57 ms to minimize.
[2024-05-31 19:41:16] [INFO ] Deduced a trap composed of 93 places in 25647 ms of which 59 ms to minimize.
[2024-05-31 19:41:40] [INFO ] Deduced a trap composed of 93 places in 23684 ms of which 50 ms to minimize.
SMT process timed out in 93907ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 8374 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8374/8374 places, 16383/16383 transitions.
Applied a total of 0 rules in 2960 ms. Remains 8374 /8374 variables (removed 0) and now considering 16383/16383 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2960 ms. Remains : 8374/8374 places, 16383/16383 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8374/8374 places, 16383/16383 transitions.
Applied a total of 0 rules in 3014 ms. Remains 8374 /8374 variables (removed 0) and now considering 16383/16383 (removed 0) transitions.
[2024-05-31 19:41:46] [INFO ] Invariant cache hit.
[2024-05-31 19:41:54] [INFO ] Implicit Places using invariants in 8069 ms returned []
Implicit Place search using SMT only with invariants took 8073 ms to find 0 implicit places.
Running 16293 sub problems to find dead transitions.
[2024-05-31 19:41:54] [INFO ] Invariant cache hit.
[2024-05-31 19:41:54] [INFO ] State equation strengthened by 16110 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s2 0.0)
(s3 1.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 1.0)
(s36 0.0)
(s37 0.0)
(s38 1.0)
(s39 0.0)
(s40 0.0)
(s41 1.0)
(s42 0.0)
(s43 0.0)
(s44 1.0)
(s45 0.0)
(s46 0.0)
(s47 1.0)
(s48 0.0)
(s49 0.0)
(s50 1.0)
(s51 0.0)
(s52 0.0)
(s53 1.0)
(s54 0.0)
(s55 0.0)
(s56 1.0)
(s57 0.0)
(s58 0.0)
(s59 1.0)
(s60 0.0)
(s61 0.0)
(s62 1.0)
(s63 0.0)
(s64 0.0)
(s65 1.0)
(s66 0.0)
(s67 0.0)
(s68 1.0)
(s69 0.0)
(s70 0.0)
(s71 1.0)
(s72 0.0)
(s73 0.0)
(s74 1.0)
(s75 0.0)
(s76 0.0)
(s77 1.0)
(s78 0.0)
(s79 0.0)
(s80 1.0)
(s81 0.0)
(s82 0.0)
(s83 1.0)
(s84 0.0)
(s85 0.0)
(s86 1.0)
(s87 0.0)
(s88 0.0)
(s89 1.0)
(s90 0.0)
(s91 0.0)
(s92 1.0)
(s93 0.0)
(s94 0.0)
(s95 1.0)
(s96 0.0)
(s97 0.0)
(s98 1.0)
(s99 0.0)
(s100 0.0)
(s101 1.0)
(s102 0.0)
(s103 0.0)
(s104 1.0)
(s105 0.0)
(s106 0.0)
(s107 1.0)
(s108 0.0)
(s109 0.0)
(s110 1.0)
(s111 0.0)
(s112 0.0)
(s113 1.0)
(s114 0.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/8373 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 16293 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 8373/24757 variables, and 91 constraints, problems are : Problem set: 0 solved, 16293 unsolved in 30214 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 0/8374 constraints, ReadFeed: 0/16110 constraints, PredecessorRefiner: 16293/16293 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16293 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8373 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 16293 unsolved
[2024-05-31 19:43:29] [INFO ] Deduced a trap composed of 93 places in 10502 ms of which 52 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 8373/24757 variables, and 92 constraints, problems are : Problem set: 0 solved, 16293 unsolved in 30221 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 0/8374 constraints, ReadFeed: 0/16110 constraints, PredecessorRefiner: 0/16293 constraints, Known Traps: 1/1 constraints]
After SMT, in 96950ms problems are : Problem set: 0 solved, 16293 unsolved
Search for dead transitions found 0 dead transitions in 97112ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 108242 ms. Remains : 8374/8374 places, 16383/16383 transitions.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT (OR p1 p2))), (F p2)]
Knowledge based reduction with 3 factoid took 221 ms. Reduced automaton from 6 states, 8 edges and 3 AP (stutter sensitive) to 6 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 235 ms :[(AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), true, (NOT p0)]
Stuttering acceptance computed with spot in 236 ms :[(AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), true, (NOT p0)]
Support contains 5 out of 9183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9183/9183 places, 17192/17192 transitions.
FORMULA CANConstruction-PT-090-LTLFireability-00 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA CANConstruction-PT-090-LTLFireability-01 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA CANConstruction-PT-090-LTLFireability-02 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA CANConstruction-PT-090-LTLFireability-03 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA CANConstruction-PT-090-LTLFireability-04 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA CANConstruction-PT-090-LTLFireability-05 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : CANConstruction-PT-090-LTLFireability-06
FORMULA CANConstruction-PT-090-LTLFireability-07 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA CANConstruction-PT-090-LTLFireability-08 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA CANConstruction-PT-090-LTLFireability-09 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA CANConstruction-PT-090-LTLFireability-10 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : CANConstruction-PT-090-LTLFireability-11
Could not compute solution for formula : CANConstruction-PT-090-LTLFireability-12
FORMULA CANConstruction-PT-090-LTLFireability-13 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : CANConstruction-PT-090-LTLFireability-14
Could not compute solution for formula : CANConstruction-PT-090-LTLFireability-15

BK_STOP 1717186418463

--------------------
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 CANConstruction-PT-090-LTLFireability-00
ltl formula formula --ltl=/tmp/878/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 17282 places, 33120 transitions and 99000 arcs
pnml2lts-mc( 0/ 4): Petri net gen analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 3.730 real 1.360 user 1.280 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/878/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/878/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/878/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/878/ltl_0_
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 17284 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 17283, there are 33135 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): Accepting cycle FOUND at depth ~107!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 434
pnml2lts-mc( 0/ 4): unique transitions count: 37613
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 437
pnml2lts-mc( 0/ 4): - cum. max stack depth: 437
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 437 states 37887 transitions, fanout: 86.698
pnml2lts-mc( 0/ 4): Total exploration time 9.400 sec (9.320 sec minimum, 9.350 sec on average)
pnml2lts-mc( 0/ 4): States per second: 46, Transitions per second: 4031
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 1.5MB, 41.8 B/state, compr.: 0.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/1.0%
pnml2lts-mc( 0/ 4): Stored 34151 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 2MB
pnml2lts-mc( 0/ 4): Est. total memory use: 3.5MB (~258.0MB paged-in)
ltl formula name CANConstruction-PT-090-LTLFireability-01
ltl formula formula --ltl=/tmp/878/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
Warning: program compiled against libxml 210 using older 209
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 17282 places, 33120 transitions and 99000 arcs
pnml2lts-mc( 0/ 4): Petri net gen analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 3.650 real 1.210 user 1.450 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/878/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/878/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/878/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/878/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 17283 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 17283, there are 33132 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 ~125!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 494
pnml2lts-mc( 0/ 4): unique transitions count: 85882
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 497
pnml2lts-mc( 0/ 4): - cum. max stack depth: 497
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 497 states 86426 transitions, fanout: 173.895
pnml2lts-mc( 0/ 4): Total exploration time 10.700 sec (10.620 sec minimum, 10.650 sec on average)
pnml2lts-mc( 0/ 4): States per second: 46, Transitions per second: 8077
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 1.7MB, 41.9 B/state, compr.: 0.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/2.0%
pnml2lts-mc( 0/ 4): Stored 34151 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 2MB
pnml2lts-mc( 0/ 4): Est. total memory use: 3.7MB (~258.0MB paged-in)
ltl formula name CANConstruction-PT-090-LTLFireability-02
ltl formula formula --ltl=/tmp/878/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 17282 places, 33120 transitions and 99000 arcs
pnml2lts-mc( 0/ 4): Petri net gen analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 3.690 real 1.230 user 1.480 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/878/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/878/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/878/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/878/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): There are 17283 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 17283, there are 33128 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): Accepting cycle FOUND at depth ~107!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 429
pnml2lts-mc( 0/ 4): unique transitions count: 37179
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 432
pnml2lts-mc( 0/ 4): - cum. max stack depth: 432
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 432 states 37453 transitions, fanout: 86.697
pnml2lts-mc( 0/ 4): Total exploration time 9.220 sec (9.130 sec minimum, 9.183 sec on average)
pnml2lts-mc( 0/ 4): States per second: 47, Transitions per second: 4062
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 1.5MB, 41.6 B/state, compr.: 0.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/1.0%
pnml2lts-mc( 0/ 4): Stored 34151 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 2MB
pnml2lts-mc( 0/ 4): Est. total memory use: 3.5MB (~258.0MB paged-in)
ltl formula name CANConstruction-PT-090-LTLFireability-03
ltl formula formula --ltl=/tmp/878/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 17282 places, 33120 transitions and 99000 arcs
pnml2lts-mc( 0/ 4): Petri net gen analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 3.600 real 1.280 user 1.310 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/878/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/878/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/878/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/878/ltl_3_
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 17284 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 17283, there are 33123 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 ~125!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 506
pnml2lts-mc( 0/ 4): unique transitions count: 44269
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 513
pnml2lts-mc( 0/ 4): - cum. max stack depth: 513
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 513 states 44635 transitions, fanout: 87.008
pnml2lts-mc( 0/ 4): Total exploration time 11.150 sec (11.100 sec minimum, 11.115 sec on average)
pnml2lts-mc( 0/ 4): States per second: 46, Transitions per second: 4003
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 1.7MB, 41.3 B/state, compr.: 0.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/2.0%
pnml2lts-mc( 0/ 4): Stored 34151 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 2MB
pnml2lts-mc( 0/ 4): Est. total memory use: 3.7MB (~258.0MB paged-in)
ltl formula name CANConstruction-PT-090-LTLFireability-04
ltl formula formula --ltl=/tmp/878/ltl_4_
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 17282 places, 33120 transitions and 99000 arcs
pnml2lts-mc( 0/ 4): Petri net gen analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 3.640 real 1.300 user 1.320 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/878/ltl_4_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/878/ltl_4_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/878/ltl_4_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/878/ltl_4_
pnml2lts-mc( 0/ 4): buchi has 7 states
pnml2lts-mc( 0/ 4): There are 17283 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 17283, there are 33144 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 ~114!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 386
pnml2lts-mc( 0/ 4): unique transitions count: 33300
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 389
pnml2lts-mc( 0/ 4): - cum. max stack depth: 389
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 389 states 33574 transitions, fanout: 86.308
pnml2lts-mc( 0/ 4): Total exploration time 9.740 sec (9.610 sec minimum, 9.680 sec on average)
pnml2lts-mc( 0/ 4): States per second: 40, Transitions per second: 3447
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 1.3MB, 41.3 B/state, compr.: 0.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/1.0%
pnml2lts-mc( 0/ 4): Stored 34151 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 2MB
pnml2lts-mc( 0/ 4): Est. total memory use: 3.3MB (~258.0MB paged-in)
ltl formula name CANConstruction-PT-090-LTLFireability-05
ltl formula formula --ltl=/tmp/878/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 17282 places, 33120 transitions and 99000 arcs
pnml2lts-mc( 0/ 4): Petri net gen analyzed
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/878/ltl_5_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/878/ltl_5_
pnml2lts-mc( 0/ 4): Loading Petri net took 6.120 real 1.390 user 1.740 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/878/ltl_5_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/878/ltl_5_
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 17284 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 17283, there are 33122 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 ~120!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 486
pnml2lts-mc( 0/ 4): unique transitions count: 42318
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 489
pnml2lts-mc( 0/ 4): - cum. max stack depth: 489
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 489 states 42592 transitions, fanout: 87.100
pnml2lts-mc( 0/ 4): Total exploration time 10.540 sec (10.460 sec minimum, 10.488 sec on average)
pnml2lts-mc( 0/ 4): States per second: 46, Transitions per second: 4041
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 1.7MB, 41.3 B/state, compr.: 0.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/2.0%
pnml2lts-mc( 0/ 4): Stored 34151 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 2MB
pnml2lts-mc( 0/ 4): Est. total memory use: 3.7MB (~258.0MB paged-in)
ltl formula name CANConstruction-PT-090-LTLFireability-06
ltl formula formula --ltl=/tmp/878/ltl_6_
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 17282 places, 33120 transitions and 99000 arcs
pnml2lts-mc( 0/ 4): Petri net gen analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 3.640 real 1.220 user 1.330 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/878/ltl_6_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/878/ltl_6_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/878/ltl_6_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/878/ltl_6_
pnml2lts-mc( 0/ 4): buchi has 10 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 17284 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 17283, there are 33148 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
ltl formula name CANConstruction-PT-090-LTLFireability-07
ltl formula formula --ltl=/tmp/878/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 17282 places, 33120 transitions and 99000 arcs
pnml2lts-mc( 0/ 4): Petri net gen analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 3.760 real 1.320 user 1.350 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/878/ltl_7_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/878/ltl_7_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/878/ltl_7_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/878/ltl_7_
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 17284 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 17283, there are 33132 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.150 sec (0.090 sec minimum, 0.117 sec on average)
pnml2lts-mc( 0/ 4): States per second: 27, Transitions per second: 27
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, 512.0 B/state, compr.: 0.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 34151 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 2MB
pnml2lts-mc( 0/ 4): Est. total memory use: 2.0MB (~258.0MB paged-in)
ltl formula name CANConstruction-PT-090-LTLFireability-08
ltl formula formula --ltl=/tmp/878/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 17282 places, 33120 transitions and 99000 arcs
pnml2lts-mc( 0/ 4): Petri net gen analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 4.470 real 1.170 user 1.360 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/878/ltl_8_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/878/ltl_8_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/878/ltl_8_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/878/ltl_8_
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 17284 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 17283, there are 33125 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: 361
pnml2lts-mc( 0/ 4): unique states count: 361
pnml2lts-mc( 0/ 4): unique transitions count: 360
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 168
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 394
pnml2lts-mc( 0/ 4): - cum. max stack depth: 20
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 394 states 658 transitions, fanout: 1.670
pnml2lts-mc( 0/ 4): Total exploration time 8.320 sec (8.230 sec minimum, 8.265 sec on average)
pnml2lts-mc( 0/ 4): States per second: 47, Transitions per second: 79
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, 71.5 B/state, compr.: 0.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 34151 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 2MB
pnml2lts-mc( 0/ 4): Est. total memory use: 2.0MB (~258.0MB paged-in)
ltl formula name CANConstruction-PT-090-LTLFireability-09
ltl formula formula --ltl=/tmp/878/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 17282 places, 33120 transitions and 99000 arcs
pnml2lts-mc( 0/ 4): Petri net gen analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 3.710 real 1.320 user 1.300 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/878/ltl_9_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/878/ltl_9_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/878/ltl_9_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/878/ltl_9_
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 17284 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 17283, there are 33127 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: 91
pnml2lts-mc( 0/ 4): unique states count: 91
pnml2lts-mc( 0/ 4): unique transitions count: 90
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 230
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 108
pnml2lts-mc( 0/ 4): - cum. max stack depth: 8
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 108 states 364 transitions, fanout: 3.370
pnml2lts-mc( 0/ 4): Total exploration time 2.930 sec (2.840 sec minimum, 2.885 sec on average)
pnml2lts-mc( 0/ 4): States per second: 37, Transitions per second: 124
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, 75.7 B/state, compr.: 0.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 34151 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 2MB
pnml2lts-mc( 0/ 4): Est. total memory use: 2.0MB (~258.0MB paged-in)
ltl formula name CANConstruction-PT-090-LTLFireability-10
ltl formula formula --ltl=/tmp/878/ltl_10_
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 17282 places, 33120 transitions and 99000 arcs
pnml2lts-mc( 0/ 4): Petri net gen analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 3.700 real 1.340 user 1.430 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/878/ltl_10_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/878/ltl_10_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/878/ltl_10_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/878/ltl_10_
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 17284 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 17283, there are 33122 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.090 sec (0.090 sec minimum, 0.090 sec on average)
pnml2lts-mc( 0/ 4): States per second: 44, Transitions per second: 44
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, 512.0 B/state, compr.: 0.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 34151 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 2MB
pnml2lts-mc( 0/ 4): Est. total memory use: 2.0MB (~258.0MB paged-in)
ltl formula name CANConstruction-PT-090-LTLFireability-11
ltl formula formula --ltl=/tmp/878/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 17282 places, 33120 transitions and 99000 arcs
pnml2lts-mc( 0/ 4): Petri net gen analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 3.700 real 1.220 user 1.360 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/878/ltl_11_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/878/ltl_11_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/878/ltl_11_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/878/ltl_11_
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 17284 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 17283, there are 33133 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
ltl formula name CANConstruction-PT-090-LTLFireability-12
ltl formula formula --ltl=/tmp/878/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 17282 places, 33120 transitions and 99000 arcs
pnml2lts-mc( 0/ 4): Petri net gen analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 3.700 real 1.310 user 1.320 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/878/ltl_12_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/878/ltl_12_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/878/ltl_12_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/878/ltl_12_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): There are 17283 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 17283, there are 33129 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
ltl formula name CANConstruction-PT-090-LTLFireability-13
ltl formula formula --ltl=/tmp/878/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 17282 places, 33120 transitions and 99000 arcs
pnml2lts-mc( 0/ 4): Petri net gen analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 3.800 real 1.340 user 1.340 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/878/ltl_13_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/878/ltl_13_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/878/ltl_13_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/878/ltl_13_
pnml2lts-mc( 0/ 4): buchi has 7 states
pnml2lts-mc( 0/ 4): There are 17283 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 17283, there are 33142 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 ~106!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 428
pnml2lts-mc( 0/ 4): unique transitions count: 37130
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 431
pnml2lts-mc( 0/ 4): - cum. max stack depth: 431
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 431 states 37674 transitions, fanout: 87.411
pnml2lts-mc( 0/ 4): Total exploration time 9.380 sec (9.340 sec minimum, 9.350 sec on average)
pnml2lts-mc( 0/ 4): States per second: 46, Transitions per second: 4016
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 1.5MB, 41.8 B/state, compr.: 0.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/1.0%
pnml2lts-mc( 0/ 4): Stored 34151 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 2MB
pnml2lts-mc( 0/ 4): Est. total memory use: 3.5MB (~258.0MB paged-in)
ltl formula name CANConstruction-PT-090-LTLFireability-14
ltl formula formula --ltl=/tmp/878/ltl_14_
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 17282 places, 33120 transitions and 99000 arcs
pnml2lts-mc( 0/ 4): Petri net gen analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 3.670 real 1.240 user 1.400 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/878/ltl_14_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/878/ltl_14_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/878/ltl_14_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/878/ltl_14_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 17283 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 17283, there are 33124 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
ltl formula name CANConstruction-PT-090-LTLFireability-15
ltl formula formula --ltl=/tmp/878/ltl_15_
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 17282 places, 33120 transitions and 99000 arcs
pnml2lts-mc( 0/ 4): Petri net gen analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 3.730 real 1.300 user 1.370 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/878/ltl_15_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/878/ltl_15_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/878/ltl_15_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/878/ltl_15_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 17283 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 17283, there are 33124 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

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="CANConstruction-PT-090"
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 CANConstruction-PT-090, 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 r476-tall-171620505100076"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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