Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2021-input.r178-tajo-162089415200052.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/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 QuasiCertifProtocol-COL-28, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-tajo-162089415200052
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 112K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 89K 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.8K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Mar 28 16:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 16:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 28 16:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 27 10:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 27 10:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 25 13:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 25 13:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 22 08:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 08:13 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_pt
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 5 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 120K 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 QuasiCertifProtocol-COL-28-00
FORMULA_NAME QuasiCertifProtocol-COL-28-01
FORMULA_NAME QuasiCertifProtocol-COL-28-02
FORMULA_NAME QuasiCertifProtocol-COL-28-03
FORMULA_NAME QuasiCertifProtocol-COL-28-04
FORMULA_NAME QuasiCertifProtocol-COL-28-05
FORMULA_NAME QuasiCertifProtocol-COL-28-06
FORMULA_NAME QuasiCertifProtocol-COL-28-07
FORMULA_NAME QuasiCertifProtocol-COL-28-08
FORMULA_NAME QuasiCertifProtocol-COL-28-09
FORMULA_NAME QuasiCertifProtocol-COL-28-10
FORMULA_NAME QuasiCertifProtocol-COL-28-11
FORMULA_NAME QuasiCertifProtocol-COL-28-12
FORMULA_NAME QuasiCertifProtocol-COL-28-13
FORMULA_NAME QuasiCertifProtocol-COL-28-14
FORMULA_NAME QuasiCertifProtocol-COL-28-15

=== Now, execution of the tool begins

BK_START 1621232343831

