Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r140-tall-162089128200642.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Peterson-PT-7, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r140-tall-162089128200642
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 21M
-rw-r--r-- 1 mcc users 1.4M May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 5.1M May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8M May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 7.8M May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 113K Mar 28 16:25 LTLCardinality.txt
-rw-r--r-- 1 mcc users 335K Mar 28 16:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 116K Mar 28 16:25 LTLFireability.txt
-rw-r--r-- 1 mcc users 380K Mar 28 16:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 159K Mar 27 07:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 427K Mar 27 07:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 127K Mar 25 08:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 418K Mar 25 08:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 23K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 47K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 2 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 2.3M May 5 16:51 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 Peterson-PT-7-CTLFireability-00
FORMULA_NAME Peterson-PT-7-CTLFireability-01
FORMULA_NAME Peterson-PT-7-CTLFireability-02
FORMULA_NAME Peterson-PT-7-CTLFireability-03
FORMULA_NAME Peterson-PT-7-CTLFireability-04
FORMULA_NAME Peterson-PT-7-CTLFireability-05
FORMULA_NAME Peterson-PT-7-CTLFireability-06
FORMULA_NAME Peterson-PT-7-CTLFireability-07
FORMULA_NAME Peterson-PT-7-CTLFireability-08
FORMULA_NAME Peterson-PT-7-CTLFireability-09
FORMULA_NAME Peterson-PT-7-CTLFireability-10
FORMULA_NAME Peterson-PT-7-CTLFireability-11
FORMULA_NAME Peterson-PT-7-CTLFireability-12
FORMULA_NAME Peterson-PT-7-CTLFireability-13
FORMULA_NAME Peterson-PT-7-CTLFireability-14
FORMULA_NAME Peterson-PT-7-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1621029330010

