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.r102-smll-162075331000061.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2021-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is FlexibleBarrier-PT-10b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r102-smll-162075331000061
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 768K
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 97K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 129K 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 3.2K Mar 28 16:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 16:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 16:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 16:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.9K Mar 23 11:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 13K Mar 23 11:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 22 19:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 22 19:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 374K 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 FlexibleBarrier-PT-10b-00
FORMULA_NAME FlexibleBarrier-PT-10b-01
FORMULA_NAME FlexibleBarrier-PT-10b-02
FORMULA_NAME FlexibleBarrier-PT-10b-03
FORMULA_NAME FlexibleBarrier-PT-10b-04
FORMULA_NAME FlexibleBarrier-PT-10b-05
FORMULA_NAME FlexibleBarrier-PT-10b-06
FORMULA_NAME FlexibleBarrier-PT-10b-07
FORMULA_NAME FlexibleBarrier-PT-10b-08
FORMULA_NAME FlexibleBarrier-PT-10b-09
FORMULA_NAME FlexibleBarrier-PT-10b-10
FORMULA_NAME FlexibleBarrier-PT-10b-11
FORMULA_NAME FlexibleBarrier-PT-10b-12
FORMULA_NAME FlexibleBarrier-PT-10b-13
FORMULA_NAME FlexibleBarrier-PT-10b-14
FORMULA_NAME FlexibleBarrier-PT-10b-15

=== Now, execution of the tool begins

BK_START 1621131706555

