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-162075331100109.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-16b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r102-smll-162075331100109
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 127K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 94K 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.3K Mar 28 16:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 16K Mar 28 16:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 23 11:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 23 11:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 22 19:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 22 19:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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 945K 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-16b-00
FORMULA_NAME FlexibleBarrier-PT-16b-01
FORMULA_NAME FlexibleBarrier-PT-16b-02
FORMULA_NAME FlexibleBarrier-PT-16b-03
FORMULA_NAME FlexibleBarrier-PT-16b-04
FORMULA_NAME FlexibleBarrier-PT-16b-05
FORMULA_NAME FlexibleBarrier-PT-16b-06
FORMULA_NAME FlexibleBarrier-PT-16b-07
FORMULA_NAME FlexibleBarrier-PT-16b-08
FORMULA_NAME FlexibleBarrier-PT-16b-09
FORMULA_NAME FlexibleBarrier-PT-16b-10
FORMULA_NAME FlexibleBarrier-PT-16b-11
FORMULA_NAME FlexibleBarrier-PT-16b-12
FORMULA_NAME FlexibleBarrier-PT-16b-13
FORMULA_NAME FlexibleBarrier-PT-16b-14
FORMULA_NAME FlexibleBarrier-PT-16b-15

=== Now, execution of the tool begins

BK_START 1621155224937