Running Version 0
[2021-05-14 21:55:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-14 21:55:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 21:55:31] [INFO ] Load time of PNML (sax parser for PT used): 218 ms
[2021-05-14 21:55:31] [INFO ] Transformed 1992 places.
[2021-05-14 21:55:31] [INFO ] Transformed 3096 transitions.
[2021-05-14 21:55:31] [INFO ] Found NUPN structural information;
[2021-05-14 21:55:31] [INFO ] Parsed PT model containing 1992 places and 3096 transitions in 272 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 352 ms.
Support contains 1992 out of 1992 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 63 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2021-05-14 21:55:33] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2021-05-14 21:55:33] [INFO ] Computed 31 place invariants in 39 ms
[2021-05-14 21:55:33] [INFO ] Implicit Places using invariants in 629 ms returned []
[2021-05-14 21:55:33] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2021-05-14 21:55:33] [INFO ] Computed 31 place invariants in 24 ms
[2021-05-14 21:55:34] [INFO ] State equation strengthened by 546 read => feed constraints.
[2021-05-14 21:55:35] [INFO ] Implicit Places using invariants and state equation in 1316 ms returned []
Implicit Place search using SMT with State Equation took 1973 ms to find 0 implicit places.
[2021-05-14 21:55:35] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2021-05-14 21:55:35] [INFO ] Computed 31 place invariants in 13 ms
[2021-05-14 21:55:36] [INFO ] Dead Transitions using invariants and state equation in 1829 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1992/1992 places, 3096/3096 transitions.
[2021-05-14 21:55:38] [INFO ] Flatten gal took : 594 ms
[2021-05-14 21:55:43] [INFO ] Flatten gal took : 707 ms
[2021-05-14 21:55:49] [INFO ] Input system was already deterministic with 3096 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 9799 ms. (steps per millisecond=10 ) properties (out of 92) seen :78
Running SMT prover for 14 properties.
[2021-05-14 21:55:59] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2021-05-14 21:55:59] [INFO ] Computed 31 place invariants in 10 ms
[2021-05-14 21:55:59] [INFO ] [Real]Absence check using 23 positive place invariants in 156 ms returned sat
[2021-05-14 21:55:59] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 42 ms returned sat
[2021-05-14 21:55:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 21:56:09] [INFO ] [Real]Absence check using state equation in 9899 ms returned sat
[2021-05-14 21:56:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 21:56:10] [INFO ] [Nat]Absence check using 23 positive place invariants in 117 ms returned sat
[2021-05-14 21:56:10] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 23 ms returned sat
[2021-05-14 21:56:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 21:56:17] [INFO ] [Nat]Absence check using state equation in 7193 ms returned sat
[2021-05-14 21:56:17] [INFO ] State equation strengthened by 546 read => feed constraints.
[2021-05-14 21:56:17] [INFO ] [Nat]Added 546 Read/Feed constraints in 176 ms returned sat
[2021-05-14 21:56:19] [INFO ] Deduced a trap composed of 57 places in 1239 ms of which 4 ms to minimize.
[2021-05-14 21:56:20] [INFO ] Deduced a trap composed of 112 places in 1148 ms of which 2 ms to minimize.
[2021-05-14 21:56:21] [INFO ] Deduced a trap composed of 134 places in 1137 ms of which 2 ms to minimize.
[2021-05-14 21:56:22] [INFO ] Deduced a trap composed of 138 places in 1112 ms of which 2 ms to minimize.
[2021-05-14 21:56:24] [INFO ] Deduced a trap composed of 13 places in 1116 ms of which 1 ms to minimize.
[2021-05-14 21:56:25] [INFO ] Deduced a trap composed of 25 places in 1098 ms of which 1 ms to minimize.
[2021-05-14 21:56:26] [INFO ] Deduced a trap composed of 13 places in 1123 ms of which 2 ms to minimize.
[2021-05-14 21:56:27] [INFO ] Deduced a trap composed of 13 places in 1098 ms of which 1 ms to minimize.
[2021-05-14 21:56:29] [INFO ] Deduced a trap composed of 25 places in 1101 ms of which 2 ms to minimize.
[2021-05-14 21:56:30] [INFO ] Deduced a trap composed of 13 places in 1134 ms of which 1 ms to minimize.
[2021-05-14 21:56:30] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
[2021-05-14 21:56:30] [INFO ] [Real]Absence check using 23 positive place invariants in 166 ms returned sat
[2021-05-14 21:56:31] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 53 ms returned sat
[2021-05-14 21:56:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 21:56:41] [INFO ] [Real]Absence check using state equation in 10201 ms returned sat
[2021-05-14 21:56:41] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 21:56:41] [INFO ] [Nat]Absence check using 23 positive place invariants in 133 ms returned sat
[2021-05-14 21:56:41] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 25 ms returned sat
[2021-05-14 21:56:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 21:56:50] [INFO ] [Nat]Absence check using state equation in 8874 ms returned sat
[2021-05-14 21:56:50] [INFO ] [Nat]Added 546 Read/Feed constraints in 167 ms returned sat
[2021-05-14 21:56:51] [INFO ] Deduced a trap composed of 55 places in 1013 ms of which 1 ms to minimize.
[2021-05-14 21:56:53] [INFO ] Deduced a trap composed of 13 places in 997 ms of which 1 ms to minimize.
[2021-05-14 21:56:54] [INFO ] Deduced a trap composed of 34 places in 1069 ms of which 1 ms to minimize.
[2021-05-14 21:56:55] [INFO ] Deduced a trap composed of 36 places in 1061 ms of which 1 ms to minimize.
[2021-05-14 21:56:56] [INFO ] Deduced a trap composed of 13 places in 1086 ms of which 1 ms to minimize.
[2021-05-14 21:56:57] [INFO ] Deduced a trap composed of 55 places in 1061 ms of which 2 ms to minimize.
[2021-05-14 21:56:59] [INFO ] Deduced a trap composed of 61 places in 1045 ms of which 2 ms to minimize.
[2021-05-14 21:57:00] [INFO ] Deduced a trap composed of 13 places in 1016 ms of which 1 ms to minimize.
[2021-05-14 21:57:01] [INFO ] Deduced a trap composed of 45 places in 1056 ms of which 1 ms to minimize.
[2021-05-14 21:57:01] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
[2021-05-14 21:57:01] [INFO ] [Real]Absence check using 23 positive place invariants in 156 ms returned sat
[2021-05-14 21:57:01] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 53 ms returned sat
[2021-05-14 21:57:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 21:57:12] [INFO ] [Real]Absence check using state equation in 10603 ms returned sat
[2021-05-14 21:57:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 21:57:13] [INFO ] [Nat]Absence check using 23 positive place invariants in 134 ms returned sat
[2021-05-14 21:57:13] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 38 ms returned sat
[2021-05-14 21:57:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 21:57:20] [INFO ] [Nat]Absence check using state equation in 6904 ms returned sat
[2021-05-14 21:57:20] [INFO ] [Nat]Added 546 Read/Feed constraints in 173 ms returned sat
[2021-05-14 21:57:21] [INFO ] Deduced a trap composed of 104 places in 1057 ms of which 1 ms to minimize.
[2021-05-14 21:57:22] [INFO ] Deduced a trap composed of 38 places in 1002 ms of which 2 ms to minimize.
[2021-05-14 21:57:23] [INFO ] Deduced a trap composed of 29 places in 972 ms of which 1 ms to minimize.
[2021-05-14 21:57:24] [INFO ] Deduced a trap composed of 13 places in 1019 ms of which 2 ms to minimize.
[2021-05-14 21:57:25] [INFO ] Deduced a trap composed of 25 places in 966 ms of which 2 ms to minimize.
[2021-05-14 21:57:26] [INFO ] Deduced a trap composed of 13 places in 1007 ms of which 2 ms to minimize.
[2021-05-14 21:57:28] [INFO ] Deduced a trap composed of 13 places in 998 ms of which 2 ms to minimize.
[2021-05-14 21:57:29] [INFO ] Deduced a trap composed of 13 places in 1021 ms of which 1 ms to minimize.
[2021-05-14 21:57:30] [INFO ] Deduced a trap composed of 67 places in 997 ms of which 1 ms to minimize.
[2021-05-14 21:57:31] [INFO ] Deduced a trap composed of 13 places in 1008 ms of which 2 ms to minimize.
[2021-05-14 21:57:32] [INFO ] Deduced a trap composed of 28 places in 1029 ms of which 1 ms to minimize.
[2021-05-14 21:57:32] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
[2021-05-14 21:57:33] [INFO ] [Real]Absence check using 23 positive place invariants in 41 ms returned sat
[2021-05-14 21:57:33] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 5 ms returned sat
[2021-05-14 21:57:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 21:57:34] [INFO ] [Real]Absence check using state equation in 1696 ms returned sat
[2021-05-14 21:57:34] [INFO ] [Real]Added 546 Read/Feed constraints in 138 ms returned sat
[2021-05-14 21:57:35] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 21:57:35] [INFO ] [Nat]Absence check using 23 positive place invariants in 43 ms returned sat
[2021-05-14 21:57:35] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 6 ms returned sat
[2021-05-14 21:57:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 21:57:36] [INFO ] [Nat]Absence check using state equation in 1542 ms returned sat
[2021-05-14 21:57:37] [INFO ] [Nat]Added 546 Read/Feed constraints in 163 ms returned sat
[2021-05-14 21:57:38] [INFO ] Deduced a trap composed of 13 places in 1084 ms of which 2 ms to minimize.
[2021-05-14 21:57:39] [INFO ] Deduced a trap composed of 105 places in 1016 ms of which 2 ms to minimize.
[2021-05-14 21:57:40] [INFO ] Deduced a trap composed of 105 places in 1016 ms of which 1 ms to minimize.
[2021-05-14 21:57:41] [INFO ] Deduced a trap composed of 123 places in 1019 ms of which 1 ms to minimize.
[2021-05-14 21:57:42] [INFO ] Deduced a trap composed of 105 places in 1017 ms of which 5 ms to minimize.
[2021-05-14 21:57:43] [INFO ] Deduced a trap composed of 105 places in 1012 ms of which 2 ms to minimize.
[2021-05-14 21:57:45] [INFO ] Deduced a trap composed of 105 places in 1022 ms of which 2 ms to minimize.
[2021-05-14 21:57:46] [INFO ] Deduced a trap composed of 105 places in 1014 ms of which 2 ms to minimize.
[2021-05-14 21:57:47] [INFO ] Deduced a trap composed of 141 places in 1013 ms of which 2 ms to minimize.
[2021-05-14 21:57:48] [INFO ] Deduced a trap composed of 206 places in 995 ms of which 9 ms to minimize.
[2021-05-14 21:57:49] [INFO ] Deduced a trap composed of 241 places in 995 ms of which 1 ms to minimize.
[2021-05-14 21:57:50] [INFO ] Deduced a trap composed of 46 places in 1025 ms of which 1 ms to minimize.
[2021-05-14 21:57:51] [INFO ] Deduced a trap composed of 87 places in 1007 ms of which 1 ms to minimize.
[2021-05-14 21:57:52] [INFO ] Deduced a trap composed of 87 places in 1026 ms of which 1 ms to minimize.
[2021-05-14 21:57:53] [INFO ] Deduced a trap composed of 87 places in 1019 ms of which 2 ms to minimize.
[2021-05-14 21:57:55] [INFO ] Deduced a trap composed of 87 places in 1090 ms of which 2 ms to minimize.
[2021-05-14 21:57:55] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
[2021-05-14 21:57:55] [INFO ] [Real]Absence check using 23 positive place invariants in 38 ms returned sat
[2021-05-14 21:57:55] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 1 ms returned sat
[2021-05-14 21:57:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 21:57:56] [INFO ] [Real]Absence check using state equation in 752 ms returned sat
[2021-05-14 21:57:56] [INFO ] [Real]Added 546 Read/Feed constraints in 125 ms returned sat
[2021-05-14 21:57:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 21:57:56] [INFO ] [Nat]Absence check using 23 positive place invariants in 41 ms returned sat
[2021-05-14 21:57:56] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 2 ms returned sat
[2021-05-14 21:57:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 21:57:57] [INFO ] [Nat]Absence check using state equation in 759 ms returned sat
[2021-05-14 21:57:57] [INFO ] [Nat]Added 546 Read/Feed constraints in 169 ms returned sat
[2021-05-14 21:57:58] [INFO ] Deduced a trap composed of 28 places in 724 ms of which 1 ms to minimize.
[2021-05-14 21:57:59] [INFO ] Deduced a trap composed of 85 places in 731 ms of which 1 ms to minimize.
[2021-05-14 21:58:00] [INFO ] Deduced a trap composed of 85 places in 738 ms of which 1 ms to minimize.
[2021-05-14 21:58:01] [INFO ] Deduced a trap composed of 85 places in 732 ms of which 1 ms to minimize.
[2021-05-14 21:58:01] [INFO ] Deduced a trap composed of 51 places in 731 ms of which 1 ms to minimize.
[2021-05-14 21:58:02] [INFO ] Deduced a trap composed of 51 places in 726 ms of which 1 ms to minimize.
[2021-05-14 21:58:03] [INFO ] Deduced a trap composed of 66 places in 730 ms of which 1 ms to minimize.
[2021-05-14 21:58:04] [INFO ] Deduced a trap composed of 51 places in 728 ms of which 1 ms to minimize.
[2021-05-14 21:58:05] [INFO ] Deduced a trap composed of 51 places in 728 ms of which 1 ms to minimize.
[2021-05-14 21:58:06] [INFO ] Deduced a trap composed of 67 places in 751 ms of which 15 ms to minimize.
[2021-05-14 21:58:06] [INFO ] Deduced a trap composed of 51 places in 732 ms of which 2 ms to minimize.
[2021-05-14 21:58:07] [INFO ] Deduced a trap composed of 17 places in 726 ms of which 1 ms to minimize.
[2021-05-14 21:58:08] [INFO ] Deduced a trap composed of 51 places in 726 ms of which 1 ms to minimize.
[2021-05-14 21:58:09] [INFO ] Deduced a trap composed of 77 places in 723 ms of which 2 ms to minimize.
[2021-05-14 21:58:10] [INFO ] Deduced a trap composed of 28 places in 725 ms of which 1 ms to minimize.
[2021-05-14 21:58:11] [INFO ] Deduced a trap composed of 17 places in 752 ms of which 1 ms to minimize.
[2021-05-14 21:58:11] [INFO ] Deduced a trap composed of 25 places in 726 ms of which 2 ms to minimize.
[2021-05-14 21:58:12] [INFO ] Deduced a trap composed of 29 places in 720 ms of which 2 ms to minimize.
[2021-05-14 21:58:13] [INFO ] Deduced a trap composed of 25 places in 744 ms of which 1 ms to minimize.
[2021-05-14 21:58:14] [INFO ] Deduced a trap composed of 62 places in 738 ms of which 1 ms to minimize.
[2021-05-14 21:58:15] [INFO ] Deduced a trap composed of 161 places in 866 ms of which 1 ms to minimize.
[2021-05-14 21:58:16] [INFO ] Deduced a trap composed of 127 places in 842 ms of which 1 ms to minimize.
[2021-05-14 21:58:17] [INFO ] Deduced a trap composed of 74 places in 850 ms of which 2 ms to minimize.
[2021-05-14 21:58:17] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
[2021-05-14 21:58:17] [INFO ] [Real]Absence check using 23 positive place invariants in 40 ms returned sat
[2021-05-14 21:58:17] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-14 21:58:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 21:58:19] [INFO ] [Real]Absence check using state equation in 1393 ms returned sat
[2021-05-14 21:58:19] [INFO ] [Real]Added 546 Read/Feed constraints in 127 ms returned sat
[2021-05-14 21:58:19] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 21:58:19] [INFO ] [Nat]Absence check using 23 positive place invariants in 41 ms returned sat
[2021-05-14 21:58:19] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-14 21:58:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 21:58:21] [INFO ] [Nat]Absence check using state equation in 1368 ms returned sat
[2021-05-14 21:58:21] [INFO ] [Nat]Added 546 Read/Feed constraints in 172 ms returned sat
[2021-05-14 21:58:22] [INFO ] Deduced a trap composed of 13 places in 1081 ms of which 2 ms to minimize.
[2021-05-14 21:58:23] [INFO ] Deduced a trap composed of 34 places in 1070 ms of which 2 ms to minimize.
[2021-05-14 21:58:24] [INFO ] Deduced a trap composed of 47 places in 1067 ms of which 2 ms to minimize.
[2021-05-14 21:58:25] [INFO ] Deduced a trap composed of 47 places in 1138 ms of which 1 ms to minimize.
[2021-05-14 21:58:27] [INFO ] Deduced a trap composed of 97 places in 1086 ms of which 1 ms to minimize.
[2021-05-14 21:58:28] [INFO ] Deduced a trap composed of 36 places in 1062 ms of which 2 ms to minimize.
[2021-05-14 21:58:29] [INFO ] Deduced a trap composed of 17 places in 1115 ms of which 1 ms to minimize.
[2021-05-14 21:58:30] [INFO ] Deduced a trap composed of 43 places in 1063 ms of which 1 ms to minimize.
[2021-05-14 21:58:31] [INFO ] Deduced a trap composed of 13 places in 1073 ms of which 1 ms to minimize.
[2021-05-14 21:58:33] [INFO ] Deduced a trap composed of 49 places in 1062 ms of which 2 ms to minimize.
[2021-05-14 21:58:34] [INFO ] Deduced a trap composed of 70 places in 1103 ms of which 2 ms to minimize.
[2021-05-14 21:58:35] [INFO ] Deduced a trap composed of 70 places in 1075 ms of which 1 ms to minimize.
[2021-05-14 21:58:36] [INFO ] Deduced a trap composed of 71 places in 1067 ms of which 1 ms to minimize.
[2021-05-14 21:58:37] [INFO ] Deduced a trap composed of 45 places in 1061 ms of which 2 ms to minimize.
[2021-05-14 21:58:39] [INFO ] Deduced a trap composed of 13 places in 1171 ms of which 1 ms to minimize.
[2021-05-14 21:58:40] [INFO ] Deduced a trap composed of 17 places in 1141 ms of which 2 ms to minimize.
[2021-05-14 21:58:40] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 5
[2021-05-14 21:58:40] [INFO ] [Real]Absence check using 23 positive place invariants in 38 ms returned sat
[2021-05-14 21:58:40] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 2 ms returned sat
[2021-05-14 21:58:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 21:58:41] [INFO ] [Real]Absence check using state equation in 962 ms returned sat
[2021-05-14 21:58:41] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 21:58:41] [INFO ] [Nat]Absence check using 23 positive place invariants in 39 ms returned sat
[2021-05-14 21:58:41] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 2 ms returned sat
[2021-05-14 21:58:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 21:58:42] [INFO ] [Nat]Absence check using state equation in 954 ms returned sat
[2021-05-14 21:58:43] [INFO ] [Nat]Added 546 Read/Feed constraints in 160 ms returned sat
[2021-05-14 21:58:44] [INFO ] Deduced a trap composed of 28 places in 949 ms of which 1 ms to minimize.
[2021-05-14 21:58:45] [INFO ] Deduced a trap composed of 13 places in 946 ms of which 2 ms to minimize.
[2021-05-14 21:58:46] [INFO ] Deduced a trap composed of 13 places in 959 ms of which 2 ms to minimize.
[2021-05-14 21:58:47] [INFO ] Deduced a trap composed of 81 places in 1022 ms of which 2 ms to minimize.
[2021-05-14 21:58:48] [INFO ] Deduced a trap composed of 77 places in 1043 ms of which 1 ms to minimize.
[2021-05-14 21:58:49] [INFO ] Deduced a trap composed of 81 places in 999 ms of which 2 ms to minimize.
[2021-05-14 21:58:50] [INFO ] Deduced a trap composed of 135 places in 972 ms of which 2 ms to minimize.
[2021-05-14 21:58:51] [INFO ] Deduced a trap composed of 31 places in 806 ms of which 2 ms to minimize.
[2021-05-14 21:58:52] [INFO ] Deduced a trap composed of 31 places in 818 ms of which 2 ms to minimize.
[2021-05-14 21:58:53] [INFO ] Deduced a trap composed of 30 places in 847 ms of which 1 ms to minimize.
[2021-05-14 21:58:54] [INFO ] Deduced a trap composed of 31 places in 858 ms of which 1 ms to minimize.
[2021-05-14 21:58:55] [INFO ] Deduced a trap composed of 31 places in 875 ms of which 1 ms to minimize.
[2021-05-14 21:58:56] [INFO ] Deduced a trap composed of 24 places in 878 ms of which 2 ms to minimize.
[2021-05-14 21:58:57] [INFO ] Deduced a trap composed of 13 places in 814 ms of which 1 ms to minimize.
[2021-05-14 21:58:58] [INFO ] Deduced a trap composed of 31 places in 799 ms of which 1 ms to minimize.
[2021-05-14 21:58:59] [INFO ] Deduced a trap composed of 45 places in 804 ms of which 1 ms to minimize.
[2021-05-14 21:59:00] [INFO ] Deduced a trap composed of 31 places in 846 ms of which 2 ms to minimize.
[2021-05-14 21:59:01] [INFO ] Deduced a trap composed of 25 places in 848 ms of which 1 ms to minimize.
[2021-05-14 21:59:01] [INFO ] Deduced a trap composed of 13 places in 846 ms of which 1 ms to minimize.
[2021-05-14 21:59:01] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 6
[2021-05-14 21:59:02] [INFO ] [Real]Absence check using 23 positive place invariants in 40 ms returned sat
[2021-05-14 21:59:02] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 1 ms returned sat
[2021-05-14 21:59:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 21:59:03] [INFO ] [Real]Absence check using state equation in 785 ms returned sat
[2021-05-14 21:59:03] [INFO ] [Real]Added 546 Read/Feed constraints in 130 ms returned sat
[2021-05-14 21:59:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 21:59:03] [INFO ] [Nat]Absence check using 23 positive place invariants in 42 ms returned sat
[2021-05-14 21:59:03] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 1 ms returned sat
[2021-05-14 21:59:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 21:59:04] [INFO ] [Nat]Absence check using state equation in 788 ms returned sat
[2021-05-14 21:59:04] [INFO ] [Nat]Added 546 Read/Feed constraints in 164 ms returned sat
[2021-05-14 21:59:05] [INFO ] Deduced a trap composed of 13 places in 987 ms of which 1 ms to minimize.
[2021-05-14 21:59:06] [INFO ] Deduced a trap composed of 72 places in 949 ms of which 1 ms to minimize.
[2021-05-14 21:59:07] [INFO ] Deduced a trap composed of 72 places in 965 ms of which 2 ms to minimize.
[2021-05-14 21:59:08] [INFO ] Deduced a trap composed of 17 places in 958 ms of which 1 ms to minimize.
[2021-05-14 21:59:09] [INFO ] Deduced a trap composed of 13 places in 975 ms of which 2 ms to minimize.
[2021-05-14 21:59:11] [INFO ] Deduced a trap composed of 45 places in 985 ms of which 2 ms to minimize.
[2021-05-14 21:59:12] [INFO ] Deduced a trap composed of 45 places in 970 ms of which 1 ms to minimize.
[2021-05-14 21:59:13] [INFO ] Deduced a trap composed of 72 places in 981 ms of which 1 ms to minimize.
[2021-05-14 21:59:14] [INFO ] Deduced a trap composed of 90 places in 981 ms of which 2 ms to minimize.
[2021-05-14 21:59:15] [INFO ] Deduced a trap composed of 95 places in 989 ms of which 2 ms to minimize.
[2021-05-14 21:59:16] [INFO ] Deduced a trap composed of 53 places in 994 ms of which 1 ms to minimize.
[2021-05-14 21:59:17] [INFO ] Deduced a trap composed of 72 places in 997 ms of which 2 ms to minimize.
[2021-05-14 21:59:18] [INFO ] Deduced a trap composed of 72 places in 976 ms of which 2 ms to minimize.
[2021-05-14 21:59:19] [INFO ] Deduced a trap composed of 72 places in 987 ms of which 1 ms to minimize.
[2021-05-14 21:59:20] [INFO ] Deduced a trap composed of 72 places in 1004 ms of which 2 ms to minimize.
[2021-05-14 21:59:21] [INFO ] Deduced a trap composed of 51 places in 944 ms of which 1 ms to minimize.
[2021-05-14 21:59:22] [INFO ] Deduced a trap composed of 45 places in 944 ms of which 1 ms to minimize.
[2021-05-14 21:59:23] [INFO ] Deduced a trap composed of 51 places in 911 ms of which 1 ms to minimize.
[2021-05-14 21:59:23] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 7
[2021-05-14 21:59:24] [INFO ] [Real]Absence check using 23 positive place invariants in 39 ms returned sat
[2021-05-14 21:59:24] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-14 21:59:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 21:59:25] [INFO ] [Real]Absence check using state equation in 1324 ms returned sat
[2021-05-14 21:59:25] [INFO ] [Real]Added 546 Read/Feed constraints in 135 ms returned sat
[2021-05-14 21:59:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 21:59:26] [INFO ] [Nat]Absence check using 23 positive place invariants in 41 ms returned sat
[2021-05-14 21:59:26] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-14 21:59:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 21:59:27] [INFO ] [Nat]Absence check using state equation in 1261 ms returned sat
[2021-05-14 21:59:27] [INFO ] [Nat]Added 546 Read/Feed constraints in 166 ms returned sat
[2021-05-14 21:59:28] [INFO ] Deduced a trap composed of 13 places in 1003 ms of which 2 ms to minimize.
[2021-05-14 21:59:29] [INFO ] Deduced a trap composed of 38 places in 952 ms of which 1 ms to minimize.
[2021-05-14 21:59:30] [INFO ] Deduced a trap composed of 142 places in 869 ms of which 1 ms to minimize.
[2021-05-14 21:59:31] [INFO ] Deduced a trap composed of 142 places in 877 ms of which 2 ms to minimize.
[2021-05-14 21:59:32] [INFO ] Deduced a trap composed of 142 places in 860 ms of which 2 ms to minimize.
[2021-05-14 21:59:33] [INFO ] Deduced a trap composed of 100 places in 859 ms of which 1 ms to minimize.
[2021-05-14 21:59:34] [INFO ] Deduced a trap composed of 100 places in 852 ms of which 2 ms to minimize.
[2021-05-14 21:59:35] [INFO ] Deduced a trap composed of 108 places in 858 ms of which 1 ms to minimize.
[2021-05-14 21:59:36] [INFO ] Deduced a trap composed of 108 places in 857 ms of which 1 ms to minimize.
[2021-05-14 21:59:37] [INFO ] Deduced a trap composed of 142 places in 848 ms of which 2 ms to minimize.
[2021-05-14 21:59:38] [INFO ] Deduced a trap composed of 142 places in 859 ms of which 1 ms to minimize.
[2021-05-14 21:59:39] [INFO ] Deduced a trap composed of 244 places in 860 ms of which 2 ms to minimize.
[2021-05-14 21:59:40] [INFO ] Deduced a trap composed of 142 places in 847 ms of which 1 ms to minimize.
[2021-05-14 21:59:41] [INFO ] Deduced a trap composed of 210 places in 855 ms of which 1 ms to minimize.
[2021-05-14 21:59:42] [INFO ] Deduced a trap composed of 244 places in 858 ms of which 1 ms to minimize.
[2021-05-14 21:59:43] [INFO ] Deduced a trap composed of 168 places in 876 ms of which 1 ms to minimize.
[2021-05-14 21:59:44] [INFO ] Deduced a trap composed of 168 places in 882 ms of which 1 ms to minimize.
[2021-05-14 21:59:45] [INFO ] Deduced a trap composed of 104 places in 818 ms of which 1 ms to minimize.
[2021-05-14 21:59:46] [INFO ] Deduced a trap composed of 93 places in 832 ms of which 1 ms to minimize.
[2021-05-14 21:59:46] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 8
[2021-05-14 21:59:46] [INFO ] [Real]Absence check using 23 positive place invariants in 39 ms returned sat
[2021-05-14 21:59:46] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 1 ms returned sat
[2021-05-14 21:59:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 21:59:47] [INFO ] [Real]Absence check using state equation in 757 ms returned sat
[2021-05-14 21:59:47] [INFO ] [Real]Added 546 Read/Feed constraints in 117 ms returned sat
[2021-05-14 21:59:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 21:59:47] [INFO ] [Nat]Absence check using 23 positive place invariants in 40 ms returned sat
[2021-05-14 21:59:47] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 1 ms returned sat
[2021-05-14 21:59:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 21:59:48] [INFO ] [Nat]Absence check using state equation in 754 ms returned sat
[2021-05-14 21:59:48] [INFO ] [Nat]Added 546 Read/Feed constraints in 151 ms returned sat
[2021-05-14 21:59:49] [INFO ] Deduced a trap composed of 58 places in 771 ms of which 1 ms to minimize.
[2021-05-14 21:59:50] [INFO ] Deduced a trap composed of 59 places in 765 ms of which 1 ms to minimize.
[2021-05-14 21:59:51] [INFO ] Deduced a trap composed of 58 places in 756 ms of which 1 ms to minimize.
[2021-05-14 21:59:52] [INFO ] Deduced a trap composed of 28 places in 768 ms of which 1 ms to minimize.
[2021-05-14 21:59:53] [INFO ] Deduced a trap composed of 21 places in 749 ms of which 2 ms to minimize.
[2021-05-14 21:59:53] [INFO ] Deduced a trap composed of 36 places in 759 ms of which 1 ms to minimize.
[2021-05-14 21:59:54] [INFO ] Deduced a trap composed of 130 places in 744 ms of which 1 ms to minimize.
[2021-05-14 21:59:55] [INFO ] Deduced a trap composed of 131 places in 760 ms of which 1 ms to minimize.
[2021-05-14 21:59:56] [INFO ] Deduced a trap composed of 130 places in 778 ms of which 2 ms to minimize.
[2021-05-14 21:59:57] [INFO ] Deduced a trap composed of 28 places in 788 ms of which 1 ms to minimize.
[2021-05-14 21:59:58] [INFO ] Deduced a trap composed of 24 places in 751 ms of which 1 ms to minimize.
[2021-05-14 21:59:59] [INFO ] Deduced a trap composed of 62 places in 747 ms of which 1 ms to minimize.
[2021-05-14 21:59:59] [INFO ] Deduced a trap composed of 59 places in 749 ms of which 1 ms to minimize.
[2021-05-14 22:00:00] [INFO ] Deduced a trap composed of 130 places in 749 ms of which 2 ms to minimize.
[2021-05-14 22:00:01] [INFO ] Deduced a trap composed of 241 places in 753 ms of which 1 ms to minimize.
[2021-05-14 22:00:02] [INFO ] Deduced a trap composed of 200 places in 776 ms of which 1 ms to minimize.
[2021-05-14 22:00:03] [INFO ] Deduced a trap composed of 131 places in 752 ms of which 1 ms to minimize.
[2021-05-14 22:00:04] [INFO ] Deduced a trap composed of 131 places in 760 ms of which 1 ms to minimize.
[2021-05-14 22:00:05] [INFO ] Deduced a trap composed of 96 places in 745 ms of which 2 ms to minimize.
[2021-05-14 22:00:05] [INFO ] Deduced a trap composed of 97 places in 766 ms of which 1 ms to minimize.
[2021-05-14 22:00:06] [INFO ] Deduced a trap composed of 92 places in 744 ms of which 1 ms to minimize.
[2021-05-14 22:00:07] [INFO ] Deduced a trap composed of 92 places in 746 ms of which 1 ms to minimize.
[2021-05-14 22:00:07] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 9
[2021-05-14 22:00:07] [INFO ] [Real]Absence check using 23 positive place invariants in 38 ms returned sat
[2021-05-14 22:00:07] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 2 ms returned sat
[2021-05-14 22:00:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 22:00:08] [INFO ] [Real]Absence check using state equation in 739 ms returned sat
[2021-05-14 22:00:08] [INFO ] [Real]Added 546 Read/Feed constraints in 153 ms returned sat
[2021-05-14 22:00:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 22:00:09] [INFO ] [Nat]Absence check using 23 positive place invariants in 40 ms returned sat
[2021-05-14 22:00:09] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 1 ms returned sat
[2021-05-14 22:00:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 22:00:10] [INFO ] [Nat]Absence check using state equation in 746 ms returned sat
[2021-05-14 22:00:10] [INFO ] [Nat]Added 546 Read/Feed constraints in 191 ms returned sat
[2021-05-14 22:00:11] [INFO ] Deduced a trap composed of 17 places in 732 ms of which 1 ms to minimize.
[2021-05-14 22:00:11] [INFO ] Deduced a trap composed of 21 places in 710 ms of which 1 ms to minimize.
[2021-05-14 22:00:12] [INFO ] Deduced a trap composed of 127 places in 699 ms of which 1 ms to minimize.
[2021-05-14 22:00:13] [INFO ] Deduced a trap composed of 127 places in 664 ms of which 1 ms to minimize.
[2021-05-14 22:00:14] [INFO ] Deduced a trap composed of 126 places in 660 ms of which 1 ms to minimize.
[2021-05-14 22:00:14] [INFO ] Deduced a trap composed of 126 places in 660 ms of which 1 ms to minimize.
[2021-05-14 22:00:15] [INFO ] Deduced a trap composed of 166 places in 657 ms of which 1 ms to minimize.
[2021-05-14 22:00:16] [INFO ] Deduced a trap composed of 160 places in 633 ms of which 1 ms to minimize.
[2021-05-14 22:00:17] [INFO ] Deduced a trap composed of 167 places in 629 ms of which 1 ms to minimize.
[2021-05-14 22:00:17] [INFO ] Deduced a trap composed of 166 places in 631 ms of which 1 ms to minimize.
[2021-05-14 22:00:18] [INFO ] Deduced a trap composed of 167 places in 635 ms of which 1 ms to minimize.
[2021-05-14 22:00:19] [INFO ] Deduced a trap composed of 201 places in 631 ms of which 1 ms to minimize.
[2021-05-14 22:00:20] [INFO ] Deduced a trap composed of 58 places in 632 ms of which 1 ms to minimize.
[2021-05-14 22:00:20] [INFO ] Deduced a trap composed of 161 places in 631 ms of which 1 ms to minimize.
[2021-05-14 22:00:21] [INFO ] Deduced a trap composed of 161 places in 642 ms of which 1 ms to minimize.
[2021-05-14 22:00:22] [INFO ] Deduced a trap composed of 195 places in 649 ms of which 1 ms to minimize.
[2021-05-14 22:00:23] [INFO ] Deduced a trap composed of 62 places in 630 ms of which 1 ms to minimize.
[2021-05-14 22:00:23] [INFO ] Deduced a trap composed of 58 places in 631 ms of which 1 ms to minimize.
[2021-05-14 22:00:24] [INFO ] Deduced a trap composed of 59 places in 638 ms of which 1 ms to minimize.
[2021-05-14 22:00:25] [INFO ] Deduced a trap composed of 59 places in 634 ms of which 1 ms to minimize.
[2021-05-14 22:00:26] [INFO ] Deduced a trap composed of 59 places in 633 ms of which 1 ms to minimize.
[2021-05-14 22:00:26] [INFO ] Deduced a trap composed of 85 places in 632 ms of which 1 ms to minimize.
[2021-05-14 22:00:27] [INFO ] Deduced a trap composed of 97 places in 636 ms of which 1 ms to minimize.
[2021-05-14 22:00:28] [INFO ] Deduced a trap composed of 96 places in 661 ms of which 1 ms to minimize.
[2021-05-14 22:00:29] [INFO ] Deduced a trap composed of 51 places in 663 ms of which 1 ms to minimize.
[2021-05-14 22:00:30] [INFO ] Deduced a trap composed of 2 places in 1197 ms of which 2 ms to minimize.
[2021-05-14 22:00:30] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 10
[2021-05-14 22:00:30] [INFO ] [Real]Absence check using 23 positive place invariants in 42 ms returned sat
[2021-05-14 22:00:30] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-14 22:00:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 22:00:32] [INFO ] [Real]Absence check using state equation in 1474 ms returned sat
[2021-05-14 22:00:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 22:00:32] [INFO ] [Nat]Absence check using 23 positive place invariants in 44 ms returned sat
[2021-05-14 22:00:32] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-14 22:00:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 22:00:33] [INFO ] [Nat]Absence check using state equation in 1529 ms returned sat
[2021-05-14 22:00:34] [INFO ] [Nat]Added 546 Read/Feed constraints in 158 ms returned sat
[2021-05-14 22:00:35] [INFO ] Deduced a trap composed of 67 places in 1000 ms of which 1 ms to minimize.
[2021-05-14 22:00:36] [INFO ] Deduced a trap composed of 67 places in 1029 ms of which 1 ms to minimize.
[2021-05-14 22:00:37] [INFO ] Deduced a trap composed of 82 places in 1000 ms of which 1 ms to minimize.
[2021-05-14 22:00:38] [INFO ] Deduced a trap composed of 58 places in 1006 ms of which 2 ms to minimize.
[2021-05-14 22:00:39] [INFO ] Deduced a trap composed of 36 places in 1011 ms of which 1 ms to minimize.
[2021-05-14 22:00:40] [INFO ] Deduced a trap composed of 60 places in 1039 ms of which 1 ms to minimize.
[2021-05-14 22:00:41] [INFO ] Deduced a trap composed of 45 places in 992 ms of which 1 ms to minimize.
[2021-05-14 22:00:43] [INFO ] Deduced a trap composed of 85 places in 1027 ms of which 2 ms to minimize.
[2021-05-14 22:00:44] [INFO ] Deduced a trap composed of 167 places in 994 ms of which 1 ms to minimize.
[2021-05-14 22:00:45] [INFO ] Deduced a trap composed of 45 places in 995 ms of which 2 ms to minimize.
[2021-05-14 22:00:46] [INFO ] Deduced a trap composed of 85 places in 998 ms of which 1 ms to minimize.
[2021-05-14 22:00:47] [INFO ] Deduced a trap composed of 167 places in 1011 ms of which 1 ms to minimize.
[2021-05-14 22:00:48] [INFO ] Deduced a trap composed of 81 places in 997 ms of which 1 ms to minimize.
[2021-05-14 22:00:49] [INFO ] Deduced a trap composed of 217 places in 964 ms of which 1 ms to minimize.
[2021-05-14 22:00:50] [INFO ] Deduced a trap composed of 114 places in 957 ms of which 1 ms to minimize.
[2021-05-14 22:00:51] [INFO ] Deduced a trap composed of 139 places in 947 ms of which 2 ms to minimize.
[2021-05-14 22:00:52] [INFO ] Deduced a trap composed of 210 places in 968 ms of which 1 ms to minimize.
[2021-05-14 22:00:52] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 11
[2021-05-14 22:00:53] [INFO ] [Real]Absence check using 23 positive place invariants in 40 ms returned sat
[2021-05-14 22:00:53] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-14 22:00:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 22:00:55] [INFO ] [Real]Absence check using state equation in 1839 ms returned sat
[2021-05-14 22:00:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 22:00:55] [INFO ] [Nat]Absence check using 23 positive place invariants in 43 ms returned sat
[2021-05-14 22:00:55] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-14 22:00:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 22:00:56] [INFO ] [Nat]Absence check using state equation in 1443 ms returned sat
[2021-05-14 22:00:57] [INFO ] [Nat]Added 546 Read/Feed constraints in 164 ms returned sat
[2021-05-14 22:00:58] [INFO ] Deduced a trap composed of 13 places in 997 ms of which 1 ms to minimize.
[2021-05-14 22:00:59] [INFO ] Deduced a trap composed of 81 places in 924 ms of which 2 ms to minimize.
[2021-05-14 22:01:00] [INFO ] Deduced a trap composed of 92 places in 928 ms of which 1 ms to minimize.
[2021-05-14 22:01:01] [INFO ] Deduced a trap composed of 81 places in 926 ms of which 2 ms to minimize.
[2021-05-14 22:01:02] [INFO ] Deduced a trap composed of 81 places in 933 ms of which 2 ms to minimize.
[2021-05-14 22:01:03] [INFO ] Deduced a trap composed of 81 places in 934 ms of which 1 ms to minimize.
[2021-05-14 22:01:04] [INFO ] Deduced a trap composed of 81 places in 931 ms of which 2 ms to minimize.
[2021-05-14 22:01:05] [INFO ] Deduced a trap composed of 81 places in 927 ms of which 2 ms to minimize.
[2021-05-14 22:01:06] [INFO ] Deduced a trap composed of 81 places in 943 ms of which 2 ms to minimize.
[2021-05-14 22:01:07] [INFO ] Deduced a trap composed of 62 places in 916 ms of which 2 ms to minimize.
[2021-05-14 22:01:08] [INFO ] Deduced a trap composed of 58 places in 919 ms of which 1 ms to minimize.
[2021-05-14 22:01:09] [INFO ] Deduced a trap composed of 58 places in 917 ms of which 1 ms to minimize.
[2021-05-14 22:01:10] [INFO ] Deduced a trap composed of 127 places in 911 ms of which 2 ms to minimize.
[2021-05-14 22:01:11] [INFO ] Deduced a trap composed of 58 places in 890 ms of which 2 ms to minimize.
[2021-05-14 22:01:12] [INFO ] Deduced a trap composed of 63 places in 922 ms of which 1 ms to minimize.
[2021-05-14 22:01:13] [INFO ] Deduced a trap composed of 59 places in 904 ms of which 1 ms to minimize.
[2021-05-14 22:01:14] [INFO ] Deduced a trap composed of 59 places in 891 ms of which 1 ms to minimize.
[2021-05-14 22:01:15] [INFO ] Deduced a trap composed of 59 places in 892 ms of which 1 ms to minimize.
[2021-05-14 22:01:15] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 12
[2021-05-14 22:01:15] [INFO ] [Real]Absence check using 23 positive place invariants in 39 ms returned sat
[2021-05-14 22:01:15] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-14 22:01:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 22:01:17] [INFO ] [Real]Absence check using state equation in 1318 ms returned sat
[2021-05-14 22:01:17] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 22:01:17] [INFO ] [Nat]Absence check using 23 positive place invariants in 41 ms returned sat
[2021-05-14 22:01:17] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-14 22:01:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 22:01:18] [INFO ] [Nat]Absence check using state equation in 1317 ms returned sat
[2021-05-14 22:01:19] [INFO ] [Nat]Added 546 Read/Feed constraints in 136 ms returned sat
[2021-05-14 22:01:19] [INFO ] Deduced a trap composed of 125 places in 841 ms of which 2 ms to minimize.
[2021-05-14 22:01:20] [INFO ] Deduced a trap composed of 72 places in 859 ms of which 2 ms to minimize.
[2021-05-14 22:01:21] [INFO ] Deduced a trap composed of 72 places in 873 ms of which 2 ms to minimize.
[2021-05-14 22:01:22] [INFO ] Deduced a trap composed of 72 places in 873 ms of which 2 ms to minimize.
[2021-05-14 22:01:23] [INFO ] Deduced a trap composed of 72 places in 882 ms of which 1 ms to minimize.
[2021-05-14 22:01:24] [INFO ] Deduced a trap composed of 54 places in 884 ms of which 1 ms to minimize.
[2021-05-14 22:01:25] [INFO ] Deduced a trap composed of 54 places in 844 ms of which 1 ms to minimize.
[2021-05-14 22:01:26] [INFO ] Deduced a trap composed of 54 places in 841 ms of which 1 ms to minimize.
[2021-05-14 22:01:27] [INFO ] Deduced a trap composed of 47 places in 1002 ms of which 1 ms to minimize.
[2021-05-14 22:01:29] [INFO ] Deduced a trap composed of 13 places in 1012 ms of which 2 ms to minimize.
[2021-05-14 22:01:30] [INFO ] Deduced a trap composed of 13 places in 1004 ms of which 1 ms to minimize.
[2021-05-14 22:01:31] [INFO ] Deduced a trap composed of 13 places in 1000 ms of which 1 ms to minimize.
[2021-05-14 22:01:32] [INFO ] Deduced a trap composed of 164 places in 988 ms of which 1 ms to minimize.
[2021-05-14 22:01:33] [INFO ] Deduced a trap composed of 164 places in 972 ms of which 2 ms to minimize.
[2021-05-14 22:01:34] [INFO ] Deduced a trap composed of 199 places in 974 ms of which 1 ms to minimize.
[2021-05-14 22:01:35] [INFO ] Deduced a trap composed of 20 places in 976 ms of which 2 ms to minimize.
[2021-05-14 22:01:36] [INFO ] Deduced a trap composed of 21 places in 994 ms of which 1 ms to minimize.
[2021-05-14 22:01:38] [INFO ] Deduced a trap composed of 13 places in 1008 ms of which 3 ms to minimize.
[2021-05-14 22:01:38] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 13
Applied a total of 0 rules in 55 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2021-05-14 22:01:39] [INFO ] Flatten gal took : 132 ms
[2021-05-14 22:01:39] [INFO ] Flatten gal took : 228 ms
[2021-05-14 22:01:40] [INFO ] Input system was already deterministic with 3096 transitions.
[2021-05-14 22:01:40] [INFO ] Flatten gal took : 150 ms
[2021-05-14 22:01:40] [INFO ] Flatten gal took : 131 ms
[2021-05-14 22:01:40] [INFO ] Time to serialize gal into /tmp/CTLFireability4643576339582304365.gal : 24 ms
[2021-05-14 22:01:40] [INFO ] Time to serialize properties into /tmp/CTLFireability15958070942994309824.ctl : 48 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability4643576339582304365.gal, -t, CGAL, -ctl, /tmp/CTLFireability15958070942994309824.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability4643576339582304365.gal -t CGAL -ctl /tmp/CTLFireability15958070942994309824.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2021-05-14 22:02:11] [INFO ] Flatten gal took : 134 ms
[2021-05-14 22:02:11] [INFO ] Applying decomposition
[2021-05-14 22:02:11] [INFO ] Flatten gal took : 135 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph12263788220321694137.txt, -o, /tmp/graph12263788220321694137.bin, -w, /tmp/graph12263788220321694137.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph12263788220321694137.bin, -l, -1, -v, -w, /tmp/graph12263788220321694137.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 22:02:11] [INFO ] Decomposing Gal with order
[2021-05-14 22:02:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 22:02:12] [INFO ] Removed a total of 2834 redundant transitions.
[2021-05-14 22:02:13] [INFO ] Flatten gal took : 452 ms
[2021-05-14 22:02:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 25 ms.
[2021-05-14 22:02:19] [INFO ] Time to serialize gal into /tmp/CTLFireability18300801475501013379.gal : 24 ms
[2021-05-14 22:02:19] [INFO ] Time to serialize properties into /tmp/CTLFireability5137786543540246004.ctl : 68 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability18300801475501013379.gal, -t, CGAL, -ctl, /tmp/CTLFireability5137786543540246004.ctl], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability18300801475501013379.gal -t CGAL -ctl /tmp/CTLFireability5137786543540246004.ctl
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Applied a total of 0 rules in 34 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2021-05-14 22:02:50] [INFO ] Flatten gal took : 110 ms
[2021-05-14 22:02:50] [INFO ] Flatten gal took : 254 ms
[2021-05-14 22:02:50] [INFO ] Input system was already deterministic with 3096 transitions.
[2021-05-14 22:02:50] [INFO ] Flatten gal took : 117 ms
[2021-05-14 22:02:51] [INFO ] Flatten gal took : 132 ms
[2021-05-14 22:02:51] [INFO ] Time to serialize gal into /tmp/CTLFireability11346689152131250366.gal : 7 ms
[2021-05-14 22:02:51] [INFO ] Time to serialize properties into /tmp/CTLFireability359423338776623044.ctl : 36 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability11346689152131250366.gal, -t, CGAL, -ctl, /tmp/CTLFireability359423338776623044.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability11346689152131250366.gal -t CGAL -ctl /tmp/CTLFireability359423338776623044.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2021-05-14 22:03:21] [INFO ] Flatten gal took : 117 ms
[2021-05-14 22:03:21] [INFO ] Applying decomposition
[2021-05-14 22:03:21] [INFO ] Flatten gal took : 118 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph590437741982094992.txt, -o, /tmp/graph590437741982094992.bin, -w, /tmp/graph590437741982094992.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph590437741982094992.bin, -l, -1, -v, -w, /tmp/graph590437741982094992.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 22:03:21] [INFO ] Decomposing Gal with order
[2021-05-14 22:03:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 22:03:22] [INFO ] Removed a total of 2835 redundant transitions.
[2021-05-14 22:03:23] [INFO ] Flatten gal took : 201 ms
[2021-05-14 22:03:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 12 ms.
[2021-05-14 22:03:30] [INFO ] Time to serialize gal into /tmp/CTLFireability15720752153319522047.gal : 14 ms
[2021-05-14 22:03:31] [INFO ] Time to serialize properties into /tmp/CTLFireability6366806833591639980.ctl : 71 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability15720752153319522047.gal, -t, CGAL, -ctl, /tmp/CTLFireability6366806833591639980.ctl], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability15720752153319522047.gal -t CGAL -ctl /tmp/CTLFireability6366806833591639980.ctl
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Drop transitions removed 816 transitions
Trivial Post-agglo rules discarded 816 transitions
Performed 816 trivial Post agglomeration. Transition count delta: 816
Iterating post reduction 0 with 816 rules applied. Total rules applied 816 place count 1992 transition count 2280
Reduce places removed 816 places and 0 transitions.
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Iterating post reduction 1 with 839 rules applied. Total rules applied 1655 place count 1176 transition count 2257
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 2 with 23 rules applied. Total rules applied 1678 place count 1153 transition count 2257
Performed 418 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 418 Pre rules applied. Total rules applied 1678 place count 1153 transition count 1839
Deduced a syphon composed of 418 places in 1 ms
Reduce places removed 418 places and 0 transitions.
Iterating global reduction 3 with 836 rules applied. Total rules applied 2514 place count 735 transition count 1839
Performed 52 Post agglomeration using F-continuation condition.Transition count delta: 52
Deduced a syphon composed of 52 places in 3 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 3 with 104 rules applied. Total rules applied 2618 place count 683 transition count 1787
Applied a total of 2618 rules in 359 ms. Remains 683 /1992 variables (removed 1309) and now considering 1787/3096 (removed 1309) transitions.
[2021-05-14 22:04:02] [INFO ] Flatten gal took : 38 ms
[2021-05-14 22:04:02] [INFO ] Flatten gal took : 45 ms
[2021-05-14 22:04:02] [INFO ] Input system was already deterministic with 1787 transitions.
[2021-05-14 22:04:02] [INFO ] Flatten gal took : 72 ms
[2021-05-14 22:04:02] [INFO ] Flatten gal took : 46 ms
[2021-05-14 22:04:02] [INFO ] Time to serialize gal into /tmp/CTLFireability3608955566336782061.gal : 4 ms
[2021-05-14 22:04:02] [INFO ] Time to serialize properties into /tmp/CTLFireability12269931225113197774.ctl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability3608955566336782061.gal, -t, CGAL, -ctl, /tmp/CTLFireability12269931225113197774.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability3608955566336782061.gal -t CGAL -ctl /tmp/CTLFireability12269931225113197774.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2021-05-14 22:04:32] [INFO ] Flatten gal took : 43 ms
[2021-05-14 22:04:32] [INFO ] Applying decomposition
[2021-05-14 22:04:32] [INFO ] Flatten gal took : 43 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph17375667664122394141.txt, -o, /tmp/graph17375667664122394141.bin, -w, /tmp/graph17375667664122394141.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph17375667664122394141.bin, -l, -1, -v, -w, /tmp/graph17375667664122394141.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 22:04:32] [INFO ] Decomposing Gal with order
[2021-05-14 22:04:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 22:04:32] [INFO ] Removed a total of 2569 redundant transitions.
[2021-05-14 22:04:32] [INFO ] Flatten gal took : 95 ms
[2021-05-14 22:04:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 643 labels/synchronizations in 56 ms.
[2021-05-14 22:04:32] [INFO ] Time to serialize gal into /tmp/CTLFireability2582433022564171010.gal : 10 ms
[2021-05-14 22:04:32] [INFO ] Time to serialize properties into /tmp/CTLFireability8046125166550037833.ctl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability2582433022564171010.gal, -t, CGAL, -ctl, /tmp/CTLFireability8046125166550037833.ctl], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability2582433022564171010.gal -t CGAL -ctl /tmp/CTLFireability8046125166550037833.ctl
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Drop transitions removed 892 transitions
Trivial Post-agglo rules discarded 892 transitions
Performed 892 trivial Post agglomeration. Transition count delta: 892
Iterating post reduction 0 with 892 rules applied. Total rules applied 892 place count 1992 transition count 2204
Reduce places removed 892 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 893 rules applied. Total rules applied 1785 place count 1100 transition count 2203
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1786 place count 1099 transition count 2203
Performed 446 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 446 Pre rules applied. Total rules applied 1786 place count 1099 transition count 1757
Deduced a syphon composed of 446 places in 2 ms
Reduce places removed 446 places and 0 transitions.
Iterating global reduction 3 with 892 rules applied. Total rules applied 2678 place count 653 transition count 1757
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 2 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 3 with 112 rules applied. Total rules applied 2790 place count 597 transition count 1701
Applied a total of 2790 rules in 344 ms. Remains 597 /1992 variables (removed 1395) and now considering 1701/3096 (removed 1395) transitions.
[2021-05-14 22:05:03] [INFO ] Flatten gal took : 37 ms
[2021-05-14 22:05:03] [INFO ] Flatten gal took : 44 ms
[2021-05-14 22:05:03] [INFO ] Input system was already deterministic with 1701 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 1) seen :0
Finished Best-First random walk after 1269 steps, including 0 resets, run visited all 1 properties in 13 ms. (steps per millisecond=97 )
FORMULA Peterson-PT-7-CTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Drop transitions removed 887 transitions
Trivial Post-agglo rules discarded 887 transitions
Performed 887 trivial Post agglomeration. Transition count delta: 887
Iterating post reduction 0 with 887 rules applied. Total rules applied 887 place count 1992 transition count 2209
Reduce places removed 887 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 888 rules applied. Total rules applied 1775 place count 1105 transition count 2208
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1776 place count 1104 transition count 2208
Performed 446 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 446 Pre rules applied. Total rules applied 1776 place count 1104 transition count 1762
Deduced a syphon composed of 446 places in 2 ms
Reduce places removed 446 places and 0 transitions.
Iterating global reduction 3 with 892 rules applied. Total rules applied 2668 place count 658 transition count 1762
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 2 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 3 with 112 rules applied. Total rules applied 2780 place count 602 transition count 1706
Applied a total of 2780 rules in 215 ms. Remains 602 /1992 variables (removed 1390) and now considering 1706/3096 (removed 1390) transitions.
[2021-05-14 22:05:04] [INFO ] Flatten gal took : 37 ms
[2021-05-14 22:05:04] [INFO ] Flatten gal took : 44 ms
[2021-05-14 22:05:05] [INFO ] Input system was already deterministic with 1706 transitions.
Finished random walk after 56 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=28 )
FORMULA Peterson-PT-7-CTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Drop transitions removed 891 transitions
Trivial Post-agglo rules discarded 891 transitions
Performed 891 trivial Post agglomeration. Transition count delta: 891
Iterating post reduction 0 with 891 rules applied. Total rules applied 891 place count 1992 transition count 2205
Reduce places removed 891 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 892 rules applied. Total rules applied 1783 place count 1101 transition count 2204
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1784 place count 1100 transition count 2204
Performed 447 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 447 Pre rules applied. Total rules applied 1784 place count 1100 transition count 1757
Deduced a syphon composed of 447 places in 2 ms
Reduce places removed 447 places and 0 transitions.
Iterating global reduction 3 with 894 rules applied. Total rules applied 2678 place count 653 transition count 1757
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 2 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 3 with 112 rules applied. Total rules applied 2790 place count 597 transition count 1701
Applied a total of 2790 rules in 188 ms. Remains 597 /1992 variables (removed 1395) and now considering 1701/3096 (removed 1395) transitions.
[2021-05-14 22:05:05] [INFO ] Flatten gal took : 44 ms
[2021-05-14 22:05:05] [INFO ] Flatten gal took : 44 ms
[2021-05-14 22:05:06] [INFO ] Input system was already deterministic with 1701 transitions.
[2021-05-14 22:05:06] [INFO ] Flatten gal took : 41 ms
[2021-05-14 22:05:06] [INFO ] Flatten gal took : 42 ms
[2021-05-14 22:05:06] [INFO ] Time to serialize gal into /tmp/CTLFireability10046748662021806833.gal : 4 ms
[2021-05-14 22:05:06] [INFO ] Time to serialize properties into /tmp/CTLFireability1606160077955963461.ctl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability10046748662021806833.gal, -t, CGAL, -ctl, /tmp/CTLFireability1606160077955963461.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability10046748662021806833.gal -t CGAL -ctl /tmp/CTLFireability1606160077955963461.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2021-05-14 22:05:36] [INFO ] Flatten gal took : 42 ms
[2021-05-14 22:05:36] [INFO ] Applying decomposition
[2021-05-14 22:05:36] [INFO ] Flatten gal took : 57 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph5263503827271329559.txt, -o, /tmp/graph5263503827271329559.bin, -w, /tmp/graph5263503827271329559.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph5263503827271329559.bin, -l, -1, -v, -w, /tmp/graph5263503827271329559.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 22:05:36] [INFO ] Decomposing Gal with order
[2021-05-14 22:05:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 22:05:36] [INFO ] Removed a total of 2503 redundant transitions.
[2021-05-14 22:05:36] [INFO ] Flatten gal took : 84 ms
[2021-05-14 22:05:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 980 labels/synchronizations in 56 ms.
[2021-05-14 22:05:36] [INFO ] Time to serialize gal into /tmp/CTLFireability8302393645532591805.gal : 9 ms
[2021-05-14 22:05:36] [INFO ] Time to serialize properties into /tmp/CTLFireability14206918946730019878.ctl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability8302393645532591805.gal, -t, CGAL, -ctl, /tmp/CTLFireability14206918946730019878.ctl], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability8302393645532591805.gal -t CGAL -ctl /tmp/CTLFireability14206918946730019878.ctl
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2021-05-14 22:06:07] [INFO ] Flatten gal took : 517 ms
[2021-05-14 22:06:12] [INFO ] Flatten gal took : 488 ms
[2021-05-14 22:06:16] [INFO ] Applying decomposition
[2021-05-14 22:06:17] [INFO ] Flatten gal took : 557 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph9457496029232805380.txt, -o, /tmp/graph9457496029232805380.bin, -w, /tmp/graph9457496029232805380.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph9457496029232805380.bin, -l, -1, -v, -w, /tmp/graph9457496029232805380.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 22:06:18] [INFO ] Decomposing Gal with order
[2021-05-14 22:06:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 22:06:27] [INFO ] Removed a total of 2835 redundant transitions.
[2021-05-14 22:06:27] [INFO ] Flatten gal took : 774 ms
[2021-05-14 22:08:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 8 ms.
[2021-05-14 22:08:17] [INFO ] Time to serialize gal into /tmp/CTLFireability11974664076253659370.gal : 14 ms
[2021-05-14 22:08:35] [INFO ] Time to serialize properties into /tmp/CTLFireability10037954833520521657.ctl : 17753 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability11974664076253659370.gal, -t, CGAL, -ctl, /tmp/CTLFireability10037954833520521657.ctl], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability11974664076253659370.gal -t CGAL -ctl /tmp/CTLFireability10037954833520521657.ctl
No direction supplied, using forward translation only.
Parsed 14 CTL formulae.
Detected timeout of ITS tools.
[2021-05-14 22:32:18] [INFO ] Applying decomposition
[2021-05-14 22:32:20] [INFO ] Flatten gal took : 1699 ms
[2021-05-14 22:32:22] [INFO ] Decomposing Gal with order
[2021-05-14 22:32:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 22:32:31] [INFO ] Removed a total of 2070 redundant transitions.
[2021-05-14 22:32:32] [INFO ] Flatten gal took : 1214 ms
[2021-05-14 22:32:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 994 labels/synchronizations in 55 ms.
[2021-05-14 22:32:32] [INFO ] Time to serialize gal into /tmp/CTLFireability6236832283773012594.gal : 27 ms
[2021-05-14 22:32:35] [INFO ] Time to serialize properties into /tmp/CTLFireability16897050848950835806.ctl : 3174 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability6236832283773012594.gal, -t, CGAL, -ctl, /tmp/CTLFireability16897050848950835806.ctl], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability6236832283773012594.gal -t CGAL -ctl /tmp/CTLFireability16897050848950835806.ctl
No direction supplied, using forward translation only.
Parsed 14 CTL formulae.

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination CTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="Peterson-PT-7"
export BK_EXAMINATION="CTLFireability"
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-4028"
echo " Executing tool itstools"
echo " Input is Peterson-PT-7, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r140-tall-162089128200642"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Peterson-PT-7.tgz
mv Peterson-PT-7 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;