Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 8.0K Apr 12 15:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Apr 12 15:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Apr 12 15:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Apr 12 15:00 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.9K Apr 23 07:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 23 07:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 23 07:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 15:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Apr 12 15:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 12 15:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 12 15:19 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-10-LTLCardinality-00
FORMULA_NAME SafeBus-COL-10-LTLCardinality-01
FORMULA_NAME SafeBus-COL-10-LTLCardinality-02
FORMULA_NAME SafeBus-COL-10-LTLCardinality-03
FORMULA_NAME SafeBus-COL-10-LTLCardinality-04
FORMULA_NAME SafeBus-COL-10-LTLCardinality-05
FORMULA_NAME SafeBus-COL-10-LTLCardinality-06
FORMULA_NAME SafeBus-COL-10-LTLCardinality-07
FORMULA_NAME SafeBus-COL-10-LTLCardinality-08
FORMULA_NAME SafeBus-COL-10-LTLCardinality-09
FORMULA_NAME SafeBus-COL-10-LTLCardinality-10
FORMULA_NAME SafeBus-COL-10-LTLCardinality-11
FORMULA_NAME SafeBus-COL-10-LTLCardinality-12
FORMULA_NAME SafeBus-COL-10-LTLCardinality-13
FORMULA_NAME SafeBus-COL-10-LTLCardinality-14
FORMULA_NAME SafeBus-COL-10-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716822639059

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-10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202405141337
[2024-05-27 15:10:40] [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:10:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 15:10:40] [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:10:40] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-27 15:10:40] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 571 ms
[2024-05-27 15:10:40] [INFO ] Detected 1 constant HL places corresponding to 10 PT places.
[2024-05-27 15:10:40] [INFO ] Imported 20 HL places and 14 HL transitions for a total of 326 PT places and 12821.0 transition bindings in 21 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:10:40] [INFO ] Built PT skeleton of HLPN with 20 places and 14 transitions 68 arcs in 4 ms.
[2024-05-27 15:10:40] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 5 formulas.
FORMULA SafeBus-COL-10-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-COL-10-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-COL-10-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-COL-10-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-COL-10-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 3 stabilizing places and 0 stable transitions
Remains 11 properties that can be checked using skeleton over-approximation.
Reduce places removed 3 places and 0 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 40000 steps (8 resets) in 1796 ms. (22 steps per ms) remains 7/19 properties
BEST_FIRST walk for 40002 steps (8 resets) in 174 ms. (228 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (8 resets) in 102 ms. (388 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 129 ms. (307 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (8 resets) in 114 ms. (347 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 102 ms. (388 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 70 ms. (563 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 67 ms. (588 steps per ms) remains 7/7 properties
// Phase 1: matrix 14 rows 17 cols
[2024-05-27 15:10:41] [INFO ] Computed 7 invariants in 7 ms
[2024-05-27 15:10:41] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp16 is UNSAT
At refinement iteration 1 (OVERLAPS) 2/7 variables, 2/2 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 4 unsolved
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp15 is UNSAT
After SMT solving in domain Real declared 11/31 variables, and 5 constraints, problems are : Problem set: 7 solved, 0 unsolved in 332 ms.
Refiners :[Positive P Invariants (semi-flows): 2/4 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/17 constraints, ReadFeed: 0/3 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 364ms problems are : Problem set: 7 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 7 atomic propositions for a total of 11 simplifications.
FORMULA SafeBus-COL-10-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-27 15:10:42] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2024-05-27 15:10:42] [INFO ] Flatten gal took : 29 ms
FORMULA SafeBus-COL-10-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-COL-10-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-27 15:10:42] [INFO ] Flatten gal took : 3 ms
Domain [It(10), It(10)] of place AMC breaks symmetries in sort It
[2024-05-27 15:10:42] [INFO ] Unfolded HLPN to a Petri net with 326 places and 1651 transitions 11294 arcs in 103 ms.
[2024-05-27 15:10:42] [INFO ] Unfolded 8 HLPN properties in 9 ms.
Deduced a syphon composed of 10 places in 5 ms
Reduce places removed 20 places and 20 transitions.
Support contains 144 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 1631/1631 transitions.
Applied a total of 0 rules in 48 ms. Remains 306 /306 variables (removed 0) and now considering 1631/1631 (removed 0) transitions.
[2024-05-27 15:10:42] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
// Phase 1: matrix 642 rows 306 cols
[2024-05-27 15:10:42] [INFO ] Computed 45 invariants in 29 ms
[2024-05-27 15:10:43] [INFO ] Implicit Places using invariants in 902 ms returned []
[2024-05-27 15:10:43] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
[2024-05-27 15:10:43] [INFO ] Invariant cache hit.
[2024-05-27 15:10:44] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-27 15:10:45] [INFO ] Implicit Places using invariants and state equation in 1496 ms returned []
Implicit Place search using SMT with State Equation took 2420 ms to find 0 implicit places.
Running 1621 sub problems to find dead transitions.
[2024-05-27 15:10:45] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
[2024-05-27 15:10:45] [INFO ] Invariant cache hit.
[2024-05-27 15:10:45] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1621 unsolved
Problem TDEAD91 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD646 is UNSAT
Problem TDEAD657 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD679 is UNSAT
Problem TDEAD690 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD702 is UNSAT
Problem TDEAD713 is UNSAT
Problem TDEAD724 is UNSAT
Problem TDEAD735 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD791 is UNSAT
Problem TDEAD802 is UNSAT
Problem TDEAD813 is UNSAT
Problem TDEAD824 is UNSAT
Problem TDEAD835 is UNSAT
Problem TDEAD846 is UNSAT
Problem TDEAD857 is UNSAT
Problem TDEAD868 is UNSAT
Problem TDEAD879 is UNSAT
Problem TDEAD890 is UNSAT
Problem TDEAD891 is UNSAT
Problem TDEAD902 is UNSAT
Problem TDEAD913 is UNSAT
Problem TDEAD924 is UNSAT
Problem TDEAD935 is UNSAT
Problem TDEAD946 is UNSAT
Problem TDEAD957 is UNSAT
Problem TDEAD968 is UNSAT
Problem TDEAD979 is UNSAT
Problem TDEAD990 is UNSAT
Problem TDEAD991 is UNSAT
Problem TDEAD1002 is UNSAT
Problem TDEAD1013 is UNSAT
Problem TDEAD1024 is UNSAT
Problem TDEAD1035 is UNSAT
Problem TDEAD1046 is UNSAT
Problem TDEAD1057 is UNSAT
Problem TDEAD1068 is UNSAT
Problem TDEAD1079 is UNSAT
Problem TDEAD1090 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/45 constraints. Problems are: Problem set: 100 solved, 1521 unsolved
[2024-05-27 15:10:58] [INFO ] Deduced a trap composed of 39 places in 270 ms of which 29 ms to minimize.
[2024-05-27 15:10:59] [INFO ] Deduced a trap composed of 52 places in 322 ms of which 18 ms to minimize.
[2024-05-27 15:10:59] [INFO ] Deduced a trap composed of 58 places in 191 ms of which 3 ms to minimize.
[2024-05-27 15:10:59] [INFO ] Deduced a trap composed of 53 places in 158 ms of which 11 ms to minimize.
[2024-05-27 15:10:59] [INFO ] Deduced a trap composed of 59 places in 181 ms of which 2 ms to minimize.
[2024-05-27 15:10:59] [INFO ] Deduced a trap composed of 58 places in 127 ms of which 2 ms to minimize.
[2024-05-27 15:10:59] [INFO ] Deduced a trap composed of 47 places in 134 ms of which 1 ms to minimize.
[2024-05-27 15:11:00] [INFO ] Deduced a trap composed of 36 places in 123 ms of which 2 ms to minimize.
[2024-05-27 15:11:00] [INFO ] Deduced a trap composed of 40 places in 171 ms of which 2 ms to minimize.
[2024-05-27 15:11:00] [INFO ] Deduced a trap composed of 37 places in 176 ms of which 2 ms to minimize.
[2024-05-27 15:11:09] [INFO ] Deduced a trap composed of 30 places in 212 ms of which 2 ms to minimize.
[2024-05-27 15:11:09] [INFO ] Deduced a trap composed of 34 places in 213 ms of which 2 ms to minimize.
[2024-05-27 15:11:09] [INFO ] Deduced a trap composed of 34 places in 207 ms of which 2 ms to minimize.
[2024-05-27 15:11:09] [INFO ] Deduced a trap composed of 32 places in 219 ms of which 2 ms to minimize.
[2024-05-27 15:11:10] [INFO ] Deduced a trap composed of 34 places in 213 ms of which 2 ms to minimize.
[2024-05-27 15:11:10] [INFO ] Deduced a trap composed of 30 places in 254 ms of which 2 ms to minimize.
[2024-05-27 15:11:10] [INFO ] Deduced a trap composed of 26 places in 257 ms of which 2 ms to minimize.
[2024-05-27 15:11:11] [INFO ] Deduced a trap composed of 30 places in 216 ms of which 2 ms to minimize.
[2024-05-27 15:11:11] [INFO ] Deduced a trap composed of 30 places in 214 ms of which 2 ms to minimize.
[2024-05-27 15:11:12] [INFO ] Deduced a trap composed of 41 places in 254 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 20/65 constraints. Problems are: Problem set: 100 solved, 1521 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 306/948 variables, and 65 constraints, problems are : Problem set: 100 solved, 1521 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 1621/1621 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 100 solved, 1521 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 21/21 constraints. Problems are: Problem set: 100 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/45 constraints. Problems are: Problem set: 100 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 20/65 constraints. Problems are: Problem set: 100 solved, 1521 unsolved
[2024-05-27 15:11:30] [INFO ] Deduced a trap composed of 49 places in 132 ms of which 2 ms to minimize.
[2024-05-27 15:11:31] [INFO ] Deduced a trap composed of 41 places in 124 ms of which 9 ms to minimize.
[2024-05-27 15:11:31] [INFO ] Deduced a trap composed of 49 places in 123 ms of which 2 ms to minimize.
[2024-05-27 15:11:31] [INFO ] Deduced a trap composed of 58 places in 129 ms of which 2 ms to minimize.
[2024-05-27 15:11:31] [INFO ] Deduced a trap composed of 49 places in 130 ms of which 1 ms to minimize.
[2024-05-27 15:11:31] [INFO ] Deduced a trap composed of 49 places in 128 ms of which 2 ms to minimize.
[2024-05-27 15:11:31] [INFO ] Deduced a trap composed of 49 places in 137 ms of which 2 ms to minimize.
[2024-05-27 15:11:32] [INFO ] Deduced a trap composed of 49 places in 202 ms of which 1 ms to minimize.
[2024-05-27 15:11:32] [INFO ] Deduced a trap composed of 41 places in 205 ms of which 2 ms to minimize.
[2024-05-27 15:11:32] [INFO ] Deduced a trap composed of 41 places in 202 ms of which 1 ms to minimize.
[2024-05-27 15:11:35] [INFO ] Deduced a trap composed of 47 places in 222 ms of which 2 ms to minimize.
[2024-05-27 15:11:35] [INFO ] Deduced a trap composed of 45 places in 212 ms of which 2 ms to minimize.
[2024-05-27 15:11:35] [INFO ] Deduced a trap composed of 42 places in 215 ms of which 1 ms to minimize.
[2024-05-27 15:11:35] [INFO ] Deduced a trap composed of 42 places in 214 ms of which 3 ms to minimize.
[2024-05-27 15:11:36] [INFO ] Deduced a trap composed of 48 places in 222 ms of which 3 ms to minimize.
[2024-05-27 15:11:36] [INFO ] Deduced a trap composed of 47 places in 204 ms of which 2 ms to minimize.
[2024-05-27 15:11:36] [INFO ] Deduced a trap composed of 44 places in 212 ms of which 2 ms to minimize.
[2024-05-27 15:11:36] [INFO ] Deduced a trap composed of 46 places in 214 ms of which 2 ms to minimize.
[2024-05-27 15:11:37] [INFO ] Deduced a trap composed of 59 places in 151 ms of which 2 ms to minimize.
[2024-05-27 15:11:37] [INFO ] Deduced a trap composed of 51 places in 146 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 20/85 constraints. Problems are: Problem set: 100 solved, 1521 unsolved
[2024-05-27 15:11:47] [INFO ] Deduced a trap composed of 21 places in 216 ms of which 2 ms to minimize.
[2024-05-27 15:11:47] [INFO ] Deduced a trap composed of 30 places in 208 ms of which 2 ms to minimize.
[2024-05-27 15:11:47] [INFO ] Deduced a trap composed of 30 places in 214 ms of which 2 ms to minimize.
[2024-05-27 15:11:48] [INFO ] Deduced a trap composed of 57 places in 136 ms of which 2 ms to minimize.
[2024-05-27 15:11:49] [INFO ] Deduced a trap composed of 49 places in 130 ms of which 1 ms to minimize.
[2024-05-27 15:11:49] [INFO ] Deduced a trap composed of 49 places in 211 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 306/948 variables, and 91 constraints, problems are : Problem set: 100 solved, 1521 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 0/1621 constraints, Known Traps: 46/46 constraints]
After SMT, in 64584ms problems are : Problem set: 100 solved, 1521 unsolved
Search for dead transitions found 100 dead transitions in 64618ms
Found 100 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 100 transitions
Dead transitions reduction (with SMT) removed 100 transitions
Starting structural reductions in LTL mode, iteration 1 : 306/306 places, 1531/1631 transitions.
Applied a total of 0 rules in 24 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 67145 ms. Remains : 306/306 places, 1531/1631 transitions.
Support contains 144 out of 306 places after structural reductions.
[2024-05-27 15:11:49] [INFO ] Flatten gal took : 153 ms
[2024-05-27 15:11:50] [INFO ] Flatten gal took : 134 ms
[2024-05-27 15:11:50] [INFO ] Input system was already deterministic with 1531 transitions.
RANDOM walk for 40000 steps (8 resets) in 1303 ms. (30 steps per ms) remains 3/13 properties
BEST_FIRST walk for 40002 steps (8 resets) in 184 ms. (216 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 311 ms. (128 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 116 ms. (341 steps per ms) remains 3/3 properties
[2024-05-27 15:11:50] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 15:11:50] [INFO ] Invariant cache hit.
[2024-05-27 15:11:50] [INFO ] State equation strengthened by 111 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp10 is UNSAT
At refinement iteration 1 (OVERLAPS) 155/247 variables, 20/20 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/247 variables, 0/20 constraints. Problems are: Problem set: 2 solved, 1 unsolved
Problem AtomicPropp6 is UNSAT
After SMT solving in domain Real declared 305/948 variables, and 44 constraints, problems are : Problem set: 3 solved, 0 unsolved in 84 ms.
Refiners :[Positive P Invariants (semi-flows): 20/21 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 113ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 3 atomic propositions for a total of 8 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 110 out of 306 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 212 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-05-27 15:11:51] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 15:11:51] [INFO ] Invariant cache hit.
[2024-05-27 15:11:51] [INFO ] Implicit Places using invariants in 387 ms returned [231, 232, 233, 234, 235, 236, 237, 238, 239, 240]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 394 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 296/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 171 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 777 ms. Remains : 296/306 places, 1531/1531 transitions.
Stuttering acceptance computed with spot in 143 ms :[(NOT p0)]
Running random walk in product with property : SafeBus-COL-10-LTLCardinality-00
Product exploration explored 100000 steps with 0 reset in 766 ms.
Product exploration explored 100000 steps with 0 reset in 725 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), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 68 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
RANDOM walk for 73 steps (0 resets) in 6 ms. (10 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 102 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
[2024-05-27 15:11:54] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
// Phase 1: matrix 642 rows 296 cols
[2024-05-27 15:11:54] [INFO ] Computed 35 invariants in 16 ms
[2024-05-27 15:11:54] [INFO ] [Real]Absence check using 14 positive place invariants in 9 ms returned sat
[2024-05-27 15:11:54] [INFO ] [Real]Absence check using 14 positive and 21 generalized place invariants in 27 ms returned sat
[2024-05-27 15:11:55] [INFO ] [Real]Absence check using state equation in 607 ms returned sat
[2024-05-27 15:11:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 15:11:56] [INFO ] [Nat]Absence check using 14 positive place invariants in 12 ms returned sat
[2024-05-27 15:11:56] [INFO ] [Nat]Absence check using 14 positive and 21 generalized place invariants in 29 ms returned sat
[2024-05-27 15:11:56] [INFO ] [Nat]Absence check using state equation in 363 ms returned sat
[2024-05-27 15:11:56] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-27 15:11:56] [INFO ] [Nat]Added 111 Read/Feed constraints in 99 ms returned sat
[2024-05-27 15:11:56] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 612 transitions) in 86 ms.
[2024-05-27 15:11:56] [INFO ] Added : 0 causal constraints over 0 iterations in 160 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 110 out of 296 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 296/296 places, 1531/1531 transitions.
Applied a total of 0 rules in 95 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-05-27 15:11:57] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 15:11:57] [INFO ] Invariant cache hit.
[2024-05-27 15:11:57] [INFO ] Implicit Places using invariants in 334 ms returned []
[2024-05-27 15:11:57] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 15:11:57] [INFO ] Invariant cache hit.
[2024-05-27 15:11:57] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-27 15:11:58] [INFO ] Implicit Places using invariants and state equation in 1469 ms returned []
Implicit Place search using SMT with State Equation took 1807 ms to find 0 implicit places.
[2024-05-27 15:11:59] [INFO ] Redundant transitions in 108 ms returned []
Running 1521 sub problems to find dead transitions.
[2024-05-27 15:11:59] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 15:11:59] [INFO ] Invariant cache hit.
[2024-05-27 15:11:59] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/296 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-05-27 15:12:10] [INFO ] Deduced a trap composed of 37 places in 196 ms of which 2 ms to minimize.
[2024-05-27 15:12:11] [INFO ] Deduced a trap composed of 53 places in 100 ms of which 2 ms to minimize.
[2024-05-27 15:12:18] [INFO ] Deduced a trap composed of 21 places in 284 ms of which 6 ms to minimize.
[2024-05-27 15:12:19] [INFO ] Deduced a trap composed of 30 places in 201 ms of which 1 ms to minimize.
[2024-05-27 15:12:19] [INFO ] Deduced a trap composed of 30 places in 193 ms of which 2 ms to minimize.
[2024-05-27 15:12:19] [INFO ] Deduced a trap composed of 21 places in 192 ms of which 2 ms to minimize.
[2024-05-27 15:12:19] [INFO ] Deduced a trap composed of 21 places in 195 ms of which 2 ms to minimize.
[2024-05-27 15:12:20] [INFO ] Deduced a trap composed of 41 places in 188 ms of which 2 ms to minimize.
[2024-05-27 15:12:20] [INFO ] Deduced a trap composed of 49 places in 190 ms of which 2 ms to minimize.
[2024-05-27 15:12:21] [INFO ] Deduced a trap composed of 49 places in 193 ms of which 5 ms to minimize.
[2024-05-27 15:12:21] [INFO ] Deduced a trap composed of 65 places in 189 ms of which 2 ms to minimize.
[2024-05-27 15:12:21] [INFO ] Deduced a trap composed of 49 places in 191 ms of which 2 ms to minimize.
[2024-05-27 15:12:24] [INFO ] Deduced a trap composed of 36 places in 201 ms of which 2 ms to minimize.
[2024-05-27 15:12:24] [INFO ] Deduced a trap composed of 35 places in 209 ms of which 2 ms to minimize.
[2024-05-27 15:12:24] [INFO ] Deduced a trap composed of 34 places in 201 ms of which 2 ms to minimize.
[2024-05-27 15:12:24] [INFO ] Deduced a trap composed of 37 places in 202 ms of which 2 ms to minimize.
[2024-05-27 15:12:24] [INFO ] Deduced a trap composed of 37 places in 195 ms of which 2 ms to minimize.
[2024-05-27 15:12:25] [INFO ] Deduced a trap composed of 59 places in 132 ms of which 1 ms to minimize.
[2024-05-27 15:12:25] [INFO ] Deduced a trap composed of 59 places in 133 ms of which 1 ms to minimize.
[2024-05-27 15:12:25] [INFO ] Deduced a trap composed of 51 places in 133 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 296/938 variables, and 55 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/296 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 1521/1521 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1521 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/296 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-05-27 15:12:33] [INFO ] Deduced a trap composed of 32 places in 202 ms of which 2 ms to minimize.
[2024-05-27 15:12:34] [INFO ] Deduced a trap composed of 34 places in 192 ms of which 1 ms to minimize.
[2024-05-27 15:12:34] [INFO ] Deduced a trap composed of 38 places in 134 ms of which 2 ms to minimize.
[2024-05-27 15:12:42] [INFO ] Deduced a trap composed of 31 places in 207 ms of which 2 ms to minimize.
[2024-05-27 15:12:43] [INFO ] Deduced a trap composed of 21 places in 202 ms of which 2 ms to minimize.
[2024-05-27 15:12:43] [INFO ] Deduced a trap composed of 30 places in 211 ms of which 2 ms to minimize.
[2024-05-27 15:12:44] [INFO ] Deduced a trap composed of 49 places in 133 ms of which 2 ms to minimize.
[2024-05-27 15:12:44] [INFO ] Deduced a trap composed of 49 places in 196 ms of which 2 ms to minimize.
[2024-05-27 15:12:44] [INFO ] Deduced a trap composed of 49 places in 123 ms of which 2 ms to minimize.
[2024-05-27 15:12:45] [INFO ] Deduced a trap composed of 41 places in 187 ms of which 1 ms to minimize.
[2024-05-27 15:12:47] [INFO ] Deduced a trap composed of 49 places in 125 ms of which 1 ms to minimize.
[2024-05-27 15:12:47] [INFO ] Deduced a trap composed of 49 places in 100 ms of which 1 ms to minimize.
[2024-05-27 15:12:48] [INFO ] Deduced a trap composed of 46 places in 109 ms of which 2 ms to minimize.
[2024-05-27 15:12:48] [INFO ] Deduced a trap composed of 45 places in 104 ms of which 2 ms to minimize.
[2024-05-27 15:12:48] [INFO ] Deduced a trap composed of 38 places in 83 ms of which 2 ms to minimize.
[2024-05-27 15:12:48] [INFO ] Deduced a trap composed of 40 places in 84 ms of which 1 ms to minimize.
[2024-05-27 15:12:48] [INFO ] Deduced a trap composed of 59 places in 106 ms of which 1 ms to minimize.
[2024-05-27 15:12:48] [INFO ] Deduced a trap composed of 56 places in 92 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/296 variables, 18/73 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-05-27 15:12:58] [INFO ] Deduced a trap composed of 21 places in 188 ms of which 2 ms to minimize.
[2024-05-27 15:12:59] [INFO ] Deduced a trap composed of 49 places in 178 ms of which 2 ms to minimize.
[2024-05-27 15:13:00] [INFO ] Deduced a trap composed of 41 places in 183 ms of which 2 ms to minimize.
[2024-05-27 15:13:00] [INFO ] Deduced a trap composed of 65 places in 174 ms of which 2 ms to minimize.
[2024-05-27 15:13:00] [INFO ] Deduced a trap composed of 41 places in 179 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 296/938 variables, and 78 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/296 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 0/1521 constraints, Known Traps: 43/43 constraints]
After SMT, in 63514ms problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 63528ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 65550 ms. Remains : 296/296 places, 1531/1531 transitions.
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), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 68 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
RANDOM walk for 74 steps (0 resets) in 5 ms. (12 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
[2024-05-27 15:13:02] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 15:13:02] [INFO ] Invariant cache hit.
[2024-05-27 15:13:03] [INFO ] [Real]Absence check using 14 positive place invariants in 8 ms returned sat
[2024-05-27 15:13:03] [INFO ] [Real]Absence check using 14 positive and 21 generalized place invariants in 82 ms returned sat
[2024-05-27 15:13:04] [INFO ] [Real]Absence check using state equation in 530 ms returned sat
[2024-05-27 15:13:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 15:13:04] [INFO ] [Nat]Absence check using 14 positive place invariants in 8 ms returned sat
[2024-05-27 15:13:05] [INFO ] [Nat]Absence check using 14 positive and 21 generalized place invariants in 42 ms returned sat
[2024-05-27 15:13:05] [INFO ] [Nat]Absence check using state equation in 367 ms returned sat
[2024-05-27 15:13:05] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-27 15:13:05] [INFO ] [Nat]Added 111 Read/Feed constraints in 110 ms returned sat
[2024-05-27 15:13:05] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 612 transitions) in 59 ms.
[2024-05-27 15:13:05] [INFO ] Added : 1 causal constraints over 1 iterations in 168 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 653 ms.
Product exploration explored 100000 steps with 0 reset in 689 ms.
Built C files in :
/tmp/ltsmin17132132317615017284
[2024-05-27 15:13:07] [INFO ] Too many transitions (1531) to apply POR reductions. Disabling POR matrices.
[2024-05-27 15:13:07] [INFO ] Built C files in 42ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17132132317615017284
Running compilation step : cd /tmp/ltsmin17132132317615017284;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17132132317615017284;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17132132317615017284;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 110 out of 296 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 296/296 places, 1531/1531 transitions.
Applied a total of 0 rules in 89 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-05-27 15:13:10] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 15:13:10] [INFO ] Invariant cache hit.
[2024-05-27 15:13:10] [INFO ] Implicit Places using invariants in 325 ms returned []
[2024-05-27 15:13:10] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 15:13:10] [INFO ] Invariant cache hit.
[2024-05-27 15:13:10] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-27 15:13:12] [INFO ] Implicit Places using invariants and state equation in 1400 ms returned []
Implicit Place search using SMT with State Equation took 1733 ms to find 0 implicit places.
[2024-05-27 15:13:12] [INFO ] Redundant transitions in 26 ms returned []
Running 1521 sub problems to find dead transitions.
[2024-05-27 15:13:12] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 15:13:12] [INFO ] Invariant cache hit.
[2024-05-27 15:13:12] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/296 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-05-27 15:13:24] [INFO ] Deduced a trap composed of 37 places in 210 ms of which 2 ms to minimize.
[2024-05-27 15:13:25] [INFO ] Deduced a trap composed of 53 places in 97 ms of which 2 ms to minimize.
[2024-05-27 15:13:32] [INFO ] Deduced a trap composed of 21 places in 205 ms of which 3 ms to minimize.
[2024-05-27 15:13:32] [INFO ] Deduced a trap composed of 30 places in 204 ms of which 1 ms to minimize.
[2024-05-27 15:13:32] [INFO ] Deduced a trap composed of 30 places in 204 ms of which 2 ms to minimize.
[2024-05-27 15:13:33] [INFO ] Deduced a trap composed of 21 places in 200 ms of which 2 ms to minimize.
[2024-05-27 15:13:33] [INFO ] Deduced a trap composed of 21 places in 201 ms of which 2 ms to minimize.
[2024-05-27 15:13:34] [INFO ] Deduced a trap composed of 41 places in 192 ms of which 2 ms to minimize.
[2024-05-27 15:13:34] [INFO ] Deduced a trap composed of 49 places in 192 ms of which 2 ms to minimize.
[2024-05-27 15:13:34] [INFO ] Deduced a trap composed of 49 places in 195 ms of which 2 ms to minimize.
[2024-05-27 15:13:34] [INFO ] Deduced a trap composed of 65 places in 184 ms of which 1 ms to minimize.
[2024-05-27 15:13:35] [INFO ] Deduced a trap composed of 49 places in 186 ms of which 2 ms to minimize.
[2024-05-27 15:13:37] [INFO ] Deduced a trap composed of 36 places in 190 ms of which 2 ms to minimize.
[2024-05-27 15:13:37] [INFO ] Deduced a trap composed of 35 places in 198 ms of which 2 ms to minimize.
[2024-05-27 15:13:38] [INFO ] Deduced a trap composed of 34 places in 195 ms of which 2 ms to minimize.
[2024-05-27 15:13:38] [INFO ] Deduced a trap composed of 37 places in 196 ms of which 2 ms to minimize.
[2024-05-27 15:13:38] [INFO ] Deduced a trap composed of 37 places in 190 ms of which 2 ms to minimize.
[2024-05-27 15:13:38] [INFO ] Deduced a trap composed of 59 places in 138 ms of which 1 ms to minimize.
[2024-05-27 15:13:38] [INFO ] Deduced a trap composed of 59 places in 131 ms of which 2 ms to minimize.
[2024-05-27 15:13:39] [INFO ] Deduced a trap composed of 51 places in 130 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 296/938 variables, and 55 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/296 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 1521/1521 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1521 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/296 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-05-27 15:13:47] [INFO ] Deduced a trap composed of 32 places in 199 ms of which 2 ms to minimize.
[2024-05-27 15:13:47] [INFO ] Deduced a trap composed of 34 places in 193 ms of which 1 ms to minimize.
[2024-05-27 15:13:47] [INFO ] Deduced a trap composed of 38 places in 131 ms of which 2 ms to minimize.
[2024-05-27 15:13:56] [INFO ] Deduced a trap composed of 31 places in 202 ms of which 2 ms to minimize.
[2024-05-27 15:13:56] [INFO ] Deduced a trap composed of 21 places in 206 ms of which 2 ms to minimize.
[2024-05-27 15:13:56] [INFO ] Deduced a trap composed of 30 places in 200 ms of which 2 ms to minimize.
[2024-05-27 15:13:57] [INFO ] Deduced a trap composed of 49 places in 134 ms of which 1 ms to minimize.
[2024-05-27 15:13:57] [INFO ] Deduced a trap composed of 49 places in 197 ms of which 2 ms to minimize.
[2024-05-27 15:13:58] [INFO ] Deduced a trap composed of 49 places in 132 ms of which 2 ms to minimize.
[2024-05-27 15:13:58] [INFO ] Deduced a trap composed of 41 places in 197 ms of which 2 ms to minimize.
[2024-05-27 15:14:00] [INFO ] Deduced a trap composed of 49 places in 120 ms of which 2 ms to minimize.
[2024-05-27 15:14:01] [INFO ] Deduced a trap composed of 49 places in 107 ms of which 1 ms to minimize.
[2024-05-27 15:14:01] [INFO ] Deduced a trap composed of 46 places in 100 ms of which 1 ms to minimize.
[2024-05-27 15:14:01] [INFO ] Deduced a trap composed of 45 places in 97 ms of which 1 ms to minimize.
[2024-05-27 15:14:01] [INFO ] Deduced a trap composed of 38 places in 91 ms of which 1 ms to minimize.
[2024-05-27 15:14:01] [INFO ] Deduced a trap composed of 40 places in 92 ms of which 2 ms to minimize.
[2024-05-27 15:14:01] [INFO ] Deduced a trap composed of 59 places in 107 ms of which 2 ms to minimize.
[2024-05-27 15:14:01] [INFO ] Deduced a trap composed of 56 places in 89 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/296 variables, 18/73 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-05-27 15:14:11] [INFO ] Deduced a trap composed of 21 places in 198 ms of which 2 ms to minimize.
[2024-05-27 15:14:12] [INFO ] Deduced a trap composed of 49 places in 184 ms of which 1 ms to minimize.
[2024-05-27 15:14:13] [INFO ] Deduced a trap composed of 41 places in 179 ms of which 1 ms to minimize.
[2024-05-27 15:14:13] [INFO ] Deduced a trap composed of 65 places in 191 ms of which 2 ms to minimize.
[2024-05-27 15:14:13] [INFO ] Deduced a trap composed of 41 places in 188 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 296/938 variables, and 78 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/296 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 0/1521 constraints, Known Traps: 43/43 constraints]
After SMT, in 63744ms problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 63757ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 65615 ms. Remains : 296/296 places, 1531/1531 transitions.
Built C files in :
/tmp/ltsmin17086647161618929852
[2024-05-27 15:14:15] [INFO ] Too many transitions (1531) to apply POR reductions. Disabling POR matrices.
[2024-05-27 15:14:15] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17086647161618929852
Running compilation step : cd /tmp/ltsmin17086647161618929852;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17086647161618929852;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17086647161618929852;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-27 15:14:19] [INFO ] Flatten gal took : 74 ms
[2024-05-27 15:14:19] [INFO ] Flatten gal took : 69 ms
[2024-05-27 15:14:19] [INFO ] Time to serialize gal into /tmp/LTL17229436317760544935.gal : 15 ms
[2024-05-27 15:14:19] [INFO ] Time to serialize properties into /tmp/LTL3192669603944114884.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17229436317760544935.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1253065315345923039.hoa' '-atoms' '/tmp/LTL3192669603944114884.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL3192669603944114884.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1253065315345923039.hoa
Detected timeout of ITS tools.
[2024-05-27 15:14:34] [INFO ] Flatten gal took : 74 ms
[2024-05-27 15:14:34] [INFO ] Flatten gal took : 78 ms
[2024-05-27 15:14:34] [INFO ] Time to serialize gal into /tmp/LTL71894439049636637.gal : 31 ms
[2024-05-27 15:14:34] [INFO ] Time to serialize properties into /tmp/LTL8386956498704527638.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL71894439049636637.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8386956498704527638.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...273
Read 1 LTL properties
Checking formula 0 : !((F(G("((((((wait_msg_0+wait_msg_1)+(wait_msg_2+wait_msg_3))+((wait_msg_4+wait_msg_5)+(wait_msg_6+wait_msg_7)))+(wait_msg_8+wait_msg_...1497
Formula 0 simplified : GF!"((((((wait_msg_0+wait_msg_1)+(wait_msg_2+wait_msg_3))+((wait_msg_4+wait_msg_5)+(wait_msg_6+wait_msg_7)))+(wait_msg_8+wait_msg_9)...1491
Detected timeout of ITS tools.
[2024-05-27 15:14:49] [INFO ] Flatten gal took : 58 ms
[2024-05-27 15:14:49] [INFO ] Applying decomposition
[2024-05-27 15:14:49] [INFO ] Flatten gal took : 57 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph13639281623215937393.txt' '-o' '/tmp/graph13639281623215937393.bin' '-w' '/tmp/graph13639281623215937393.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13639281623215937393.bin' '-l' '-1' '-v' '-w' '/tmp/graph13639281623215937393.weights' '-q' '0' '-e' '0.001'
[2024-05-27 15:14:49] [INFO ] Decomposing Gal with order
[2024-05-27 15:14:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 15:14:50] [INFO ] Removed a total of 769 redundant transitions.
[2024-05-27 15:14:50] [INFO ] Flatten gal took : 495 ms
[2024-05-27 15:14:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 661 labels/synchronizations in 36 ms.
[2024-05-27 15:14:50] [INFO ] Time to serialize gal into /tmp/LTL17489084700939569003.gal : 20 ms
[2024-05-27 15:14:50] [INFO ] Time to serialize properties into /tmp/LTL18293463598220253295.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17489084700939569003.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18293463598220253295.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F(G("((((((gu2.wait_msg_0+gu2.wait_msg_1)+(gu2.wait_msg_2+gu2.wait_msg_3))+((gu2.wait_msg_4+gu2.wait_msg_5)+(gu2.wait_msg_6+gu2.wai...2017
Formula 0 simplified : GF!"((((((gu2.wait_msg_0+gu2.wait_msg_1)+(gu2.wait_msg_2+gu2.wait_msg_3))+((gu2.wait_msg_4+gu2.wait_msg_5)+(gu2.wait_msg_6+gu2.wait_...2011
Detected timeout of ITS tools.
Treatment of property SafeBus-COL-10-LTLCardinality-00 finished in 194679 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(G(p0))))'
Support contains 2 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 5 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-05-27 15:15:05] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
// Phase 1: matrix 642 rows 306 cols
[2024-05-27 15:15:05] [INFO ] Computed 45 invariants in 14 ms
[2024-05-27 15:15:06] [INFO ] Implicit Places using invariants in 484 ms returned [231, 232, 233, 234, 235, 236, 237, 238, 239, 240]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 489 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 296/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 5 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 499 ms. Remains : 296/306 places, 1531/1531 transitions.
Stuttering acceptance computed with spot in 102 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SafeBus-COL-10-LTLCardinality-02
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA SafeBus-COL-10-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SafeBus-COL-10-LTLCardinality-02 finished in 626 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(F(p0)))'
Support contains 11 out of 306 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 83 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-05-27 15:15:06] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 15:15:06] [INFO ] Invariant cache hit.
[2024-05-27 15:15:06] [INFO ] Implicit Places using invariants in 389 ms returned [231, 232, 233, 234, 235, 236, 237, 238, 239, 240]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 390 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 296/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 81 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 554 ms. Remains : 296/306 places, 1531/1531 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SafeBus-COL-10-LTLCardinality-03
Product exploration explored 100000 steps with 144 reset in 448 ms.
Product exploration explored 100000 steps with 4179 reset in 385 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), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 60 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 64 steps (0 resets) in 5 ms. (10 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 88 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
[2024-05-27 15:15:08] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
// Phase 1: matrix 642 rows 296 cols
[2024-05-27 15:15:08] [INFO ] Computed 35 invariants in 4 ms
[2024-05-27 15:15:08] [INFO ] [Real]Absence check using 14 positive place invariants in 12 ms returned sat
[2024-05-27 15:15:08] [INFO ] [Real]Absence check using 14 positive and 21 generalized place invariants in 39 ms returned sat
[2024-05-27 15:15:09] [INFO ] [Real]Absence check using state equation in 496 ms returned sat
[2024-05-27 15:15:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 15:15:09] [INFO ] [Nat]Absence check using 14 positive place invariants in 8 ms returned sat
[2024-05-27 15:15:09] [INFO ] [Nat]Absence check using 14 positive and 21 generalized place invariants in 22 ms returned sat
[2024-05-27 15:15:10] [INFO ] [Nat]Absence check using state equation in 278 ms returned sat
[2024-05-27 15:15:10] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-27 15:15:10] [INFO ] [Nat]Added 111 Read/Feed constraints in 729 ms returned sat
[2024-05-27 15:15:11] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 612 transitions) in 47 ms.
[2024-05-27 15:15:11] [INFO ] Added : 1 causal constraints over 1 iterations in 154 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 11 out of 296 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 296/296 places, 1531/1531 transitions.
Applied a total of 0 rules in 80 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-05-27 15:15:11] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 15:15:11] [INFO ] Invariant cache hit.
[2024-05-27 15:15:11] [INFO ] Implicit Places using invariants in 347 ms returned []
[2024-05-27 15:15:11] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 15:15:11] [INFO ] Invariant cache hit.
[2024-05-27 15:15:11] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-27 15:15:13] [INFO ] Implicit Places using invariants and state equation in 1610 ms returned []
Implicit Place search using SMT with State Equation took 1971 ms to find 0 implicit places.
[2024-05-27 15:15:13] [INFO ] Redundant transitions in 25 ms returned []
Running 1521 sub problems to find dead transitions.
[2024-05-27 15:15:13] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 15:15:13] [INFO ] Invariant cache hit.
[2024-05-27 15:15:13] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/296 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-05-27 15:15:25] [INFO ] Deduced a trap composed of 37 places in 202 ms of which 5 ms to minimize.
[2024-05-27 15:15:26] [INFO ] Deduced a trap composed of 53 places in 94 ms of which 2 ms to minimize.
[2024-05-27 15:15:33] [INFO ] Deduced a trap composed of 21 places in 204 ms of which 2 ms to minimize.
[2024-05-27 15:15:34] [INFO ] Deduced a trap composed of 30 places in 206 ms of which 2 ms to minimize.
[2024-05-27 15:15:34] [INFO ] Deduced a trap composed of 30 places in 198 ms of which 2 ms to minimize.
[2024-05-27 15:15:34] [INFO ] Deduced a trap composed of 21 places in 202 ms of which 1 ms to minimize.
[2024-05-27 15:15:34] [INFO ] Deduced a trap composed of 21 places in 204 ms of which 2 ms to minimize.
[2024-05-27 15:15:35] [INFO ] Deduced a trap composed of 41 places in 194 ms of which 2 ms to minimize.
[2024-05-27 15:15:36] [INFO ] Deduced a trap composed of 49 places in 227 ms of which 2 ms to minimize.
[2024-05-27 15:15:36] [INFO ] Deduced a trap composed of 49 places in 230 ms of which 3 ms to minimize.
[2024-05-27 15:15:36] [INFO ] Deduced a trap composed of 65 places in 228 ms of which 2 ms to minimize.
[2024-05-27 15:15:36] [INFO ] Deduced a trap composed of 49 places in 224 ms of which 2 ms to minimize.
[2024-05-27 15:15:39] [INFO ] Deduced a trap composed of 36 places in 202 ms of which 2 ms to minimize.
[2024-05-27 15:15:39] [INFO ] Deduced a trap composed of 35 places in 200 ms of which 2 ms to minimize.
[2024-05-27 15:15:39] [INFO ] Deduced a trap composed of 34 places in 195 ms of which 1 ms to minimize.
[2024-05-27 15:15:40] [INFO ] Deduced a trap composed of 37 places in 199 ms of which 2 ms to minimize.
[2024-05-27 15:15:40] [INFO ] Deduced a trap composed of 37 places in 199 ms of which 2 ms to minimize.
[2024-05-27 15:15:40] [INFO ] Deduced a trap composed of 59 places in 138 ms of which 2 ms to minimize.
[2024-05-27 15:15:40] [INFO ] Deduced a trap composed of 59 places in 156 ms of which 2 ms to minimize.
[2024-05-27 15:15:40] [INFO ] Deduced a trap composed of 51 places in 135 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 296/938 variables, and 55 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/296 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 1521/1521 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1521 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/296 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-05-27 15:15:48] [INFO ] Deduced a trap composed of 32 places in 201 ms of which 2 ms to minimize.
[2024-05-27 15:15:48] [INFO ] Deduced a trap composed of 34 places in 201 ms of which 1 ms to minimize.
[2024-05-27 15:15:48] [INFO ] Deduced a trap composed of 38 places in 134 ms of which 2 ms to minimize.
[2024-05-27 15:15:57] [INFO ] Deduced a trap composed of 31 places in 206 ms of which 2 ms to minimize.
[2024-05-27 15:15:57] [INFO ] Deduced a trap composed of 21 places in 204 ms of which 1 ms to minimize.
[2024-05-27 15:15:57] [INFO ] Deduced a trap composed of 30 places in 198 ms of which 1 ms to minimize.
[2024-05-27 15:15:59] [INFO ] Deduced a trap composed of 49 places in 133 ms of which 2 ms to minimize.
[2024-05-27 15:15:59] [INFO ] Deduced a trap composed of 49 places in 192 ms of which 1 ms to minimize.
[2024-05-27 15:15:59] [INFO ] Deduced a trap composed of 49 places in 127 ms of which 2 ms to minimize.
[2024-05-27 15:15:59] [INFO ] Deduced a trap composed of 41 places in 192 ms of which 2 ms to minimize.
[2024-05-27 15:16:02] [INFO ] Deduced a trap composed of 49 places in 126 ms of which 2 ms to minimize.
[2024-05-27 15:16:02] [INFO ] Deduced a trap composed of 49 places in 95 ms of which 1 ms to minimize.
[2024-05-27 15:16:02] [INFO ] Deduced a trap composed of 46 places in 107 ms of which 1 ms to minimize.
[2024-05-27 15:16:02] [INFO ] Deduced a trap composed of 45 places in 106 ms of which 1 ms to minimize.
[2024-05-27 15:16:02] [INFO ] Deduced a trap composed of 38 places in 88 ms of which 1 ms to minimize.
[2024-05-27 15:16:02] [INFO ] Deduced a trap composed of 40 places in 82 ms of which 1 ms to minimize.
[2024-05-27 15:16:03] [INFO ] Deduced a trap composed of 59 places in 106 ms of which 1 ms to minimize.
[2024-05-27 15:16:03] [INFO ] Deduced a trap composed of 56 places in 94 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/296 variables, 18/73 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-05-27 15:16:13] [INFO ] Deduced a trap composed of 21 places in 199 ms of which 1 ms to minimize.
[2024-05-27 15:16:14] [INFO ] Deduced a trap composed of 49 places in 184 ms of which 2 ms to minimize.
[2024-05-27 15:16:14] [INFO ] Deduced a trap composed of 41 places in 183 ms of which 1 ms to minimize.
[2024-05-27 15:16:14] [INFO ] Deduced a trap composed of 65 places in 176 ms of which 2 ms to minimize.
[2024-05-27 15:16:14] [INFO ] Deduced a trap composed of 41 places in 179 ms of which 2 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 296/938 variables, and 78 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/296 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 0/1521 constraints, Known Traps: 43/43 constraints]
After SMT, in 63724ms problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 63738ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 65821 ms. Remains : 296/296 places, 1531/1531 transitions.
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), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 64 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 59 steps (0 resets) in 5 ms. (9 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 88 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
[2024-05-27 15:16:17] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 15:16:17] [INFO ] Invariant cache hit.
[2024-05-27 15:16:17] [INFO ] [Real]Absence check using 14 positive place invariants in 8 ms returned sat
[2024-05-27 15:16:17] [INFO ] [Real]Absence check using 14 positive and 21 generalized place invariants in 26 ms returned sat
[2024-05-27 15:16:18] [INFO ] [Real]Absence check using state equation in 554 ms returned sat
[2024-05-27 15:16:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 15:16:19] [INFO ] [Nat]Absence check using 14 positive place invariants in 8 ms returned sat
[2024-05-27 15:16:19] [INFO ] [Nat]Absence check using 14 positive and 21 generalized place invariants in 53 ms returned sat
[2024-05-27 15:16:19] [INFO ] [Nat]Absence check using state equation in 298 ms returned sat
[2024-05-27 15:16:19] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-27 15:16:19] [INFO ] [Nat]Added 111 Read/Feed constraints in 90 ms returned sat
[2024-05-27 15:16:19] [INFO ] Deduced a trap composed of 50 places in 73 ms of which 1 ms to minimize.
[2024-05-27 15:16:19] [INFO ] Deduced a trap composed of 42 places in 78 ms of which 2 ms to minimize.
[2024-05-27 15:16:19] [INFO ] Deduced a trap composed of 42 places in 78 ms of which 1 ms to minimize.
[2024-05-27 15:16:19] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 342 ms
[2024-05-27 15:16:19] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 612 transitions) in 60 ms.
[2024-05-27 15:16:20] [INFO ] Added : 0 causal constraints over 0 iterations in 129 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 6479 reset in 322 ms.
Product exploration explored 100000 steps with 3146 reset in 408 ms.
Built C files in :
/tmp/ltsmin2358589789392405581
[2024-05-27 15:16:20] [INFO ] Too many transitions (1531) to apply POR reductions. Disabling POR matrices.
[2024-05-27 15:16:20] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2358589789392405581
Running compilation step : cd /tmp/ltsmin2358589789392405581;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2358589789392405581;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2358589789392405581;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 11 out of 296 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 296/296 places, 1531/1531 transitions.
Applied a total of 0 rules in 88 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-05-27 15:16:23] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 15:16:23] [INFO ] Invariant cache hit.
[2024-05-27 15:16:24] [INFO ] Implicit Places using invariants in 357 ms returned []
[2024-05-27 15:16:24] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 15:16:24] [INFO ] Invariant cache hit.
[2024-05-27 15:16:24] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-27 15:16:25] [INFO ] Implicit Places using invariants and state equation in 1629 ms returned []
Implicit Place search using SMT with State Equation took 1990 ms to find 0 implicit places.
[2024-05-27 15:16:25] [INFO ] Redundant transitions in 24 ms returned []
Running 1521 sub problems to find dead transitions.
[2024-05-27 15:16:26] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 15:16:26] [INFO ] Invariant cache hit.
[2024-05-27 15:16:26] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/296 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-05-27 15:16:37] [INFO ] Deduced a trap composed of 37 places in 234 ms of which 2 ms to minimize.
[2024-05-27 15:16:38] [INFO ] Deduced a trap composed of 53 places in 96 ms of which 1 ms to minimize.
[2024-05-27 15:16:46] [INFO ] Deduced a trap composed of 21 places in 239 ms of which 2 ms to minimize.
[2024-05-27 15:16:46] [INFO ] Deduced a trap composed of 30 places in 231 ms of which 2 ms to minimize.
[2024-05-27 15:16:46] [INFO ] Deduced a trap composed of 30 places in 202 ms of which 2 ms to minimize.
[2024-05-27 15:16:47] [INFO ] Deduced a trap composed of 21 places in 201 ms of which 1 ms to minimize.
[2024-05-27 15:16:47] [INFO ] Deduced a trap composed of 21 places in 200 ms of which 2 ms to minimize.
[2024-05-27 15:16:48] [INFO ] Deduced a trap composed of 41 places in 213 ms of which 2 ms to minimize.
[2024-05-27 15:16:48] [INFO ] Deduced a trap composed of 49 places in 194 ms of which 2 ms to minimize.
[2024-05-27 15:16:48] [INFO ] Deduced a trap composed of 49 places in 197 ms of which 2 ms to minimize.
[2024-05-27 15:16:48] [INFO ] Deduced a trap composed of 65 places in 195 ms of which 2 ms to minimize.
[2024-05-27 15:16:49] [INFO ] Deduced a trap composed of 49 places in 193 ms of which 2 ms to minimize.
[2024-05-27 15:16:51] [INFO ] Deduced a trap composed of 36 places in 237 ms of which 2 ms to minimize.
[2024-05-27 15:16:52] [INFO ] Deduced a trap composed of 35 places in 235 ms of which 2 ms to minimize.
[2024-05-27 15:16:52] [INFO ] Deduced a trap composed of 34 places in 234 ms of which 2 ms to minimize.
[2024-05-27 15:16:52] [INFO ] Deduced a trap composed of 37 places in 203 ms of which 2 ms to minimize.
[2024-05-27 15:16:52] [INFO ] Deduced a trap composed of 37 places in 198 ms of which 1 ms to minimize.
[2024-05-27 15:16:53] [INFO ] Deduced a trap composed of 59 places in 136 ms of which 2 ms to minimize.
[2024-05-27 15:16:53] [INFO ] Deduced a trap composed of 59 places in 152 ms of which 2 ms to minimize.
[2024-05-27 15:16:53] [INFO ] Deduced a trap composed of 51 places in 137 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 296/938 variables, and 55 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/296 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 1521/1521 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1521 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/296 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-05-27 15:17:00] [INFO ] Deduced a trap composed of 32 places in 197 ms of which 2 ms to minimize.
[2024-05-27 15:17:01] [INFO ] Deduced a trap composed of 34 places in 194 ms of which 2 ms to minimize.
[2024-05-27 15:17:01] [INFO ] Deduced a trap composed of 38 places in 133 ms of which 2 ms to minimize.
[2024-05-27 15:17:09] [INFO ] Deduced a trap composed of 31 places in 205 ms of which 1 ms to minimize.
[2024-05-27 15:17:09] [INFO ] Deduced a trap composed of 21 places in 208 ms of which 2 ms to minimize.
[2024-05-27 15:17:10] [INFO ] Deduced a trap composed of 30 places in 204 ms of which 2 ms to minimize.
[2024-05-27 15:17:11] [INFO ] Deduced a trap composed of 49 places in 136 ms of which 2 ms to minimize.
[2024-05-27 15:17:11] [INFO ] Deduced a trap composed of 49 places in 194 ms of which 1 ms to minimize.
[2024-05-27 15:17:11] [INFO ] Deduced a trap composed of 49 places in 127 ms of which 2 ms to minimize.
[2024-05-27 15:17:11] [INFO ] Deduced a trap composed of 41 places in 192 ms of which 2 ms to minimize.
[2024-05-27 15:17:14] [INFO ] Deduced a trap composed of 49 places in 122 ms of which 1 ms to minimize.
[2024-05-27 15:17:14] [INFO ] Deduced a trap composed of 49 places in 98 ms of which 1 ms to minimize.
[2024-05-27 15:17:14] [INFO ] Deduced a trap composed of 46 places in 105 ms of which 1 ms to minimize.
[2024-05-27 15:17:14] [INFO ] Deduced a trap composed of 45 places in 102 ms of which 1 ms to minimize.
[2024-05-27 15:17:15] [INFO ] Deduced a trap composed of 38 places in 88 ms of which 2 ms to minimize.
[2024-05-27 15:17:15] [INFO ] Deduced a trap composed of 40 places in 104 ms of which 1 ms to minimize.
[2024-05-27 15:17:15] [INFO ] Deduced a trap composed of 59 places in 106 ms of which 2 ms to minimize.
[2024-05-27 15:17:15] [INFO ] Deduced a trap composed of 56 places in 114 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/296 variables, 18/73 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-05-27 15:17:25] [INFO ] Deduced a trap composed of 21 places in 231 ms of which 2 ms to minimize.
[2024-05-27 15:17:26] [INFO ] Deduced a trap composed of 49 places in 216 ms of which 2 ms to minimize.
[2024-05-27 15:17:27] [INFO ] Deduced a trap composed of 41 places in 226 ms of which 2 ms to minimize.
[2024-05-27 15:17:27] [INFO ] Deduced a trap composed of 65 places in 188 ms of which 2 ms to minimize.
[2024-05-27 15:17:27] [INFO ] Deduced a trap composed of 41 places in 217 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 296/938 variables, and 78 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/296 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 0/1521 constraints, Known Traps: 43/43 constraints]
After SMT, in 63423ms problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 63436ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 65545 ms. Remains : 296/296 places, 1531/1531 transitions.
Built C files in :
/tmp/ltsmin3384964968107306782
[2024-05-27 15:17:29] [INFO ] Too many transitions (1531) to apply POR reductions. Disabling POR matrices.
[2024-05-27 15:17:29] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3384964968107306782
Running compilation step : cd /tmp/ltsmin3384964968107306782;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3384964968107306782;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3384964968107306782;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-27 15:17:32] [INFO ] Flatten gal took : 87 ms
[2024-05-27 15:17:32] [INFO ] Flatten gal took : 84 ms
[2024-05-27 15:17:32] [INFO ] Time to serialize gal into /tmp/LTL6871934014139225265.gal : 7 ms
[2024-05-27 15:17:32] [INFO ] Time to serialize properties into /tmp/LTL13623970831616853844.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6871934014139225265.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7920693776910241577.hoa' '-atoms' '/tmp/LTL13623970831616853844.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL13623970831616853844.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7920693776910241577.hoa
Detected timeout of ITS tools.
[2024-05-27 15:17:47] [INFO ] Flatten gal took : 53 ms
[2024-05-27 15:17:47] [INFO ] Flatten gal took : 53 ms
[2024-05-27 15:17:47] [INFO ] Time to serialize gal into /tmp/LTL7832982346778396591.gal : 8 ms
[2024-05-27 15:17:47] [INFO ] Time to serialize properties into /tmp/LTL4414218894706300101.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7832982346778396591.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4414218894706300101.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(F("(FMCb<=((((wait_msg_0+wait_msg_1)+(wait_msg_2+wait_msg_3))+((wait_msg_4+wait_msg_5)+(wait_msg_6+wait_msg_7)))+(wait_msg_8+wait...169
Formula 0 simplified : FG!"(FMCb<=((((wait_msg_0+wait_msg_1)+(wait_msg_2+wait_msg_3))+((wait_msg_4+wait_msg_5)+(wait_msg_6+wait_msg_7)))+(wait_msg_8+wait_m...163
Detected timeout of ITS tools.
[2024-05-27 15:18:03] [INFO ] Flatten gal took : 52 ms
[2024-05-27 15:18:03] [INFO ] Applying decomposition
[2024-05-27 15:18:03] [INFO ] Flatten gal took : 52 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2453418035318345399.txt' '-o' '/tmp/graph2453418035318345399.bin' '-w' '/tmp/graph2453418035318345399.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2453418035318345399.bin' '-l' '-1' '-v' '-w' '/tmp/graph2453418035318345399.weights' '-q' '0' '-e' '0.001'
[2024-05-27 15:18:03] [INFO ] Decomposing Gal with order
[2024-05-27 15:18:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 15:18:03] [INFO ] Removed a total of 1460 redundant transitions.
[2024-05-27 15:18:03] [INFO ] Flatten gal took : 642 ms
[2024-05-27 15:18:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 3536 labels/synchronizations in 116 ms.
[2024-05-27 15:18:04] [INFO ] Time to serialize gal into /tmp/LTL1989027818711581442.gal : 115 ms
[2024-05-27 15:18:04] [INFO ] Time to serialize properties into /tmp/LTL2159158906776133116.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1989027818711581442.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2159158906776133116.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(F("(gu6.FMCb<=((((gu6.wait_msg_0+gu6.wait_msg_1)+(gu6.wait_msg_2+gu6.wait_msg_3))+((gu6.wait_msg_4+gu6.wait_msg_5)+(gu6.wait_msg_...213
Formula 0 simplified : FG!"(gu6.FMCb<=((((gu6.wait_msg_0+gu6.wait_msg_1)+(gu6.wait_msg_2+gu6.wait_msg_3))+((gu6.wait_msg_4+gu6.wait_msg_5)+(gu6.wait_msg_6+...207
Detected timeout of ITS tools.
Treatment of property SafeBus-COL-10-LTLCardinality-03 finished in 192833 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)))'
Support contains 11 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 12 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-05-27 15:18:19] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
// Phase 1: matrix 642 rows 306 cols
[2024-05-27 15:18:19] [INFO ] Computed 45 invariants in 8 ms
[2024-05-27 15:18:19] [INFO ] Implicit Places using invariants in 390 ms returned [231, 232, 233, 234, 235, 236, 237, 238, 239, 240]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 392 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 296/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 4 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 408 ms. Remains : 296/306 places, 1531/1531 transitions.
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : SafeBus-COL-10-LTLCardinality-04
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA SafeBus-COL-10-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SafeBus-COL-10-LTLCardinality-04 finished in 513 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 306 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 85 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-05-27 15:18:19] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 15:18:19] [INFO ] Invariant cache hit.
[2024-05-27 15:18:20] [INFO ] Implicit Places using invariants in 421 ms returned [231, 232, 233, 234, 235, 236, 237, 238, 239, 240]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 423 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 296/306 places, 1531/1531 transitions.
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 10 Pre rules applied. Total rules applied 0 place count 296 transition count 1521
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 286 transition count 1521
Applied a total of 20 rules in 96 ms. Remains 286 /296 variables (removed 10) and now considering 1521/1531 (removed 10) transitions.
[2024-05-27 15:18:20] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
// Phase 1: matrix 632 rows 286 cols
[2024-05-27 15:18:20] [INFO ] Computed 35 invariants in 10 ms
[2024-05-27 15:18:20] [INFO ] Implicit Places using invariants in 359 ms returned []
[2024-05-27 15:18:20] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
[2024-05-27 15:18:20] [INFO ] Invariant cache hit.
[2024-05-27 15:18:21] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-27 15:18:22] [INFO ] Implicit Places using invariants and state equation in 1704 ms returned []
Implicit Place search using SMT with State Equation took 2065 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 286/306 places, 1521/1531 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2670 ms. Remains : 286/306 places, 1521/1531 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : SafeBus-COL-10-LTLCardinality-07
Product exploration explored 100000 steps with 0 reset in 432 ms.
Stack based approach found an accepted trace after 1065 steps with 0 reset with depth 1066 and stack size 1066 in 5 ms.
FORMULA SafeBus-COL-10-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property SafeBus-COL-10-LTLCardinality-07 finished in 3152 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0 U (G(p0)||(p0&&(G(p1)||(p1&&F(!p2)))))))))'
Support contains 110 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 4 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-05-27 15:18:23] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
// Phase 1: matrix 642 rows 306 cols
[2024-05-27 15:18:23] [INFO ] Computed 45 invariants in 9 ms
[2024-05-27 15:18:23] [INFO ] Implicit Places using invariants in 375 ms returned [231, 232, 233, 234, 235, 236, 237, 238, 239, 240]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 377 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 296/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 13 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 395 ms. Remains : 296/306 places, 1531/1531 transitions.
Stuttering acceptance computed with spot in 170 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0) p2), (AND (NOT p0) p2)]
Running random walk in product with property : SafeBus-COL-10-LTLCardinality-10
Product exploration explored 100000 steps with 50000 reset in 434 ms.
Product exploration explored 100000 steps with 50000 reset in 454 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 : [(AND p1 p0 (NOT p2)), (X (NOT p2)), (X (NOT (AND p1 p2 p0))), (X p0), (X (NOT (AND (NOT p1) p0))), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND p1 p2 p0)))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 14 factoid took 138 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SafeBus-COL-10-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SafeBus-COL-10-LTLCardinality-10 finished in 1623 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(F((p0||G(!p1)))))'
Support contains 20 out of 306 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 119 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-05-27 15:18:24] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 15:18:24] [INFO ] Invariant cache hit.
[2024-05-27 15:18:25] [INFO ] Implicit Places using invariants in 416 ms returned [231, 232, 233, 234, 235, 236, 237, 238, 239, 240]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 418 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 296/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 114 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 651 ms. Remains : 296/306 places, 1531/1531 transitions.
Stuttering acceptance computed with spot in 73 ms :[(AND p1 (NOT p0)), (AND p1 (NOT p0))]
Running random walk in product with property : SafeBus-COL-10-LTLCardinality-13
Product exploration explored 100000 steps with 5177 reset in 351 ms.
Product exploration explored 100000 steps with 5242 reset in 361 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 : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 193 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
RANDOM walk for 58 steps (0 resets) in 5 ms. (9 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT (AND (NOT p0) p1))), (F (NOT p1)), (F p0)]
Knowledge based reduction with 9 factoid took 203 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
[2024-05-27 15:18:26] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
// Phase 1: matrix 642 rows 296 cols
[2024-05-27 15:18:26] [INFO ] Computed 35 invariants in 10 ms
[2024-05-27 15:18:27] [INFO ] [Real]Absence check using 14 positive place invariants in 12 ms returned sat
[2024-05-27 15:18:27] [INFO ] [Real]Absence check using 14 positive and 21 generalized place invariants in 29 ms returned sat
[2024-05-27 15:18:27] [INFO ] [Real]Absence check using state equation in 514 ms returned sat
[2024-05-27 15:18:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 15:18:28] [INFO ] [Nat]Absence check using 14 positive place invariants in 10 ms returned sat
[2024-05-27 15:18:28] [INFO ] [Nat]Absence check using 14 positive and 21 generalized place invariants in 171 ms returned sat
[2024-05-27 15:18:28] [INFO ] [Nat]Absence check using state equation in 281 ms returned sat
[2024-05-27 15:18:28] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-27 15:18:28] [INFO ] [Nat]Added 111 Read/Feed constraints in 170 ms returned sat
[2024-05-27 15:18:28] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 612 transitions) in 48 ms.
[2024-05-27 15:18:29] [INFO ] Added : 1 causal constraints over 1 iterations in 154 ms. Result :sat
Could not prove EG (AND (NOT p0) p1)
Support contains 20 out of 296 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 296/296 places, 1531/1531 transitions.
Applied a total of 0 rules in 115 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-05-27 15:18:29] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 15:18:29] [INFO ] Invariant cache hit.
[2024-05-27 15:18:29] [INFO ] Implicit Places using invariants in 379 ms returned []
[2024-05-27 15:18:29] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 15:18:29] [INFO ] Invariant cache hit.
[2024-05-27 15:18:29] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-27 15:18:31] [INFO ] Implicit Places using invariants and state equation in 1652 ms returned []
Implicit Place search using SMT with State Equation took 2033 ms to find 0 implicit places.
[2024-05-27 15:18:31] [INFO ] Redundant transitions in 19 ms returned []
Running 1521 sub problems to find dead transitions.
[2024-05-27 15:18:31] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 15:18:31] [INFO ] Invariant cache hit.
[2024-05-27 15:18:31] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/296 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-05-27 15:18:43] [INFO ] Deduced a trap composed of 37 places in 196 ms of which 2 ms to minimize.
[2024-05-27 15:18:44] [INFO ] Deduced a trap composed of 53 places in 100 ms of which 1 ms to minimize.
[2024-05-27 15:18:51] [INFO ] Deduced a trap composed of 21 places in 210 ms of which 2 ms to minimize.
[2024-05-27 15:18:51] [INFO ] Deduced a trap composed of 30 places in 208 ms of which 2 ms to minimize.
[2024-05-27 15:18:51] [INFO ] Deduced a trap composed of 30 places in 209 ms of which 2 ms to minimize.
[2024-05-27 15:18:52] [INFO ] Deduced a trap composed of 21 places in 213 ms of which 2 ms to minimize.
[2024-05-27 15:18:52] [INFO ] Deduced a trap composed of 21 places in 194 ms of which 2 ms to minimize.
[2024-05-27 15:18:53] [INFO ] Deduced a trap composed of 41 places in 190 ms of which 1 ms to minimize.
[2024-05-27 15:18:53] [INFO ] Deduced a trap composed of 49 places in 202 ms of which 3 ms to minimize.
[2024-05-27 15:18:53] [INFO ] Deduced a trap composed of 49 places in 188 ms of which 2 ms to minimize.
[2024-05-27 15:18:54] [INFO ] Deduced a trap composed of 65 places in 195 ms of which 2 ms to minimize.
[2024-05-27 15:18:54] [INFO ] Deduced a trap composed of 49 places in 198 ms of which 1 ms to minimize.
[2024-05-27 15:18:56] [INFO ] Deduced a trap composed of 36 places in 200 ms of which 2 ms to minimize.
[2024-05-27 15:18:57] [INFO ] Deduced a trap composed of 35 places in 200 ms of which 2 ms to minimize.
[2024-05-27 15:18:57] [INFO ] Deduced a trap composed of 34 places in 205 ms of which 2 ms to minimize.
[2024-05-27 15:18:57] [INFO ] Deduced a trap composed of 37 places in 201 ms of which 2 ms to minimize.
[2024-05-27 15:18:57] [INFO ] Deduced a trap composed of 37 places in 193 ms of which 2 ms to minimize.
[2024-05-27 15:18:58] [INFO ] Deduced a trap composed of 59 places in 137 ms of which 2 ms to minimize.
[2024-05-27 15:18:58] [INFO ] Deduced a trap composed of 59 places in 147 ms of which 2 ms to minimize.
[2024-05-27 15:18:58] [INFO ] Deduced a trap composed of 51 places in 133 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 296/938 variables, and 55 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/296 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 1521/1521 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1521 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/296 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-05-27 15:19:06] [INFO ] Deduced a trap composed of 32 places in 196 ms of which 2 ms to minimize.
[2024-05-27 15:19:06] [INFO ] Deduced a trap composed of 34 places in 209 ms of which 2 ms to minimize.
[2024-05-27 15:19:06] [INFO ] Deduced a trap composed of 38 places in 135 ms of which 2 ms to minimize.
[2024-05-27 15:19:15] [INFO ] Deduced a trap composed of 31 places in 212 ms of which 2 ms to minimize.
[2024-05-27 15:19:15] [INFO ] Deduced a trap composed of 21 places in 208 ms of which 2 ms to minimize.
[2024-05-27 15:19:15] [INFO ] Deduced a trap composed of 30 places in 199 ms of which 2 ms to minimize.
[2024-05-27 15:19:16] [INFO ] Deduced a trap composed of 49 places in 130 ms of which 3 ms to minimize.
[2024-05-27 15:19:16] [INFO ] Deduced a trap composed of 49 places in 186 ms of which 2 ms to minimize.
[2024-05-27 15:19:16] [INFO ] Deduced a trap composed of 49 places in 135 ms of which 2 ms to minimize.
[2024-05-27 15:19:17] [INFO ] Deduced a trap composed of 41 places in 198 ms of which 2 ms to minimize.
[2024-05-27 15:19:19] [INFO ] Deduced a trap composed of 49 places in 121 ms of which 2 ms to minimize.
[2024-05-27 15:19:20] [INFO ] Deduced a trap composed of 49 places in 95 ms of which 1 ms to minimize.
[2024-05-27 15:19:20] [INFO ] Deduced a trap composed of 46 places in 105 ms of which 2 ms to minimize.
[2024-05-27 15:19:20] [INFO ] Deduced a trap composed of 45 places in 101 ms of which 2 ms to minimize.
[2024-05-27 15:19:20] [INFO ] Deduced a trap composed of 38 places in 90 ms of which 4 ms to minimize.
[2024-05-27 15:19:20] [INFO ] Deduced a trap composed of 40 places in 87 ms of which 1 ms to minimize.
[2024-05-27 15:19:20] [INFO ] Deduced a trap composed of 59 places in 101 ms of which 1 ms to minimize.
[2024-05-27 15:19:20] [INFO ] Deduced a trap composed of 56 places in 93 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/296 variables, 18/73 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-05-27 15:19:30] [INFO ] Deduced a trap composed of 21 places in 195 ms of which 1 ms to minimize.
[2024-05-27 15:19:31] [INFO ] Deduced a trap composed of 49 places in 185 ms of which 1 ms to minimize.
[2024-05-27 15:19:31] [INFO ] Deduced a trap composed of 41 places in 193 ms of which 2 ms to minimize.
[2024-05-27 15:19:32] [INFO ] Deduced a trap composed of 65 places in 185 ms of which 2 ms to minimize.
[2024-05-27 15:19:32] [INFO ] Deduced a trap composed of 41 places in 182 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 296/938 variables, and 78 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/296 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 0/1521 constraints, Known Traps: 43/43 constraints]
After SMT, in 63704ms problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 63718ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 65893 ms. Remains : 296/296 places, 1531/1531 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 109 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
RANDOM walk for 74 steps (0 resets) in 6 ms. (10 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT (AND (NOT p0) p1))), (F (NOT p1)), (F p0)]
Knowledge based reduction with 9 factoid took 245 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
[2024-05-27 15:19:35] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 15:19:35] [INFO ] Invariant cache hit.
[2024-05-27 15:19:35] [INFO ] [Real]Absence check using 14 positive place invariants in 7 ms returned sat
[2024-05-27 15:19:35] [INFO ] [Real]Absence check using 14 positive and 21 generalized place invariants in 38 ms returned sat
[2024-05-27 15:19:36] [INFO ] [Real]Absence check using state equation in 579 ms returned sat
[2024-05-27 15:19:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 15:19:37] [INFO ] [Nat]Absence check using 14 positive place invariants in 8 ms returned sat
[2024-05-27 15:19:37] [INFO ] [Nat]Absence check using 14 positive and 21 generalized place invariants in 17 ms returned sat
[2024-05-27 15:19:37] [INFO ] [Nat]Absence check using state equation in 268 ms returned sat
[2024-05-27 15:19:37] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-27 15:19:37] [INFO ] [Nat]Added 111 Read/Feed constraints in 110 ms returned sat
[2024-05-27 15:19:37] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 612 transitions) in 48 ms.
[2024-05-27 15:19:37] [INFO ] Added : 0 causal constraints over 0 iterations in 119 ms. Result :sat
Could not prove EG (AND (NOT p0) p1)
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 5230 reset in 381 ms.
Product exploration explored 100000 steps with 5184 reset in 401 ms.
Built C files in :
/tmp/ltsmin17681217282113553748
[2024-05-27 15:19:38] [INFO ] Too many transitions (1531) to apply POR reductions. Disabling POR matrices.
[2024-05-27 15:19:38] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17681217282113553748
Running compilation step : cd /tmp/ltsmin17681217282113553748;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17681217282113553748;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17681217282113553748;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 20 out of 296 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 296/296 places, 1531/1531 transitions.
Applied a total of 0 rules in 118 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-05-27 15:19:41] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 15:19:41] [INFO ] Invariant cache hit.
[2024-05-27 15:19:41] [INFO ] Implicit Places using invariants in 378 ms returned []
[2024-05-27 15:19:41] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 15:19:41] [INFO ] Invariant cache hit.
[2024-05-27 15:19:42] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-27 15:19:43] [INFO ] Implicit Places using invariants and state equation in 1681 ms returned []
Implicit Place search using SMT with State Equation took 2063 ms to find 0 implicit places.
[2024-05-27 15:19:43] [INFO ] Redundant transitions in 20 ms returned []
Running 1521 sub problems to find dead transitions.
[2024-05-27 15:19:43] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 15:19:43] [INFO ] Invariant cache hit.
[2024-05-27 15:19:43] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/296 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-05-27 15:19:55] [INFO ] Deduced a trap composed of 37 places in 188 ms of which 2 ms to minimize.
[2024-05-27 15:19:56] [INFO ] Deduced a trap composed of 53 places in 100 ms of which 1 ms to minimize.
[2024-05-27 15:20:03] [INFO ] Deduced a trap composed of 21 places in 212 ms of which 1 ms to minimize.
[2024-05-27 15:20:04] [INFO ] Deduced a trap composed of 30 places in 206 ms of which 2 ms to minimize.
[2024-05-27 15:20:04] [INFO ] Deduced a trap composed of 30 places in 208 ms of which 1 ms to minimize.
[2024-05-27 15:20:04] [INFO ] Deduced a trap composed of 21 places in 200 ms of which 2 ms to minimize.
[2024-05-27 15:20:04] [INFO ] Deduced a trap composed of 21 places in 210 ms of which 2 ms to minimize.
[2024-05-27 15:20:05] [INFO ] Deduced a trap composed of 41 places in 197 ms of which 2 ms to minimize.
[2024-05-27 15:20:06] [INFO ] Deduced a trap composed of 49 places in 303 ms of which 2 ms to minimize.
[2024-05-27 15:20:06] [INFO ] Deduced a trap composed of 49 places in 202 ms of which 2 ms to minimize.
[2024-05-27 15:20:06] [INFO ] Deduced a trap composed of 65 places in 198 ms of which 2 ms to minimize.
[2024-05-27 15:20:06] [INFO ] Deduced a trap composed of 49 places in 196 ms of which 2 ms to minimize.
[2024-05-27 15:20:09] [INFO ] Deduced a trap composed of 36 places in 206 ms of which 2 ms to minimize.
[2024-05-27 15:20:09] [INFO ] Deduced a trap composed of 35 places in 214 ms of which 1 ms to minimize.
[2024-05-27 15:20:09] [INFO ] Deduced a trap composed of 34 places in 204 ms of which 2 ms to minimize.
[2024-05-27 15:20:10] [INFO ] Deduced a trap composed of 37 places in 206 ms of which 2 ms to minimize.
[2024-05-27 15:20:10] [INFO ] Deduced a trap composed of 37 places in 217 ms of which 2 ms to minimize.
[2024-05-27 15:20:10] [INFO ] Deduced a trap composed of 59 places in 134 ms of which 1 ms to minimize.
[2024-05-27 15:20:10] [INFO ] Deduced a trap composed of 59 places in 139 ms of which 2 ms to minimize.
[2024-05-27 15:20:10] [INFO ] Deduced a trap composed of 51 places in 130 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 296/938 variables, and 55 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/296 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 1521/1521 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1521 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/296 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-05-27 15:20:18] [INFO ] Deduced a trap composed of 32 places in 204 ms of which 2 ms to minimize.
[2024-05-27 15:20:19] [INFO ] Deduced a trap composed of 34 places in 193 ms of which 2 ms to minimize.
[2024-05-27 15:20:19] [INFO ] Deduced a trap composed of 38 places in 132 ms of which 2 ms to minimize.
[2024-05-27 15:20:27] [INFO ] Deduced a trap composed of 31 places in 246 ms of which 1 ms to minimize.
[2024-05-27 15:20:27] [INFO ] Deduced a trap composed of 21 places in 215 ms of which 2 ms to minimize.
[2024-05-27 15:20:28] [INFO ] Deduced a trap composed of 30 places in 210 ms of which 2 ms to minimize.
[2024-05-27 15:20:29] [INFO ] Deduced a trap composed of 49 places in 140 ms of which 2 ms to minimize.
[2024-05-27 15:20:29] [INFO ] Deduced a trap composed of 49 places in 193 ms of which 2 ms to minimize.
[2024-05-27 15:20:29] [INFO ] Deduced a trap composed of 49 places in 138 ms of which 1 ms to minimize.
[2024-05-27 15:20:29] [INFO ] Deduced a trap composed of 41 places in 200 ms of which 2 ms to minimize.
[2024-05-27 15:20:32] [INFO ] Deduced a trap composed of 49 places in 127 ms of which 2 ms to minimize.
[2024-05-27 15:20:32] [INFO ] Deduced a trap composed of 49 places in 102 ms of which 1 ms to minimize.
[2024-05-27 15:20:32] [INFO ] Deduced a trap composed of 46 places in 99 ms of which 1 ms to minimize.
[2024-05-27 15:20:32] [INFO ] Deduced a trap composed of 45 places in 104 ms of which 2 ms to minimize.
[2024-05-27 15:20:33] [INFO ] Deduced a trap composed of 38 places in 89 ms of which 1 ms to minimize.
[2024-05-27 15:20:33] [INFO ] Deduced a trap composed of 40 places in 95 ms of which 1 ms to minimize.
[2024-05-27 15:20:33] [INFO ] Deduced a trap composed of 59 places in 110 ms of which 2 ms to minimize.
[2024-05-27 15:20:33] [INFO ] Deduced a trap composed of 56 places in 98 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/296 variables, 18/73 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-05-27 15:20:43] [INFO ] Deduced a trap composed of 21 places in 203 ms of which 2 ms to minimize.
[2024-05-27 15:20:44] [INFO ] Deduced a trap composed of 49 places in 188 ms of which 2 ms to minimize.
[2024-05-27 15:20:44] [INFO ] Deduced a trap composed of 41 places in 180 ms of which 1 ms to minimize.
[2024-05-27 15:20:44] [INFO ] Deduced a trap composed of 65 places in 183 ms of which 2 ms to minimize.
[2024-05-27 15:20:45] [INFO ] Deduced a trap composed of 41 places in 187 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 296/938 variables, and 78 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/296 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 0/1521 constraints, Known Traps: 43/43 constraints]
After SMT, in 63907ms problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 63920ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 66132 ms. Remains : 296/296 places, 1531/1531 transitions.
Built C files in :
/tmp/ltsmin6906068132513674849
[2024-05-27 15:20:47] [INFO ] Too many transitions (1531) to apply POR reductions. Disabling POR matrices.
[2024-05-27 15:20:47] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6906068132513674849
Running compilation step : cd /tmp/ltsmin6906068132513674849;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6906068132513674849;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6906068132513674849;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-27 15:20:50] [INFO ] Flatten gal took : 65 ms
[2024-05-27 15:20:50] [INFO ] Flatten gal took : 53 ms
[2024-05-27 15:20:50] [INFO ] Time to serialize gal into /tmp/LTL13371520327140161048.gal : 7 ms
[2024-05-27 15:20:50] [INFO ] Time to serialize properties into /tmp/LTL5430375799838180138.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13371520327140161048.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3885486830593522352.hoa' '-atoms' '/tmp/LTL5430375799838180138.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL5430375799838180138.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3885486830593522352.hoa
Detected timeout of ITS tools.
[2024-05-27 15:21:05] [INFO ] Flatten gal took : 51 ms
[2024-05-27 15:21:06] [INFO ] Flatten gal took : 52 ms
[2024-05-27 15:21:06] [INFO ] Time to serialize gal into /tmp/LTL11353915651919590810.gal : 7 ms
[2024-05-27 15:21:06] [INFO ] Time to serialize properties into /tmp/LTL887763868586145159.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11353915651919590810.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL887763868586145159.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(F(("(((((RMC_0+RMC_1)+(RMC_2+RMC_3))+((RMC_4+RMC_5)+(RMC_6+RMC_7)))+(RMC_8+RMC_9))>=2)")||(G("(((((MSG_0+MSG_1)+(MSG_2+MSG_3))+((...209
Formula 0 simplified : G(F!"(((((MSG_0+MSG_1)+(MSG_2+MSG_3))+((MSG_4+MSG_5)+(MSG_6+MSG_7)))+(MSG_8+MSG_9))>=1)" & FG!"(((((RMC_0+RMC_1)+(RMC_2+RMC_3))+((RM...202
Detected timeout of ITS tools.
[2024-05-27 15:21:21] [INFO ] Flatten gal took : 53 ms
[2024-05-27 15:21:21] [INFO ] Applying decomposition
[2024-05-27 15:21:21] [INFO ] Flatten gal took : 52 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1893857672002743654.txt' '-o' '/tmp/graph1893857672002743654.bin' '-w' '/tmp/graph1893857672002743654.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1893857672002743654.bin' '-l' '-1' '-v' '-w' '/tmp/graph1893857672002743654.weights' '-q' '0' '-e' '0.001'
[2024-05-27 15:21:21] [INFO ] Decomposing Gal with order
[2024-05-27 15:21:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 15:21:21] [INFO ] Removed a total of 1443 redundant transitions.
[2024-05-27 15:21:21] [INFO ] Flatten gal took : 602 ms
[2024-05-27 15:21:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 3409 labels/synchronizations in 68 ms.
[2024-05-27 15:21:22] [INFO ] Time to serialize gal into /tmp/LTL12272300458656300445.gal : 7 ms
[2024-05-27 15:21:22] [INFO ] Time to serialize properties into /tmp/LTL5323465029181541922.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12272300458656300445.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5323465029181541922.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F(("(((((gu5.RMC_0+gu5.RMC_1)+(gu5.RMC_2+gu5.RMC_3))+((gu5.RMC_4+gu5.RMC_5)+(gu5.RMC_6+gu5.RMC_7)))+(gu5.RMC_8+gu5.RMC_9))>=2)")|...299
Formula 0 simplified : G(F!"(((((gu14.MSG_0+gu14.MSG_1)+(gu14.MSG_2+gu14.MSG_3))+((gu14.MSG_4+gu14.MSG_5)+(gu14.MSG_6+gu14.MSG_7)))+(gu14.MSG_8+gu14.MSG_9)...292
Detected timeout of ITS tools.
Treatment of property SafeBus-COL-10-LTLCardinality-13 finished in 192555 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p0)) U p0)))'
Support contains 10 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 9 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-05-27 15:21:37] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
// Phase 1: matrix 642 rows 306 cols
[2024-05-27 15:21:37] [INFO ] Computed 45 invariants in 6 ms
[2024-05-27 15:21:37] [INFO ] Implicit Places using invariants in 391 ms returned []
[2024-05-27 15:21:37] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 15:21:37] [INFO ] Invariant cache hit.
[2024-05-27 15:21:37] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-27 15:21:39] [INFO ] Implicit Places using invariants and state equation in 1749 ms returned []
Implicit Place search using SMT with State Equation took 2140 ms to find 0 implicit places.
Running 1521 sub problems to find dead transitions.
[2024-05-27 15:21:39] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 15:21:39] [INFO ] Invariant cache hit.
[2024-05-27 15:21:39] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/45 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-05-27 15:21:51] [INFO ] Deduced a trap composed of 35 places in 198 ms of which 1 ms to minimize.
[2024-05-27 15:21:52] [INFO ] Deduced a trap composed of 59 places in 196 ms of which 2 ms to minimize.
[2024-05-27 15:21:52] [INFO ] Deduced a trap composed of 42 places in 200 ms of which 1 ms to minimize.
[2024-05-27 15:21:52] [INFO ] Deduced a trap composed of 56 places in 131 ms of which 2 ms to minimize.
[2024-05-27 15:21:52] [INFO ] Deduced a trap composed of 40 places in 131 ms of which 2 ms to minimize.
[2024-05-27 15:21:52] [INFO ] Deduced a trap composed of 50 places in 135 ms of which 2 ms to minimize.
[2024-05-27 15:21:52] [INFO ] Deduced a trap composed of 49 places in 125 ms of which 2 ms to minimize.
[2024-05-27 15:21:53] [INFO ] Deduced a trap composed of 48 places in 121 ms of which 2 ms to minimize.
[2024-05-27 15:22:01] [INFO ] Deduced a trap composed of 31 places in 213 ms of which 2 ms to minimize.
[2024-05-27 15:22:01] [INFO ] Deduced a trap composed of 30 places in 211 ms of which 2 ms to minimize.
[2024-05-27 15:22:02] [INFO ] Deduced a trap composed of 30 places in 202 ms of which 2 ms to minimize.
[2024-05-27 15:22:02] [INFO ] Deduced a trap composed of 21 places in 209 ms of which 1 ms to minimize.
[2024-05-27 15:22:02] [INFO ] Deduced a trap composed of 30 places in 199 ms of which 2 ms to minimize.
[2024-05-27 15:22:02] [INFO ] Deduced a trap composed of 30 places in 209 ms of which 2 ms to minimize.
[2024-05-27 15:22:03] [INFO ] Deduced a trap composed of 21 places in 207 ms of which 2 ms to minimize.
[2024-05-27 15:22:03] [INFO ] Deduced a trap composed of 30 places in 215 ms of which 2 ms to minimize.
[2024-05-27 15:22:03] [INFO ] Deduced a trap composed of 30 places in 199 ms of which 2 ms to minimize.
[2024-05-27 15:22:04] [INFO ] Deduced a trap composed of 65 places in 209 ms of which 2 ms to minimize.
[2024-05-27 15:22:04] [INFO ] Deduced a trap composed of 49 places in 212 ms of which 2 ms to minimize.
[2024-05-27 15:22:04] [INFO ] Deduced a trap composed of 49 places in 211 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 306/948 variables, and 65 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 1521/1521 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1521 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/45 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-05-27 15:22:24] [INFO ] Deduced a trap composed of 65 places in 116 ms of which 2 ms to minimize.
[2024-05-27 15:22:24] [INFO ] Deduced a trap composed of 65 places in 119 ms of which 1 ms to minimize.
[2024-05-27 15:22:24] [INFO ] Deduced a trap composed of 65 places in 116 ms of which 1 ms to minimize.
[2024-05-27 15:22:24] [INFO ] Deduced a trap composed of 57 places in 141 ms of which 1 ms to minimize.
[2024-05-27 15:22:24] [INFO ] Deduced a trap composed of 50 places in 137 ms of which 2 ms to minimize.
[2024-05-27 15:22:25] [INFO ] Deduced a trap composed of 44 places in 135 ms of which 2 ms to minimize.
[2024-05-27 15:22:25] [INFO ] Deduced a trap composed of 65 places in 208 ms of which 2 ms to minimize.
[2024-05-27 15:22:25] [INFO ] Deduced a trap composed of 57 places in 192 ms of which 2 ms to minimize.
[2024-05-27 15:22:28] [INFO ] Deduced a trap composed of 44 places in 208 ms of which 2 ms to minimize.
[2024-05-27 15:22:28] [INFO ] Deduced a trap composed of 41 places in 209 ms of which 1 ms to minimize.
[2024-05-27 15:22:28] [INFO ] Deduced a trap composed of 53 places in 205 ms of which 2 ms to minimize.
[2024-05-27 15:22:28] [INFO ] Deduced a trap composed of 41 places in 202 ms of which 2 ms to minimize.
[2024-05-27 15:22:29] [INFO ] Deduced a trap composed of 40 places in 207 ms of which 2 ms to minimize.
[2024-05-27 15:22:29] [INFO ] Deduced a trap composed of 59 places in 135 ms of which 2 ms to minimize.
[2024-05-27 15:22:29] [INFO ] Deduced a trap composed of 49 places in 130 ms of which 1 ms to minimize.
[2024-05-27 15:22:29] [INFO ] Deduced a trap composed of 49 places in 117 ms of which 1 ms to minimize.
[2024-05-27 15:22:29] [INFO ] Deduced a trap composed of 57 places in 103 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 17/82 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-05-27 15:22:41] [INFO ] Deduced a trap composed of 49 places in 133 ms of which 2 ms to minimize.
[2024-05-27 15:22:41] [INFO ] Deduced a trap composed of 49 places in 141 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 306/948 variables, and 84 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 0/1521 constraints, Known Traps: 39/39 constraints]
After SMT, in 64201ms problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 64219ms
Finished structural reductions in LTL mode , in 1 iterations and 66375 ms. Remains : 306/306 places, 1531/1531 transitions.
Stuttering acceptance computed with spot in 158 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SafeBus-COL-10-LTLCardinality-15
Product exploration explored 100000 steps with 50000 reset in 280 ms.
Product exploration explored 100000 steps with 50000 reset in 274 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 : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 14 ms. Reduced automaton from 4 states, 6 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SafeBus-COL-10-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SafeBus-COL-10-LTLCardinality-15 finished in 67123 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)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(!p1)))))'
[2024-05-27 15:22:44] [INFO ] Flatten gal took : 52 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin7731600247574626706
[2024-05-27 15:22:44] [INFO ] Too many transitions (1531) to apply POR reductions. Disabling POR matrices.
[2024-05-27 15:22:44] [INFO ] Applying decomposition
[2024-05-27 15:22:44] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7731600247574626706
Running compilation step : cd /tmp/ltsmin7731600247574626706;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-27 15:22:44] [INFO ] Flatten gal took : 63 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5893685845359252748.txt' '-o' '/tmp/graph5893685845359252748.bin' '-w' '/tmp/graph5893685845359252748.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5893685845359252748.bin' '-l' '-1' '-v' '-w' '/tmp/graph5893685845359252748.weights' '-q' '0' '-e' '0.001'
[2024-05-27 15:22:45] [INFO ] Decomposing Gal with order
[2024-05-27 15:22:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 15:22:45] [INFO ] Removed a total of 2283 redundant transitions.
[2024-05-27 15:22:45] [INFO ] Flatten gal took : 469 ms
[2024-05-27 15:22:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 2290 labels/synchronizations in 55 ms.
[2024-05-27 15:22:45] [INFO ] Time to serialize gal into /tmp/LTLCardinality15371683462206739044.gal : 8 ms
[2024-05-27 15:22:45] [INFO ] Time to serialize properties into /tmp/LTLCardinality15769042728890032626.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality15371683462206739044.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality15769042728890032626.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...299
Read 3 LTL properties
Checking formula 0 : !((F(G("((((((gi3.gu15.wait_msg_0+gi3.gu15.wait_msg_1)+(gi3.gu15.wait_msg_2+gi3.gu15.wait_msg_3))+((gi3.gu15.wait_msg_4+gi3.gu15.wait_...1997
Formula 0 simplified : GF!"((((((gi3.gu15.wait_msg_0+gi3.gu15.wait_msg_1)+(gi3.gu15.wait_msg_2+gi3.gu15.wait_msg_3))+((gi3.gu15.wait_msg_4+gi3.gu15.wait_ms...1991
Compilation finished in 3638 ms.
Running link step : cd /tmp/ltsmin7731600247574626706;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin7731600247574626706;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin7731600247574626706;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin7731600247574626706;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp1==true)))' '--buchi-type=spotba'

BK_STOP 1716823996055

--------------------
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-10"
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-10, 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-171679080200371"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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