Running Version 0
[2021-05-16 08:53:48] [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 08:53:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-16 08:53:48] [INFO ] Load time of PNML (sax parser for PT used): 364 ms
[2021-05-16 08:53:48] [INFO ] Transformed 3472 places.
[2021-05-16 08:53:48] [INFO ] Transformed 4001 transitions.
[2021-05-16 08:53:48] [INFO ] Found NUPN structural information;
[2021-05-16 08:53:48] [INFO ] Parsed PT model containing 3472 places and 4001 transitions in 468 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
[2021-05-16 08:53:48] [INFO ] Initial state test concluded for 3 properties.
FORMULA FlexibleBarrier-PT-16b-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-16b-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 3472 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3472/3472 places, 4001/4001 transitions.
Discarding 1427 places :
Symmetric choice reduction at 0 with 1427 rule applications. Total rules 1427 place count 2045 transition count 2574
Iterating global reduction 0 with 1427 rules applied. Total rules applied 2854 place count 2045 transition count 2574
Discarding 663 places :
Symmetric choice reduction at 0 with 663 rule applications. Total rules 3517 place count 1382 transition count 1911
Iterating global reduction 0 with 663 rules applied. Total rules applied 4180 place count 1382 transition count 1911
Discarding 431 places :
Symmetric choice reduction at 0 with 431 rule applications. Total rules 4611 place count 951 transition count 1480
Iterating global reduction 0 with 431 rules applied. Total rules applied 5042 place count 951 transition count 1480
Ensure Unique test removed 207 transitions
Reduce isomorphic transitions removed 207 transitions.
Iterating post reduction 0 with 207 rules applied. Total rules applied 5249 place count 951 transition count 1273
Applied a total of 5249 rules in 978 ms. Remains 951 /3472 variables (removed 2521) and now considering 1273/4001 (removed 2728) transitions.
// Phase 1: matrix 1273 rows 951 cols
[2021-05-16 08:53:50] [INFO ] Computed 18 place invariants in 60 ms
[2021-05-16 08:53:51] [INFO ] Implicit Places using invariants in 1198 ms returned []
// Phase 1: matrix 1273 rows 951 cols
[2021-05-16 08:53:51] [INFO ] Computed 18 place invariants in 37 ms
[2021-05-16 08:53:52] [INFO ] Implicit Places using invariants and state equation in 1589 ms returned []
Implicit Place search using SMT with State Equation took 2827 ms to find 0 implicit places.
// Phase 1: matrix 1273 rows 951 cols
[2021-05-16 08:53:52] [INFO ] Computed 18 place invariants in 37 ms
[2021-05-16 08:53:53] [INFO ] Dead Transitions using invariants and state equation in 1024 ms returned []
Finished structural reductions, in 1 iterations. Remains : 951/3472 places, 1273/4001 transitions.
[2021-05-16 08:53:54] [INFO ] Flatten gal took : 270 ms
[2021-05-16 08:53:54] [INFO ] Flatten gal took : 139 ms
[2021-05-16 08:53:54] [INFO ] Input system was already deterministic with 1273 transitions.
Incomplete random walk after 100000 steps, including 892 resets, run finished after 594 ms. (steps per millisecond=168 ) properties (out of 28) seen :9
Running SMT prover for 19 properties.
// Phase 1: matrix 1273 rows 951 cols
[2021-05-16 08:53:55] [INFO ] Computed 18 place invariants in 23 ms
[2021-05-16 08:53:55] [INFO ] [Real]Absence check using 18 positive place invariants in 30 ms returned sat
[2021-05-16 08:53:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 08:53:56] [INFO ] [Real]Absence check using state equation in 713 ms returned sat
[2021-05-16 08:53:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 08:53:56] [INFO ] [Nat]Absence check using 18 positive place invariants in 26 ms returned sat
[2021-05-16 08:53:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 08:53:57] [INFO ] [Nat]Absence check using state equation in 588 ms returned sat
[2021-05-16 08:53:57] [INFO ] Computed and/alt/rep : 1236/1992/1236 causal constraints (skipped 36 transitions) in 133 ms.
[2021-05-16 08:54:12] [INFO ] Added : 613 causal constraints over 123 iterations in 14823 ms. Result :sat
[2021-05-16 08:54:12] [INFO ] [Real]Absence check using 18 positive place invariants in 29 ms returned sat
[2021-05-16 08:54:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 08:54:12] [INFO ] [Real]Absence check using state equation in 490 ms returned sat
[2021-05-16 08:54:13] [INFO ] Computed and/alt/rep : 1236/1992/1236 causal constraints (skipped 36 transitions) in 94 ms.
[2021-05-16 08:54:13] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 08:54:13] [INFO ] [Nat]Absence check using 18 positive place invariants in 20 ms returned sat
[2021-05-16 08:54:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 08:54:14] [INFO ] [Nat]Absence check using state equation in 453 ms returned sat
[2021-05-16 08:54:14] [INFO ] Computed and/alt/rep : 1236/1992/1236 causal constraints (skipped 36 transitions) in 84 ms.
[2021-05-16 08:54:26] [INFO ] Added : 615 causal constraints over 123 iterations in 12538 ms. Result :sat
[2021-05-16 08:54:26] [INFO ] [Real]Absence check using 18 positive place invariants in 31 ms returned sat
[2021-05-16 08:54:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 08:54:27] [INFO ] [Real]Absence check using state equation in 716 ms returned sat
[2021-05-16 08:54:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 08:54:27] [INFO ] [Nat]Absence check using 18 positive place invariants in 22 ms returned sat
[2021-05-16 08:54:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 08:54:28] [INFO ] [Nat]Absence check using state equation in 695 ms returned sat
[2021-05-16 08:54:28] [INFO ] Computed and/alt/rep : 1236/1992/1236 causal constraints (skipped 36 transitions) in 74 ms.
[2021-05-16 08:54:40] [INFO ] Deduced a trap composed of 143 places in 517 ms of which 8 ms to minimize.
[2021-05-16 08:54:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 694 ms
[2021-05-16 08:54:41] [INFO ] Added : 614 causal constraints over 123 iterations in 12562 ms. Result :sat
[2021-05-16 08:54:41] [INFO ] [Real]Absence check using 18 positive place invariants in 30 ms returned sat
[2021-05-16 08:54:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 08:54:42] [INFO ] [Real]Absence check using state equation in 691 ms returned sat
[2021-05-16 08:54:42] [INFO ] Computed and/alt/rep : 1236/1992/1236 causal constraints (skipped 36 transitions) in 73 ms.
[2021-05-16 08:54:42] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 08:54:42] [INFO ] [Nat]Absence check using 18 positive place invariants in 24 ms returned sat
[2021-05-16 08:54:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 08:54:43] [INFO ] [Nat]Absence check using state equation in 538 ms returned sat
[2021-05-16 08:54:43] [INFO ] Computed and/alt/rep : 1236/1992/1236 causal constraints (skipped 36 transitions) in 87 ms.
[2021-05-16 08:54:54] [INFO ] Deduced a trap composed of 138 places in 395 ms of which 3 ms to minimize.
[2021-05-16 08:54:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 537 ms
[2021-05-16 08:54:55] [INFO ] Added : 612 causal constraints over 123 iterations in 12045 ms. Result :sat
[2021-05-16 08:54:55] [INFO ] [Real]Absence check using 18 positive place invariants in 21 ms returned sat
[2021-05-16 08:54:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 08:54:55] [INFO ] [Real]Absence check using state equation in 561 ms returned sat
[2021-05-16 08:54:56] [INFO ] Computed and/alt/rep : 1236/1992/1236 causal constraints (skipped 36 transitions) in 80 ms.
[2021-05-16 08:54:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 08:54:56] [INFO ] [Nat]Absence check using 18 positive place invariants in 20 ms returned sat
[2021-05-16 08:54:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 08:54:56] [INFO ] [Nat]Absence check using state equation in 549 ms returned sat
[2021-05-16 08:54:57] [INFO ] Computed and/alt/rep : 1236/1992/1236 causal constraints (skipped 36 transitions) in 78 ms.
[2021-05-16 08:55:07] [INFO ] Added : 616 causal constraints over 124 iterations in 10383 ms. Result :sat
[2021-05-16 08:55:07] [INFO ] [Real]Absence check using 18 positive place invariants in 29 ms returned sat
[2021-05-16 08:55:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 08:55:08] [INFO ] [Real]Absence check using state equation in 663 ms returned sat
[2021-05-16 08:55:08] [INFO ] Computed and/alt/rep : 1236/1992/1236 causal constraints (skipped 36 transitions) in 97 ms.
[2021-05-16 08:55:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 08:55:08] [INFO ] [Nat]Absence check using 18 positive place invariants in 26 ms returned sat
[2021-05-16 08:55:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 08:55:09] [INFO ] [Nat]Absence check using state equation in 554 ms returned sat
[2021-05-16 08:55:09] [INFO ] Computed and/alt/rep : 1236/1992/1236 causal constraints (skipped 36 transitions) in 84 ms.
[2021-05-16 08:55:19] [INFO ] Added : 614 causal constraints over 123 iterations in 10328 ms. Result :sat
[2021-05-16 08:55:20] [INFO ] [Real]Absence check using 18 positive place invariants in 20 ms returned sat
[2021-05-16 08:55:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 08:55:20] [INFO ] [Real]Absence check using state equation in 522 ms returned sat
[2021-05-16 08:55:20] [INFO ] Computed and/alt/rep : 1236/1992/1236 causal constraints (skipped 36 transitions) in 84 ms.
[2021-05-16 08:55:20] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 08:55:21] [INFO ] [Nat]Absence check using 18 positive place invariants in 22 ms returned sat
[2021-05-16 08:55:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 08:55:21] [INFO ] [Nat]Absence check using state equation in 543 ms returned sat
[2021-05-16 08:55:21] [INFO ] Computed and/alt/rep : 1236/1992/1236 causal constraints (skipped 36 transitions) in 89 ms.
[2021-05-16 08:55:32] [INFO ] Deduced a trap composed of 167 places in 417 ms of which 3 ms to minimize.
[2021-05-16 08:55:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 556 ms
[2021-05-16 08:55:32] [INFO ] Added : 610 causal constraints over 122 iterations in 10514 ms. Result :sat
[2021-05-16 08:55:32] [INFO ] [Real]Absence check using 18 positive place invariants in 21 ms returned sat
[2021-05-16 08:55:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 08:55:32] [INFO ] [Real]Absence check using state equation in 531 ms returned sat
[2021-05-16 08:55:33] [INFO ] Computed and/alt/rep : 1236/1992/1236 causal constraints (skipped 36 transitions) in 89 ms.
[2021-05-16 08:55:33] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 08:55:33] [INFO ] [Nat]Absence check using 18 positive place invariants in 22 ms returned sat
[2021-05-16 08:55:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 08:55:34] [INFO ] [Nat]Absence check using state equation in 519 ms returned sat
[2021-05-16 08:55:34] [INFO ] Computed and/alt/rep : 1236/1992/1236 causal constraints (skipped 36 transitions) in 70 ms.
[2021-05-16 08:55:44] [INFO ] Deduced a trap composed of 135 places in 335 ms of which 2 ms to minimize.
[2021-05-16 08:55:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 485 ms
[2021-05-16 08:55:44] [INFO ] Added : 612 causal constraints over 123 iterations in 10771 ms. Result :sat
[2021-05-16 08:55:44] [INFO ] [Real]Absence check using 18 positive place invariants in 21 ms returned sat
[2021-05-16 08:55:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 08:55:45] [INFO ] [Real]Absence check using state equation in 519 ms returned sat
[2021-05-16 08:55:45] [INFO ] Computed and/alt/rep : 1236/1992/1236 causal constraints (skipped 36 transitions) in 77 ms.
[2021-05-16 08:55:45] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 08:55:45] [INFO ] [Nat]Absence check using 18 positive place invariants in 22 ms returned sat
[2021-05-16 08:55:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 08:55:46] [INFO ] [Nat]Absence check using state equation in 544 ms returned sat
[2021-05-16 08:55:46] [INFO ] Computed and/alt/rep : 1236/1992/1236 causal constraints (skipped 36 transitions) in 79 ms.
[2021-05-16 08:55:57] [INFO ] Deduced a trap composed of 44 places in 507 ms of which 2 ms to minimize.
[2021-05-16 08:55:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 655 ms
[2021-05-16 08:55:57] [INFO ] Added : 615 causal constraints over 124 iterations in 11180 ms. Result :sat
[2021-05-16 08:55:57] [INFO ] [Real]Absence check using 18 positive place invariants in 22 ms returned sat
[2021-05-16 08:55:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 08:55:58] [INFO ] [Real]Absence check using state equation in 525 ms returned sat
[2021-05-16 08:55:58] [INFO ] Computed and/alt/rep : 1236/1992/1236 causal constraints (skipped 36 transitions) in 85 ms.
[2021-05-16 08:55:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 08:55:58] [INFO ] [Nat]Absence check using 18 positive place invariants in 22 ms returned sat
[2021-05-16 08:55:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 08:55:59] [INFO ] [Nat]Absence check using state equation in 528 ms returned sat
[2021-05-16 08:55:59] [INFO ] Computed and/alt/rep : 1236/1992/1236 causal constraints (skipped 36 transitions) in 90 ms.
[2021-05-16 08:56:09] [INFO ] Added : 618 causal constraints over 124 iterations in 9997 ms. Result :sat
[2021-05-16 08:56:09] [INFO ] [Real]Absence check using 18 positive place invariants in 20 ms returned sat
[2021-05-16 08:56:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 08:56:10] [INFO ] [Real]Absence check using state equation in 509 ms returned sat
[2021-05-16 08:56:10] [INFO ] Computed and/alt/rep : 1236/1992/1236 causal constraints (skipped 36 transitions) in 86 ms.
[2021-05-16 08:56:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 08:56:10] [INFO ] [Nat]Absence check using 18 positive place invariants in 22 ms returned sat
[2021-05-16 08:56:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 08:56:11] [INFO ] [Nat]Absence check using state equation in 527 ms returned sat
[2021-05-16 08:56:11] [INFO ] Computed and/alt/rep : 1236/1992/1236 causal constraints (skipped 36 transitions) in 87 ms.
[2021-05-16 08:56:21] [INFO ] Added : 614 causal constraints over 123 iterations in 10279 ms. Result :sat
[2021-05-16 08:56:21] [INFO ] [Real]Absence check using 18 positive place invariants in 20 ms returned sat
[2021-05-16 08:56:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 08:56:22] [INFO ] [Real]Absence check using state equation in 564 ms returned sat
[2021-05-16 08:56:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 08:56:22] [INFO ] [Nat]Absence check using 18 positive place invariants in 20 ms returned sat
[2021-05-16 08:56:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 08:56:23] [INFO ] [Nat]Absence check using state equation in 528 ms returned sat
[2021-05-16 08:56:23] [INFO ] Computed and/alt/rep : 1236/1992/1236 causal constraints (skipped 36 transitions) in 87 ms.
[2021-05-16 08:56:33] [INFO ] Added : 612 causal constraints over 123 iterations in 10127 ms. Result :sat
[2021-05-16 08:56:33] [INFO ] [Real]Absence check using 18 positive place invariants in 21 ms returned sat
[2021-05-16 08:56:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 08:56:33] [INFO ] [Real]Absence check using state equation in 517 ms returned sat
[2021-05-16 08:56:34] [INFO ] Computed and/alt/rep : 1236/1992/1236 causal constraints (skipped 36 transitions) in 83 ms.
[2021-05-16 08:56:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 08:56:34] [INFO ] [Nat]Absence check using 18 positive place invariants in 23 ms returned sat
[2021-05-16 08:56:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 08:56:34] [INFO ] [Nat]Absence check using state equation in 540 ms returned sat
[2021-05-16 08:56:35] [INFO ] Computed and/alt/rep : 1236/1992/1236 causal constraints (skipped 36 transitions) in 91 ms.
[2021-05-16 08:56:45] [INFO ] Added : 619 causal constraints over 124 iterations in 10720 ms. Result :sat
[2021-05-16 08:56:45] [INFO ] [Real]Absence check using 18 positive place invariants in 20 ms returned sat
[2021-05-16 08:56:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 08:56:46] [INFO ] [Real]Absence check using state equation in 513 ms returned sat
[2021-05-16 08:56:46] [INFO ] Computed and/alt/rep : 1236/1992/1236 causal constraints (skipped 36 transitions) in 77 ms.
[2021-05-16 08:56:46] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 08:56:46] [INFO ] [Nat]Absence check using 18 positive place invariants in 26 ms returned sat
[2021-05-16 08:56:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 08:56:47] [INFO ] [Nat]Absence check using state equation in 470 ms returned sat
[2021-05-16 08:56:47] [INFO ] Computed and/alt/rep : 1236/1992/1236 causal constraints (skipped 36 transitions) in 87 ms.
[2021-05-16 08:56:57] [INFO ] Added : 616 causal constraints over 124 iterations in 10371 ms. Result :sat
[2021-05-16 08:56:57] [INFO ] [Real]Absence check using 18 positive place invariants in 22 ms returned sat
[2021-05-16 08:56:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 08:56:58] [INFO ] [Real]Absence check using state equation in 529 ms returned sat
[2021-05-16 08:56:58] [INFO ] Computed and/alt/rep : 1236/1992/1236 causal constraints (skipped 36 transitions) in 88 ms.
[2021-05-16 08:56:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 08:56:59] [INFO ] [Nat]Absence check using 18 positive place invariants in 30 ms returned sat
[2021-05-16 08:56:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 08:56:59] [INFO ] [Nat]Absence check using state equation in 532 ms returned sat
[2021-05-16 08:56:59] [INFO ] Computed and/alt/rep : 1236/1992/1236 causal constraints (skipped 36 transitions) in 86 ms.
[2021-05-16 08:57:09] [INFO ] Added : 613 causal constraints over 123 iterations in 10038 ms. Result :sat
[2021-05-16 08:57:09] [INFO ] [Real]Absence check using 18 positive place invariants in 21 ms returned sat
[2021-05-16 08:57:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 08:57:10] [INFO ] [Real]Absence check using state equation in 551 ms returned sat
[2021-05-16 08:57:10] [INFO ] Computed and/alt/rep : 1236/1992/1236 causal constraints (skipped 36 transitions) in 86 ms.
[2021-05-16 08:57:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 08:57:11] [INFO ] [Nat]Absence check using 18 positive place invariants in 23 ms returned sat
[2021-05-16 08:57:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 08:57:11] [INFO ] [Nat]Absence check using state equation in 523 ms returned sat
[2021-05-16 08:57:11] [INFO ] Computed and/alt/rep : 1236/1992/1236 causal constraints (skipped 36 transitions) in 84 ms.
[2021-05-16 08:57:22] [INFO ] Deduced a trap composed of 135 places in 458 ms of which 1 ms to minimize.
[2021-05-16 08:57:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 604 ms
[2021-05-16 08:57:22] [INFO ] Added : 612 causal constraints over 123 iterations in 10682 ms. Result :sat
[2021-05-16 08:57:22] [INFO ] [Real]Absence check using 18 positive place invariants in 24 ms returned sat
[2021-05-16 08:57:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 08:57:22] [INFO ] [Real]Absence check using state equation in 515 ms returned sat
[2021-05-16 08:57:23] [INFO ] Computed and/alt/rep : 1236/1992/1236 causal constraints (skipped 36 transitions) in 85 ms.
[2021-05-16 08:57:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 08:57:23] [INFO ] [Nat]Absence check using 18 positive place invariants in 22 ms returned sat
[2021-05-16 08:57:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 08:57:24] [INFO ] [Nat]Absence check using state equation in 533 ms returned sat
[2021-05-16 08:57:24] [INFO ] Computed and/alt/rep : 1236/1992/1236 causal constraints (skipped 36 transitions) in 69 ms.
[2021-05-16 08:57:34] [INFO ] Added : 621 causal constraints over 125 iterations in 10526 ms. Result :sat
[2021-05-16 08:57:34] [INFO ] [Real]Absence check using 18 positive place invariants in 22 ms returned sat
[2021-05-16 08:57:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 08:57:35] [INFO ] [Real]Absence check using state equation in 544 ms returned sat
[2021-05-16 08:57:35] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 08:57:35] [INFO ] [Nat]Absence check using 18 positive place invariants in 23 ms returned sat
[2021-05-16 08:57:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 08:57:36] [INFO ] [Nat]Absence check using state equation in 560 ms returned sat
[2021-05-16 08:57:36] [INFO ] Computed and/alt/rep : 1236/1992/1236 causal constraints (skipped 36 transitions) in 86 ms.
[2021-05-16 08:57:46] [INFO ] Added : 616 causal constraints over 124 iterations in 10428 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(F((p0&&X((p1&&G(F(p2))))))) U G(p1)))], workingDir=/home/mcc/execution]
Support contains 2 out of 951 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 951/951 places, 1273/1273 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 931 transition count 1253
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 931 transition count 1253
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 42 place count 931 transition count 1251
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 59 place count 914 transition count 1234
Iterating global reduction 1 with 17 rules applied. Total rules applied 76 place count 914 transition count 1234
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 85 place count 914 transition count 1225
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 91 place count 908 transition count 1219
Iterating global reduction 2 with 6 rules applied. Total rules applied 97 place count 908 transition count 1219
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 103 place count 908 transition count 1213
Applied a total of 103 rules in 163 ms. Remains 908 /951 variables (removed 43) and now considering 1213/1273 (removed 60) transitions.
// Phase 1: matrix 1213 rows 908 cols
[2021-05-16 08:57:46] [INFO ] Computed 18 place invariants in 15 ms
[2021-05-16 08:57:47] [INFO ] Implicit Places using invariants in 531 ms returned []
// Phase 1: matrix 1213 rows 908 cols
[2021-05-16 08:57:47] [INFO ] Computed 18 place invariants in 21 ms
[2021-05-16 08:57:48] [INFO ] Implicit Places using invariants and state equation in 1449 ms returned []
Implicit Place search using SMT with State Equation took 1983 ms to find 0 implicit places.
// Phase 1: matrix 1213 rows 908 cols
[2021-05-16 08:57:48] [INFO ] Computed 18 place invariants in 14 ms
[2021-05-16 08:57:50] [INFO ] Dead Transitions using invariants and state equation in 1262 ms returned []
Finished structural reductions, in 1 iterations. Remains : 908/951 places, 1213/1273 transitions.
Stuttering acceptance computed with spot in 387 ms :[(NOT p1), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p2)]
Running random walk in product with property : FlexibleBarrier-PT-16b-01 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s902 1), p0:(EQ s20 0), p2:(EQ s20 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 107 steps with 0 reset in 4 ms.
FORMULA FlexibleBarrier-PT-16b-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-16b-01 finished in 3897 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(((G(p0)&&(G(p2)||p1)) U p3)))], workingDir=/home/mcc/execution]
Support contains 4 out of 951 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 951/951 places, 1273/1273 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 933 transition count 1255
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 933 transition count 1255
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 38 place count 933 transition count 1253
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 54 place count 917 transition count 1237
Iterating global reduction 1 with 16 rules applied. Total rules applied 70 place count 917 transition count 1237
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 79 place count 917 transition count 1228
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 84 place count 912 transition count 1223
Iterating global reduction 2 with 5 rules applied. Total rules applied 89 place count 912 transition count 1223
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 94 place count 912 transition count 1218
Applied a total of 94 rules in 172 ms. Remains 912 /951 variables (removed 39) and now considering 1218/1273 (removed 55) transitions.
// Phase 1: matrix 1218 rows 912 cols
[2021-05-16 08:57:50] [INFO ] Computed 18 place invariants in 14 ms
[2021-05-16 08:57:51] [INFO ] Implicit Places using invariants in 739 ms returned []
// Phase 1: matrix 1218 rows 912 cols
[2021-05-16 08:57:51] [INFO ] Computed 18 place invariants in 15 ms
[2021-05-16 08:57:52] [INFO ] Implicit Places using invariants and state equation in 1190 ms returned []
Implicit Place search using SMT with State Equation took 1937 ms to find 0 implicit places.
// Phase 1: matrix 1218 rows 912 cols
[2021-05-16 08:57:52] [INFO ] Computed 18 place invariants in 15 ms
[2021-05-16 08:57:53] [INFO ] Dead Transitions using invariants and state equation in 1107 ms returned []
Finished structural reductions, in 1 iterations. Remains : 912/951 places, 1218/1273 transitions.
Stuttering acceptance computed with spot in 184 ms :[(NOT p3), (NOT p3), true, (NOT p0), (NOT p2)]
Running random walk in product with property : FlexibleBarrier-PT-16b-02 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p3) p0 p1) (AND (NOT p3) p0 p2)), acceptance={0} source=1 dest: 1}, { cond=(OR (AND (NOT p3) (NOT p0)) (AND (NOT p3) (NOT p1) (NOT p2))), acceptance={0} source=1 dest: 2}, { cond=(OR (AND (NOT p3) p0 p1) (AND (NOT p3) p0 p2)), acceptance={0} source=1 dest: 3}, { cond=(AND (NOT p3) p0 (NOT p1) p2), acceptance={0} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 2}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=0, aps=[p3:(EQ s20 1), p0:(EQ s344 1), p1:(OR (EQ s432 1) (EQ s104 1)), p2:(EQ s104 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-16b-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-16b-02 finished in 3436 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 951 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 951/951 places, 1273/1273 transitions.
Graph (trivial) has 900 edges and 951 vertex of which 97 / 951 are part of one of the 16 SCC in 8 ms
Free SCC test removed 81 places
Ensure Unique test removed 82 transitions
Reduce isomorphic transitions removed 82 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 80 place count 869 transition count 1111
Reduce places removed 79 places and 0 transitions.
Iterating post reduction 1 with 79 rules applied. Total rules applied 159 place count 790 transition count 1111
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 44 Pre rules applied. Total rules applied 159 place count 790 transition count 1067
Deduced a syphon composed of 44 places in 1 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 88 rules applied. Total rules applied 247 place count 746 transition count 1067
Discarding 50 places :
Symmetric choice reduction at 2 with 50 rule applications. Total rules 297 place count 696 transition count 1017
Iterating global reduction 2 with 50 rules applied. Total rules applied 347 place count 696 transition count 1017
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 349 place count 696 transition count 1015
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 364 place count 681 transition count 1000
Iterating global reduction 3 with 15 rules applied. Total rules applied 379 place count 681 transition count 1000
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 3 with 15 rules applied. Total rules applied 394 place count 681 transition count 985
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 97
Deduced a syphon composed of 97 places in 1 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 4 with 194 rules applied. Total rules applied 588 place count 584 transition count 888
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 4 with 16 rules applied. Total rules applied 604 place count 584 transition count 872
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 605 place count 583 transition count 871
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 606 place count 582 transition count 870
Applied a total of 606 rules in 651 ms. Remains 582 /951 variables (removed 369) and now considering 870/1273 (removed 403) transitions.
[2021-05-16 08:57:54] [INFO ] Flow matrix only has 839 transitions (discarded 31 similar events)
// Phase 1: matrix 839 rows 582 cols
[2021-05-16 08:57:54] [INFO ] Computed 18 place invariants in 22 ms
[2021-05-16 08:57:55] [INFO ] Implicit Places using invariants in 452 ms returned []
[2021-05-16 08:57:55] [INFO ] Flow matrix only has 839 transitions (discarded 31 similar events)
// Phase 1: matrix 839 rows 582 cols
[2021-05-16 08:57:55] [INFO ] Computed 18 place invariants in 13 ms
[2021-05-16 08:57:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-16 08:57:56] [INFO ] Implicit Places using invariants and state equation in 1087 ms returned []
Implicit Place search using SMT with State Equation took 1541 ms to find 0 implicit places.
[2021-05-16 08:57:56] [INFO ] Redundant transitions in 77 ms returned []
[2021-05-16 08:57:56] [INFO ] Flow matrix only has 839 transitions (discarded 31 similar events)
// Phase 1: matrix 839 rows 582 cols
[2021-05-16 08:57:56] [INFO ] Computed 18 place invariants in 13 ms
[2021-05-16 08:57:56] [INFO ] Dead Transitions using invariants and state equation in 729 ms returned []
Finished structural reductions, in 1 iterations. Remains : 582/951 places, 870/1273 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-16b-03 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:(EQ s58 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-16b-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-16b-03 finished in 3092 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0) U X(p1)))], workingDir=/home/mcc/execution]
Support contains 3 out of 951 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 951/951 places, 1273/1273 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 932 transition count 1254
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 932 transition count 1254
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 40 place count 932 transition count 1252
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 56 place count 916 transition count 1236
Iterating global reduction 1 with 16 rules applied. Total rules applied 72 place count 916 transition count 1236
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 80 place count 916 transition count 1228
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 86 place count 910 transition count 1222
Iterating global reduction 2 with 6 rules applied. Total rules applied 92 place count 910 transition count 1222
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 98 place count 910 transition count 1216
Applied a total of 98 rules in 140 ms. Remains 910 /951 variables (removed 41) and now considering 1216/1273 (removed 57) transitions.
// Phase 1: matrix 1216 rows 910 cols
[2021-05-16 08:57:57] [INFO ] Computed 18 place invariants in 13 ms
[2021-05-16 08:57:57] [INFO ] Implicit Places using invariants in 508 ms returned []
// Phase 1: matrix 1216 rows 910 cols
[2021-05-16 08:57:57] [INFO ] Computed 18 place invariants in 13 ms
[2021-05-16 08:57:58] [INFO ] Implicit Places using invariants and state equation in 1309 ms returned []
Implicit Place search using SMT with State Equation took 1820 ms to find 0 implicit places.
// Phase 1: matrix 1216 rows 910 cols
[2021-05-16 08:57:58] [INFO ] Computed 18 place invariants in 13 ms
[2021-05-16 08:58:00] [INFO ] Dead Transitions using invariants and state equation in 1120 ms returned []
Finished structural reductions, in 1 iterations. Remains : 910/951 places, 1216/1273 transitions.
Stuttering acceptance computed with spot in 153 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-16b-04 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s261 0), p1:(OR (EQ s345 1) (EQ s102 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 218 steps with 1 reset in 9 ms.
FORMULA FlexibleBarrier-PT-16b-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-16b-04 finished in 3269 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0&&G((p1 U p2)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 951 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 951/951 places, 1273/1273 transitions.
Graph (trivial) has 897 edges and 951 vertex of which 97 / 951 are part of one of the 16 SCC in 1 ms
Free SCC test removed 81 places
Ensure Unique test removed 82 transitions
Reduce isomorphic transitions removed 82 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 78 rules applied. Total rules applied 79 place count 869 transition count 1112
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 1 with 78 rules applied. Total rules applied 157 place count 791 transition count 1112
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 42 Pre rules applied. Total rules applied 157 place count 791 transition count 1070
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 241 place count 749 transition count 1070
Discarding 48 places :
Symmetric choice reduction at 2 with 48 rule applications. Total rules 289 place count 701 transition count 1022
Iterating global reduction 2 with 48 rules applied. Total rules applied 337 place count 701 transition count 1022
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 339 place count 701 transition count 1020
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 354 place count 686 transition count 1005
Iterating global reduction 3 with 15 rules applied. Total rules applied 369 place count 686 transition count 1005
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 382 place count 686 transition count 992
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 97
Deduced a syphon composed of 97 places in 1 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 4 with 194 rules applied. Total rules applied 576 place count 589 transition count 895
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 577 place count 588 transition count 894
Iterating global reduction 4 with 1 rules applied. Total rules applied 578 place count 588 transition count 894
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 579 place count 588 transition count 893
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 5 with 16 rules applied. Total rules applied 595 place count 588 transition count 877
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 596 place count 587 transition count 876
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 597 place count 586 transition count 875
Applied a total of 597 rules in 404 ms. Remains 586 /951 variables (removed 365) and now considering 875/1273 (removed 398) transitions.
[2021-05-16 08:58:00] [INFO ] Flow matrix only has 844 transitions (discarded 31 similar events)
// Phase 1: matrix 844 rows 586 cols
[2021-05-16 08:58:00] [INFO ] Computed 18 place invariants in 15 ms
[2021-05-16 08:58:01] [INFO ] Implicit Places using invariants in 458 ms returned []
[2021-05-16 08:58:01] [INFO ] Flow matrix only has 844 transitions (discarded 31 similar events)
// Phase 1: matrix 844 rows 586 cols
[2021-05-16 08:58:01] [INFO ] Computed 18 place invariants in 14 ms
[2021-05-16 08:58:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-16 08:58:02] [INFO ] Implicit Places using invariants and state equation in 1253 ms returned []
Implicit Place search using SMT with State Equation took 1715 ms to find 0 implicit places.
[2021-05-16 08:58:02] [INFO ] Redundant transitions in 13 ms returned []
[2021-05-16 08:58:02] [INFO ] Flow matrix only has 844 transitions (discarded 31 similar events)
// Phase 1: matrix 844 rows 586 cols
[2021-05-16 08:58:02] [INFO ] Computed 18 place invariants in 13 ms
[2021-05-16 08:58:03] [INFO ] Dead Transitions using invariants and state equation in 802 ms returned []
Finished structural reductions, in 1 iterations. Remains : 586/951 places, 875/1273 transitions.
Stuttering acceptance computed with spot in 122 ms :[(OR (NOT p2) (NOT p0)), (NOT p2), (NOT p2)]
Running random walk in product with property : FlexibleBarrier-PT-16b-05 automaton TGBA [mat=[[{ cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={0} source=0 dest: 0}, { cond=(OR (AND p0 p2) (AND p0 p1)), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=0 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(OR p2 p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s313 1), p2:(EQ s201 1), p1:(EQ s68 1)], nbAcceptance=1, 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 0 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-16b-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-16b-05 finished in 3086 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0&&F(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 951 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 951/951 places, 1273/1273 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 932 transition count 1254
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 932 transition count 1254
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 932 transition count 1253
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 56 place count 915 transition count 1236
Iterating global reduction 1 with 17 rules applied. Total rules applied 73 place count 915 transition count 1236
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 81 place count 915 transition count 1228
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 88 place count 908 transition count 1221
Iterating global reduction 2 with 7 rules applied. Total rules applied 95 place count 908 transition count 1221
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 102 place count 908 transition count 1214
Applied a total of 102 rules in 131 ms. Remains 908 /951 variables (removed 43) and now considering 1214/1273 (removed 59) transitions.
// Phase 1: matrix 1214 rows 908 cols
[2021-05-16 08:58:03] [INFO ] Computed 18 place invariants in 14 ms
[2021-05-16 08:58:04] [INFO ] Implicit Places using invariants in 708 ms returned []
// Phase 1: matrix 1214 rows 908 cols
[2021-05-16 08:58:04] [INFO ] Computed 18 place invariants in 22 ms
[2021-05-16 08:58:05] [INFO ] Implicit Places using invariants and state equation in 1273 ms returned []
Implicit Place search using SMT with State Equation took 1990 ms to find 0 implicit places.
// Phase 1: matrix 1214 rows 908 cols
[2021-05-16 08:58:05] [INFO ] Computed 18 place invariants in 13 ms
[2021-05-16 08:58:06] [INFO ] Dead Transitions using invariants and state equation in 1027 ms returned []
Finished structural reductions, in 1 iterations. Remains : 908/951 places, 1214/1273 transitions.
Stuttering acceptance computed with spot in 216 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true, (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-16b-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s102 1), p1:(AND (EQ s115 1) (EQ s509 1) (EQ s715 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-16b-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-16b-07 finished in 3403 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(G((p0&&F(p1)))) U G(p2)))], workingDir=/home/mcc/execution]
Support contains 2 out of 951 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 951/951 places, 1273/1273 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 932 transition count 1254
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 932 transition count 1254
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 40 place count 932 transition count 1252
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 56 place count 916 transition count 1236
Iterating global reduction 1 with 16 rules applied. Total rules applied 72 place count 916 transition count 1236
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 80 place count 916 transition count 1228
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 86 place count 910 transition count 1222
Iterating global reduction 2 with 6 rules applied. Total rules applied 92 place count 910 transition count 1222
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 98 place count 910 transition count 1216
Applied a total of 98 rules in 139 ms. Remains 910 /951 variables (removed 41) and now considering 1216/1273 (removed 57) transitions.
// Phase 1: matrix 1216 rows 910 cols
[2021-05-16 08:58:06] [INFO ] Computed 18 place invariants in 23 ms
[2021-05-16 08:58:07] [INFO ] Implicit Places using invariants in 736 ms returned []
// Phase 1: matrix 1216 rows 910 cols
[2021-05-16 08:58:07] [INFO ] Computed 18 place invariants in 13 ms
[2021-05-16 08:58:08] [INFO ] Implicit Places using invariants and state equation in 1351 ms returned []
Implicit Place search using SMT with State Equation took 2089 ms to find 0 implicit places.
// Phase 1: matrix 1216 rows 910 cols
[2021-05-16 08:58:09] [INFO ] Computed 18 place invariants in 13 ms
[2021-05-16 08:58:10] [INFO ] Dead Transitions using invariants and state equation in 1231 ms returned []
Finished structural reductions, in 1 iterations. Remains : 910/951 places, 1216/1273 transitions.
Stuttering acceptance computed with spot in 195 ms :[(NOT p2), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), true, (NOT p1), (AND (NOT p2) p0)]
Running random walk in product with property : FlexibleBarrier-PT-16b-08 automaton TGBA [mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}], [{ cond=(AND p2 p0), acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p2) p0), acceptance={} source=5 dest: 3}, { cond=(AND p2 p0), acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(EQ s266 0), p0:(EQ s266 1), p1:(EQ s597 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 25002 reset in 901 ms.
Product exploration explored 100000 steps with 24943 reset in 691 ms.
Knowledge obtained : [p2, (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 196 ms :[(NOT p2), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), true, (NOT p1), (AND (NOT p2) p0)]
Product exploration explored 100000 steps with 24970 reset in 696 ms.
Product exploration explored 100000 steps with 25016 reset in 679 ms.
Applying partial POR strategy [false, true, true, true, true, true]
Stuttering acceptance computed with spot in 205 ms :[(NOT p2), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), true, (NOT p1), (AND (NOT p2) p0)]
Support contains 2 out of 910 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 910/910 places, 1216/1216 transitions.
Graph (trivial) has 857 edges and 910 vertex of which 97 / 910 are part of one of the 16 SCC in 1 ms
Free SCC test removed 81 places
Ensure Unique test removed 82 transitions
Reduce isomorphic transitions removed 82 transitions.
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 63 rules applied. Total rules applied 64 place count 829 transition count 1134
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 47 Pre rules applied. Total rules applied 64 place count 829 transition count 1486
Deduced a syphon composed of 110 places in 1 ms
Iterating global reduction 1 with 47 rules applied. Total rules applied 111 place count 829 transition count 1486
Discarding 74 places :
Symmetric choice reduction at 1 with 74 rule applications. Total rules 185 place count 755 transition count 1412
Deduced a syphon composed of 67 places in 1 ms
Iterating global reduction 1 with 74 rules applied. Total rules applied 259 place count 755 transition count 1412
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 261 place count 753 transition count 1410
Deduced a syphon composed of 67 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 263 place count 753 transition count 1410
Performed 68 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 135 places in 0 ms
Iterating global reduction 1 with 68 rules applied. Total rules applied 331 place count 753 transition count 1426
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 366 place count 718 transition count 1391
Deduced a syphon composed of 100 places in 0 ms
Iterating global reduction 1 with 35 rules applied. Total rules applied 401 place count 718 transition count 1391
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: -96
Deduced a syphon composed of 132 places in 1 ms
Iterating global reduction 1 with 32 rules applied. Total rules applied 433 place count 718 transition count 1487
Deduced a syphon composed of 132 places in 0 ms
Drop transitions removed 64 transitions
Redundant transition composition rules discarded 64 transitions
Iterating global reduction 1 with 64 rules applied. Total rules applied 497 place count 718 transition count 1423
Deduced a syphon composed of 132 places in 0 ms
Applied a total of 497 rules in 412 ms. Remains 718 /910 variables (removed 192) and now considering 1423/1216 (removed -207) transitions.
[2021-05-16 08:58:14] [INFO ] Redundant transitions in 76 ms returned []
[2021-05-16 08:58:14] [INFO ] Flow matrix only has 1362 transitions (discarded 61 similar events)
// Phase 1: matrix 1362 rows 718 cols
[2021-05-16 08:58:14] [INFO ] Computed 18 place invariants in 18 ms
[2021-05-16 08:58:15] [INFO ] Dead Transitions using invariants and state equation in 906 ms returned []
Finished structural reductions, in 1 iterations. Remains : 718/910 places, 1423/1216 transitions.
Product exploration explored 100000 steps with 25082 reset in 3091 ms.
Product exploration explored 100000 steps with 24995 reset in 2810 ms.
[2021-05-16 08:58:21] [INFO ] Flatten gal took : 73 ms
[2021-05-16 08:58:21] [INFO ] Flatten gal took : 66 ms
[2021-05-16 08:58:21] [INFO ] Time to serialize gal into /tmp/LTL10199933826366169649.gal : 38 ms
[2021-05-16 08:58:21] [INFO ] Time to serialize properties into /tmp/LTL3992101025052659346.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/LTL10199933826366169649.gal, -t, CGAL, -LTL, /tmp/LTL3992101025052659346.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/LTL10199933826366169649.gal -t CGAL -LTL /tmp/LTL3992101025052659346.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((X(G(("(p948==1)")&&(F("(p2147==1)")))))U(G("(p948==0)"))))
Formula 0 simplified : !(XG("(p948==1)" & F"(p2147==1)") U G"(p948==0)")
Detected timeout of ITS tools.
[2021-05-16 08:58:36] [INFO ] Flatten gal took : 63 ms
[2021-05-16 08:58:36] [INFO ] Applying decomposition
[2021-05-16 08:58:37] [INFO ] Flatten gal took : 57 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph15439080367015834013.txt, -o, /tmp/graph15439080367015834013.bin, -w, /tmp/graph15439080367015834013.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/graph15439080367015834013.bin, -l, -1, -v, -w, /tmp/graph15439080367015834013.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-16 08:58:37] [INFO ] Decomposing Gal with order
[2021-05-16 08:58:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 08:58:37] [INFO ] Removed a total of 336 redundant transitions.
[2021-05-16 08:58:37] [INFO ] Flatten gal took : 384 ms
[2021-05-16 08:58:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 37 ms.
[2021-05-16 08:58:37] [INFO ] Time to serialize gal into /tmp/LTL13990448079883112725.gal : 23 ms
[2021-05-16 08:58:37] [INFO ] Time to serialize properties into /tmp/LTL14714219792871472833.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/LTL13990448079883112725.gal, -t, CGAL, -LTL, /tmp/LTL14714219792871472833.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/LTL13990448079883112725.gal -t CGAL -LTL /tmp/LTL14714219792871472833.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !(((X(G(("(i7.u71.p948==1)")&&(F("(i16.u154.p2147==1)")))))U(G("(i7.u71.p948==0)"))))
Formula 0 simplified : !(XG("(i7.u71.p948==1)" & F"(i16.u154.p2147==1)") U G"(i7.u71.p948==0)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin18327197848020385887
[2021-05-16 08:58:53] [INFO ] Built C files in 44ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18327197848020385887
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/ltsmin18327197848020385887]
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/ltsmin18327197848020385887] 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/ltsmin18327197848020385887] 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-16b-08 finished in 47404 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 951 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 951/951 places, 1273/1273 transitions.
Graph (trivial) has 899 edges and 951 vertex of which 97 / 951 are part of one of the 16 SCC in 10 ms
Free SCC test removed 81 places
Ensure Unique test removed 82 transitions
Reduce isomorphic transitions removed 82 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 78 rules applied. Total rules applied 79 place count 869 transition count 1112
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 1 with 78 rules applied. Total rules applied 157 place count 791 transition count 1112
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 44 Pre rules applied. Total rules applied 157 place count 791 transition count 1068
Deduced a syphon composed of 44 places in 1 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 88 rules applied. Total rules applied 245 place count 747 transition count 1068
Discarding 50 places :
Symmetric choice reduction at 2 with 50 rule applications. Total rules 295 place count 697 transition count 1018
Iterating global reduction 2 with 50 rules applied. Total rules applied 345 place count 697 transition count 1018
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 347 place count 697 transition count 1016
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 362 place count 682 transition count 1001
Iterating global reduction 3 with 15 rules applied. Total rules applied 377 place count 682 transition count 1001
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 3 with 15 rules applied. Total rules applied 392 place count 682 transition count 986
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 97
Deduced a syphon composed of 97 places in 1 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 4 with 194 rules applied. Total rules applied 586 place count 585 transition count 889
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 587 place count 584 transition count 888
Iterating global reduction 4 with 1 rules applied. Total rules applied 588 place count 584 transition count 888
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 589 place count 584 transition count 887
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 5 with 16 rules applied. Total rules applied 605 place count 584 transition count 871
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 606 place count 583 transition count 870
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 607 place count 582 transition count 869
Applied a total of 607 rules in 414 ms. Remains 582 /951 variables (removed 369) and now considering 869/1273 (removed 404) transitions.
[2021-05-16 08:58:54] [INFO ] Flow matrix only has 838 transitions (discarded 31 similar events)
// Phase 1: matrix 838 rows 582 cols
[2021-05-16 08:58:54] [INFO ] Computed 18 place invariants in 13 ms
[2021-05-16 08:58:55] [INFO ] Implicit Places using invariants in 492 ms returned []
[2021-05-16 08:58:55] [INFO ] Flow matrix only has 838 transitions (discarded 31 similar events)
// Phase 1: matrix 838 rows 582 cols
[2021-05-16 08:58:55] [INFO ] Computed 18 place invariants in 13 ms
[2021-05-16 08:58:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-16 08:58:56] [INFO ] Implicit Places using invariants and state equation in 1097 ms returned []
Implicit Place search using SMT with State Equation took 1597 ms to find 0 implicit places.
[2021-05-16 08:58:56] [INFO ] Redundant transitions in 20 ms returned []
[2021-05-16 08:58:56] [INFO ] Flow matrix only has 838 transitions (discarded 31 similar events)
// Phase 1: matrix 838 rows 582 cols
[2021-05-16 08:58:56] [INFO ] Computed 18 place invariants in 13 ms
[2021-05-16 08:58:56] [INFO ] Dead Transitions using invariants and state equation in 674 ms returned []
Finished structural reductions, in 1 iterations. Remains : 582/951 places, 869/1273 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-16b-09 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s373 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-16b-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-16b-09 finished in 2772 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((p0 U (F(p1)&&X(X(G(p2))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 951 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 951/951 places, 1273/1273 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 932 transition count 1254
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 932 transition count 1254
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 40 place count 932 transition count 1252
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 56 place count 916 transition count 1236
Iterating global reduction 1 with 16 rules applied. Total rules applied 72 place count 916 transition count 1236
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 80 place count 916 transition count 1228
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 86 place count 910 transition count 1222
Iterating global reduction 2 with 6 rules applied. Total rules applied 92 place count 910 transition count 1222
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 98 place count 910 transition count 1216
Applied a total of 98 rules in 137 ms. Remains 910 /951 variables (removed 41) and now considering 1216/1273 (removed 57) transitions.
// Phase 1: matrix 1216 rows 910 cols
[2021-05-16 08:58:57] [INFO ] Computed 18 place invariants in 13 ms
[2021-05-16 08:58:57] [INFO ] Implicit Places using invariants in 508 ms returned []
// Phase 1: matrix 1216 rows 910 cols
[2021-05-16 08:58:57] [INFO ] Computed 18 place invariants in 14 ms
[2021-05-16 08:58:58] [INFO ] Implicit Places using invariants and state equation in 1400 ms returned []
Implicit Place search using SMT with State Equation took 1911 ms to find 0 implicit places.
// Phase 1: matrix 1216 rows 910 cols
[2021-05-16 08:58:59] [INFO ] Computed 18 place invariants in 13 ms
[2021-05-16 08:59:00] [INFO ] Dead Transitions using invariants and state equation in 1337 ms returned []
Finished structural reductions, in 1 iterations. Remains : 910/951 places, 1216/1273 transitions.
Stuttering acceptance computed with spot in 259 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2), (NOT p2), true, (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : FlexibleBarrier-PT-16b-10 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={0} source=5 dest: 5}, { cond=(AND p0 p2), acceptance={} source=5 dest: 5}, { cond=(NOT p1), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(EQ s309 1), p0:(EQ s475 1), p2:(OR (AND (EQ s503 1) (EQ s908 1)) (EQ s309 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-16b-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-16b-10 finished in 3671 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F(p0))))], workingDir=/home/mcc/execution]
Support contains 1 out of 951 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 951/951 places, 1273/1273 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 931 transition count 1253
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 931 transition count 1253
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 42 place count 931 transition count 1251
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 59 place count 914 transition count 1234
Iterating global reduction 1 with 17 rules applied. Total rules applied 76 place count 914 transition count 1234
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 84 place count 914 transition count 1226
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 91 place count 907 transition count 1219
Iterating global reduction 2 with 7 rules applied. Total rules applied 98 place count 907 transition count 1219
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 105 place count 907 transition count 1212
Applied a total of 105 rules in 128 ms. Remains 907 /951 variables (removed 44) and now considering 1212/1273 (removed 61) transitions.
// Phase 1: matrix 1212 rows 907 cols
[2021-05-16 08:59:00] [INFO ] Computed 18 place invariants in 13 ms
[2021-05-16 08:59:01] [INFO ] Implicit Places using invariants in 585 ms returned []
// Phase 1: matrix 1212 rows 907 cols
[2021-05-16 08:59:01] [INFO ] Computed 18 place invariants in 15 ms
[2021-05-16 08:59:02] [INFO ] Implicit Places using invariants and state equation in 1279 ms returned []
Implicit Place search using SMT with State Equation took 1885 ms to find 0 implicit places.
// Phase 1: matrix 1212 rows 907 cols
[2021-05-16 08:59:02] [INFO ] Computed 18 place invariants in 13 ms
[2021-05-16 08:59:03] [INFO ] Dead Transitions using invariants and state equation in 871 ms returned []
Finished structural reductions, in 1 iterations. Remains : 907/951 places, 1212/1273 transitions.
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-16b-11 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(EQ s471 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]]
Stuttering criterion allowed to conclude after 114 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-16b-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-16b-11 finished in 3018 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0&&F(p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 951 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 951/951 places, 1273/1273 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 931 transition count 1253
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 931 transition count 1253
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 42 place count 931 transition count 1251
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 59 place count 914 transition count 1234
Iterating global reduction 1 with 17 rules applied. Total rules applied 76 place count 914 transition count 1234
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 85 place count 914 transition count 1225
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 91 place count 908 transition count 1219
Iterating global reduction 2 with 6 rules applied. Total rules applied 97 place count 908 transition count 1219
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 103 place count 908 transition count 1213
Applied a total of 103 rules in 144 ms. Remains 908 /951 variables (removed 43) and now considering 1213/1273 (removed 60) transitions.
// Phase 1: matrix 1213 rows 908 cols
[2021-05-16 08:59:03] [INFO ] Computed 18 place invariants in 14 ms
[2021-05-16 08:59:04] [INFO ] Implicit Places using invariants in 612 ms returned []
// Phase 1: matrix 1213 rows 908 cols
[2021-05-16 08:59:04] [INFO ] Computed 18 place invariants in 13 ms
[2021-05-16 08:59:05] [INFO ] Implicit Places using invariants and state equation in 1240 ms returned []
Implicit Place search using SMT with State Equation took 1881 ms to find 0 implicit places.
// Phase 1: matrix 1213 rows 908 cols
[2021-05-16 08:59:05] [INFO ] Computed 18 place invariants in 13 ms
[2021-05-16 08:59:06] [INFO ] Dead Transitions using invariants and state equation in 888 ms returned []
Finished structural reductions, in 1 iterations. Remains : 908/951 places, 1213/1273 transitions.
Stuttering acceptance computed with spot in 119 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : FlexibleBarrier-PT-16b-12 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(EQ s430 1), p0:(EQ s667 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-16b-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-16b-12 finished in 3062 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(!p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 951 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 951/951 places, 1273/1273 transitions.
Graph (trivial) has 675 edges and 951 vertex of which 97 / 951 are part of one of the 16 SCC in 1 ms
Free SCC test removed 81 places
Ensure Unique test removed 82 transitions
Reduce isomorphic transitions removed 82 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 80 place count 869 transition count 1111
Reduce places removed 79 places and 0 transitions.
Iterating post reduction 1 with 79 rules applied. Total rules applied 159 place count 790 transition count 1111
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 43 Pre rules applied. Total rules applied 159 place count 790 transition count 1068
Deduced a syphon composed of 43 places in 1 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 2 with 86 rules applied. Total rules applied 245 place count 747 transition count 1068
Discarding 51 places :
Symmetric choice reduction at 2 with 51 rule applications. Total rules 296 place count 696 transition count 1017
Iterating global reduction 2 with 51 rules applied. Total rules applied 347 place count 696 transition count 1017
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 349 place count 696 transition count 1015
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 364 place count 681 transition count 1000
Iterating global reduction 3 with 15 rules applied. Total rules applied 379 place count 681 transition count 1000
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 3 with 15 rules applied. Total rules applied 394 place count 681 transition count 985
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 97
Deduced a syphon composed of 97 places in 0 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 4 with 194 rules applied. Total rules applied 588 place count 584 transition count 888
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 589 place count 583 transition count 887
Iterating global reduction 4 with 1 rules applied. Total rules applied 590 place count 583 transition count 887
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 591 place count 583 transition count 886
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 592 place count 582 transition count 885
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 593 place count 581 transition count 884
Applied a total of 593 rules in 231 ms. Remains 581 /951 variables (removed 370) and now considering 884/1273 (removed 389) transitions.
[2021-05-16 08:59:06] [INFO ] Flow matrix only has 838 transitions (discarded 46 similar events)
// Phase 1: matrix 838 rows 581 cols
[2021-05-16 08:59:06] [INFO ] Computed 18 place invariants in 12 ms
[2021-05-16 08:59:07] [INFO ] Implicit Places using invariants in 627 ms returned []
[2021-05-16 08:59:07] [INFO ] Flow matrix only has 838 transitions (discarded 46 similar events)
// Phase 1: matrix 838 rows 581 cols
[2021-05-16 08:59:07] [INFO ] Computed 18 place invariants in 11 ms
[2021-05-16 08:59:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-16 08:59:08] [INFO ] Implicit Places using invariants and state equation in 1151 ms returned []
Implicit Place search using SMT with State Equation took 1780 ms to find 0 implicit places.
[2021-05-16 08:59:08] [INFO ] Redundant transitions in 13 ms returned []
[2021-05-16 08:59:08] [INFO ] Flow matrix only has 838 transitions (discarded 46 similar events)
// Phase 1: matrix 838 rows 581 cols
[2021-05-16 08:59:08] [INFO ] Computed 18 place invariants in 24 ms
[2021-05-16 08:59:09] [INFO ] Dead Transitions using invariants and state equation in 747 ms returned []
Finished structural reductions, in 1 iterations. Remains : 581/951 places, 884/1273 transitions.
Stuttering acceptance computed with spot in 46 ms :[true, p0]
Running random walk in product with property : FlexibleBarrier-PT-16b-13 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(EQ s578 1)], 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][true, true]]
Entered a terminal (fully accepting) state of product in 17 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-16b-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-16b-13 finished in 2846 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 951 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 951/951 places, 1273/1273 transitions.
Graph (trivial) has 898 edges and 951 vertex of which 97 / 951 are part of one of the 16 SCC in 3 ms
Free SCC test removed 81 places
Ensure Unique test removed 82 transitions
Reduce isomorphic transitions removed 82 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 80 place count 869 transition count 1111
Reduce places removed 79 places and 0 transitions.
Iterating post reduction 1 with 79 rules applied. Total rules applied 159 place count 790 transition count 1111
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 44 Pre rules applied. Total rules applied 159 place count 790 transition count 1067
Deduced a syphon composed of 44 places in 1 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 88 rules applied. Total rules applied 247 place count 746 transition count 1067
Discarding 50 places :
Symmetric choice reduction at 2 with 50 rule applications. Total rules 297 place count 696 transition count 1017
Iterating global reduction 2 with 50 rules applied. Total rules applied 347 place count 696 transition count 1017
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 348 place count 696 transition count 1016
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 363 place count 681 transition count 1001
Iterating global reduction 3 with 15 rules applied. Total rules applied 378 place count 681 transition count 1001
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 3 with 15 rules applied. Total rules applied 393 place count 681 transition count 986
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 97
Deduced a syphon composed of 97 places in 0 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 4 with 194 rules applied. Total rules applied 587 place count 584 transition count 889
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 588 place count 583 transition count 888
Iterating global reduction 4 with 1 rules applied. Total rules applied 589 place count 583 transition count 888
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 590 place count 583 transition count 887
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 5 with 16 rules applied. Total rules applied 606 place count 583 transition count 871
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 607 place count 582 transition count 870
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 608 place count 581 transition count 869
Applied a total of 608 rules in 439 ms. Remains 581 /951 variables (removed 370) and now considering 869/1273 (removed 404) transitions.
[2021-05-16 08:59:09] [INFO ] Flow matrix only has 838 transitions (discarded 31 similar events)
// Phase 1: matrix 838 rows 581 cols
[2021-05-16 08:59:10] [INFO ] Computed 18 place invariants in 18 ms
[2021-05-16 08:59:10] [INFO ] Implicit Places using invariants in 605 ms returned []
[2021-05-16 08:59:10] [INFO ] Flow matrix only has 838 transitions (discarded 31 similar events)
// Phase 1: matrix 838 rows 581 cols
[2021-05-16 08:59:10] [INFO ] Computed 18 place invariants in 13 ms
[2021-05-16 08:59:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-16 08:59:11] [INFO ] Implicit Places using invariants and state equation in 996 ms returned []
Implicit Place search using SMT with State Equation took 1630 ms to find 0 implicit places.
[2021-05-16 08:59:11] [INFO ] Redundant transitions in 12 ms returned []
[2021-05-16 08:59:11] [INFO ] Flow matrix only has 838 transitions (discarded 31 similar events)
// Phase 1: matrix 838 rows 581 cols
[2021-05-16 08:59:11] [INFO ] Computed 18 place invariants in 13 ms
[2021-05-16 08:59:12] [INFO ] Dead Transitions using invariants and state equation in 717 ms returned []
Finished structural reductions, in 1 iterations. Remains : 581/951 places, 869/1273 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-16b-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s218 1) (EQ s252 1) (EQ s517 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 0 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-16b-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-16b-14 finished in 2877 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 951 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 951/951 places, 1273/1273 transitions.
Graph (trivial) has 897 edges and 951 vertex of which 97 / 951 are part of one of the 16 SCC in 1 ms
Free SCC test removed 81 places
Ensure Unique test removed 82 transitions
Reduce isomorphic transitions removed 82 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 80 place count 869 transition count 1111
Reduce places removed 79 places and 0 transitions.
Iterating post reduction 1 with 79 rules applied. Total rules applied 159 place count 790 transition count 1111
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 42 Pre rules applied. Total rules applied 159 place count 790 transition count 1069
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 243 place count 748 transition count 1069
Discarding 50 places :
Symmetric choice reduction at 2 with 50 rule applications. Total rules 293 place count 698 transition count 1019
Iterating global reduction 2 with 50 rules applied. Total rules applied 343 place count 698 transition count 1019
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 345 place count 698 transition count 1017
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 359 place count 684 transition count 1003
Iterating global reduction 3 with 14 rules applied. Total rules applied 373 place count 684 transition count 1003
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 387 place count 684 transition count 989
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 97
Deduced a syphon composed of 97 places in 0 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 4 with 194 rules applied. Total rules applied 581 place count 587 transition count 892
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 582 place count 586 transition count 891
Iterating global reduction 4 with 1 rules applied. Total rules applied 583 place count 586 transition count 891
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 584 place count 586 transition count 890
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 5 with 16 rules applied. Total rules applied 600 place count 586 transition count 874
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 601 place count 585 transition count 873
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 602 place count 584 transition count 872
Applied a total of 602 rules in 292 ms. Remains 584 /951 variables (removed 367) and now considering 872/1273 (removed 401) transitions.
[2021-05-16 08:59:12] [INFO ] Flow matrix only has 842 transitions (discarded 30 similar events)
// Phase 1: matrix 842 rows 584 cols
[2021-05-16 08:59:12] [INFO ] Computed 18 place invariants in 12 ms
[2021-05-16 08:59:13] [INFO ] Implicit Places using invariants in 646 ms returned []
[2021-05-16 08:59:13] [INFO ] Flow matrix only has 842 transitions (discarded 30 similar events)
// Phase 1: matrix 842 rows 584 cols
[2021-05-16 08:59:13] [INFO ] Computed 18 place invariants in 11 ms
[2021-05-16 08:59:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-16 08:59:14] [INFO ] Implicit Places using invariants and state equation in 1160 ms returned []
Implicit Place search using SMT with State Equation took 1811 ms to find 0 implicit places.
[2021-05-16 08:59:14] [INFO ] Redundant transitions in 14 ms returned []
[2021-05-16 08:59:14] [INFO ] Flow matrix only has 842 transitions (discarded 30 similar events)
// Phase 1: matrix 842 rows 584 cols
[2021-05-16 08:59:14] [INFO ] Computed 18 place invariants in 12 ms
[2021-05-16 08:59:15] [INFO ] Dead Transitions using invariants and state equation in 887 ms returned []
Finished structural reductions, in 1 iterations. Remains : 584/951 places, 872/1273 transitions.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-16b-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 (NEQ s457 1) (AND (NEQ s240 0) (NEQ s583 0)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 3926 reset in 960 ms.
Product exploration explored 100000 steps with 3954 reset in 1212 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3928 reset in 873 ms.
Product exploration explored 100000 steps with 3946 reset in 897 ms.
[2021-05-16 08:59:19] [INFO ] Flatten gal took : 34 ms
[2021-05-16 08:59:19] [INFO ] Flatten gal took : 33 ms
[2021-05-16 08:59:19] [INFO ] Time to serialize gal into /tmp/LTL2659499976986422518.gal : 5 ms
[2021-05-16 08:59:19] [INFO ] Time to serialize properties into /tmp/LTL4364102445631059110.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/LTL2659499976986422518.gal, -t, CGAL, -LTL, /tmp/LTL4364102445631059110.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/LTL2659499976986422518.gal -t CGAL -LTL /tmp/LTL4364102445631059110.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F("((p2842!=1)||((p1626!=0)&&(p3469!=0)))"))))
Formula 0 simplified : !GF"((p2842!=1)||((p1626!=0)&&(p3469!=0)))"
Detected timeout of ITS tools.
[2021-05-16 08:59:34] [INFO ] Flatten gal took : 38 ms
[2021-05-16 08:59:34] [INFO ] Applying decomposition
[2021-05-16 08:59:34] [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/graph8211108935285221474.txt, -o, /tmp/graph8211108935285221474.bin, -w, /tmp/graph8211108935285221474.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/graph8211108935285221474.bin, -l, -1, -v, -w, /tmp/graph8211108935285221474.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-16 08:59:34] [INFO ] Decomposing Gal with order
[2021-05-16 08:59:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 08:59:35] [INFO ] Removed a total of 304 redundant transitions.
[2021-05-16 08:59:35] [INFO ] Flatten gal took : 172 ms
[2021-05-16 08:59:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 128 labels/synchronizations in 12 ms.
[2021-05-16 08:59:35] [INFO ] Time to serialize gal into /tmp/LTL14451714954830324266.gal : 8 ms
[2021-05-16 08:59:35] [INFO ] Time to serialize properties into /tmp/LTL14676775470989393555.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/LTL14451714954830324266.gal, -t, CGAL, -LTL, /tmp/LTL14676775470989393555.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/LTL14451714954830324266.gal -t CGAL -LTL /tmp/LTL14676775470989393555.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((G(F("((u32.p2842!=1)||((i17.u20.p1626!=0)&&(i17.u33.p3469!=0)))"))))
Formula 0 simplified : !GF"((u32.p2842!=1)||((i17.u20.p1626!=0)&&(i17.u33.p3469!=0)))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4939046896384807467
[2021-05-16 08:59:50] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4939046896384807467
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/ltsmin4939046896384807467]
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/ltsmin4939046896384807467] 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/ltsmin4939046896384807467] 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-16b-15 finished in 38776 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9524366736297343270
[2021-05-16 08:59:51] [INFO ] Computing symmetric may disable matrix : 1273 transitions.
[2021-05-16 08:59:51] [INFO ] Applying decomposition
[2021-05-16 08:59:51] [INFO ] Computation of Complete disable matrix. took 24 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-16 08:59:51] [INFO ] Computing symmetric may enable matrix : 1273 transitions.
[2021-05-16 08:59:51] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-16 08:59:51] [INFO ] Flatten gal took : 46 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/graph7640613653421392319.txt, -o, /tmp/graph7640613653421392319.bin, -w, /tmp/graph7640613653421392319.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/graph7640613653421392319.bin, -l, -1, -v, -w, /tmp/graph7640613653421392319.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-16 08:59:51] [INFO ] Decomposing Gal with order
[2021-05-16 08:59:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 08:59:51] [INFO ] Computing Do-Not-Accords matrix : 1273 transitions.
[2021-05-16 08:59:51] [INFO ] Computation of Completed DNA matrix. took 98 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-16 08:59:51] [INFO ] Built C files in 449ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9524366736297343270
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/ltsmin9524366736297343270]
[2021-05-16 08:59:51] [INFO ] Removed a total of 367 redundant transitions.
[2021-05-16 08:59:51] [INFO ] Flatten gal took : 300 ms
[2021-05-16 08:59:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 17 labels/synchronizations in 21 ms.
[2021-05-16 08:59:51] [INFO ] Time to serialize gal into /tmp/LTLFireability7446279996144504701.gal : 13 ms
[2021-05-16 08:59:51] [INFO ] Time to serialize properties into /tmp/LTLFireability1275952867673095790.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/LTLFireability7446279996144504701.gal, -t, CGAL, -LTL, /tmp/LTLFireability1275952867673095790.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/LTLFireability7446279996144504701.gal -t CGAL -LTL /tmp/LTLFireability1275952867673095790.ltl -c -stutter-deadlock
Read 2 LTL properties
Checking formula 0 : !(((X(G(("(i8.u77.p948==1)")&&(F("(i17.i1.i0.u163.p2147==1)")))))U(G("(i8.u77.p948==0)"))))
Formula 0 simplified : !(XG("(i8.u77.p948==1)" & F"(i17.i1.i0.u163.p2147==1)") U G"(i8.u77.p948==0)")
Compilation finished in 19374 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin9524366736297343270]
Link finished in 112 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))), --buchi-type=spotba], workingDir=/tmp/ltsmin9524366736297343270]
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, (X([](((LTLAPp0==true)&&<>((LTLAPp1==true))))) U []((LTLAPp2==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin9524366736297343270]
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, [](<>((LTLAPp3==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin9524366736297343270]
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, [](<>((LTLAPp3==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin9524366736297343270]
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, (X([](((LTLAPp0==true)&&<>((LTLAPp1==true))))) U []((LTLAPp2==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin9524366736297343270]
Detected timeout of ITS tools.
[2021-05-16 09:21:53] [INFO ] Applying decomposition
[2021-05-16 09:21:53] [INFO ] Flatten gal took : 190 ms
[2021-05-16 09:21:53] [INFO ] Decomposing Gal with order
[2021-05-16 09:21:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 09:21:53] [INFO ] Removed a total of 338 redundant transitions.
[2021-05-16 09:21:54] [INFO ] Flatten gal took : 636 ms
[2021-05-16 09:21:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 1033 labels/synchronizations in 530 ms.
[2021-05-16 09:21:54] [INFO ] Time to serialize gal into /tmp/LTLFireability18333517072007534623.gal : 67 ms
[2021-05-16 09:21:54] [INFO ] Time to serialize properties into /tmp/LTLFireability12628569520444470441.ltl : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLFireability18333517072007534623.gal, -t, CGAL, -LTL, /tmp/LTLFireability12628569520444470441.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/LTLFireability18333517072007534623.gal -t CGAL -LTL /tmp/LTLFireability12628569520444470441.ltl -c -stutter-deadlock
Read 2 LTL properties
Checking formula 0 : !(((X(G(("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u22.p948==1)")&&(F("(i0.i0.u30.p2147==1)")))))U(G("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u22.p948==0)"))))
Formula 0 simplified : !(XG("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u22.p948==1)" & F"(i0.i0.u30.p2147==1)") U G"(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u22.p948==0)")
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, (X([](((LTLAPp0==true)&&<>((LTLAPp1==true))))) U []((LTLAPp2==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin9524366736297343270]
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, [](<>((LTLAPp3==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin9524366736297343270]
Detected timeout of ITS tools.
[2021-05-16 09:43:56] [INFO ] Flatten gal took : 141 ms
[2021-05-16 09:43:56] [INFO ] Input system was already deterministic with 1273 transitions.
[2021-05-16 09:43:56] [INFO ] Transformed 951 places.
[2021-05-16 09:43:56] [INFO ] Transformed 1273 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 09:43:57] [INFO ] Time to serialize gal into /tmp/LTLFireability1585507728800744172.gal : 22 ms
[2021-05-16 09:43:57] [INFO ] Time to serialize properties into /tmp/LTLFireability300667397324265396.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/LTLFireability1585507728800744172.gal, -t, CGAL, -LTL, /tmp/LTLFireability300667397324265396.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/LTLFireability1585507728800744172.gal -t CGAL -LTL /tmp/LTLFireability300667397324265396.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 : !(((X(G(("(p948==1)")&&(F("(p2147==1)")))))U(G("(p948==0)"))))
Formula 0 simplified : !(XG("(p948==1)" & F"(p2147==1)") U G"(p948==0)")

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

tar xzf /home/mcc/BenchKit/INPUTS/FlexibleBarrier-PT-16b.tgz
mv FlexibleBarrier-PT-16b 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 ;