Running Version 0
[2021-05-16 02:21:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -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-16 02:21:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-16 02:21:50] [INFO ] Load time of PNML (sax parser for PT used): 210 ms
[2021-05-16 02:21:50] [INFO ] Transformed 1402 places.
[2021-05-16 02:21:50] [INFO ] Transformed 1613 transitions.
[2021-05-16 02:21:50] [INFO ] Found NUPN structural information;
[2021-05-16 02:21:50] [INFO ] Parsed PT model containing 1402 places and 1613 transitions in 285 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
[2021-05-16 02:21:50] [INFO ] Initial state test concluded for 3 properties.
FORMULA FlexibleBarrier-PT-10b-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-10b-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 39 out of 1402 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1402/1402 places, 1613/1613 transitions.
Discarding 526 places :
Symmetric choice reduction at 0 with 526 rule applications. Total rules 526 place count 876 transition count 1087
Iterating global reduction 0 with 526 rules applied. Total rules applied 1052 place count 876 transition count 1087
Discarding 232 places :
Symmetric choice reduction at 0 with 232 rule applications. Total rules 1284 place count 644 transition count 855
Iterating global reduction 0 with 232 rules applied. Total rules applied 1516 place count 644 transition count 855
Discarding 145 places :
Symmetric choice reduction at 0 with 145 rule applications. Total rules 1661 place count 499 transition count 710
Iterating global reduction 0 with 145 rules applied. Total rules applied 1806 place count 499 transition count 710
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 1870 place count 499 transition count 646
Applied a total of 1870 rules in 332 ms. Remains 499 /1402 variables (removed 903) and now considering 646/1613 (removed 967) transitions.
// Phase 1: matrix 646 rows 499 cols
[2021-05-16 02:21:51] [INFO ] Computed 12 place invariants in 43 ms
[2021-05-16 02:21:51] [INFO ] Implicit Places using invariants in 781 ms returned []
// Phase 1: matrix 646 rows 499 cols
[2021-05-16 02:21:51] [INFO ] Computed 12 place invariants in 13 ms
[2021-05-16 02:21:52] [INFO ] Implicit Places using invariants and state equation in 975 ms returned []
Implicit Place search using SMT with State Equation took 1808 ms to find 0 implicit places.
// Phase 1: matrix 646 rows 499 cols
[2021-05-16 02:21:52] [INFO ] Computed 12 place invariants in 7 ms
[2021-05-16 02:21:53] [INFO ] Dead Transitions using invariants and state equation in 642 ms returned []
Finished structural reductions, in 1 iterations. Remains : 499/1402 places, 646/1613 transitions.
[2021-05-16 02:21:54] [INFO ] Flatten gal took : 212 ms
[2021-05-16 02:21:54] [INFO ] Flatten gal took : 90 ms
[2021-05-16 02:21:54] [INFO ] Input system was already deterministic with 646 transitions.
Incomplete random walk after 100000 steps, including 1307 resets, run finished after 519 ms. (steps per millisecond=192 ) properties (out of 31) seen :17
Running SMT prover for 14 properties.
// Phase 1: matrix 646 rows 499 cols
[2021-05-16 02:21:54] [INFO ] Computed 12 place invariants in 5 ms
[2021-05-16 02:21:55] [INFO ] [Real]Absence check using 12 positive place invariants in 11 ms returned sat
[2021-05-16 02:21:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 02:21:55] [INFO ] [Real]Absence check using state equation in 332 ms returned sat
[2021-05-16 02:21:55] [INFO ] Computed and/alt/rep : 627/1197/627 causal constraints (skipped 18 transitions) in 152 ms.
[2021-05-16 02:21:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 02:21:56] [INFO ] [Nat]Absence check using 12 positive place invariants in 17 ms returned sat
[2021-05-16 02:21:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 02:21:56] [INFO ] [Nat]Absence check using state equation in 409 ms returned sat
[2021-05-16 02:21:56] [INFO ] Computed and/alt/rep : 627/1197/627 causal constraints (skipped 18 transitions) in 147 ms.
[2021-05-16 02:22:03] [INFO ] Added : 498 causal constraints over 100 iterations in 6772 ms. Result :sat
[2021-05-16 02:22:03] [INFO ] [Real]Absence check using 12 positive place invariants in 17 ms returned sat
[2021-05-16 02:22:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 02:22:04] [INFO ] [Real]Absence check using state equation in 482 ms returned sat
[2021-05-16 02:22:04] [INFO ] Deduced a trap composed of 45 places in 136 ms of which 5 ms to minimize.
[2021-05-16 02:22:04] [INFO ] Deduced a trap composed of 94 places in 205 ms of which 2 ms to minimize.
[2021-05-16 02:22:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 456 ms
[2021-05-16 02:22:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 02:22:04] [INFO ] [Nat]Absence check using 12 positive place invariants in 13 ms returned sat
[2021-05-16 02:22:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 02:22:05] [INFO ] [Nat]Absence check using state equation in 238 ms returned sat
[2021-05-16 02:22:05] [INFO ] Deduced a trap composed of 45 places in 128 ms of which 2 ms to minimize.
[2021-05-16 02:22:05] [INFO ] Deduced a trap composed of 94 places in 188 ms of which 3 ms to minimize.
[2021-05-16 02:22:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 406 ms
[2021-05-16 02:22:05] [INFO ] Computed and/alt/rep : 627/1197/627 causal constraints (skipped 18 transitions) in 99 ms.
[2021-05-16 02:22:12] [INFO ] Deduced a trap composed of 17 places in 297 ms of which 2 ms to minimize.
[2021-05-16 02:22:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 481 ms
[2021-05-16 02:22:13] [INFO ] Added : 531 causal constraints over 107 iterations in 7798 ms. Result :sat
[2021-05-16 02:22:13] [INFO ] [Real]Absence check using 12 positive place invariants in 17 ms returned sat
[2021-05-16 02:22:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 02:22:13] [INFO ] [Real]Absence check using state equation in 366 ms returned sat
[2021-05-16 02:22:13] [INFO ] Computed and/alt/rep : 627/1197/627 causal constraints (skipped 18 transitions) in 73 ms.
[2021-05-16 02:22:14] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 02:22:14] [INFO ] [Nat]Absence check using 12 positive place invariants in 13 ms returned sat
[2021-05-16 02:22:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 02:22:14] [INFO ] [Nat]Absence check using state equation in 280 ms returned sat
[2021-05-16 02:22:14] [INFO ] Computed and/alt/rep : 627/1197/627 causal constraints (skipped 18 transitions) in 58 ms.
[2021-05-16 02:22:20] [INFO ] Added : 498 causal constraints over 100 iterations in 6072 ms. Result :sat
[2021-05-16 02:22:20] [INFO ] [Real]Absence check using 12 positive place invariants in 13 ms returned sat
[2021-05-16 02:22:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 02:22:20] [INFO ] [Real]Absence check using state equation in 314 ms returned sat
[2021-05-16 02:22:20] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 02:22:21] [INFO ] [Nat]Absence check using 12 positive place invariants in 11 ms returned sat
[2021-05-16 02:22:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 02:22:21] [INFO ] [Nat]Absence check using state equation in 237 ms returned sat
[2021-05-16 02:22:21] [INFO ] Computed and/alt/rep : 627/1197/627 causal constraints (skipped 18 transitions) in 64 ms.
[2021-05-16 02:22:27] [INFO ] Added : 502 causal constraints over 101 iterations in 5907 ms. Result :sat
[2021-05-16 02:22:27] [INFO ] [Real]Absence check using 12 positive place invariants in 13 ms returned sat
[2021-05-16 02:22:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 02:22:27] [INFO ] [Real]Absence check using state equation in 300 ms returned sat
[2021-05-16 02:22:27] [INFO ] Computed and/alt/rep : 627/1197/627 causal constraints (skipped 18 transitions) in 61 ms.
[2021-05-16 02:22:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 02:22:28] [INFO ] [Nat]Absence check using 12 positive place invariants in 19 ms returned sat
[2021-05-16 02:22:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 02:22:28] [INFO ] [Nat]Absence check using state equation in 361 ms returned sat
[2021-05-16 02:22:28] [INFO ] Computed and/alt/rep : 627/1197/627 causal constraints (skipped 18 transitions) in 79 ms.
[2021-05-16 02:22:34] [INFO ] Added : 497 causal constraints over 100 iterations in 6032 ms. Result :sat
[2021-05-16 02:22:34] [INFO ] [Real]Absence check using 12 positive place invariants in 16 ms returned unsat
[2021-05-16 02:22:34] [INFO ] [Real]Absence check using 12 positive place invariants in 12 ms returned sat
[2021-05-16 02:22:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 02:22:34] [INFO ] [Real]Absence check using state equation in 225 ms returned sat
[2021-05-16 02:22:35] [INFO ] Computed and/alt/rep : 627/1197/627 causal constraints (skipped 18 transitions) in 44 ms.
[2021-05-16 02:22:35] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 02:22:35] [INFO ] [Nat]Absence check using 12 positive place invariants in 17 ms returned sat
[2021-05-16 02:22:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 02:22:35] [INFO ] [Nat]Absence check using state equation in 322 ms returned sat
[2021-05-16 02:22:35] [INFO ] Computed and/alt/rep : 627/1197/627 causal constraints (skipped 18 transitions) in 58 ms.
[2021-05-16 02:22:43] [INFO ] Deduced a trap composed of 17 places in 251 ms of which 1 ms to minimize.
[2021-05-16 02:22:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 393 ms
[2021-05-16 02:22:43] [INFO ] Added : 527 causal constraints over 106 iterations in 8336 ms. Result :sat
[2021-05-16 02:22:44] [INFO ] [Real]Absence check using 12 positive place invariants in 13 ms returned sat
[2021-05-16 02:22:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 02:22:44] [INFO ] [Real]Absence check using state equation in 292 ms returned sat
[2021-05-16 02:22:44] [INFO ] Deduced a trap composed of 63 places in 218 ms of which 3 ms to minimize.
[2021-05-16 02:22:44] [INFO ] Deduced a trap composed of 80 places in 86 ms of which 2 ms to minimize.
[2021-05-16 02:22:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 396 ms
[2021-05-16 02:22:44] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 02:22:44] [INFO ] [Nat]Absence check using 12 positive place invariants in 18 ms returned sat
[2021-05-16 02:22:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 02:22:45] [INFO ] [Nat]Absence check using state equation in 365 ms returned sat
[2021-05-16 02:22:45] [INFO ] Deduced a trap composed of 63 places in 127 ms of which 1 ms to minimize.
[2021-05-16 02:22:45] [INFO ] Deduced a trap composed of 80 places in 67 ms of which 1 ms to minimize.
[2021-05-16 02:22:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 313 ms
[2021-05-16 02:22:45] [INFO ] Computed and/alt/rep : 627/1197/627 causal constraints (skipped 18 transitions) in 63 ms.
[2021-05-16 02:22:53] [INFO ] Added : 495 causal constraints over 100 iterations in 7902 ms. Result :sat
[2021-05-16 02:22:53] [INFO ] [Real]Absence check using 12 positive place invariants in 12 ms returned sat
[2021-05-16 02:22:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 02:22:53] [INFO ] [Real]Absence check using state equation in 243 ms returned sat
[2021-05-16 02:22:53] [INFO ] Computed and/alt/rep : 627/1197/627 causal constraints (skipped 18 transitions) in 35 ms.
[2021-05-16 02:22:54] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 02:22:54] [INFO ] [Nat]Absence check using 12 positive place invariants in 19 ms returned sat
[2021-05-16 02:22:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 02:22:54] [INFO ] [Nat]Absence check using state equation in 330 ms returned sat
[2021-05-16 02:22:54] [INFO ] Computed and/alt/rep : 627/1197/627 causal constraints (skipped 18 transitions) in 106 ms.
[2021-05-16 02:23:01] [INFO ] Added : 505 causal constraints over 101 iterations in 6917 ms. Result :sat
[2021-05-16 02:23:01] [INFO ] [Real]Absence check using 12 positive place invariants in 19 ms returned sat
[2021-05-16 02:23:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 02:23:01] [INFO ] [Real]Absence check using state equation in 327 ms returned sat
[2021-05-16 02:23:01] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 02:23:02] [INFO ] [Nat]Absence check using 12 positive place invariants in 16 ms returned sat
[2021-05-16 02:23:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 02:23:02] [INFO ] [Nat]Absence check using state equation in 310 ms returned sat
[2021-05-16 02:23:02] [INFO ] Computed and/alt/rep : 627/1197/627 causal constraints (skipped 18 transitions) in 54 ms.
[2021-05-16 02:23:09] [INFO ] Added : 505 causal constraints over 101 iterations in 6646 ms. Result :sat
[2021-05-16 02:23:09] [INFO ] [Real]Absence check using 12 positive place invariants in 12 ms returned sat
[2021-05-16 02:23:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 02:23:09] [INFO ] [Real]Absence check using state equation in 237 ms returned sat
[2021-05-16 02:23:09] [INFO ] Computed and/alt/rep : 627/1197/627 causal constraints (skipped 18 transitions) in 59 ms.
[2021-05-16 02:23:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 02:23:09] [INFO ] [Nat]Absence check using 12 positive place invariants in 19 ms returned sat
[2021-05-16 02:23:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 02:23:09] [INFO ] [Nat]Absence check using state equation in 235 ms returned sat
[2021-05-16 02:23:09] [INFO ] Computed and/alt/rep : 627/1197/627 causal constraints (skipped 18 transitions) in 41 ms.
[2021-05-16 02:23:15] [INFO ] Added : 503 causal constraints over 101 iterations in 5842 ms. Result :sat
[2021-05-16 02:23:15] [INFO ] [Real]Absence check using 12 positive place invariants in 17 ms returned sat
[2021-05-16 02:23:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 02:23:16] [INFO ] [Real]Absence check using state equation in 360 ms returned sat
[2021-05-16 02:23:16] [INFO ] Computed and/alt/rep : 627/1197/627 causal constraints (skipped 18 transitions) in 67 ms.
[2021-05-16 02:23:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 02:23:16] [INFO ] [Nat]Absence check using 12 positive place invariants in 14 ms returned sat
[2021-05-16 02:23:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 02:23:16] [INFO ] [Nat]Absence check using state equation in 284 ms returned sat
[2021-05-16 02:23:17] [INFO ] Computed and/alt/rep : 627/1197/627 causal constraints (skipped 18 transitions) in 58 ms.
[2021-05-16 02:23:22] [INFO ] Added : 500 causal constraints over 100 iterations in 5856 ms. Result :sat
[2021-05-16 02:23:22] [INFO ] [Real]Absence check using 12 positive place invariants in 18 ms returned sat
[2021-05-16 02:23:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 02:23:23] [INFO ] [Real]Absence check using state equation in 359 ms returned sat
[2021-05-16 02:23:23] [INFO ] Computed and/alt/rep : 627/1197/627 causal constraints (skipped 18 transitions) in 66 ms.
[2021-05-16 02:23:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 02:23:23] [INFO ] [Nat]Absence check using 12 positive place invariants in 14 ms returned sat
[2021-05-16 02:23:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 02:23:23] [INFO ] [Nat]Absence check using state equation in 288 ms returned sat
[2021-05-16 02:23:24] [INFO ] Computed and/alt/rep : 627/1197/627 causal constraints (skipped 18 transitions) in 60 ms.
[2021-05-16 02:23:29] [INFO ] Added : 501 causal constraints over 101 iterations in 5765 ms. Result :sat
[2021-05-16 02:23:29] [INFO ] [Real]Absence check using 12 positive place invariants in 12 ms returned sat
[2021-05-16 02:23:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 02:23:30] [INFO ] [Real]Absence check using state equation in 261 ms returned sat
[2021-05-16 02:23:30] [INFO ] Deduced a trap composed of 68 places in 145 ms of which 2 ms to minimize.
[2021-05-16 02:23:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 202 ms
[2021-05-16 02:23:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 02:23:30] [INFO ] [Nat]Absence check using 12 positive place invariants in 13 ms returned sat
[2021-05-16 02:23:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 02:23:30] [INFO ] [Nat]Absence check using state equation in 284 ms returned sat
[2021-05-16 02:23:30] [INFO ] Deduced a trap composed of 68 places in 141 ms of which 1 ms to minimize.
[2021-05-16 02:23:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 200 ms
[2021-05-16 02:23:31] [INFO ] Computed and/alt/rep : 627/1197/627 causal constraints (skipped 18 transitions) in 55 ms.
[2021-05-16 02:23:36] [INFO ] Added : 490 causal constraints over 98 iterations in 5615 ms. Result :sat
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0||(G(p1) U p2)||(p3 U p2))))], workingDir=/home/mcc/execution]
Support contains 4 out of 499 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 499/499 places, 646/646 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 476 transition count 623
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 476 transition count 623
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 48 place count 476 transition count 621
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 64 place count 460 transition count 605
Iterating global reduction 1 with 16 rules applied. Total rules applied 80 place count 460 transition count 605
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 89 place count 460 transition count 596
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 94 place count 455 transition count 591
Iterating global reduction 2 with 5 rules applied. Total rules applied 99 place count 455 transition count 591
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 104 place count 455 transition count 586
Applied a total of 104 rules in 146 ms. Remains 455 /499 variables (removed 44) and now considering 586/646 (removed 60) transitions.
// Phase 1: matrix 586 rows 455 cols
[2021-05-16 02:23:36] [INFO ] Computed 12 place invariants in 6 ms
[2021-05-16 02:23:37] [INFO ] Implicit Places using invariants in 291 ms returned []
// Phase 1: matrix 586 rows 455 cols
[2021-05-16 02:23:37] [INFO ] Computed 12 place invariants in 10 ms
[2021-05-16 02:23:37] [INFO ] Implicit Places using invariants and state equation in 733 ms returned []
Implicit Place search using SMT with State Equation took 1029 ms to find 0 implicit places.
// Phase 1: matrix 586 rows 455 cols
[2021-05-16 02:23:37] [INFO ] Computed 12 place invariants in 6 ms
[2021-05-16 02:23:38] [INFO ] Dead Transitions using invariants and state equation in 641 ms returned []
Finished structural reductions, in 1 iterations. Remains : 455/499 places, 586/646 transitions.
Stuttering acceptance computed with spot in 453 ms :[(NOT p1), (AND (NOT p0) (NOT p2)), (OR (NOT p2) (NOT p1)), true, (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2)]
Running random walk in product with property : FlexibleBarrier-PT-10b-00 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) p1 (NOT p3)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p2) (NOT p1) p3), acceptance={} source=1 dest: 5}, { cond=(AND (NOT p0) (NOT p2) p1 p3), acceptance={} source=1 dest: 6}], [{ cond=(AND p2 p1), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p2) p3), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p2) p1 (NOT p3)), acceptance={0} source=6 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={0} source=6 dest: 3}, { cond=(AND (NOT p2) (NOT p1) p3), acceptance={0} source=6 dest: 5}, { cond=(AND (NOT p2) p1 p3), acceptance={0} source=6 dest: 6}]], initial=4, aps=[p1:(EQ s177 1), p0:(NEQ s46 1), p2:(EQ s42 1), p3:(EQ s193 1)], 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, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 766 ms.
Product exploration explored 100000 steps with 50000 reset in 492 ms.
Knowledge obtained : [(NOT p1), p0, (NOT p2), (NOT p3)]
Stuttering acceptance computed with spot in 417 ms :[(NOT p1), (AND (NOT p0) (NOT p2)), (OR (NOT p2) (NOT p1)), true, (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 50000 reset in 373 ms.
Product exploration explored 100000 steps with 50000 reset in 653 ms.
Applying partial POR strategy [true, true, true, true, false, true, true]
Stuttering acceptance computed with spot in 282 ms :[(NOT p1), (AND (NOT p0) (NOT p2)), (OR (NOT p2) (NOT p1)), true, (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2)]
Support contains 4 out of 455 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 455/455 places, 586/586 transitions.
Graph (trivial) has 407 edges and 455 vertex of which 55 / 455 are part of one of the 9 SCC in 7 ms
Free SCC test removed 46 places
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 41 rules applied. Total rules applied 42 place count 409 transition count 539
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 30 Pre rules applied. Total rules applied 42 place count 409 transition count 699
Deduced a syphon composed of 71 places in 2 ms
Iterating global reduction 1 with 30 rules applied. Total rules applied 72 place count 409 transition count 699
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 114 place count 367 transition count 657
Deduced a syphon composed of 46 places in 2 ms
Iterating global reduction 1 with 42 rules applied. Total rules applied 156 place count 367 transition count 657
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 157 place count 366 transition count 656
Deduced a syphon composed of 46 places in 2 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 158 place count 366 transition count 656
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 91 places in 1 ms
Iterating global reduction 1 with 45 rules applied. Total rules applied 203 place count 366 transition count 665
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 228 place count 341 transition count 640
Deduced a syphon composed of 66 places in 1 ms
Iterating global reduction 1 with 25 rules applied. Total rules applied 253 place count 341 transition count 640
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: -86
Deduced a syphon composed of 88 places in 1 ms
Iterating global reduction 1 with 22 rules applied. Total rules applied 275 place count 341 transition count 726
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 278 place count 338 transition count 719
Deduced a syphon composed of 85 places in 2 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 281 place count 338 transition count 719
Deduced a syphon composed of 85 places in 1 ms
Drop transitions removed 42 transitions
Redundant transition composition rules discarded 42 transitions
Iterating global reduction 1 with 42 rules applied. Total rules applied 323 place count 338 transition count 677
Deduced a syphon composed of 85 places in 1 ms
Applied a total of 323 rules in 354 ms. Remains 338 /455 variables (removed 117) and now considering 677/586 (removed -91) transitions.
[2021-05-16 02:23:42] [INFO ] Redundant transitions in 77 ms returned []
[2021-05-16 02:23:42] [INFO ] Flow matrix only has 639 transitions (discarded 38 similar events)
// Phase 1: matrix 639 rows 338 cols
[2021-05-16 02:23:42] [INFO ] Computed 12 place invariants in 4 ms
[2021-05-16 02:23:43] [INFO ] Dead Transitions using invariants and state equation in 493 ms returned []
Finished structural reductions, in 1 iterations. Remains : 338/455 places, 677/586 transitions.
Product exploration explored 100000 steps with 50000 reset in 1964 ms.
Product exploration explored 100000 steps with 50000 reset in 2048 ms.
[2021-05-16 02:23:47] [INFO ] Flatten gal took : 40 ms
[2021-05-16 02:23:47] [INFO ] Flatten gal took : 42 ms
[2021-05-16 02:23:47] [INFO ] Time to serialize gal into /tmp/LTL17220580809878237494.gal : 17 ms
[2021-05-16 02:23:47] [INFO ] Time to serialize properties into /tmp/LTL7922522062975798623.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/LTL17220580809878237494.gal, -t, CGAL, -LTL, /tmp/LTL7922522062975798623.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/LTL17220580809878237494.gal -t CGAL -LTL /tmp/LTL7922522062975798623.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((("(p109!=1)")||((G("(p493==1)"))U("(p101==1)")))||(("(p530==1)")U("(p101==1)")))))
Formula 0 simplified : !X("(p109!=1)" | (G"(p493==1)" U "(p101==1)") | ("(p530==1)" U "(p101==1)"))
Detected timeout of ITS tools.
[2021-05-16 02:24:02] [INFO ] Flatten gal took : 35 ms
[2021-05-16 02:24:02] [INFO ] Applying decomposition
[2021-05-16 02:24:02] [INFO ] Flatten gal took : 31 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/graph12512326418201679358.txt, -o, /tmp/graph12512326418201679358.bin, -w, /tmp/graph12512326418201679358.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/graph12512326418201679358.bin, -l, -1, -v, -w, /tmp/graph12512326418201679358.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-16 02:24:02] [INFO ] Decomposing Gal with order
[2021-05-16 02:24:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 02:24:03] [INFO ] Removed a total of 261 redundant transitions.
[2021-05-16 02:24:03] [INFO ] Flatten gal took : 142 ms
[2021-05-16 02:24:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 16 ms.
[2021-05-16 02:24:03] [INFO ] Time to serialize gal into /tmp/LTL8499268404045158234.gal : 15 ms
[2021-05-16 02:24:03] [INFO ] Time to serialize properties into /tmp/LTL12524596373691529584.ltl : 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-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL8499268404045158234.gal, -t, CGAL, -LTL, /tmp/LTL12524596373691529584.ltl, -c, -stutter-deadlock], 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/LTL8499268404045158234.gal -t CGAL -LTL /tmp/LTL12524596373691529584.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X((("(i1.u4.p109!=1)")||((G("(i7.u52.p493==1)"))U("(i1.u12.p101==1)")))||(("(i9.u58.p530==1)")U("(i1.u12.p101==1)")))))
Formula 0 simplified : !X("(i1.u4.p109!=1)" | (G"(i7.u52.p493==1)" U "(i1.u12.p101==1)") | ("(i9.u58.p530==1)" U "(i1.u12.p101==1)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14789616696599303239
[2021-05-16 02:24:18] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14789616696599303239
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/ltsmin14789616696599303239]
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/ltsmin14789616696599303239] 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/ltsmin14789616696599303239] 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 FlexibleBarrier-PT-10b-00 finished in 42625 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 499 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 499/499 places, 646/646 transitions.
Graph (trivial) has 463 edges and 499 vertex of which 61 / 499 are part of one of the 10 SCC in 1 ms
Free SCC test removed 51 places
Ensure Unique test removed 52 transitions
Reduce isomorphic transitions removed 52 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 53 place count 447 transition count 541
Reduce places removed 52 places and 0 transitions.
Iterating post reduction 1 with 52 rules applied. Total rules applied 105 place count 395 transition count 541
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 31 Pre rules applied. Total rules applied 105 place count 395 transition count 510
Deduced a syphon composed of 31 places in 2 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 167 place count 364 transition count 510
Discarding 40 places :
Symmetric choice reduction at 2 with 40 rule applications. Total rules 207 place count 324 transition count 470
Iterating global reduction 2 with 40 rules applied. Total rules applied 247 place count 324 transition count 470
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 248 place count 324 transition count 469
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 248 place count 324 transition count 467
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 252 place count 322 transition count 467
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 264 place count 310 transition count 455
Iterating global reduction 3 with 12 rules applied. Total rules applied 276 place count 310 transition count 455
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 288 place count 310 transition count 443
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 4 with 118 rules applied. Total rules applied 406 place count 251 transition count 384
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 409 place count 248 transition count 381
Iterating global reduction 4 with 3 rules applied. Total rules applied 412 place count 248 transition count 381
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 415 place count 248 transition count 378
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 425 place count 248 transition count 368
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 426 place count 247 transition count 367
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 427 place count 246 transition count 366
Applied a total of 427 rules in 277 ms. Remains 246 /499 variables (removed 253) and now considering 366/646 (removed 280) transitions.
[2021-05-16 02:24:19] [INFO ] Flow matrix only has 347 transitions (discarded 19 similar events)
// Phase 1: matrix 347 rows 246 cols
[2021-05-16 02:24:19] [INFO ] Computed 12 place invariants in 4 ms
[2021-05-16 02:24:19] [INFO ] Implicit Places using invariants in 306 ms returned []
[2021-05-16 02:24:19] [INFO ] Flow matrix only has 347 transitions (discarded 19 similar events)
// Phase 1: matrix 347 rows 246 cols
[2021-05-16 02:24:19] [INFO ] Computed 12 place invariants in 4 ms
[2021-05-16 02:24:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-16 02:24:20] [INFO ] Implicit Places using invariants and state equation in 468 ms returned []
Implicit Place search using SMT with State Equation took 777 ms to find 0 implicit places.
[2021-05-16 02:24:20] [INFO ] Redundant transitions in 9 ms returned []
[2021-05-16 02:24:20] [INFO ] Flow matrix only has 347 transitions (discarded 19 similar events)
// Phase 1: matrix 347 rows 246 cols
[2021-05-16 02:24:20] [INFO ] Computed 12 place invariants in 5 ms
[2021-05-16 02:24:20] [INFO ] Dead Transitions using invariants and state equation in 298 ms returned []
Finished structural reductions, in 1 iterations. Remains : 246/499 places, 366/646 transitions.
Stuttering acceptance computed with spot in 144 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-10b-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(NEQ s26 1), p1:(OR (NEQ s47 1) (NEQ s147 1) (NEQ s237 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 6022 reset in 868 ms.
Product exploration explored 100000 steps with 6015 reset in 657 ms.
Knowledge obtained : [p0, p1]
Stuttering acceptance computed with spot in 141 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering criterion allowed to conclude after 21656 steps with 1303 reset in 183 ms.
FORMULA FlexibleBarrier-PT-10b-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10b-01 finished in 3533 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F((p0||(X(X(F(p1)))&&G(p2))||G(F(p1)))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 499 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 499/499 places, 646/646 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 475 transition count 622
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 475 transition count 622
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 50 place count 475 transition count 620
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 66 place count 459 transition count 604
Iterating global reduction 1 with 16 rules applied. Total rules applied 82 place count 459 transition count 604
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 90 place count 459 transition count 596
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 95 place count 454 transition count 591
Iterating global reduction 2 with 5 rules applied. Total rules applied 100 place count 454 transition count 591
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 105 place count 454 transition count 586
Applied a total of 105 rules in 75 ms. Remains 454 /499 variables (removed 45) and now considering 586/646 (removed 60) transitions.
// Phase 1: matrix 586 rows 454 cols
[2021-05-16 02:24:22] [INFO ] Computed 12 place invariants in 6 ms
[2021-05-16 02:24:23] [INFO ] Implicit Places using invariants in 413 ms returned []
// Phase 1: matrix 586 rows 454 cols
[2021-05-16 02:24:23] [INFO ] Computed 12 place invariants in 5 ms
[2021-05-16 02:24:23] [INFO ] Implicit Places using invariants and state equation in 667 ms returned []
Implicit Place search using SMT with State Equation took 1095 ms to find 0 implicit places.
// Phase 1: matrix 586 rows 454 cols
[2021-05-16 02:24:23] [INFO ] Computed 12 place invariants in 4 ms
[2021-05-16 02:24:24] [INFO ] Dead Transitions using invariants and state equation in 646 ms returned []
Finished structural reductions, in 1 iterations. Remains : 454/499 places, 586/646 transitions.
Stuttering acceptance computed with spot in 271 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FlexibleBarrier-PT-10b-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 5}], [{ cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s120 0), p2:(NEQ s120 1), p1:(NEQ s14 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 322 ms.
Product exploration explored 100000 steps with 33333 reset in 438 ms.
Knowledge obtained : [p0, p2, p1]
Stuttering acceptance computed with spot in 307 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 33333 reset in 420 ms.
Product exploration explored 100000 steps with 33333 reset in 445 ms.
Applying partial POR strategy [false, false, false, false, false, true]
Stuttering acceptance computed with spot in 318 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 454 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 454/454 places, 586/586 transitions.
Graph (trivial) has 419 edges and 454 vertex of which 61 / 454 are part of one of the 10 SCC in 1 ms
Free SCC test removed 51 places
Ensure Unique test removed 52 transitions
Reduce isomorphic transitions removed 52 transitions.
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 39 rules applied. Total rules applied 40 place count 403 transition count 534
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 29 Pre rules applied. Total rules applied 40 place count 403 transition count 694
Deduced a syphon composed of 68 places in 1 ms
Iterating global reduction 1 with 29 rules applied. Total rules applied 69 place count 403 transition count 694
Discarding 44 places :
Symmetric choice reduction at 1 with 44 rule applications. Total rules 113 place count 359 transition count 650
Deduced a syphon composed of 43 places in 1 ms
Iterating global reduction 1 with 44 rules applied. Total rules applied 157 place count 359 transition count 650
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 159 place count 357 transition count 648
Deduced a syphon composed of 43 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 161 place count 357 transition count 648
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 87 places in 0 ms
Iterating global reduction 1 with 44 rules applied. Total rules applied 205 place count 357 transition count 658
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 228 place count 334 transition count 635
Deduced a syphon composed of 64 places in 7 ms
Iterating global reduction 1 with 23 rules applied. Total rules applied 251 place count 334 transition count 635
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: -60
Deduced a syphon composed of 84 places in 0 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 271 place count 334 transition count 695
Deduced a syphon composed of 84 places in 1 ms
Drop transitions removed 40 transitions
Redundant transition composition rules discarded 40 transitions
Iterating global reduction 1 with 40 rules applied. Total rules applied 311 place count 334 transition count 655
Deduced a syphon composed of 84 places in 0 ms
Applied a total of 311 rules in 159 ms. Remains 334 /454 variables (removed 120) and now considering 655/586 (removed -69) transitions.
[2021-05-16 02:24:27] [INFO ] Redundant transitions in 13 ms returned []
[2021-05-16 02:24:27] [INFO ] Flow matrix only has 618 transitions (discarded 37 similar events)
// Phase 1: matrix 618 rows 334 cols
[2021-05-16 02:24:27] [INFO ] Computed 12 place invariants in 7 ms
[2021-05-16 02:24:28] [INFO ] Dead Transitions using invariants and state equation in 511 ms returned []
Finished structural reductions, in 1 iterations. Remains : 334/454 places, 655/586 transitions.
Product exploration explored 100000 steps with 33333 reset in 310 ms.
Product exploration explored 100000 steps with 33333 reset in 405 ms.
[2021-05-16 02:24:28] [INFO ] Flatten gal took : 43 ms
[2021-05-16 02:24:29] [INFO ] Flatten gal took : 38 ms
[2021-05-16 02:24:29] [INFO ] Time to serialize gal into /tmp/LTL2308823692399735656.gal : 7 ms
[2021-05-16 02:24:29] [INFO ] Time to serialize properties into /tmp/LTL9272907654683706215.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/LTL2308823692399735656.gal, -t, CGAL, -LTL, /tmp/LTL9272907654683706215.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/LTL2308823692399735656.gal -t CGAL -LTL /tmp/LTL9272907654683706215.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(F((("(p326==0)")||(G(F("(p41!=1)"))))||((X(X(F("(p41!=1)"))))&&(G("(p326!=1)"))))))))
Formula 0 simplified : !XXF("(p326==0)" | GF"(p41!=1)" | (XXF"(p41!=1)" & G"(p326!=1)"))
Detected timeout of ITS tools.
[2021-05-16 02:24:44] [INFO ] Flatten gal took : 29 ms
[2021-05-16 02:24:44] [INFO ] Applying decomposition
[2021-05-16 02:24:44] [INFO ] Flatten gal took : 32 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/graph10694772280594844249.txt, -o, /tmp/graph10694772280594844249.bin, -w, /tmp/graph10694772280594844249.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/graph10694772280594844249.bin, -l, -1, -v, -w, /tmp/graph10694772280594844249.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-16 02:24:44] [INFO ] Decomposing Gal with order
[2021-05-16 02:24:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 02:24:44] [INFO ] Removed a total of 265 redundant transitions.
[2021-05-16 02:24:44] [INFO ] Flatten gal took : 89 ms
[2021-05-16 02:24:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 15 labels/synchronizations in 12 ms.
[2021-05-16 02:24:44] [INFO ] Time to serialize gal into /tmp/LTL15588211472824506462.gal : 13 ms
[2021-05-16 02:24:44] [INFO ] Time to serialize properties into /tmp/LTL9287935036224413560.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/LTL15588211472824506462.gal, -t, CGAL, -LTL, /tmp/LTL9287935036224413560.ltl, -c, -stutter-deadlock], 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/LTL15588211472824506462.gal -t CGAL -LTL /tmp/LTL9287935036224413560.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(X(F((("(i6.u38.p326==0)")||(G(F("(i1.u6.p41!=1)"))))||((X(X(F("(i1.u6.p41!=1)"))))&&(G("(i6.u38.p326!=1)"))))))))
Formula 0 simplified : !XXF("(i6.u38.p326==0)" | GF"(i1.u6.p41!=1)" | (XXF"(i1.u6.p41!=1)" & G"(i6.u38.p326!=1)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin977382460947800957
[2021-05-16 02:24:59] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin977382460947800957
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/ltsmin977382460947800957]
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/ltsmin977382460947800957] 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/ltsmin977382460947800957] 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 FlexibleBarrier-PT-10b-03 finished in 37738 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0) U (p1 U (p2||G(p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 499 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 499/499 places, 646/646 transitions.
Graph (trivial) has 463 edges and 499 vertex of which 61 / 499 are part of one of the 10 SCC in 1 ms
Free SCC test removed 51 places
Ensure Unique test removed 52 transitions
Reduce isomorphic transitions removed 52 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 51 place count 447 transition count 543
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 1 with 50 rules applied. Total rules applied 101 place count 397 transition count 543
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 101 place count 397 transition count 513
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 161 place count 367 transition count 513
Discarding 39 places :
Symmetric choice reduction at 2 with 39 rule applications. Total rules 200 place count 328 transition count 474
Iterating global reduction 2 with 39 rules applied. Total rules applied 239 place count 328 transition count 474
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 241 place count 328 transition count 472
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 241 place count 328 transition count 470
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 245 place count 326 transition count 470
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 256 place count 315 transition count 459
Iterating global reduction 3 with 11 rules applied. Total rules applied 267 place count 315 transition count 459
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 278 place count 315 transition count 448
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: 61
Deduced a syphon composed of 61 places in 0 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 4 with 122 rules applied. Total rules applied 400 place count 254 transition count 387
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 403 place count 251 transition count 384
Iterating global reduction 4 with 3 rules applied. Total rules applied 406 place count 251 transition count 384
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 409 place count 251 transition count 381
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 419 place count 251 transition count 371
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 420 place count 250 transition count 370
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 421 place count 249 transition count 369
Applied a total of 421 rules in 137 ms. Remains 249 /499 variables (removed 250) and now considering 369/646 (removed 277) transitions.
[2021-05-16 02:25:00] [INFO ] Flow matrix only has 350 transitions (discarded 19 similar events)
// Phase 1: matrix 350 rows 249 cols
[2021-05-16 02:25:00] [INFO ] Computed 12 place invariants in 3 ms
[2021-05-16 02:25:00] [INFO ] Implicit Places using invariants in 177 ms returned []
[2021-05-16 02:25:00] [INFO ] Flow matrix only has 350 transitions (discarded 19 similar events)
// Phase 1: matrix 350 rows 249 cols
[2021-05-16 02:25:00] [INFO ] Computed 12 place invariants in 5 ms
[2021-05-16 02:25:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-16 02:25:01] [INFO ] Implicit Places using invariants and state equation in 454 ms returned []
Implicit Place search using SMT with State Equation took 649 ms to find 0 implicit places.
[2021-05-16 02:25:01] [INFO ] Redundant transitions in 2 ms returned []
[2021-05-16 02:25:01] [INFO ] Flow matrix only has 350 transitions (discarded 19 similar events)
// Phase 1: matrix 350 rows 249 cols
[2021-05-16 02:25:01] [INFO ] Computed 12 place invariants in 2 ms
[2021-05-16 02:25:01] [INFO ] Dead Transitions using invariants and state equation in 369 ms returned []
Finished structural reductions, in 1 iterations. Remains : 249/499 places, 369/646 transitions.
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p1) (NOT p2)), true, (NOT p0), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : FlexibleBarrier-PT-10b-04 automaton TGBA [mat=[[{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(AND (EQ s0 1) (NEQ s28 1)), p1:(NEQ s28 1), p0:(EQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 359 steps with 21 reset in 3 ms.
FORMULA FlexibleBarrier-PT-10b-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10b-04 finished in 1366 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F((G(p1)||G(p2))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 499 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 499/499 places, 646/646 transitions.
Graph (trivial) has 381 edges and 499 vertex of which 61 / 499 are part of one of the 10 SCC in 0 ms
Free SCC test removed 51 places
Ensure Unique test removed 52 transitions
Reduce isomorphic transitions removed 52 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 51 place count 447 transition count 543
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 1 with 50 rules applied. Total rules applied 101 place count 397 transition count 543
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 31 Pre rules applied. Total rules applied 101 place count 397 transition count 512
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 163 place count 366 transition count 512
Discarding 39 places :
Symmetric choice reduction at 2 with 39 rule applications. Total rules 202 place count 327 transition count 473
Iterating global reduction 2 with 39 rules applied. Total rules applied 241 place count 327 transition count 473
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 243 place count 327 transition count 471
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 255 place count 315 transition count 459
Iterating global reduction 3 with 12 rules applied. Total rules applied 267 place count 315 transition count 459
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 278 place count 315 transition count 448
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: 61
Deduced a syphon composed of 61 places in 0 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 4 with 122 rules applied. Total rules applied 400 place count 254 transition count 387
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 403 place count 251 transition count 384
Iterating global reduction 4 with 3 rules applied. Total rules applied 406 place count 251 transition count 384
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 409 place count 251 transition count 381
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 410 place count 250 transition count 380
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 411 place count 249 transition count 379
Applied a total of 411 rules in 78 ms. Remains 249 /499 variables (removed 250) and now considering 379/646 (removed 267) transitions.
[2021-05-16 02:25:01] [INFO ] Flow matrix only has 351 transitions (discarded 28 similar events)
// Phase 1: matrix 351 rows 249 cols
[2021-05-16 02:25:01] [INFO ] Computed 12 place invariants in 3 ms
[2021-05-16 02:25:02] [INFO ] Implicit Places using invariants in 219 ms returned []
[2021-05-16 02:25:02] [INFO ] Flow matrix only has 351 transitions (discarded 28 similar events)
// Phase 1: matrix 351 rows 249 cols
[2021-05-16 02:25:02] [INFO ] Computed 12 place invariants in 9 ms
[2021-05-16 02:25:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-16 02:25:02] [INFO ] Implicit Places using invariants and state equation in 490 ms returned []
Implicit Place search using SMT with State Equation took 711 ms to find 0 implicit places.
[2021-05-16 02:25:02] [INFO ] Redundant transitions in 4 ms returned []
[2021-05-16 02:25:02] [INFO ] Flow matrix only has 351 transitions (discarded 28 similar events)
// Phase 1: matrix 351 rows 249 cols
[2021-05-16 02:25:02] [INFO ] Computed 12 place invariants in 2 ms
[2021-05-16 02:25:02] [INFO ] Dead Transitions using invariants and state equation in 298 ms returned []
Finished structural reductions, in 1 iterations. Remains : 249/499 places, 379/646 transitions.
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : FlexibleBarrier-PT-10b-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(OR (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={1} source=2 dest: 2}, { cond=(AND p1 p2), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(NEQ s245 1), p1:(EQ s244 0), p2:(EQ s113 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-10b-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10b-05 finished in 1235 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0||X(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 499 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 499/499 places, 646/646 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 475 transition count 622
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 475 transition count 622
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 50 place count 475 transition count 620
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 65 place count 460 transition count 605
Iterating global reduction 1 with 15 rules applied. Total rules applied 80 place count 460 transition count 605
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 87 place count 460 transition count 598
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 92 place count 455 transition count 593
Iterating global reduction 2 with 5 rules applied. Total rules applied 97 place count 455 transition count 593
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 102 place count 455 transition count 588
Applied a total of 102 rules in 37 ms. Remains 455 /499 variables (removed 44) and now considering 588/646 (removed 58) transitions.
// Phase 1: matrix 588 rows 455 cols
[2021-05-16 02:25:03] [INFO ] Computed 12 place invariants in 3 ms
[2021-05-16 02:25:03] [INFO ] Implicit Places using invariants in 256 ms returned []
// Phase 1: matrix 588 rows 455 cols
[2021-05-16 02:25:03] [INFO ] Computed 12 place invariants in 4 ms
[2021-05-16 02:25:03] [INFO ] Implicit Places using invariants and state equation in 543 ms returned []
Implicit Place search using SMT with State Equation took 801 ms to find 0 implicit places.
// Phase 1: matrix 588 rows 455 cols
[2021-05-16 02:25:03] [INFO ] Computed 12 place invariants in 5 ms
[2021-05-16 02:25:04] [INFO ] Dead Transitions using invariants and state equation in 473 ms returned []
Finished structural reductions, in 1 iterations. Remains : 455/499 places, 588/646 transitions.
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), true]
Running random walk in product with property : FlexibleBarrier-PT-10b-06 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (NEQ s84 1) (NEQ s438 1)), p1:(NEQ s130 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1301 reset in 269 ms.
Product exploration explored 100000 steps with 1298 reset in 318 ms.
Knowledge obtained : [p0, p1]
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), true]
Product exploration explored 100000 steps with 1299 reset in 282 ms.
Product exploration explored 100000 steps with 1299 reset in 238 ms.
[2021-05-16 02:25:05] [INFO ] Flatten gal took : 18 ms
[2021-05-16 02:25:05] [INFO ] Flatten gal took : 19 ms
[2021-05-16 02:25:05] [INFO ] Time to serialize gal into /tmp/LTL3926593642526188339.gal : 4 ms
[2021-05-16 02:25:05] [INFO ] Time to serialize properties into /tmp/LTL15620568852581885054.ltl : 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-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL3926593642526188339.gal, -t, CGAL, -LTL, /tmp/LTL15620568852581885054.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/LTL3926593642526188339.gal -t CGAL -LTL /tmp/LTL15620568852581885054.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G((X("(p376!=1)"))||("((p223!=1)&&(p1334!=1))"))))
Formula 0 simplified : !G("((p223!=1)&&(p1334!=1))" | X"(p376!=1)")
Detected timeout of ITS tools.
[2021-05-16 02:25:21] [INFO ] Flatten gal took : 18 ms
[2021-05-16 02:25:21] [INFO ] Applying decomposition
[2021-05-16 02:25:21] [INFO ] Flatten gal took : 18 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/graph12889774923830437324.txt, -o, /tmp/graph12889774923830437324.bin, -w, /tmp/graph12889774923830437324.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/graph12889774923830437324.bin, -l, -1, -v, -w, /tmp/graph12889774923830437324.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-16 02:25:21] [INFO ] Decomposing Gal with order
[2021-05-16 02:25:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 02:25:21] [INFO ] Removed a total of 249 redundant transitions.
[2021-05-16 02:25:21] [INFO ] Flatten gal took : 55 ms
[2021-05-16 02:25:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 9 ms.
[2021-05-16 02:25:21] [INFO ] Time to serialize gal into /tmp/LTL9423924968755998559.gal : 6 ms
[2021-05-16 02:25:21] [INFO ] Time to serialize properties into /tmp/LTL15116181007287066743.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/LTL9423924968755998559.gal, -t, CGAL, -LTL, /tmp/LTL15116181007287066743.ltl, -c, -stutter-deadlock], 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/LTL9423924968755998559.gal -t CGAL -LTL /tmp/LTL15116181007287066743.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((G((X("(i6.u47.p376!=1)"))||("((i4.u27.p223!=1)&&(u112.p1334!=1))"))))
Formula 0 simplified : !G("((i4.u27.p223!=1)&&(u112.p1334!=1))" | X"(i6.u47.p376!=1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1910030181769310932
[2021-05-16 02:25:36] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1910030181769310932
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/ltsmin1910030181769310932]
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/ltsmin1910030181769310932] 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/ltsmin1910030181769310932] 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 FlexibleBarrier-PT-10b-06 finished in 34259 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 499 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 499/499 places, 646/646 transitions.
Graph (trivial) has 465 edges and 499 vertex of which 61 / 499 are part of one of the 10 SCC in 2 ms
Free SCC test removed 51 places
Ensure Unique test removed 52 transitions
Reduce isomorphic transitions removed 52 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 52 place count 447 transition count 542
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 103 place count 396 transition count 542
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 103 place count 396 transition count 512
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 163 place count 366 transition count 512
Discarding 40 places :
Symmetric choice reduction at 2 with 40 rule applications. Total rules 203 place count 326 transition count 472
Iterating global reduction 2 with 40 rules applied. Total rules applied 243 place count 326 transition count 472
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 245 place count 326 transition count 470
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 245 place count 326 transition count 468
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 249 place count 324 transition count 468
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 261 place count 312 transition count 456
Iterating global reduction 3 with 12 rules applied. Total rules applied 273 place count 312 transition count 456
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 284 place count 312 transition count 445
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 4 with 120 rules applied. Total rules applied 404 place count 252 transition count 385
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 407 place count 249 transition count 382
Iterating global reduction 4 with 3 rules applied. Total rules applied 410 place count 249 transition count 382
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 413 place count 249 transition count 379
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 423 place count 249 transition count 369
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 424 place count 248 transition count 368
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 425 place count 247 transition count 367
Applied a total of 425 rules in 197 ms. Remains 247 /499 variables (removed 252) and now considering 367/646 (removed 279) transitions.
[2021-05-16 02:25:37] [INFO ] Flow matrix only has 348 transitions (discarded 19 similar events)
// Phase 1: matrix 348 rows 247 cols
[2021-05-16 02:25:37] [INFO ] Computed 12 place invariants in 4 ms
[2021-05-16 02:25:37] [INFO ] Implicit Places using invariants in 244 ms returned []
[2021-05-16 02:25:37] [INFO ] Flow matrix only has 348 transitions (discarded 19 similar events)
// Phase 1: matrix 348 rows 247 cols
[2021-05-16 02:25:37] [INFO ] Computed 12 place invariants in 5 ms
[2021-05-16 02:25:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-16 02:25:38] [INFO ] Implicit Places using invariants and state equation in 527 ms returned []
Implicit Place search using SMT with State Equation took 774 ms to find 0 implicit places.
[2021-05-16 02:25:38] [INFO ] Redundant transitions in 3 ms returned []
[2021-05-16 02:25:38] [INFO ] Flow matrix only has 348 transitions (discarded 19 similar events)
// Phase 1: matrix 348 rows 247 cols
[2021-05-16 02:25:38] [INFO ] Computed 12 place invariants in 5 ms
[2021-05-16 02:25:38] [INFO ] Dead Transitions using invariants and state equation in 258 ms returned []
Finished structural reductions, in 1 iterations. Remains : 247/499 places, 367/646 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-10b-07 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s65 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-10b-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10b-07 finished in 1307 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0||G(p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 499 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 499/499 places, 646/646 transitions.
Graph (trivial) has 462 edges and 499 vertex of which 55 / 499 are part of one of the 9 SCC in 0 ms
Free SCC test removed 46 places
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 53 place count 452 transition count 546
Reduce places removed 52 places and 0 transitions.
Iterating post reduction 1 with 52 rules applied. Total rules applied 105 place count 400 transition count 546
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 33 Pre rules applied. Total rules applied 105 place count 400 transition count 513
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 171 place count 367 transition count 513
Discarding 39 places :
Symmetric choice reduction at 2 with 39 rule applications. Total rules 210 place count 328 transition count 474
Iterating global reduction 2 with 39 rules applied. Total rules applied 249 place count 328 transition count 474
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 251 place count 328 transition count 472
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 251 place count 328 transition count 470
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 255 place count 326 transition count 470
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 267 place count 314 transition count 458
Iterating global reduction 3 with 12 rules applied. Total rules applied 279 place count 314 transition count 458
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 291 place count 314 transition count 446
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 62
Deduced a syphon composed of 62 places in 0 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 4 with 124 rules applied. Total rules applied 415 place count 252 transition count 384
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 417 place count 250 transition count 382
Iterating global reduction 4 with 2 rules applied. Total rules applied 419 place count 250 transition count 382
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 421 place count 250 transition count 380
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 423 place count 249 transition count 390
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 433 place count 249 transition count 380
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 434 place count 249 transition count 380
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 435 place count 248 transition count 379
Applied a total of 435 rules in 129 ms. Remains 248 /499 variables (removed 251) and now considering 379/646 (removed 267) transitions.
[2021-05-16 02:25:38] [INFO ] Flow matrix only has 361 transitions (discarded 18 similar events)
// Phase 1: matrix 361 rows 248 cols
[2021-05-16 02:25:38] [INFO ] Computed 12 place invariants in 3 ms
[2021-05-16 02:25:38] [INFO ] Implicit Places using invariants in 166 ms returned []
[2021-05-16 02:25:38] [INFO ] Flow matrix only has 361 transitions (discarded 18 similar events)
// Phase 1: matrix 361 rows 248 cols
[2021-05-16 02:25:38] [INFO ] Computed 12 place invariants in 3 ms
[2021-05-16 02:25:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-16 02:25:39] [INFO ] Implicit Places using invariants and state equation in 453 ms returned []
Implicit Place search using SMT with State Equation took 621 ms to find 0 implicit places.
[2021-05-16 02:25:39] [INFO ] Redundant transitions in 2 ms returned []
[2021-05-16 02:25:39] [INFO ] Flow matrix only has 361 transitions (discarded 18 similar events)
// Phase 1: matrix 361 rows 248 cols
[2021-05-16 02:25:39] [INFO ] Computed 12 place invariants in 3 ms
[2021-05-16 02:25:39] [INFO ] Dead Transitions using invariants and state equation in 219 ms returned []
Finished structural reductions, in 1 iterations. Remains : 248/499 places, 379/646 transitions.
Stuttering acceptance computed with spot in 123 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), true]
Running random walk in product with property : FlexibleBarrier-PT-10b-08 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(OR (NEQ s4 1) (NEQ s64 1) (NEQ s167 1)), p0:(EQ s107 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 5868 reset in 816 ms.
Product exploration explored 100000 steps with 5847 reset in 732 ms.
Knowledge obtained : [p1, p0]
Stuttering acceptance computed with spot in 100 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), true]
Product exploration explored 100000 steps with 5840 reset in 739 ms.
Product exploration explored 100000 steps with 5860 reset in 694 ms.
[2021-05-16 02:25:43] [INFO ] Flatten gal took : 41 ms
[2021-05-16 02:25:43] [INFO ] Flatten gal took : 18 ms
[2021-05-16 02:25:43] [INFO ] Time to serialize gal into /tmp/LTL10566705732011341865.gal : 3 ms
[2021-05-16 02:25:43] [INFO ] Time to serialize properties into /tmp/LTL6199924070212760174.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/LTL10566705732011341865.gal, -t, CGAL, -LTL, /tmp/LTL6199924070212760174.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/LTL10566705732011341865.gal -t CGAL -LTL /tmp/LTL6199924070212760174.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(("(p678==0)")||(G("(((p55!=1)||(p406!=1))||(p993!=1))")))))
Formula 0 simplified : !G("(p678==0)" | G"(((p55!=1)||(p406!=1))||(p993!=1))")
Detected timeout of ITS tools.
[2021-05-16 02:25:58] [INFO ] Flatten gal took : 15 ms
[2021-05-16 02:25:58] [INFO ] Applying decomposition
[2021-05-16 02:25:58] [INFO ] Flatten gal took : 23 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/graph9357218246739418293.txt, -o, /tmp/graph9357218246739418293.bin, -w, /tmp/graph9357218246739418293.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/graph9357218246739418293.bin, -l, -1, -v, -w, /tmp/graph9357218246739418293.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-16 02:25:58] [INFO ] Decomposing Gal with order
[2021-05-16 02:25:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 02:25:58] [INFO ] Removed a total of 196 redundant transitions.
[2021-05-16 02:25:58] [INFO ] Flatten gal took : 62 ms
[2021-05-16 02:25:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 103 labels/synchronizations in 11 ms.
[2021-05-16 02:25:58] [INFO ] Time to serialize gal into /tmp/LTL11232619432448237407.gal : 6 ms
[2021-05-16 02:25:58] [INFO ] Time to serialize properties into /tmp/LTL9307012881777672676.ltl : 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-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL11232619432448237407.gal, -t, CGAL, -LTL, /tmp/LTL9307012881777672676.ltl, -c, -stutter-deadlock], 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/LTL11232619432448237407.gal -t CGAL -LTL /tmp/LTL9307012881777672676.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((G(("(i6.u18.p678==0)")||(G("(((i0.u2.p55!=1)||(i3.u11.p406!=1))||(u29.p993!=1))")))))
Formula 0 simplified : !G("(i6.u18.p678==0)" | G"(((i0.u2.p55!=1)||(i3.u11.p406!=1))||(u29.p993!=1))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2465912020207382865
[2021-05-16 02:26:13] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2465912020207382865
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/ltsmin2465912020207382865]
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/ltsmin2465912020207382865] 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/ltsmin2465912020207382865] 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 FlexibleBarrier-PT-10b-08 finished in 35815 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((X(p1)||p0))))], workingDir=/home/mcc/execution]
Support contains 4 out of 499 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 499/499 places, 646/646 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 476 transition count 623
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 476 transition count 623
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 48 place count 476 transition count 621
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 62 place count 462 transition count 607
Iterating global reduction 1 with 14 rules applied. Total rules applied 76 place count 462 transition count 607
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 83 place count 462 transition count 600
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 88 place count 457 transition count 595
Iterating global reduction 2 with 5 rules applied. Total rules applied 93 place count 457 transition count 595
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 98 place count 457 transition count 590
Applied a total of 98 rules in 82 ms. Remains 457 /499 variables (removed 42) and now considering 590/646 (removed 56) transitions.
// Phase 1: matrix 590 rows 457 cols
[2021-05-16 02:26:14] [INFO ] Computed 12 place invariants in 4 ms
[2021-05-16 02:26:14] [INFO ] Implicit Places using invariants in 305 ms returned []
// Phase 1: matrix 590 rows 457 cols
[2021-05-16 02:26:14] [INFO ] Computed 12 place invariants in 4 ms
[2021-05-16 02:26:15] [INFO ] Implicit Places using invariants and state equation in 705 ms returned []
Implicit Place search using SMT with State Equation took 1014 ms to find 0 implicit places.
// Phase 1: matrix 590 rows 457 cols
[2021-05-16 02:26:15] [INFO ] Computed 12 place invariants in 4 ms
[2021-05-16 02:26:16] [INFO ] Dead Transitions using invariants and state equation in 630 ms returned []
Finished structural reductions, in 1 iterations. Remains : 457/499 places, 590/646 transitions.
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FlexibleBarrier-PT-10b-09 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:(OR (EQ s49 1) (EQ s124 1) (EQ s86 0)), p1:(EQ s65 1)], 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 574 ms.
Product exploration explored 100000 steps with 50000 reset in 402 ms.
Knowledge obtained : [p0, (NOT p1)]
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 50000 reset in 535 ms.
Product exploration explored 100000 steps with 50000 reset in 371 ms.
Applying partial POR strategy [false, false, true]
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 457 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 457/457 places, 590/590 transitions.
Graph (trivial) has 419 edges and 457 vertex of which 61 / 457 are part of one of the 10 SCC in 1 ms
Free SCC test removed 51 places
Ensure Unique test removed 52 transitions
Reduce isomorphic transitions removed 52 transitions.
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 39 rules applied. Total rules applied 40 place count 406 transition count 538
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 28 Pre rules applied. Total rules applied 40 place count 406 transition count 698
Deduced a syphon composed of 67 places in 1 ms
Iterating global reduction 1 with 28 rules applied. Total rules applied 68 place count 406 transition count 698
Discarding 43 places :
Symmetric choice reduction at 1 with 43 rule applications. Total rules 111 place count 363 transition count 655
Deduced a syphon composed of 43 places in 1 ms
Iterating global reduction 1 with 43 rules applied. Total rules applied 154 place count 363 transition count 655
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 156 place count 361 transition count 653
Deduced a syphon composed of 43 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 158 place count 361 transition count 653
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 87 places in 0 ms
Iterating global reduction 1 with 44 rules applied. Total rules applied 202 place count 361 transition count 663
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 225 place count 338 transition count 640
Deduced a syphon composed of 64 places in 0 ms
Iterating global reduction 1 with 23 rules applied. Total rules applied 248 place count 338 transition count 640
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: -60
Deduced a syphon composed of 84 places in 1 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 268 place count 338 transition count 700
Deduced a syphon composed of 84 places in 0 ms
Drop transitions removed 40 transitions
Redundant transition composition rules discarded 40 transitions
Iterating global reduction 1 with 40 rules applied. Total rules applied 308 place count 338 transition count 660
Deduced a syphon composed of 84 places in 0 ms
Applied a total of 308 rules in 65 ms. Remains 338 /457 variables (removed 119) and now considering 660/590 (removed -70) transitions.
[2021-05-16 02:26:18] [INFO ] Redundant transitions in 8 ms returned []
[2021-05-16 02:26:18] [INFO ] Flow matrix only has 623 transitions (discarded 37 similar events)
// Phase 1: matrix 623 rows 338 cols
[2021-05-16 02:26:18] [INFO ] Computed 12 place invariants in 3 ms
[2021-05-16 02:26:19] [INFO ] Dead Transitions using invariants and state equation in 686 ms returned []
Finished structural reductions, in 1 iterations. Remains : 338/457 places, 660/590 transitions.
Product exploration explored 100000 steps with 50000 reset in 730 ms.
Product exploration explored 100000 steps with 50000 reset in 596 ms.
[2021-05-16 02:26:20] [INFO ] Flatten gal took : 22 ms
[2021-05-16 02:26:20] [INFO ] Flatten gal took : 22 ms
[2021-05-16 02:26:20] [INFO ] Time to serialize gal into /tmp/LTL17536854809514883743.gal : 4 ms
[2021-05-16 02:26:20] [INFO ] Time to serialize properties into /tmp/LTL1142992523836575992.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/LTL17536854809514883743.gal, -t, CGAL, -LTL, /tmp/LTL1142992523836575992.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/LTL17536854809514883743.gal -t CGAL -LTL /tmp/LTL1142992523836575992.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F(("(((p117==1)||(p333==1))||(p222==0))")||(X("(p186==1)"))))))
Formula 0 simplified : !XF("(((p117==1)||(p333==1))||(p222==0))" | X"(p186==1)")
Detected timeout of ITS tools.
[2021-05-16 02:26:35] [INFO ] Flatten gal took : 15 ms
[2021-05-16 02:26:35] [INFO ] Applying decomposition
[2021-05-16 02:26:35] [INFO ] Flatten gal took : 15 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/graph14791907951804387996.txt, -o, /tmp/graph14791907951804387996.bin, -w, /tmp/graph14791907951804387996.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/graph14791907951804387996.bin, -l, -1, -v, -w, /tmp/graph14791907951804387996.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-16 02:26:35] [INFO ] Decomposing Gal with order
[2021-05-16 02:26:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 02:26:36] [INFO ] Removed a total of 254 redundant transitions.
[2021-05-16 02:26:36] [INFO ] Flatten gal took : 80 ms
[2021-05-16 02:26:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 12 ms.
[2021-05-16 02:26:36] [INFO ] Time to serialize gal into /tmp/LTL18362495877143504178.gal : 9 ms
[2021-05-16 02:26:36] [INFO ] Time to serialize properties into /tmp/LTL17626353691465830698.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/LTL18362495877143504178.gal, -t, CGAL, -LTL, /tmp/LTL17626353691465830698.ltl, -c, -stutter-deadlock], 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/LTL18362495877143504178.gal -t CGAL -LTL /tmp/LTL17626353691465830698.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(F(("(((i2.u16.p117==1)||(i5.u38.p333==1))||(i3.u28.p222==0))")||(X("(i2.u20.p186==1)"))))))
Formula 0 simplified : !XF("(((i2.u16.p117==1)||(i5.u38.p333==1))||(i3.u28.p222==0))" | X"(i2.u20.p186==1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9429539534053031684
[2021-05-16 02:26:51] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9429539534053031684
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/ltsmin9429539534053031684]
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/ltsmin9429539534053031684] 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/ltsmin9429539534053031684] 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 FlexibleBarrier-PT-10b-09 finished in 37684 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(G(p0))||(p1&&X(p0)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 499 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 499/499 places, 646/646 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 474 transition count 621
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 474 transition count 621
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 52 place count 474 transition count 619
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 69 place count 457 transition count 602
Iterating global reduction 1 with 17 rules applied. Total rules applied 86 place count 457 transition count 602
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 94 place count 457 transition count 594
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 100 place count 451 transition count 588
Iterating global reduction 2 with 6 rules applied. Total rules applied 106 place count 451 transition count 588
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 112 place count 451 transition count 582
Applied a total of 112 rules in 101 ms. Remains 451 /499 variables (removed 48) and now considering 582/646 (removed 64) transitions.
// Phase 1: matrix 582 rows 451 cols
[2021-05-16 02:26:52] [INFO ] Computed 12 place invariants in 4 ms
[2021-05-16 02:26:52] [INFO ] Implicit Places using invariants in 475 ms returned []
// Phase 1: matrix 582 rows 451 cols
[2021-05-16 02:26:52] [INFO ] Computed 12 place invariants in 6 ms
[2021-05-16 02:26:53] [INFO ] Implicit Places using invariants and state equation in 547 ms returned []
Implicit Place search using SMT with State Equation took 1026 ms to find 0 implicit places.
// Phase 1: matrix 582 rows 451 cols
[2021-05-16 02:26:53] [INFO ] Computed 12 place invariants in 6 ms
[2021-05-16 02:26:53] [INFO ] Dead Transitions using invariants and state equation in 477 ms returned []
Finished structural reductions, in 1 iterations. Remains : 451/499 places, 582/646 transitions.
Stuttering acceptance computed with spot in 180 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-10b-10 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p1:(EQ s181 1), p0:(EQ s225 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 89 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-10b-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10b-10 finished in 1824 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0||F(p1)||X(p2))))], workingDir=/home/mcc/execution]
Support contains 6 out of 499 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 499/499 places, 646/646 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 477 transition count 624
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 477 transition count 624
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 45 place count 477 transition count 623
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 61 place count 461 transition count 607
Iterating global reduction 1 with 16 rules applied. Total rules applied 77 place count 461 transition count 607
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 85 place count 461 transition count 599
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 90 place count 456 transition count 594
Iterating global reduction 2 with 5 rules applied. Total rules applied 95 place count 456 transition count 594
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 100 place count 456 transition count 589
Applied a total of 100 rules in 63 ms. Remains 456 /499 variables (removed 43) and now considering 589/646 (removed 57) transitions.
// Phase 1: matrix 589 rows 456 cols
[2021-05-16 02:26:54] [INFO ] Computed 12 place invariants in 3 ms
[2021-05-16 02:26:54] [INFO ] Implicit Places using invariants in 292 ms returned []
// Phase 1: matrix 589 rows 456 cols
[2021-05-16 02:26:54] [INFO ] Computed 12 place invariants in 3 ms
[2021-05-16 02:26:54] [INFO ] Implicit Places using invariants and state equation in 574 ms returned []
Implicit Place search using SMT with State Equation took 872 ms to find 0 implicit places.
// Phase 1: matrix 589 rows 456 cols
[2021-05-16 02:26:54] [INFO ] Computed 12 place invariants in 3 ms
[2021-05-16 02:26:55] [INFO ] Dead Transitions using invariants and state equation in 407 ms returned []
Finished structural reductions, in 1 iterations. Remains : 456/499 places, 589/646 transitions.
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : FlexibleBarrier-PT-10b-12 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 1}]], initial=0, aps=[p1:(EQ s51 1), p0:(AND (EQ s153 1) (EQ s199 1) (EQ s412 1) (EQ s17 1)), p2:(EQ s116 1)], 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, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 70 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-10b-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10b-12 finished in 1490 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 499 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 499/499 places, 646/646 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 474 transition count 621
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 474 transition count 621
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 52 place count 474 transition count 619
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 69 place count 457 transition count 602
Iterating global reduction 1 with 17 rules applied. Total rules applied 86 place count 457 transition count 602
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 94 place count 457 transition count 594
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 100 place count 451 transition count 588
Iterating global reduction 2 with 6 rules applied. Total rules applied 106 place count 451 transition count 588
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 112 place count 451 transition count 582
Applied a total of 112 rules in 41 ms. Remains 451 /499 variables (removed 48) and now considering 582/646 (removed 64) transitions.
// Phase 1: matrix 582 rows 451 cols
[2021-05-16 02:26:55] [INFO ] Computed 12 place invariants in 3 ms
[2021-05-16 02:26:55] [INFO ] Implicit Places using invariants in 300 ms returned []
// Phase 1: matrix 582 rows 451 cols
[2021-05-16 02:26:55] [INFO ] Computed 12 place invariants in 6 ms
[2021-05-16 02:26:56] [INFO ] Implicit Places using invariants and state equation in 675 ms returned []
Implicit Place search using SMT with State Equation took 977 ms to find 0 implicit places.
// Phase 1: matrix 582 rows 451 cols
[2021-05-16 02:26:56] [INFO ] Computed 12 place invariants in 5 ms
[2021-05-16 02:26:57] [INFO ] Dead Transitions using invariants and state equation in 558 ms returned []
Finished structural reductions, in 1 iterations. Remains : 451/499 places, 582/646 transitions.
Stuttering acceptance computed with spot in 99 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-10b-13 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(NEQ s295 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 24550 steps with 319 reset in 75 ms.
FORMULA FlexibleBarrier-PT-10b-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10b-13 finished in 1771 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 499 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 499/499 places, 646/646 transitions.
Graph (trivial) has 465 edges and 499 vertex of which 61 / 499 are part of one of the 10 SCC in 1 ms
Free SCC test removed 51 places
Ensure Unique test removed 52 transitions
Reduce isomorphic transitions removed 52 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 51 place count 447 transition count 543
Reduce places removed 50 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 51 rules applied. Total rules applied 102 place count 397 transition count 542
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 103 place count 396 transition count 542
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 31 Pre rules applied. Total rules applied 103 place count 396 transition count 511
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 165 place count 365 transition count 511
Discarding 41 places :
Symmetric choice reduction at 3 with 41 rule applications. Total rules 206 place count 324 transition count 470
Iterating global reduction 3 with 41 rules applied. Total rules applied 247 place count 324 transition count 470
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 249 place count 324 transition count 468
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 249 place count 324 transition count 466
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 253 place count 322 transition count 466
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 265 place count 310 transition count 454
Iterating global reduction 4 with 12 rules applied. Total rules applied 277 place count 310 transition count 454
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 289 place count 310 transition count 442
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 5 with 120 rules applied. Total rules applied 409 place count 250 transition count 382
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 412 place count 247 transition count 379
Iterating global reduction 5 with 3 rules applied. Total rules applied 415 place count 247 transition count 379
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 418 place count 247 transition count 376
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 6 with 10 rules applied. Total rules applied 428 place count 247 transition count 366
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 429 place count 246 transition count 365
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 430 place count 245 transition count 364
Applied a total of 430 rules in 137 ms. Remains 245 /499 variables (removed 254) and now considering 364/646 (removed 282) transitions.
[2021-05-16 02:26:57] [INFO ] Flow matrix only has 345 transitions (discarded 19 similar events)
// Phase 1: matrix 345 rows 245 cols
[2021-05-16 02:26:57] [INFO ] Computed 12 place invariants in 4 ms
[2021-05-16 02:26:57] [INFO ] Implicit Places using invariants in 346 ms returned []
[2021-05-16 02:26:57] [INFO ] Flow matrix only has 345 transitions (discarded 19 similar events)
// Phase 1: matrix 345 rows 245 cols
[2021-05-16 02:26:57] [INFO ] Computed 12 place invariants in 6 ms
[2021-05-16 02:26:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-16 02:26:58] [INFO ] Implicit Places using invariants and state equation in 530 ms returned []
Implicit Place search using SMT with State Equation took 879 ms to find 0 implicit places.
[2021-05-16 02:26:58] [INFO ] Redundant transitions in 3 ms returned []
[2021-05-16 02:26:58] [INFO ] Flow matrix only has 345 transitions (discarded 19 similar events)
// Phase 1: matrix 345 rows 245 cols
[2021-05-16 02:26:58] [INFO ] Computed 12 place invariants in 2 ms
[2021-05-16 02:26:58] [INFO ] Dead Transitions using invariants and state equation in 343 ms returned []
Finished structural reductions, in 1 iterations. Remains : 245/499 places, 364/646 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-10b-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s110 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 250 steps with 16 reset in 2 ms.
FORMULA FlexibleBarrier-PT-10b-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10b-14 finished in 1444 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 499 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 499/499 places, 646/646 transitions.
Graph (trivial) has 465 edges and 499 vertex of which 61 / 499 are part of one of the 10 SCC in 0 ms
Free SCC test removed 51 places
Ensure Unique test removed 52 transitions
Reduce isomorphic transitions removed 52 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 53 place count 447 transition count 541
Reduce places removed 52 places and 0 transitions.
Iterating post reduction 1 with 52 rules applied. Total rules applied 105 place count 395 transition count 541
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 31 Pre rules applied. Total rules applied 105 place count 395 transition count 510
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 167 place count 364 transition count 510
Discarding 39 places :
Symmetric choice reduction at 2 with 39 rule applications. Total rules 206 place count 325 transition count 471
Iterating global reduction 2 with 39 rules applied. Total rules applied 245 place count 325 transition count 471
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 247 place count 325 transition count 469
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 247 place count 325 transition count 468
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 249 place count 324 transition count 468
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 261 place count 312 transition count 456
Iterating global reduction 3 with 12 rules applied. Total rules applied 273 place count 312 transition count 456
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 285 place count 312 transition count 444
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: 61
Deduced a syphon composed of 61 places in 0 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 4 with 122 rules applied. Total rules applied 407 place count 251 transition count 383
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 409 place count 249 transition count 381
Iterating global reduction 4 with 2 rules applied. Total rules applied 411 place count 249 transition count 381
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 413 place count 249 transition count 379
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 423 place count 249 transition count 369
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 424 place count 248 transition count 368
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 425 place count 247 transition count 367
Applied a total of 425 rules in 133 ms. Remains 247 /499 variables (removed 252) and now considering 367/646 (removed 279) transitions.
[2021-05-16 02:26:58] [INFO ] Flow matrix only has 348 transitions (discarded 19 similar events)
// Phase 1: matrix 348 rows 247 cols
[2021-05-16 02:26:58] [INFO ] Computed 12 place invariants in 2 ms
[2021-05-16 02:26:59] [INFO ] Implicit Places using invariants in 249 ms returned []
[2021-05-16 02:26:59] [INFO ] Flow matrix only has 348 transitions (discarded 19 similar events)
// Phase 1: matrix 348 rows 247 cols
[2021-05-16 02:26:59] [INFO ] Computed 12 place invariants in 2 ms
[2021-05-16 02:26:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-16 02:26:59] [INFO ] Implicit Places using invariants and state equation in 423 ms returned []
Implicit Place search using SMT with State Equation took 676 ms to find 0 implicit places.
[2021-05-16 02:26:59] [INFO ] Redundant transitions in 4 ms returned []
[2021-05-16 02:26:59] [INFO ] Flow matrix only has 348 transitions (discarded 19 similar events)
// Phase 1: matrix 348 rows 247 cols
[2021-05-16 02:26:59] [INFO ] Computed 12 place invariants in 2 ms
[2021-05-16 02:26:59] [INFO ] Dead Transitions using invariants and state equation in 241 ms returned []
Finished structural reductions, in 1 iterations. Remains : 247/499 places, 367/646 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-10b-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s54 1) (EQ s243 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-10b-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10b-15 finished in 1137 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin8889699087752776195
[2021-05-16 02:26:59] [INFO ] Computing symmetric may disable matrix : 646 transitions.
[2021-05-16 02:26:59] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-16 02:26:59] [INFO ] Applying decomposition
[2021-05-16 02:26:59] [INFO ] Computing symmetric may enable matrix : 646 transitions.
[2021-05-16 02:26:59] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-16 02:26:59] [INFO ] Flatten gal took : 25 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/graph10152570452322932843.txt, -o, /tmp/graph10152570452322932843.bin, -w, /tmp/graph10152570452322932843.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/graph10152570452322932843.bin, -l, -1, -v, -w, /tmp/graph10152570452322932843.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-16 02:26:59] [INFO ] Decomposing Gal with order
[2021-05-16 02:26:59] [INFO ] Computing Do-Not-Accords matrix : 646 transitions.
[2021-05-16 02:26:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 02:26:59] [INFO ] Computation of Completed DNA matrix. took 27 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-16 02:26:59] [INFO ] Built C files in 145ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8889699087752776195
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/ltsmin8889699087752776195]
[2021-05-16 02:27:00] [INFO ] Removed a total of 241 redundant transitions.
[2021-05-16 02:27:00] [INFO ] Flatten gal took : 84 ms
[2021-05-16 02:27:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 17 labels/synchronizations in 16 ms.
[2021-05-16 02:27:00] [INFO ] Time to serialize gal into /tmp/LTLFireability1785463019522466916.gal : 8 ms
[2021-05-16 02:27:00] [INFO ] Time to serialize properties into /tmp/LTLFireability13370226757074591217.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/LTLFireability1785463019522466916.gal, -t, CGAL, -LTL, /tmp/LTLFireability13370226757074591217.ltl, -c, -stutter-deadlock], 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/LTLFireability1785463019522466916.gal -t CGAL -LTL /tmp/LTLFireability13370226757074591217.ltl -c -stutter-deadlock
Read 5 LTL properties
Checking formula 0 : !((X((("(i3.u17.p109!=1)")||((G("(i8.u60.p493==1)"))U("(i3.u15.p101==1)")))||(("(i10.i0.i0.u68.p530==1)")U("(i3.u15.p101==1)")))))
Formula 0 simplified : !X("(i3.u17.p109!=1)" | (G"(i8.u60.p493==1)" U "(i3.u15.p101==1)") | ("(i10.i0.i0.u68.p530==1)" U "(i3.u15.p101==1)"))
Compilation finished in 6115 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin8889699087752776195]
Link finished in 67 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(((LTLAPp0==true)||([]((LTLAPp1==true)) U (LTLAPp2==true))||((LTLAPp3==true) U (LTLAPp2==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin8889699087752776195]
LTSmin run took 580 ms.
FORMULA FlexibleBarrier-PT-10b-00 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(X(<>(((LTLAPp4==true)||(X(X(<>((LTLAPp5==true))))&&[]((LTLAPp6==true)))||[](<>((LTLAPp5==true))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin8889699087752776195]
LTSmin run took 893 ms.
FORMULA FlexibleBarrier-PT-10b-03 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, [](((LTLAPp7==true)||X((LTLAPp8==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin8889699087752776195]
WARNING : LTSmin timed out (>257 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, [](((LTLAPp7==true)||X((LTLAPp8==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin8889699087752776195]
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, [](((LTLAPp9==true)||[]((LTLAPp10==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin8889699087752776195]
WARNING : LTSmin timed out (>257 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, [](((LTLAPp9==true)||[]((LTLAPp10==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin8889699087752776195]
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(<>((X((LTLAPp12==true))||(LTLAPp11==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin8889699087752776195]
LTSmin run took 284 ms.
FORMULA FlexibleBarrier-PT-10b-09 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Retrying LTSmin with larger timeout 2056 s
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, [](((LTLAPp7==true)||X((LTLAPp8==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin8889699087752776195]
Detected timeout of ITS tools.
[2021-05-16 02:48:43] [INFO ] Applying decomposition
[2021-05-16 02:48:43] [INFO ] Flatten gal took : 64 ms
[2021-05-16 02:48:43] [INFO ] Decomposing Gal with order
[2021-05-16 02:48:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 02:48:44] [INFO ] Removed a total of 158 redundant transitions.
[2021-05-16 02:48:44] [INFO ] Flatten gal took : 143 ms
[2021-05-16 02:48:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 456 labels/synchronizations in 55 ms.
[2021-05-16 02:48:44] [INFO ] Time to serialize gal into /tmp/LTLFireability6544165471354711848.gal : 21 ms
[2021-05-16 02:48:44] [INFO ] Time to serialize properties into /tmp/LTLFireability10135048640326035770.ltl : 11 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/LTLFireability6544165471354711848.gal, -t, CGAL, -LTL, /tmp/LTLFireability10135048640326035770.ltl, -c, -stutter-deadlock], 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/LTLFireability6544165471354711848.gal -t CGAL -LTL /tmp/LTLFireability10135048640326035770.ltl -c -stutter-deadlock
Read 2 LTL properties
Checking formula 0 : !((G((!("((i0.i0.i0.i0.i0.i0.i0.i0.u12.p223==1)||(i1.u21.p1334==1))"))||(X("(i0.i0.i0.i0.i0.i0.i0.u13.p376!=1)")))))
Formula 0 simplified : !G(!"((i0.i0.i0.i0.i0.i0.i0.i0.u12.p223==1)||(i1.u21.p1334==1))" | X"(i0.i0.i0.i0.i0.i0.i0.u13.p376!=1)")
WARNING : LTSmin timed out (>2056 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, [](((LTLAPp7==true)||X((LTLAPp8==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin8889699087752776195]
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, [](((LTLAPp9==true)||[]((LTLAPp10==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin8889699087752776195]
Detected timeout of ITS tools.
[2021-05-16 03:10:28] [INFO ] Flatten gal took : 44 ms
[2021-05-16 03:10:28] [INFO ] Input system was already deterministic with 646 transitions.
[2021-05-16 03:10:28] [INFO ] Transformed 499 places.
[2021-05-16 03:10:28] [INFO ] Transformed 646 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-05-16 03:10:28] [INFO ] Time to serialize gal into /tmp/LTLFireability9750652607944009775.gal : 3 ms
[2021-05-16 03:10:28] [INFO ] Time to serialize properties into /tmp/LTLFireability123660854442086104.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/LTLFireability9750652607944009775.gal, -t, CGAL, -LTL, /tmp/LTLFireability123660854442086104.ltl, -c, -stutter-deadlock, --load-order, /home/mcc/execution/model.ord, --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/LTLFireability9750652607944009775.gal -t CGAL -LTL /tmp/LTLFireability123660854442086104.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G((!("((p223==1)||(p1334==1))"))||(X("(p376!=1)")))))
Formula 0 simplified : !G(!"((p223==1)||(p1334==1))" | X"(p376!=1)")

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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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="FlexibleBarrier-PT-10b"
export BK_EXAMINATION="LTLFireability"
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 FlexibleBarrier-PT-10b, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r102-smll-162075331000061"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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