Running Version 0
[2021-05-17 06:19:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -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-17 06:19:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 06:19:05] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
[2021-05-17 06:19:05] [WARNING] Using fallBack plugin, rng conformance not checked
[2021-05-17 06:19:06] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 637 ms
[2021-05-17 06:19:06] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 2998 PT places and 446.0 transition bindings in 22 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
FORMULA QuasiCertifProtocol-COL-28-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-28-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 06:19:06] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions in 3 ms.
[2021-05-17 06:19:06] [INFO ] Skeletonized HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1000_3434691931607438578.dot
[2021-05-17 06:19:06] [INFO ] Initial state test concluded for 3 properties.
FORMULA QuasiCertifProtocol-COL-28-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-28-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 100005 steps, including 2559 resets, run finished after 64 ms. (steps per millisecond=1562 ) properties (out of 25) seen :21
Running SMT prover for 4 properties.
// Phase 1: matrix 26 rows 30 cols
[2021-05-17 06:19:06] [INFO ] Computed 5 place invariants in 6 ms
[2021-05-17 06:19:06] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned unsat
[2021-05-17 06:19:06] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-17 06:19:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:19:06] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2021-05-17 06:19:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 06:19:06] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2021-05-17 06:19:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 06:19:06] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2021-05-17 06:19:06] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 14 ms.
[2021-05-17 06:19:06] [INFO ] Added : 12 causal constraints over 3 iterations in 28 ms. Result :sat
[2021-05-17 06:19:06] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-17 06:19:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:19:06] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2021-05-17 06:19:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 06:19:06] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2021-05-17 06:19:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 06:19:06] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2021-05-17 06:19:06] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 4 ms.
[2021-05-17 06:19:06] [INFO ] Added : 12 causal constraints over 3 iterations in 29 ms. Result :sat
[2021-05-17 06:19:06] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-17 06:19:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:19:06] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-17 06:19:06] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 12 ms.
[2021-05-17 06:19:06] [INFO ] Added : 13 causal constraints over 3 iterations in 29 ms. Result :sat
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
[2021-05-17 06:19:06] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-17 06:19:06] [INFO ] Flatten gal took : 20 ms
FORMULA QuasiCertifProtocol-COL-28-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 06:19:06] [INFO ] Flatten gal took : 4 ms
[2021-05-17 06:19:06] [INFO ] Unfolded HLPN to a Petri net with 2998 places and 446 transitions in 26 ms.
[2021-05-17 06:19:06] [INFO ] Unfolded HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1001_16078806235427197196.dot
[2021-05-17 06:19:06] [INFO ] Initial state test concluded for 1 properties.
Support contains 2848 out of 2998 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2998/2998 places, 446/446 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 2997 transition count 446
Applied a total of 1 rules in 30 ms. Remains 2997 /2998 variables (removed 1) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2997 cols
[2021-05-17 06:19:07] [INFO ] Computed 2552 place invariants in 116 ms
[2021-05-17 06:19:08] [INFO ] Implicit Places using invariants in 1065 ms returned []
// Phase 1: matrix 446 rows 2997 cols
[2021-05-17 06:19:08] [INFO ] Computed 2552 place invariants in 62 ms
[2021-05-17 06:19:10] [INFO ] Implicit Places using invariants and state equation in 2164 ms returned []
Implicit Place search using SMT with State Equation took 3231 ms to find 0 implicit places.
// Phase 1: matrix 446 rows 2997 cols
[2021-05-17 06:19:10] [INFO ] Computed 2552 place invariants in 70 ms
[2021-05-17 06:19:11] [INFO ] Dead Transitions using invariants and state equation in 1286 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2997/2998 places, 446/446 transitions.
[2021-05-17 06:19:11] [INFO ] Flatten gal took : 203 ms
[2021-05-17 06:19:11] [INFO ] Flatten gal took : 110 ms
[2021-05-17 06:19:12] [INFO ] Input system was already deterministic with 446 transitions.
Incomplete random walk after 100000 steps, including 3025 resets, run finished after 4895 ms. (steps per millisecond=20 ) properties (out of 23) seen :5
Running SMT prover for 18 properties.
// Phase 1: matrix 446 rows 2997 cols
[2021-05-17 06:19:17] [INFO ] Computed 2552 place invariants in 59 ms
[2021-05-17 06:19:17] [INFO ] [Real]Absence check using 31 positive place invariants in 87 ms returned sat
[2021-05-17 06:19:18] [INFO ] [Real]Absence check using 31 positive and 2521 generalized place invariants in 550 ms returned sat
[2021-05-17 06:19:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:19:20] [INFO ] [Real]Absence check using state equation in 2475 ms returned sat
[2021-05-17 06:19:20] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 06:19:21] [INFO ] [Nat]Absence check using 31 positive place invariants in 92 ms returned sat
[2021-05-17 06:19:21] [INFO ] [Nat]Absence check using 31 positive and 2521 generalized place invariants in 414 ms returned sat
[2021-05-17 06:19:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 06:19:24] [INFO ] [Nat]Absence check using state equation in 2884 ms returned sat
[2021-05-17 06:19:24] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 54 ms.
[2021-05-17 06:19:27] [INFO ] Added : 90 causal constraints over 18 iterations in 2499 ms. Result :sat
[2021-05-17 06:19:27] [INFO ] [Real]Absence check using 31 positive place invariants in 31 ms returned unsat
[2021-05-17 06:19:27] [INFO ] [Real]Absence check using 31 positive place invariants in 68 ms returned sat
[2021-05-17 06:19:28] [INFO ] [Real]Absence check using 31 positive and 2521 generalized place invariants in 540 ms returned sat
[2021-05-17 06:19:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:19:33] [INFO ] [Real]Absence check using state equation in 5193 ms returned sat
[2021-05-17 06:19:33] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 06:19:34] [INFO ] [Nat]Absence check using 31 positive place invariants in 65 ms returned sat
[2021-05-17 06:19:34] [INFO ] [Nat]Absence check using 31 positive and 2521 generalized place invariants in 497 ms returned sat
[2021-05-17 06:19:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 06:19:39] [INFO ] [Nat]Absence check using state equation in 5342 ms returned sat
[2021-05-17 06:19:41] [INFO ] Deduced a trap composed of 6 places in 1383 ms of which 6 ms to minimize.
[2021-05-17 06:19:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1616 ms
[2021-05-17 06:19:41] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 62 ms.
[2021-05-17 06:19:45] [INFO ] Added : 128 causal constraints over 26 iterations in 3557 ms. Result :sat
[2021-05-17 06:19:45] [INFO ] [Real]Absence check using 31 positive place invariants in 67 ms returned sat
[2021-05-17 06:19:45] [INFO ] [Real]Absence check using 31 positive and 2521 generalized place invariants in 499 ms returned sat
[2021-05-17 06:19:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:19:46] [INFO ] [Real]Absence check using state equation in 1009 ms returned sat
[2021-05-17 06:19:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 06:19:47] [INFO ] [Nat]Absence check using 31 positive place invariants in 69 ms returned sat
[2021-05-17 06:19:47] [INFO ] [Nat]Absence check using 31 positive and 2521 generalized place invariants in 517 ms returned sat
[2021-05-17 06:19:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 06:19:48] [INFO ] [Nat]Absence check using state equation in 936 ms returned sat
[2021-05-17 06:19:49] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 55 ms.
[2021-05-17 06:19:51] [INFO ] Added : 119 causal constraints over 24 iterations in 2990 ms. Result :sat
[2021-05-17 06:19:52] [INFO ] [Real]Absence check using 31 positive place invariants in 64 ms returned sat
[2021-05-17 06:19:52] [INFO ] [Real]Absence check using 31 positive and 2521 generalized place invariants in 516 ms returned sat
[2021-05-17 06:19:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:19:53] [INFO ] [Real]Absence check using state equation in 998 ms returned sat
[2021-05-17 06:19:54] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 06:19:54] [INFO ] [Nat]Absence check using 31 positive place invariants in 43 ms returned sat
[2021-05-17 06:19:54] [INFO ] [Nat]Absence check using 31 positive and 2521 generalized place invariants in 411 ms returned sat
[2021-05-17 06:19:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 06:19:55] [INFO ] [Nat]Absence check using state equation in 932 ms returned sat
[2021-05-17 06:19:55] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 49 ms.
[2021-05-17 06:19:58] [INFO ] Added : 118 causal constraints over 24 iterations in 3023 ms. Result :sat
[2021-05-17 06:19:59] [INFO ] [Real]Absence check using 31 positive place invariants in 63 ms returned sat
[2021-05-17 06:19:59] [INFO ] [Real]Absence check using 31 positive and 2521 generalized place invariants in 537 ms returned sat
[2021-05-17 06:19:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:20:00] [INFO ] [Real]Absence check using state equation in 992 ms returned sat
[2021-05-17 06:20:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 06:20:01] [INFO ] [Nat]Absence check using 31 positive place invariants in 61 ms returned sat
[2021-05-17 06:20:01] [INFO ] [Nat]Absence check using 31 positive and 2521 generalized place invariants in 480 ms returned sat
[2021-05-17 06:20:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 06:20:02] [INFO ] [Nat]Absence check using state equation in 950 ms returned sat
[2021-05-17 06:20:02] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 46 ms.
[2021-05-17 06:20:03] [INFO ] Added : 30 causal constraints over 6 iterations in 847 ms. Result :sat
[2021-05-17 06:20:04] [INFO ] [Real]Absence check using 31 positive place invariants in 62 ms returned sat
[2021-05-17 06:20:04] [INFO ] [Real]Absence check using 31 positive and 2521 generalized place invariants in 558 ms returned sat
[2021-05-17 06:20:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:20:08] [INFO ] [Real]Absence check using state equation in 3868 ms returned sat
[2021-05-17 06:20:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 06:20:08] [INFO ] [Nat]Absence check using 31 positive place invariants in 47 ms returned sat
[2021-05-17 06:20:09] [INFO ] [Nat]Absence check using 31 positive and 2521 generalized place invariants in 445 ms returned sat
[2021-05-17 06:20:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 06:20:13] [INFO ] [Nat]Absence check using state equation in 3768 ms returned sat
[2021-05-17 06:20:13] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 52 ms.
[2021-05-17 06:20:15] [INFO ] Added : 119 causal constraints over 24 iterations in 2648 ms. Result :sat
[2021-05-17 06:20:16] [INFO ] [Real]Absence check using 31 positive place invariants in 64 ms returned sat
[2021-05-17 06:20:16] [INFO ] [Real]Absence check using 31 positive and 2521 generalized place invariants in 609 ms returned sat
[2021-05-17 06:20:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:20:17] [INFO ] [Real]Absence check using state equation in 1116 ms returned sat
[2021-05-17 06:20:18] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 51 ms.
[2021-05-17 06:20:19] [INFO ] Added : 60 causal constraints over 12 iterations in 1758 ms. Result :sat
[2021-05-17 06:20:20] [INFO ] [Real]Absence check using 31 positive place invariants in 63 ms returned sat
[2021-05-17 06:20:20] [INFO ] [Real]Absence check using 31 positive and 2521 generalized place invariants in 540 ms returned sat
[2021-05-17 06:20:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:20:22] [INFO ] [Real]Absence check using state equation in 1375 ms returned sat
[2021-05-17 06:20:22] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 42 ms.
[2021-05-17 06:20:25] [INFO ] Added : 118 causal constraints over 24 iterations in 3301 ms. Result :sat
[2021-05-17 06:20:26] [INFO ] [Real]Absence check using 31 positive place invariants in 62 ms returned sat
[2021-05-17 06:20:26] [INFO ] [Real]Absence check using 31 positive and 2521 generalized place invariants in 578 ms returned sat
[2021-05-17 06:20:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:20:27] [INFO ] [Real]Absence check using state equation in 1053 ms returned sat
[2021-05-17 06:20:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 06:20:28] [INFO ] [Nat]Absence check using 31 positive place invariants in 61 ms returned sat
[2021-05-17 06:20:28] [INFO ] [Nat]Absence check using 31 positive and 2521 generalized place invariants in 523 ms returned sat
[2021-05-17 06:20:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 06:20:29] [INFO ] [Nat]Absence check using state equation in 964 ms returned sat
[2021-05-17 06:20:29] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 52 ms.
[2021-05-17 06:20:30] [INFO ] Added : 31 causal constraints over 7 iterations in 916 ms. Result :sat
[2021-05-17 06:20:31] [INFO ] [Real]Absence check using 31 positive place invariants in 65 ms returned sat
[2021-05-17 06:20:31] [INFO ] [Real]Absence check using 31 positive and 2521 generalized place invariants in 580 ms returned sat
[2021-05-17 06:20:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:20:32] [INFO ] [Real]Absence check using state equation in 974 ms returned sat
[2021-05-17 06:20:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 06:20:32] [INFO ] [Nat]Absence check using 31 positive place invariants in 47 ms returned sat
[2021-05-17 06:20:33] [INFO ] [Nat]Absence check using 31 positive and 2521 generalized place invariants in 521 ms returned sat
[2021-05-17 06:20:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 06:20:34] [INFO ] [Nat]Absence check using state equation in 936 ms returned sat
[2021-05-17 06:20:34] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 38 ms.
[2021-05-17 06:20:37] [INFO ] Added : 119 causal constraints over 24 iterations in 2838 ms. Result :sat
[2021-05-17 06:20:37] [INFO ] [Real]Absence check using 31 positive place invariants in 63 ms returned sat
[2021-05-17 06:20:38] [INFO ] [Real]Absence check using 31 positive and 2521 generalized place invariants in 516 ms returned sat
[2021-05-17 06:20:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:20:42] [INFO ] [Real]Absence check using state equation in 4403 ms returned sat
[2021-05-17 06:20:42] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 06:20:43] [INFO ] [Nat]Absence check using 31 positive place invariants in 44 ms returned sat
[2021-05-17 06:20:43] [INFO ] [Nat]Absence check using 31 positive and 2521 generalized place invariants in 454 ms returned sat
[2021-05-17 06:20:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 06:20:58] [INFO ] [Nat]Absence check using state equation in 14624 ms returned sat
[2021-05-17 06:20:58] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 50 ms.
[2021-05-17 06:20:59] [INFO ] Added : 46 causal constraints over 10 iterations in 1289 ms. Result :sat
[2021-05-17 06:20:59] [INFO ] [Real]Absence check using 31 positive place invariants in 65 ms returned sat
[2021-05-17 06:21:00] [INFO ] [Real]Absence check using 31 positive and 2521 generalized place invariants in 582 ms returned sat
[2021-05-17 06:21:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:21:08] [INFO ] [Real]Absence check using state equation in 7509 ms returned sat
[2021-05-17 06:21:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 06:21:08] [INFO ] [Nat]Absence check using 31 positive place invariants in 62 ms returned sat
[2021-05-17 06:21:09] [INFO ] [Nat]Absence check using 31 positive and 2521 generalized place invariants in 508 ms returned sat
[2021-05-17 06:21:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 06:21:17] [INFO ] [Nat]Absence check using state equation in 7994 ms returned sat
[2021-05-17 06:21:17] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 38 ms.
[2021-05-17 06:21:20] [INFO ] Added : 136 causal constraints over 28 iterations in 3113 ms. Result :sat
[2021-05-17 06:21:20] [INFO ] [Real]Absence check using 31 positive place invariants in 64 ms returned sat
[2021-05-17 06:21:21] [INFO ] [Real]Absence check using 31 positive and 2521 generalized place invariants in 582 ms returned sat
[2021-05-17 06:21:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:21:22] [INFO ] [Real]Absence check using state equation in 1019 ms returned sat
[2021-05-17 06:21:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 06:21:22] [INFO ] [Nat]Absence check using 31 positive place invariants in 61 ms returned sat
[2021-05-17 06:21:23] [INFO ] [Nat]Absence check using 31 positive and 2521 generalized place invariants in 597 ms returned sat
[2021-05-17 06:21:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 06:21:24] [INFO ] [Nat]Absence check using state equation in 1043 ms returned sat
[2021-05-17 06:21:24] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 36 ms.
[2021-05-17 06:21:25] [INFO ] Added : 60 causal constraints over 12 iterations in 1555 ms. Result :sat
[2021-05-17 06:21:26] [INFO ] [Real]Absence check using 31 positive place invariants in 65 ms returned sat
[2021-05-17 06:21:27] [INFO ] [Real]Absence check using 31 positive and 2521 generalized place invariants in 857 ms returned sat
[2021-05-17 06:21:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:21:32] [INFO ] [Real]Absence check using state equation in 5521 ms returned sat
[2021-05-17 06:21:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 06:21:33] [INFO ] [Nat]Absence check using 31 positive place invariants in 46 ms returned sat
[2021-05-17 06:21:34] [INFO ] [Nat]Absence check using 31 positive and 2521 generalized place invariants in 889 ms returned sat
[2021-05-17 06:21:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 06:21:39] [INFO ] [Nat]Absence check using state equation in 5380 ms returned sat
[2021-05-17 06:21:39] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 40 ms.
[2021-05-17 06:21:42] [INFO ] Added : 120 causal constraints over 24 iterations in 2930 ms. Result :sat
[2021-05-17 06:21:42] [INFO ] [Real]Absence check using 31 positive place invariants in 63 ms returned sat
[2021-05-17 06:21:43] [INFO ] [Real]Absence check using 31 positive and 2521 generalized place invariants in 552 ms returned sat
[2021-05-17 06:21:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:21:44] [INFO ] [Real]Absence check using state equation in 1483 ms returned sat
[2021-05-17 06:21:45] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 06:21:45] [INFO ] [Nat]Absence check using 31 positive place invariants in 59 ms returned sat
[2021-05-17 06:21:45] [INFO ] [Nat]Absence check using 31 positive and 2521 generalized place invariants in 562 ms returned sat
[2021-05-17 06:21:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 06:21:47] [INFO ] [Nat]Absence check using state equation in 1312 ms returned sat
[2021-05-17 06:21:47] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 53 ms.
[2021-05-17 06:21:48] [INFO ] Added : 31 causal constraints over 7 iterations in 974 ms. Result :sat
[2021-05-17 06:21:48] [INFO ] [Real]Absence check using 31 positive place invariants in 63 ms returned sat
[2021-05-17 06:21:49] [INFO ] [Real]Absence check using 31 positive and 2521 generalized place invariants in 550 ms returned sat
[2021-05-17 06:21:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:21:50] [INFO ] [Real]Absence check using state equation in 990 ms returned sat
[2021-05-17 06:21:50] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 27 ms.
[2021-05-17 06:21:53] [INFO ] Added : 118 causal constraints over 24 iterations in 3026 ms. Result :sat
[2021-05-17 06:21:53] [INFO ] [Real]Absence check using 31 positive place invariants in 65 ms returned sat
[2021-05-17 06:21:54] [INFO ] [Real]Absence check using 31 positive and 2521 generalized place invariants in 735 ms returned sat
[2021-05-17 06:21:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:21:55] [INFO ] [Real]Absence check using state equation in 1102 ms returned sat
[2021-05-17 06:21:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 06:21:56] [INFO ] [Nat]Absence check using 31 positive place invariants in 62 ms returned sat
[2021-05-17 06:21:56] [INFO ] [Nat]Absence check using 31 positive and 2521 generalized place invariants in 685 ms returned sat
[2021-05-17 06:21:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 06:21:57] [INFO ] [Nat]Absence check using state equation in 800 ms returned sat
[2021-05-17 06:21:57] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 48 ms.
[2021-05-17 06:22:01] [INFO ] Added : 147 causal constraints over 30 iterations in 3442 ms. Result :sat
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((p0||X(p1)))))], workingDir=/home/mcc/execution]
Support contains 58 out of 2997 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2997/2997 places, 446/446 transitions.
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 2965 transition count 446
Applied a total of 32 rules in 337 ms. Remains 2965 /2997 variables (removed 32) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2965 cols
[2021-05-17 06:22:01] [INFO ] Computed 2521 place invariants in 80 ms
[2021-05-17 06:22:02] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-17 06:22:04] [INFO ] Implicit Places using invariants in 2348 ms returned []
// Phase 1: matrix 446 rows 2965 cols
[2021-05-17 06:22:04] [INFO ] Computed 2521 place invariants in 24 ms
[2021-05-17 06:22:11] [INFO ] Implicit Places using invariants and state equation in 7515 ms returned [2727, 2728, 2729, 2730, 2731, 2732, 2733, 2734, 2735, 2736, 2737, 2738, 2739, 2740, 2741, 2742, 2743, 2744, 2745, 2746, 2747, 2748, 2749, 2750, 2751, 2752, 2753, 2754, 2755]
Discarding 29 places :
Implicit Place search using SMT with State Equation took 9869 ms to find 29 implicit places.
// Phase 1: matrix 446 rows 2936 cols
[2021-05-17 06:22:11] [INFO ] Computed 2492 place invariants in 51 ms
[2021-05-17 06:22:12] [INFO ] Dead Transitions using invariants and state equation in 848 ms returned []
Starting structural reductions, iteration 1 : 2936/2997 places, 446/446 transitions.
Applied a total of 0 rules in 260 ms. Remains 2936 /2936 variables (removed 0) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2936 cols
[2021-05-17 06:22:12] [INFO ] Computed 2492 place invariants in 20 ms
[2021-05-17 06:22:13] [INFO ] Dead Transitions using invariants and state equation in 1042 ms returned []
Finished structural reductions, in 2 iterations. Remains : 2936/2997 places, 446/446 transitions.
Stuttering acceptance computed with spot in 171 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-COL-28-00 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GT 1 (ADD s2814 s2815 s2816 s2817 s2818 s2819 s2820 s2821 s2822 s2823 s2824 s2825 s2826 s2827 s2828 s2829 s2830 s2831 s2832 s2833 s2834 s2835 s2836 s2837 s2838 s2839 s2840 s2841 s2842)), p1:(LEQ 1 (ADD s2901 s2902 s2903 s2904 s2905 s2906 s2907 s2908 s2909 s2910 s2911 s2912 s2913 s2914 s2915 s2916 s2917 s2918 s2919 s2920 s2921 s2922 s2923 s2924 s2925 s2926 s2927 s2928 s2929))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1226 ms.
Product exploration explored 100000 steps with 50000 reset in 1152 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 2936 transition count 446
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (G p0)), (F (OR (G p1) (G (NOT p1)))), p0, (NOT p1)]
Property proved to be true thanks to knowledge :(F (G p0))
FORMULA QuasiCertifProtocol-COL-28-00 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property QuasiCertifProtocol-COL-28-00 finished in 15614 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 2997 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2997/2997 places, 446/446 transitions.
Reduce places removed 59 places and 0 transitions.
Iterating post reduction 0 with 59 rules applied. Total rules applied 59 place count 2938 transition count 446
Applied a total of 59 rules in 244 ms. Remains 2938 /2997 variables (removed 59) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2938 cols
[2021-05-17 06:22:17] [INFO ] Computed 2493 place invariants in 150 ms
[2021-05-17 06:22:20] [INFO ] Implicit Places using invariants in 3721 ms returned []
// Phase 1: matrix 446 rows 2938 cols
[2021-05-17 06:22:21] [INFO ] Computed 2493 place invariants in 110 ms
[2021-05-17 06:22:28] [INFO ] Implicit Places using invariants and state equation in 7668 ms returned [2729, 2730, 2731, 2732, 2733, 2734, 2735, 2736, 2737, 2738, 2739, 2740, 2741, 2742, 2743, 2744, 2745, 2746, 2747, 2748, 2749, 2750, 2751, 2752, 2753, 2754, 2755, 2756, 2757]
Discarding 29 places :
Implicit Place search using SMT with State Equation took 11392 ms to find 29 implicit places.
// Phase 1: matrix 446 rows 2909 cols
[2021-05-17 06:22:28] [INFO ] Computed 2464 place invariants in 72 ms
[2021-05-17 06:22:29] [INFO ] Dead Transitions using invariants and state equation in 888 ms returned []
Starting structural reductions, iteration 1 : 2909/2997 places, 446/446 transitions.
Applied a total of 0 rules in 117 ms. Remains 2909 /2909 variables (removed 0) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2909 cols
[2021-05-17 06:22:29] [INFO ] Computed 2464 place invariants in 59 ms
[2021-05-17 06:22:30] [INFO ] Dead Transitions using invariants and state equation in 920 ms returned []
Finished structural reductions, in 2 iterations. Remains : 2909/2997 places, 446/446 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-28-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s2 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 1128 ms.
Product exploration explored 100000 steps with 50000 reset in 1140 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 2909 transition count 446
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (OR (G p0) (G (NOT p0)))), p0]
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 1123 ms.
Product exploration explored 100000 steps with 50000 reset in 1153 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 2909 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 2909/2909 places, 446/446 transitions.
Applied a total of 0 rules in 330 ms. Remains 2909 /2909 variables (removed 0) and now considering 446/446 (removed 0) transitions.
[2021-05-17 06:22:36] [INFO ] Redundant transitions in 84 ms returned []
// Phase 1: matrix 446 rows 2909 cols
[2021-05-17 06:22:36] [INFO ] Computed 2464 place invariants in 73 ms
[2021-05-17 06:22:37] [INFO ] Dead Transitions using invariants and state equation in 1052 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2909/2909 places, 446/446 transitions.
Product exploration explored 100000 steps with 50000 reset in 6551 ms.
Product exploration explored 100000 steps with 50000 reset in 6256 ms.
[2021-05-17 06:22:50] [INFO ] Flatten gal took : 75 ms
[2021-05-17 06:22:50] [INFO ] Flatten gal took : 77 ms
[2021-05-17 06:22:50] [INFO ] Time to serialize gal into /tmp/LTL9023667475008789670.gal : 25 ms
[2021-05-17 06:22:50] [INFO ] Time to serialize properties into /tmp/LTL4863066040011642489.ltl : 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-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL9023667475008789670.gal, -t, CGAL, -LTL, /tmp/LTL4863066040011642489.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL9023667475008789670.gal -t CGAL -LTL /tmp/LTL4863066040011642489.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("(AstopAbort_0<=SstopAbort_0)"))))
Formula 0 simplified : !XF"(AstopAbort_0<=SstopAbort_0)"
Detected timeout of ITS tools.
[2021-05-17 06:23:05] [INFO ] Flatten gal took : 114 ms
[2021-05-17 06:23:05] [INFO ] Applying decomposition
[2021-05-17 06:23:05] [INFO ] Flatten gal took : 58 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/graph14138069924601687620.txt, -o, /tmp/graph14138069924601687620.bin, -w, /tmp/graph14138069924601687620.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/graph14138069924601687620.bin, -l, -1, -v, -w, /tmp/graph14138069924601687620.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 06:23:06] [INFO ] Decomposing Gal with order
[2021-05-17 06:23:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 06:23:06] [INFO ] Removed a total of 293 redundant transitions.
[2021-05-17 06:23:06] [INFO ] Flatten gal took : 481 ms
[2021-05-17 06:23:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 673 labels/synchronizations in 314 ms.
[2021-05-17 06:23:08] [INFO ] Time to serialize gal into /tmp/LTL10169501247346301991.gal : 25 ms
[2021-05-17 06:23:08] [INFO ] Time to serialize properties into /tmp/LTL6396392748891044641.ltl : 2 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-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL10169501247346301991.gal, -t, CGAL, -LTL, /tmp/LTL6396392748891044641.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL10169501247346301991.gal -t CGAL -LTL /tmp/LTL6396392748891044641.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("(gu0.AstopAbort_0<=gu0.SstopAbort_0)"))))
Formula 0 simplified : !XF"(gu0.AstopAbort_0<=gu0.SstopAbort_0)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14717563333590718394
[2021-05-17 06:23:23] [INFO ] Built C files in 41ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14717563333590718394
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin14717563333590718394]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin14717563333590718394] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin14717563333590718394] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property QuasiCertifProtocol-COL-28-01 finished in 67106 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(((p0||X(p1))&&(X(p1)||F(p2))))))], workingDir=/home/mcc/execution]
Support contains 61 out of 2997 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2997/2997 places, 446/446 transitions.
Reduce places removed 59 places and 0 transitions.
Iterating post reduction 0 with 59 rules applied. Total rules applied 59 place count 2938 transition count 446
Applied a total of 59 rules in 242 ms. Remains 2938 /2997 variables (removed 59) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2938 cols
[2021-05-17 06:23:24] [INFO ] Computed 2493 place invariants in 103 ms
[2021-05-17 06:23:28] [INFO ] Implicit Places using invariants in 4210 ms returned []
// Phase 1: matrix 446 rows 2938 cols
[2021-05-17 06:23:28] [INFO ] Computed 2493 place invariants in 48 ms
[2021-05-17 06:23:35] [INFO ] Implicit Places using invariants and state equation in 7185 ms returned [2728, 2729, 2730, 2731, 2732, 2733, 2734, 2735, 2736, 2737, 2738, 2739, 2740, 2741, 2742, 2743, 2744, 2745, 2746, 2747, 2748, 2749, 2750, 2751, 2752, 2753, 2754, 2755, 2756]
Discarding 29 places :
Implicit Place search using SMT with State Equation took 11399 ms to find 29 implicit places.
// Phase 1: matrix 446 rows 2909 cols
[2021-05-17 06:23:35] [INFO ] Computed 2464 place invariants in 114 ms
[2021-05-17 06:23:36] [INFO ] Dead Transitions using invariants and state equation in 1090 ms returned []
Starting structural reductions, iteration 1 : 2909/2997 places, 446/446 transitions.
Applied a total of 0 rules in 237 ms. Remains 2909 /2909 variables (removed 0) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2909 cols
[2021-05-17 06:23:37] [INFO ] Computed 2464 place invariants in 104 ms
[2021-05-17 06:23:38] [INFO ] Dead Transitions using invariants and state equation in 1242 ms returned []
Finished structural reductions, in 2 iterations. Remains : 2909/2997 places, 446/446 transitions.
Stuttering acceptance computed with spot in 136 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p2) (NOT p1)), false]
Running random walk in product with property : QuasiCertifProtocol-COL-28-02 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ (ADD s2525 s2526 s2527 s2528 s2529 s2530 s2531 s2532 s2533 s2534 s2535 s2536 s2537 s2538 s2539 s2540 s2541 s2542 s2543 s2544 s2545 s2546 s2547 s2548 s2549 s2550 s2551 s2552 s2553) s1), p2:(GT s2904 (ADD s2641 s2642 s2643 s2644 s2645 s2646 s2647 s2648 s2649 s2650 s2651 s2652 s2653 s2654 s2655 s2656 s2657 s2658 s2659 s2660 s2661 s2662 s2663 s2664 s2665 s2666 s2667 s2668 s2669)), p1:(LEQ s2908 s2904)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33231 reset in 959 ms.
Product exploration explored 100000 steps with 33367 reset in 1048 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 2909 transition count 446
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (OR (G p0) (G (NOT p0)))), (F (G (NOT p2))), (F (OR (G p1) (G (NOT p1)))), p0, (NOT p2), p1]
Stuttering acceptance computed with spot in 174 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p2) (NOT p1)), false]
Product exploration explored 100000 steps with 33330 reset in 1418 ms.
Product exploration explored 100000 steps with 33232 reset in 984 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 155 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p2) (NOT p1)), false]
Support contains 61 out of 2909 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 2909/2909 places, 446/446 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 1 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 2909 transition count 447
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 354 ms. Remains 2909 /2909 variables (removed 0) and now considering 447/446 (removed -1) transitions.
[2021-05-17 06:23:44] [INFO ] Redundant transitions in 19 ms returned []
// Phase 1: matrix 447 rows 2909 cols
[2021-05-17 06:23:44] [INFO ] Computed 2464 place invariants in 97 ms
[2021-05-17 06:23:45] [INFO ] Dead Transitions using invariants and state equation in 1122 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2909/2909 places, 447/446 transitions.
Product exploration explored 100000 steps with 33351 reset in 5522 ms.
Product exploration explored 100000 steps with 33283 reset in 5310 ms.
[2021-05-17 06:23:56] [INFO ] Flatten gal took : 84 ms
[2021-05-17 06:23:56] [INFO ] Flatten gal took : 100 ms
[2021-05-17 06:23:56] [INFO ] Time to serialize gal into /tmp/LTL6621185445675230763.gal : 8 ms
[2021-05-17 06:23:56] [INFO ] Time to serialize properties into /tmp/LTL15696344598628970049.ltl : 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-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL6621185445675230763.gal, -t, CGAL, -LTL, /tmp/LTL15696344598628970049.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL6621185445675230763.gal -t CGAL -LTL /tmp/LTL15696344598628970049.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(G((("(((((((((((((((((((((((((((((n6_0+n6_1)+n6_2)+n6_3)+n6_4)+n6_5)+n6_6)+n6_7)+n6_8)+n6_9)+n6_10)+n6_11)+n6_12)+n6_13)+n6_14)+n6_15)+n6_16)+n6_17)+n6_18)+n6_19)+n6_20)+n6_21)+n6_22)+n6_23)+n6_24)+n6_25)+n6_26)+n6_27)+n6_28)<=SstopAbort_0)")||(X("(AstopOK_0<=a3_0)")))&&((X("(AstopOK_0<=a3_0)"))||(F("(a3_0>((((((((((((((((((((((((((((n2_0+n2_1)+n2_2)+n2_3)+n2_4)+n2_5)+n2_6)+n2_7)+n2_8)+n2_9)+n2_10)+n2_11)+n2_12)+n2_13)+n2_14)+n2_15)+n2_16)+n2_17)+n2_18)+n2_19)+n2_20)+n2_21)+n2_22)+n2_23)+n2_24)+n2_25)+n2_26)+n2_27)+n2_28))")))))))
Formula 0 simplified : !FG(("(((((((((((((((((((((((((((((n6_0+n6_1)+n6_2)+n6_3)+n6_4)+n6_5)+n6_6)+n6_7)+n6_8)+n6_9)+n6_10)+n6_11)+n6_12)+n6_13)+n6_14)+n6_15)+n6_16)+n6_17)+n6_18)+n6_19)+n6_20)+n6_21)+n6_22)+n6_23)+n6_24)+n6_25)+n6_26)+n6_27)+n6_28)<=SstopAbort_0)" | X"(AstopOK_0<=a3_0)") & (X"(AstopOK_0<=a3_0)" | F"(a3_0>((((((((((((((((((((((((((((n2_0+n2_1)+n2_2)+n2_3)+n2_4)+n2_5)+n2_6)+n2_7)+n2_8)+n2_9)+n2_10)+n2_11)+n2_12)+n2_13)+n2_14)+n2_15)+n2_16)+n2_17)+n2_18)+n2_19)+n2_20)+n2_21)+n2_22)+n2_23)+n2_24)+n2_25)+n2_26)+n2_27)+n2_28))"))
Detected timeout of ITS tools.
[2021-05-17 06:24:12] [INFO ] Flatten gal took : 123 ms
[2021-05-17 06:24:12] [INFO ] Applying decomposition
[2021-05-17 06:24:12] [INFO ] Flatten gal took : 82 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/graph9374866156698720386.txt, -o, /tmp/graph9374866156698720386.bin, -w, /tmp/graph9374866156698720386.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/graph9374866156698720386.bin, -l, -1, -v, -w, /tmp/graph9374866156698720386.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 06:24:12] [INFO ] Decomposing Gal with order
[2021-05-17 06:24:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 06:24:12] [INFO ] Removed a total of 192 redundant transitions.
[2021-05-17 06:24:12] [INFO ] Flatten gal took : 258 ms
[2021-05-17 06:24:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 569 labels/synchronizations in 103 ms.
[2021-05-17 06:24:13] [INFO ] Time to serialize gal into /tmp/LTL8878416682126893726.gal : 29 ms
[2021-05-17 06:24:13] [INFO ] Time to serialize properties into /tmp/LTL17539184515346257588.ltl : 2 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-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL8878416682126893726.gal, -t, CGAL, -LTL, /tmp/LTL17539184515346257588.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8878416682126893726.gal -t CGAL -LTL /tmp/LTL17539184515346257588.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(G((("(((((((((((((((((((((((((((((gu1.n6_0+gu1.n6_1)+gu1.n6_2)+gu1.n6_3)+gu1.n6_4)+gu1.n6_5)+gu1.n6_6)+gu1.n6_7)+gu1.n6_8)+gu1.n6_9)+gu1.n6_10)+gu1.n6_11)+gu1.n6_12)+gu1.n6_13)+gu1.n6_14)+gu1.n6_15)+gu1.n6_16)+gu1.n6_17)+gu1.n6_18)+gu1.n6_19)+gu1.n6_20)+gu1.n6_21)+gu1.n6_22)+gu1.n6_23)+gu1.n6_24)+gu1.n6_25)+gu1.n6_26)+gu1.n6_27)+gu1.n6_28)<=gu1.SstopAbort_0)")||(X("(gu15.AstopOK_0<=gu15.a3_0)")))&&((X("(gu15.AstopOK_0<=gu15.a3_0)"))||(F("(gu15.a3_0>((((((((((((((((((((((((((((gu15.n2_0+gu15.n2_1)+gu15.n2_2)+gu15.n2_3)+gu15.n2_4)+gu15.n2_5)+gu15.n2_6)+gu15.n2_7)+gu15.n2_8)+gu15.n2_9)+gu15.n2_10)+gu15.n2_11)+gu15.n2_12)+gu15.n2_13)+gu15.n2_14)+gu15.n2_15)+gu15.n2_16)+gu15.n2_17)+gu15.n2_18)+gu15.n2_19)+gu15.n2_20)+gu15.n2_21)+gu15.n2_22)+gu15.n2_23)+gu15.n2_24)+gu15.n2_25)+gu15.n2_26)+gu15.n2_27)+gu15.n2_28))")))))))
Formula 0 simplified : !FG(("(((((((((((((((((((((((((((((gu1.n6_0+gu1.n6_1)+gu1.n6_2)+gu1.n6_3)+gu1.n6_4)+gu1.n6_5)+gu1.n6_6)+gu1.n6_7)+gu1.n6_8)+gu1.n6_9)+gu1.n6_10)+gu1.n6_11)+gu1.n6_12)+gu1.n6_13)+gu1.n6_14)+gu1.n6_15)+gu1.n6_16)+gu1.n6_17)+gu1.n6_18)+gu1.n6_19)+gu1.n6_20)+gu1.n6_21)+gu1.n6_22)+gu1.n6_23)+gu1.n6_24)+gu1.n6_25)+gu1.n6_26)+gu1.n6_27)+gu1.n6_28)<=gu1.SstopAbort_0)" | X"(gu15.AstopOK_0<=gu15.a3_0)") & (X"(gu15.AstopOK_0<=gu15.a3_0)" | F"(gu15.a3_0>((((((((((((((((((((((((((((gu15.n2_0+gu15.n2_1)+gu15.n2_2)+gu15.n2_3)+gu15.n2_4)+gu15.n2_5)+gu15.n2_6)+gu15.n2_7)+gu15.n2_8)+gu15.n2_9)+gu15.n2_10)+gu15.n2_11)+gu15.n2_12)+gu15.n2_13)+gu15.n2_14)+gu15.n2_15)+gu15.n2_16)+gu15.n2_17)+gu15.n2_18)+gu15.n2_19)+gu15.n2_20)+gu15.n2_21)+gu15.n2_22)+gu15.n2_23)+gu15.n2_24)+gu15.n2_25)+gu15.n2_26)+gu15.n2_27)+gu15.n2_28))"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7296392628559413017
[2021-05-17 06:24:28] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7296392628559413017
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin7296392628559413017]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin7296392628559413017] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin7296392628559413017] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property QuasiCertifProtocol-COL-28-02 finished in 65239 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((p0 U p1)&&(G(!p1) U G(p2))))], workingDir=/home/mcc/execution]
Support contains 900 out of 2997 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2997/2997 places, 446/446 transitions.
Graph (complete) has 30288 edges and 2997 vertex of which 2936 are kept as prefixes of interest. Removing 61 places using SCC suffix rule.26 ms
Discarding 61 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 2934 transition count 444
Applied a total of 3 rules in 435 ms. Remains 2934 /2997 variables (removed 63) and now considering 444/446 (removed 2) transitions.
// Phase 1: matrix 444 rows 2934 cols
[2021-05-17 06:24:29] [INFO ] Computed 2492 place invariants in 49 ms
[2021-05-17 06:24:32] [INFO ] Implicit Places using invariants in 2371 ms returned []
// Phase 1: matrix 444 rows 2934 cols
[2021-05-17 06:24:32] [INFO ] Computed 2492 place invariants in 48 ms
[2021-05-17 06:24:36] [INFO ] Implicit Places using invariants and state equation in 4352 ms returned [2669, 2670, 2671, 2672, 2673, 2674, 2675, 2676, 2677, 2678, 2679, 2680, 2681, 2682, 2683, 2684, 2685, 2686, 2687, 2688, 2689, 2690, 2691, 2692, 2693, 2694, 2695, 2696, 2697, 2727, 2728, 2729, 2730, 2731, 2732, 2733, 2734, 2735, 2736, 2737, 2738, 2739, 2740, 2741, 2742, 2743, 2744, 2745, 2746, 2747, 2748, 2749, 2750, 2751, 2752, 2753, 2754, 2755]
Discarding 58 places :
Implicit Place search using SMT with State Equation took 6729 ms to find 58 implicit places.
[2021-05-17 06:24:36] [INFO ] Redundant transitions in 12 ms returned []
// Phase 1: matrix 444 rows 2876 cols
[2021-05-17 06:24:36] [INFO ] Computed 2436 place invariants in 400 ms
[2021-05-17 06:24:38] [INFO ] Dead Transitions using invariants and state equation in 1512 ms returned []
Starting structural reductions, iteration 1 : 2876/2997 places, 444/446 transitions.
Applied a total of 0 rules in 99 ms. Remains 2876 /2876 variables (removed 0) and now considering 444/444 (removed 0) transitions.
[2021-05-17 06:24:38] [INFO ] Redundant transitions in 10 ms returned []
// Phase 1: matrix 444 rows 2876 cols
[2021-05-17 06:24:38] [INFO ] Computed 2436 place invariants in 391 ms
[2021-05-17 06:24:39] [INFO ] Dead Transitions using invariants and state equation in 1489 ms returned []
Finished structural reductions, in 2 iterations. Remains : 2876/2997 places, 444/446 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p2), true, (OR (NOT p1) (NOT p2))]
Running random walk in product with property : QuasiCertifProtocol-COL-28-03 automaton TGBA [mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 p2), acceptance={0} source=2 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p0)) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=2 dest: 2}]], initial=2, aps=[p2:(GT 1 s2873), p1:(GT 1 (ADD s2843 s2844 s2845 s2846 s2847 s2848 s2849 s2850 s2851 s2852 s2853 s2854 s2855 s2856 s2857 s2858 s2859 s2860 s2861 s2862 s2863 s2864 s2865 s2866 s2867 s2868 s2869 s2870 s2871)), p0:(LEQ (ADD s2698 s2699 s2700 s2701 s2702 s2703 s2704 s2705 s2706 s2707 s2708 s2709 s2710 s2711 s2712 s2713 s2714 s2715 s2716 s2717 s2718 s2719 s2720 s2721 s2722 s2723 s2724 s2725 s2726) (ADD s842 s843 s844 s845 s846 s847 s848 s849 s850 s851 s852 s853 s854 s855 s856 s857 s858 s859 s860 s861 s862 s863 s864 s865 s866 s867 s868 s869 s870 s871 s872 s873 s874 s875 s876 s877 s878 s879 s880 s881 s882 s883 s884 s885 s886 s887 s888 s889 s890 s891 s892 s893 s894 s895 s896 s897 s898 s899 s900 s901 s902 s903 s904 s905 s906 s907 s908 s909 s910 s911 s912 s913 s914 s915 s916 s917 s918 s919 s920 s921 s922 s923 s924 s925 s926 s927 s928 s929 s930 s931 s932 s933 s934 s935 s936 s937 s938 s939 s940 s941 s942 s943 s944 s945 s946 s947 s948 s949 s950 s951 s952 s953 s954 s955 s956 s957 s958 s959 s960 s961 s962 s963 s964 s965 s966 s967 s968 s969 s970 s971 s972 s973 s974 s975 s976 s977 s978 s979 s980 s981 s982 s983 s984 s985 s986 s987 s988 s989 s990 s991 s992 s993 s994 s995 s996 s997 s998 s999 s1000 s1001 s1002 s1003 s1004 s1005 s1006 s1007 s1008 s1009 s1010 s1011 s1012 s1013 s1014 s1015 s1016 s1017 s1018 s1019 s1020 s1021 s1022 s1023 s1024 s1025 s1026 s1027 s1028 s1029 s1030 s1031 s1032 s1033 s1034 s1035 s1036 s1037 s1038 s1039 s1040 s1041 s1042 s1043 s1044 s1045 s1046 s1047 s1048 s1049 s1050 s1051 s1052 s1053 s1054 s1055 s1056 s1057 s1058 s1059 s1060 s1061 s1062 s1063 s1064 s1065 s1066 s1067 s1068 s1069 s1070 s1071 s1072 s1073 s1074 s1075 s1076 s1077 s1078 s1079 s1080 s1081 s1082 s1083 s1084 s1085 s1086 s1087 s1088 s1089 s1090 s1091 s1092 s1093 s1094 s1095 s1096 s1097 s1098 s1099 s1100 s1101 s1102 s1103 s1104 s1105 s1106 s1107 s1108 s1109 s1110 s1111 s1112 s1113 s1114 s1115 s1116 s1117 s1118 s1119 s1120 s1121 s1122 s1123 s1124 s1125 s1126 s1127 s1128 s1129 s1130 s1131 s1132 s1133 s1134 s1135 s1136 s1137 s1138 s1139 s1140 s1141 s1142 s1143 s1144 s1145 s1146 s1147 s1148 s1149 s1150 s1151 s1152 s1153 s1154 s1155 s1156 s1157 s1158 s1159 s1160 s1161 s1162 s1163 s1164 s1165 s1166 s1167 s1168 s1169 s1170 s1171 s1172 s1173 s1174 s1175 s1176 s1177 s1178 s1179 s1180 s1181 s1182 s1183 s1184 s1185 s1186 s1187 s1188 s1189 s1190 s1191 s1192 s1193 s1194 s1195 s1196 s1197 s1198 s1199 s1200 s1201 s1202 s1203 s1204 s1205 s1206 s1207 s1208 s1209 s1210 s1211 s1212 s1213 s1214 s1215 s1216 s1217 s1218 s1219 s1220 s1221 s1222 s1223 s1224 s1225 s1226 s1227 s1228 s1229 s1230 s1231 s1232 s1233 s1234 s1235 s1236 s1237 s1238 s1239 s1240 s1241 s1242 s1243 s1244 s1245 s1246 s1247 s1248 s1249 s1250 s1251 s1252 s1253 s1254 s1255 s1256 s1257 s1258 s1259 s1260 s1261 s1262 s1263 s1264 s1265 s1266 s1267 s1268 s1269 s1270 s1271 s1272 s1273 s1274 s1275 s1276 s1277 s1278 s1279 s1280 s1281 s1282 s1283 s1284 s1285 s1286 s1287 s1288 s1289 s1290 s1291 s1292 s1293 s1294 s1295 s1296 s1297 s1298 s1299 s1300 s1301 s1302 s1303 s1304 s1305 s1306 s1307 s1308 s1309 s1310 s1311 s1312 s1313 s1314 s1315 s1316 s1317 s1318 s1319 s1320 s1321 s1322 s1323 s1324 s1325 s1326 s1327 s1328 s1329 s1330 s1331 s1332 s1333 s1334 s1335 s1336 s1337 s1338 s1339 s1340 s1341 s1342 s1343 s1344 s1345 s1346 s1347 s1348 s1349 s1350 s1351 s1352 s1353 s1354 s1355 s1356 s1357 s1358 s1359 s1360 s1361 s1362 s1363 s1364 s1365 s1366 s1367 s1368 s1369 s1370 s1371 s1372 s1373 s1374 s1375 s1376 s1377 s1378 s1379 s1380 s1381 s1382 s1383 s1384 s1385 s1386 s1387 s1388 s1389 s1390 s1391 s1392 s1393 s1394 s1395 s1396 s1397 s1398 s1399 s1400 s1401 s1402 s1403 s1404 s1405 s1406 s1407 s1408 s1409 s1410 s1411 s1412 s1413 s1414 s1415 s1416 s1417 s1418 s1419 s1420 s1421 s1422 s1423 s1424 s1425 s1426 s1427 s1428 s1429 s1430 s1431 s1432 s1433 s1434 s1435 s1436 s1437 s1438 s1439 s1440 s1441 s1442 s1443 s1444 s1445 s1446 s1447 s1448 s1449 s1450 s1451 s1452 s1453 s1454 s1455 s1456 s1457 s1458 s1459 s1460 s1461 s1462 s1463 s1464 s1465 s1466 s1467 s1468 s1469 s1470 s1471 s1472 s1473 s1474 s1475 s1476 s1477 s1478 s1479 s1480 s1481 s1482 s1483 s1484 s1485 s1486 s1487 s1488 s1489 s1490 s1491 s1492 s1493 s1494 s1495 s1496 s1497 s1498 s1499 s1500 s1501 s1502 s1503 s1504 s1505 s1506 s1507 s1508 s1509 s1510 s1511 s1512 s1513 s1514 s1515 s1516 s1517 s1518 s1519 s1520 s1521 s1522 s1523 s1524 s1525 s1526 s1527 s1528 s1529 s1530 s1531 s1532 s1533 s1534 s1535 s1536 s1537 s1538 s1539 s1540 s1541 s1542 s1543 s1544 s1545 s1546 s1547 s1548 s1549 s1550 s1551 s1552 s1553 s1554 s1555 s1556 s1557 s1558 s1559 s1560 s1561 s1562 s1563 s1564 s1565 s1566 s1567 s1568 s1569 s1570 s1571 s1572 s1573 s1574 s1575 s1576 s1577 s1578 s1579 s1580 s1581 s1582 s1583 s1584 s1585 s1586 s1587 s1588 s1589 s1590 s1591 s1592 s1593 s1594 s1595 s1596 s1597 s1598 s1599 s1600 s1601 s1602 s1603 s1604 s1605 s1606 s1607 s1608 s1609 s1610 s1611 s1612 s1613 s1614 s1615 s1616 s1617 s1618 s1619 s1620 s1621 s1622 s1623 s1624 s1625 s1626 s1627 s1628 s1629 s1630 s1631 s1632 s1633 s1634 s1635 s1636 s1637 s1638 s1639 s1640 s1641 s1642 s1643 s1644 s1645 s1646 s1647 s1648 s1649 s1650 s1651 s1652 s1653 s1654 s1655 s1656 s1657 s1658 s1659 s1660 s1661 s1662 s1663 s1664 s1665 s1666 s1667 s1668 s1669 s1670 s1671 s1672 s1673 s1674 s1675 s1676 s1677 s1678 s1679 s1680 s1681 s1682))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 2811 reset in 378 ms.
Product exploration explored 100000 steps with 2820 reset in 502 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 2876 transition count 444
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (G p2)), (F (G p1)), (F (G p0)), p2, p1, (NOT p0)]
Adopting property with smaller alphabet thanks to knowledge :p1
Stuttering acceptance computed with spot in 64 ms :[true, (NOT p2), (AND (NOT p2) p1)]
Support contains 30 out of 2876 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 2876/2876 places, 444/444 transitions.
Applied a total of 0 rules in 201 ms. Remains 2876 /2876 variables (removed 0) and now considering 444/444 (removed 0) transitions.
// Phase 1: matrix 444 rows 2876 cols
[2021-05-17 06:24:42] [INFO ] Computed 2436 place invariants in 345 ms
[2021-05-17 06:24:45] [INFO ] Implicit Places using invariants in 3760 ms returned []
// Phase 1: matrix 444 rows 2876 cols
[2021-05-17 06:24:45] [INFO ] Computed 2436 place invariants in 226 ms
[2021-05-17 06:24:53] [INFO ] Implicit Places using invariants and state equation in 8133 ms returned []
Implicit Place search using SMT with State Equation took 11895 ms to find 0 implicit places.
[2021-05-17 06:24:53] [INFO ] Redundant transitions in 14 ms returned []
// Phase 1: matrix 444 rows 2876 cols
[2021-05-17 06:24:53] [INFO ] Computed 2436 place invariants in 236 ms
[2021-05-17 06:24:54] [INFO ] Dead Transitions using invariants and state equation in 1172 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2876/2876 places, 444/444 transitions.
Stuttering acceptance computed with spot in 60 ms :[true, (NOT p2), (AND (NOT p2) p1)]
Product exploration explored 100000 steps with 2815 reset in 294 ms.
Product exploration explored 100000 steps with 2819 reset in 282 ms.
Starting structural reductions, iteration 0 : 2876/2876 places, 444/444 transitions.
Applied a total of 0 rules in 127 ms. Remains 2876 /2876 variables (removed 0) and now considering 444/444 (removed 0) transitions.
// Phase 1: matrix 444 rows 2876 cols
[2021-05-17 06:24:55] [INFO ] Computed 2436 place invariants in 261 ms
[2021-05-17 06:24:58] [INFO ] Implicit Places using invariants in 2450 ms returned []
// Phase 1: matrix 444 rows 2876 cols
[2021-05-17 06:24:58] [INFO ] Computed 2436 place invariants in 232 ms
[2021-05-17 06:25:02] [INFO ] Implicit Places using invariants and state equation in 4142 ms returned []
Implicit Place search using SMT with State Equation took 6594 ms to find 0 implicit places.
[2021-05-17 06:25:02] [INFO ] Redundant transitions in 10 ms returned []
// Phase 1: matrix 444 rows 2876 cols
[2021-05-17 06:25:02] [INFO ] Computed 2436 place invariants in 230 ms
[2021-05-17 06:25:03] [INFO ] Dead Transitions using invariants and state equation in 1286 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2876/2876 places, 444/444 transitions.
Application raised an uncaught exception null
java.lang.UnsupportedOperationException
at fr.lip6.move.gal.application.MccTranslator.toGal(MccTranslator.java:879)
at fr.lip6.move.gal.application.MccTranslator.lambda$3(MccTranslator.java:862)
at fr.lip6.move.gal.structural.expr.NaryOp.forEachChild(NaryOp.java:153)
at fr.lip6.move.gal.application.MccTranslator.toGal(MccTranslator.java:862)
at fr.lip6.move.gal.application.MccTranslator.toGal(MccTranslator.java:760)
at fr.lip6.move.gal.application.MccTranslator.rebuildSpecification(MccTranslator.java:729)
at fr.lip6.move.gal.application.GlobalPropertySolver.verifyWithSDD(GlobalPropertySolver.java:585)
at fr.lip6.move.gal.application.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:269)
at fr.lip6.move.gal.application.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:60)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:470)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)

BK_STOP 1621232704085

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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="QuasiCertifProtocol-COL-28"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is QuasiCertifProtocol-COL-28, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r178-tajo-162089415200052"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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