Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r334-tall-171679080200379.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 itstools
Input is SafeBus-COL-15, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r334-tall-171679080200379
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 548K
-rw-r--r-- 1 mcc users 8.0K Apr 12 15:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Apr 12 15:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Apr 12 15:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Apr 12 15:29 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 16:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K Apr 12 16:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Apr 12 16:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Apr 12 16:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 42K May 18 16:43 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 SafeBus-COL-15-LTLCardinality-00
FORMULA_NAME SafeBus-COL-15-LTLCardinality-01
FORMULA_NAME SafeBus-COL-15-LTLCardinality-02
FORMULA_NAME SafeBus-COL-15-LTLCardinality-03
FORMULA_NAME SafeBus-COL-15-LTLCardinality-04
FORMULA_NAME SafeBus-COL-15-LTLCardinality-05
FORMULA_NAME SafeBus-COL-15-LTLCardinality-06
FORMULA_NAME SafeBus-COL-15-LTLCardinality-07
FORMULA_NAME SafeBus-COL-15-LTLCardinality-08
FORMULA_NAME SafeBus-COL-15-LTLCardinality-09
FORMULA_NAME SafeBus-COL-15-LTLCardinality-10
FORMULA_NAME SafeBus-COL-15-LTLCardinality-11
FORMULA_NAME SafeBus-COL-15-LTLCardinality-12
FORMULA_NAME SafeBus-COL-15-LTLCardinality-13
FORMULA_NAME SafeBus-COL-15-LTLCardinality-14
FORMULA_NAME SafeBus-COL-15-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716824006158

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SafeBus-COL-15
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202405141337
[2024-05-27 15:33:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-27 15:33:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 15:33:27] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-27 15:33:27] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-27 15:33:27] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 537 ms
[2024-05-27 15:33:27] [INFO ] Detected 1 constant HL places corresponding to 15 PT places.
[2024-05-27 15:33:27] [INFO ] Imported 20 HL places and 14 HL transitions for a total of 636 PT places and 59206.0 transition bindings in 23 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2024-05-27 15:33:28] [INFO ] Built PT skeleton of HLPN with 20 places and 14 transitions 68 arcs in 4 ms.
[2024-05-27 15:33:28] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 1 formulas.
FORMULA SafeBus-COL-15-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 3 stabilizing places and 0 stable transitions
Remains 15 properties that can be checked using skeleton over-approximation.
Reduce places removed 3 places and 0 transitions.
FORMULA SafeBus-COL-15-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-COL-15-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 40001 steps (8 resets) in 1826 ms. (21 steps per ms) remains 10/24 properties
BEST_FIRST walk for 40003 steps (8 resets) in 166 ms. (239 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 123 ms. (322 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (8 resets) in 186 ms. (213 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (8 resets) in 203 ms. (196 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 122 ms. (325 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 118 ms. (336 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (8 resets) in 120 ms. (330 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (8 resets) in 162 ms. (245 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 54 ms. (727 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 50 ms. (784 steps per ms) remains 10/10 properties
// Phase 1: matrix 14 rows 17 cols
[2024-05-27 15:33:29] [INFO ] Computed 7 invariants in 7 ms
[2024-05-27 15:33:29] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem AtomicPropp21 is UNSAT
At refinement iteration 1 (OVERLAPS) 8/14 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 9 unsolved
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp20 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 2/5 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 0/5 constraints. Problems are: Problem set: 3 solved, 7 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp11 is UNSAT
After SMT solving in domain Real declared 15/31 variables, and 6 constraints, problems are : Problem set: 10 solved, 0 unsolved in 209 ms.
Refiners :[Positive P Invariants (semi-flows): 3/4 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/17 constraints, ReadFeed: 0/3 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 247ms problems are : Problem set: 10 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 10 atomic propositions for a total of 13 simplifications.
FORMULA SafeBus-COL-15-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-COL-15-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-COL-15-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-COL-15-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-COL-15-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-27 15:33:29] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2024-05-27 15:33:29] [INFO ] Flatten gal took : 15 ms
FORMULA SafeBus-COL-15-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-COL-15-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-27 15:33:29] [INFO ] Flatten gal took : 4 ms
Domain [It(15), It(15)] of place AMC breaks symmetries in sort It
[2024-05-27 15:33:29] [INFO ] Unfolded HLPN to a Petri net with 636 places and 4801 transitions 34264 arcs in 89 ms.
[2024-05-27 15:33:29] [INFO ] Unfolded 6 HLPN properties in 1 ms.
Deduced a syphon composed of 15 places in 13 ms
Reduce places removed 30 places and 30 transitions.
Support contains 319 out of 606 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 606/606 places, 4771/4771 transitions.
Applied a total of 0 rules in 56 ms. Remains 606 /606 variables (removed 0) and now considering 4771/4771 (removed 0) transitions.
[2024-05-27 15:33:29] [INFO ] Flow matrix only has 1412 transitions (discarded 3359 similar events)
// Phase 1: matrix 1412 rows 606 cols
[2024-05-27 15:33:29] [INFO ] Computed 65 invariants in 79 ms
[2024-05-27 15:33:30] [INFO ] Implicit Places using invariants in 777 ms returned [496, 497, 498, 499, 500, 501, 502, 503, 504, 505, 506, 507, 508, 509, 510]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 791 ms to find 15 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 591/606 places, 4771/4771 transitions.
Applied a total of 0 rules in 23 ms. Remains 591 /591 variables (removed 0) and now considering 4771/4771 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 880 ms. Remains : 591/606 places, 4771/4771 transitions.
Support contains 319 out of 591 places after structural reductions.
[2024-05-27 15:33:31] [INFO ] Flatten gal took : 398 ms
[2024-05-27 15:33:31] [INFO ] Flatten gal took : 284 ms
[2024-05-27 15:33:31] [INFO ] Input system was already deterministic with 4771 transitions.
RANDOM walk for 40000 steps (8 resets) in 2355 ms. (16 steps per ms) remains 3/11 properties
BEST_FIRST walk for 40001 steps (8 resets) in 300 ms. (132 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 249 ms. (160 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 258 ms. (154 steps per ms) remains 3/3 properties
[2024-05-27 15:33:32] [INFO ] Flow matrix only has 1412 transitions (discarded 3359 similar events)
// Phase 1: matrix 1412 rows 591 cols
[2024-05-27 15:33:33] [INFO ] Computed 50 invariants in 40 ms
[2024-05-27 15:33:33] [INFO ] State equation strengthened by 241 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp8 is UNSAT
At refinement iteration 1 (OVERLAPS) 317/348 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/348 variables, 14/17 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/348 variables, 0/17 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 196/544 variables, 14/31 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/544 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp3 is UNSAT
After SMT solving in domain Real declared 588/2003 variables, and 48 constraints, problems are : Problem set: 3 solved, 0 unsolved in 255 ms.
Refiners :[Positive P Invariants (semi-flows): 17/19 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 0/591 constraints, ReadFeed: 0/241 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 423ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 3 atomic propositions for a total of 6 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 591 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 591/591 places, 4771/4771 transitions.
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 15 Pre rules applied. Total rules applied 0 place count 591 transition count 4756
Deduced a syphon composed of 15 places in 3 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 0 with 30 rules applied. Total rules applied 30 place count 576 transition count 4756
Applied a total of 30 rules in 1251 ms. Remains 576 /591 variables (removed 15) and now considering 4756/4771 (removed 15) transitions.
[2024-05-27 15:33:34] [INFO ] Flow matrix only has 1397 transitions (discarded 3359 similar events)
// Phase 1: matrix 1397 rows 576 cols
[2024-05-27 15:33:34] [INFO ] Computed 50 invariants in 18 ms
[2024-05-27 15:33:35] [INFO ] Implicit Places using invariants in 1154 ms returned []
[2024-05-27 15:33:35] [INFO ] Flow matrix only has 1397 transitions (discarded 3359 similar events)
[2024-05-27 15:33:35] [INFO ] Invariant cache hit.
[2024-05-27 15:33:36] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-05-27 15:33:42] [INFO ] Implicit Places using invariants and state equation in 6316 ms returned []
Implicit Place search using SMT with State Equation took 7473 ms to find 0 implicit places.
[2024-05-27 15:33:42] [INFO ] Redundant transitions in 363 ms returned []
Running 4741 sub problems to find dead transitions.
[2024-05-27 15:33:42] [INFO ] Flow matrix only has 1397 transitions (discarded 3359 similar events)
[2024-05-27 15:33:42] [INFO ] Invariant cache hit.
[2024-05-27 15:33:42] [INFO ] State equation strengthened by 241 read => feed constraints.
Problem TDEAD211 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD661 is UNSAT
Problem TDEAD886 is UNSAT
Problem TDEAD1111 is UNSAT
Problem TDEAD1336 is UNSAT
Problem TDEAD1561 is UNSAT
Problem TDEAD1786 is UNSAT
Problem TDEAD2011 is UNSAT
Problem TDEAD2236 is UNSAT
Problem TDEAD2461 is UNSAT
Problem TDEAD2686 is UNSAT
Problem TDEAD2911 is UNSAT
Problem TDEAD3136 is UNSAT
Problem TDEAD3361 is UNSAT
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/576 variables, 20/20 constraints. Problems are: Problem set: 15 solved, 4726 unsolved
SMT process timed out in 57992ms, After SMT, problems are : Problem set: 15 solved, 4726 unsolved
Search for dead transitions found 15 dead transitions in 58059ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 576/591 places, 4741/4771 transitions.
Applied a total of 0 rules in 1166 ms. Remains 576 /576 variables (removed 0) and now considering 4741/4741 (removed 0) transitions.
[2024-05-27 15:34:42] [INFO ] Redundant transitions in 366 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 68731 ms. Remains : 576/591 places, 4741/4771 transitions.
Stuttering acceptance computed with spot in 363 ms :[(NOT p0)]
Running random walk in product with property : SafeBus-COL-15-LTLCardinality-00
Product exploration explored 100000 steps with 0 reset in 1583 ms.
Stack based approach found an accepted trace after 1314 steps with 0 reset with depth 1315 and stack size 1315 in 16 ms.
FORMULA SafeBus-COL-15-LTLCardinality-00 FALSE TECHNIQUES STACK_TEST
Treatment of property SafeBus-COL-15-LTLCardinality-00 finished in 70758 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 1 out of 591 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 591/591 places, 4771/4771 transitions.
Applied a total of 0 rules in 84 ms. Remains 591 /591 variables (removed 0) and now considering 4771/4771 (removed 0) transitions.
[2024-05-27 15:34:44] [INFO ] Flow matrix only has 1412 transitions (discarded 3359 similar events)
// Phase 1: matrix 1412 rows 591 cols
[2024-05-27 15:34:44] [INFO ] Computed 50 invariants in 11 ms
[2024-05-27 15:34:45] [INFO ] Implicit Places using invariants in 1181 ms returned []
[2024-05-27 15:34:45] [INFO ] Flow matrix only has 1412 transitions (discarded 3359 similar events)
[2024-05-27 15:34:45] [INFO ] Invariant cache hit.
[2024-05-27 15:34:46] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-05-27 15:34:51] [INFO ] Implicit Places using invariants and state equation in 6115 ms returned []
Implicit Place search using SMT with State Equation took 7336 ms to find 0 implicit places.
Running 4756 sub problems to find dead transitions.
[2024-05-27 15:34:51] [INFO ] Flow matrix only has 1412 transitions (discarded 3359 similar events)
[2024-05-27 15:34:51] [INFO ] Invariant cache hit.
[2024-05-27 15:34:51] [INFO ] State equation strengthened by 241 read => feed constraints.
Problem TDEAD211 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD661 is UNSAT
Problem TDEAD886 is UNSAT
Problem TDEAD1111 is UNSAT
Problem TDEAD1336 is UNSAT
Problem TDEAD1561 is UNSAT
Problem TDEAD1786 is UNSAT
Problem TDEAD2011 is UNSAT
Problem TDEAD2236 is UNSAT
Problem TDEAD2461 is UNSAT
Problem TDEAD2686 is UNSAT
Problem TDEAD2911 is UNSAT
Problem TDEAD3136 is UNSAT
Problem TDEAD3361 is UNSAT
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/591 variables, 19/19 constraints. Problems are: Problem set: 15 solved, 4741 unsolved
SMT process timed out in 59065ms, After SMT, problems are : Problem set: 15 solved, 4741 unsolved
Search for dead transitions found 15 dead transitions in 59109ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in LTL mode, iteration 1 : 591/591 places, 4756/4771 transitions.
Applied a total of 0 rules in 58 ms. Remains 591 /591 variables (removed 0) and now considering 4756/4756 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 66602 ms. Remains : 591/591 places, 4756/4771 transitions.
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SafeBus-COL-15-LTLCardinality-04
Product exploration explored 100000 steps with 5537 reset in 670 ms.
Product exploration explored 100000 steps with 5539 reset in 648 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 68 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 72 steps (0 resets) in 6 ms. (10 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 1 factoid took 111 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 139 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 162 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2024-05-27 15:35:53] [INFO ] Flow matrix only has 1412 transitions (discarded 3344 similar events)
[2024-05-27 15:35:53] [INFO ] Invariant cache hit.
[2024-05-27 15:35:55] [INFO ] [Real]Absence check using 19 positive place invariants in 16 ms returned sat
[2024-05-27 15:35:56] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 370 ms returned sat
[2024-05-27 15:35:57] [INFO ] [Real]Absence check using state equation in 1034 ms returned sat
[2024-05-27 15:35:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 15:35:59] [INFO ] [Nat]Absence check using 19 positive place invariants in 46 ms returned sat
[2024-05-27 15:35:59] [INFO ] [Nat]Absence check using 19 positive and 31 generalized place invariants in 114 ms returned sat
[2024-05-27 15:36:00] [INFO ] [Nat]Absence check using state equation in 1099 ms returned sat
[2024-05-27 15:36:00] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-05-27 15:36:01] [INFO ] [Nat]Added 241 Read/Feed constraints in 595 ms returned sat
[2024-05-27 15:36:01] [INFO ] Deduced a trap composed of 56 places in 492 ms of which 18 ms to minimize.
[2024-05-27 15:36:02] [INFO ] Deduced a trap composed of 47 places in 671 ms of which 3 ms to minimize.
[2024-05-27 15:36:02] [INFO ] Deduced a trap composed of 47 places in 164 ms of which 2 ms to minimize.
[2024-05-27 15:36:03] [INFO ] Deduced a trap composed of 47 places in 166 ms of which 4 ms to minimize.
[2024-05-27 15:36:03] [INFO ] Deduced a trap composed of 47 places in 165 ms of which 3 ms to minimize.
[2024-05-27 15:36:03] [INFO ] Deduced a trap composed of 47 places in 149 ms of which 2 ms to minimize.
[2024-05-27 15:36:04] [INFO ] Deduced a trap composed of 55 places in 174 ms of which 3 ms to minimize.
[2024-05-27 15:36:04] [INFO ] Deduced a trap composed of 47 places in 163 ms of which 3 ms to minimize.
[2024-05-27 15:36:04] [INFO ] Deduced a trap composed of 47 places in 150 ms of which 2 ms to minimize.
[2024-05-27 15:36:04] [INFO ] Deduced a trap composed of 89 places in 171 ms of which 2 ms to minimize.
[2024-05-27 15:36:05] [INFO ] Deduced a trap composed of 67 places in 164 ms of which 3 ms to minimize.
[2024-05-27 15:36:05] [INFO ] Deduced a trap composed of 71 places in 161 ms of which 2 ms to minimize.
[2024-05-27 15:36:05] [INFO ] Deduced a trap composed of 77 places in 161 ms of which 2 ms to minimize.
[2024-05-27 15:36:05] [INFO ] Deduced a trap composed of 64 places in 158 ms of which 2 ms to minimize.
[2024-05-27 15:36:05] [INFO ] Deduced a trap composed of 81 places in 152 ms of which 2 ms to minimize.
[2024-05-27 15:36:06] [INFO ] Deduced a trap composed of 76 places in 153 ms of which 2 ms to minimize.
[2024-05-27 15:36:06] [INFO ] Deduced a trap composed of 77 places in 157 ms of which 2 ms to minimize.
[2024-05-27 15:36:06] [INFO ] Deduced a trap composed of 56 places in 160 ms of which 2 ms to minimize.
[2024-05-27 15:36:06] [INFO ] Deduced a trap composed of 57 places in 158 ms of which 2 ms to minimize.
[2024-05-27 15:36:06] [INFO ] Deduced a trap composed of 55 places in 156 ms of which 2 ms to minimize.
[2024-05-27 15:36:07] [INFO ] Deduced a trap composed of 58 places in 150 ms of which 2 ms to minimize.
[2024-05-27 15:36:07] [INFO ] Deduced a trap composed of 55 places in 146 ms of which 3 ms to minimize.
[2024-05-27 15:36:07] [INFO ] Deduced a trap composed of 55 places in 172 ms of which 3 ms to minimize.
[2024-05-27 15:36:07] [INFO ] Deduced a trap composed of 61 places in 162 ms of which 2 ms to minimize.
[2024-05-27 15:36:09] [INFO ] Deduced a trap composed of 60 places in 154 ms of which 2 ms to minimize.
[2024-05-27 15:36:09] [INFO ] Deduced a trap composed of 58 places in 174 ms of which 2 ms to minimize.
[2024-05-27 15:36:09] [INFO ] Deduced a trap composed of 78 places in 171 ms of which 2 ms to minimize.
[2024-05-27 15:36:09] [INFO ] Deduced a trap composed of 57 places in 180 ms of which 2 ms to minimize.
[2024-05-27 15:36:10] [INFO ] Deduced a trap composed of 67 places in 173 ms of which 2 ms to minimize.
[2024-05-27 15:36:10] [INFO ] Deduced a trap composed of 78 places in 188 ms of which 2 ms to minimize.
[2024-05-27 15:36:10] [INFO ] Deduced a trap composed of 67 places in 188 ms of which 2 ms to minimize.
[2024-05-27 15:36:11] [INFO ] Deduced a trap composed of 78 places in 408 ms of which 12 ms to minimize.
[2024-05-27 15:36:11] [INFO ] Deduced a trap composed of 78 places in 352 ms of which 24 ms to minimize.
[2024-05-27 15:36:12] [INFO ] Deduced a trap composed of 71 places in 782 ms of which 8 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:587)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:619)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:581)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:252)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:958)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-27 15:36:12] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Support contains 1 out of 591 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 591/591 places, 4756/4756 transitions.
Applied a total of 0 rules in 47 ms. Remains 591 /591 variables (removed 0) and now considering 4756/4756 (removed 0) transitions.
[2024-05-27 15:36:12] [INFO ] Flow matrix only has 1412 transitions (discarded 3344 similar events)
[2024-05-27 15:36:12] [INFO ] Invariant cache hit.
[2024-05-27 15:36:13] [INFO ] Implicit Places using invariants in 1199 ms returned []
[2024-05-27 15:36:13] [INFO ] Flow matrix only has 1412 transitions (discarded 3344 similar events)
[2024-05-27 15:36:13] [INFO ] Invariant cache hit.
[2024-05-27 15:36:14] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-05-27 15:36:20] [INFO ] Implicit Places using invariants and state equation in 6874 ms returned []
Implicit Place search using SMT with State Equation took 8078 ms to find 0 implicit places.
Running 4741 sub problems to find dead transitions.
[2024-05-27 15:36:20] [INFO ] Flow matrix only has 1412 transitions (discarded 3344 similar events)
[2024-05-27 15:36:20] [INFO ] Invariant cache hit.
[2024-05-27 15:36:20] [INFO ] State equation strengthened by 241 read => feed constraints.

BK_STOP 1716824186075

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="SafeBus-COL-15"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
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 itstools"
echo " Input is SafeBus-COL-15, 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 r334-tall-171679080200379"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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