Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r024-tall-165251918700547.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-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 CANConstruction-PT-080, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r024-tall-165251918700547
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 9.8M
-rw-r--r-- 1 mcc users 11K Apr 29 12:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K Apr 29 12:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 29 12:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 29 12:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.1K May 9 07:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 07:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 9 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 07:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 9 07:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 9 07:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 9.5M May 10 09:33 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 CANConstruction-PT-080-LTLCardinality-00
FORMULA_NAME CANConstruction-PT-080-LTLCardinality-01
FORMULA_NAME CANConstruction-PT-080-LTLCardinality-02
FORMULA_NAME CANConstruction-PT-080-LTLCardinality-03
FORMULA_NAME CANConstruction-PT-080-LTLCardinality-04
FORMULA_NAME CANConstruction-PT-080-LTLCardinality-05
FORMULA_NAME CANConstruction-PT-080-LTLCardinality-06
FORMULA_NAME CANConstruction-PT-080-LTLCardinality-07
FORMULA_NAME CANConstruction-PT-080-LTLCardinality-08
FORMULA_NAME CANConstruction-PT-080-LTLCardinality-09
FORMULA_NAME CANConstruction-PT-080-LTLCardinality-10
FORMULA_NAME CANConstruction-PT-080-LTLCardinality-11
FORMULA_NAME CANConstruction-PT-080-LTLCardinality-12
FORMULA_NAME CANConstruction-PT-080-LTLCardinality-13
FORMULA_NAME CANConstruction-PT-080-LTLCardinality-14
FORMULA_NAME CANConstruction-PT-080-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652656567134

Running Version 202205111006
[2022-05-15 23:16:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-15 23:16:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 23:16:09] [INFO ] Load time of PNML (sax parser for PT used): 666 ms
[2022-05-15 23:16:09] [INFO ] Transformed 13762 places.
[2022-05-15 23:16:09] [INFO ] Transformed 26240 transitions.
[2022-05-15 23:16:09] [INFO ] Parsed PT model containing 13762 places and 26240 transitions in 885 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA CANConstruction-PT-080-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-080-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-080-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-080-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 51 out of 13762 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 13762/13762 places, 26240/26240 transitions.
Discarding 6222 places :
Symmetric choice reduction at 0 with 6222 rule applications. Total rules 6222 place count 7540 transition count 13796
Iterating global reduction 0 with 6222 rules applied. Total rules applied 12444 place count 7540 transition count 13796
Applied a total of 12444 rules in 4137 ms. Remains 7540 /13762 variables (removed 6222) and now considering 13796/26240 (removed 12444) transitions.
// Phase 1: matrix 13796 rows 7540 cols
[2022-05-15 23:16:13] [INFO ] Computed 161 place invariants in 213 ms
[2022-05-15 23:16:19] [INFO ] Implicit Places using invariants in 5959 ms returned []
Implicit Place search using SMT only with invariants took 5986 ms to find 0 implicit places.
// Phase 1: matrix 13796 rows 7540 cols
[2022-05-15 23:16:19] [INFO ] Computed 161 place invariants in 122 ms
[2022-05-15 23:16:29] [INFO ] Dead Transitions using invariants and state equation in 9407 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 7540/13762 places, 13796/26240 transitions.
Finished structural reductions, in 1 iterations. Remains : 7540/13762 places, 13796/26240 transitions.
Support contains 51 out of 7540 places after structural reductions.
[2022-05-15 23:16:29] [INFO ] Flatten gal took : 592 ms
[2022-05-15 23:16:30] [INFO ] Flatten gal took : 464 ms
[2022-05-15 23:16:31] [INFO ] Input system was already deterministic with 13796 transitions.
Support contains 46 out of 7540 places (down from 51) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 7 resets, run finished after 611 ms. (steps per millisecond=16 ) properties (out of 26) seen :5
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 21) seen :0
Running SMT prover for 21 properties.
// Phase 1: matrix 13796 rows 7540 cols
[2022-05-15 23:16:32] [INFO ] Computed 161 place invariants in 94 ms
[2022-05-15 23:16:35] [INFO ] After 2761ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:21
[2022-05-15 23:16:38] [INFO ] [Nat]Absence check using 81 positive place invariants in 178 ms returned sat
[2022-05-15 23:16:38] [INFO ] [Nat]Absence check using 81 positive and 80 generalized place invariants in 75 ms returned sat
[2022-05-15 23:16:51] [INFO ] After 12468ms SMT Verify possible using state equation in natural domain returned unsat :9 sat :12
[2022-05-15 23:16:51] [INFO ] State equation strengthened by 12720 read => feed constraints.
[2022-05-15 23:17:00] [INFO ] After 8557ms SMT Verify possible using 12720 Read/Feed constraints in natural domain returned unsat :9 sat :11
[2022-05-15 23:17:00] [INFO ] After 8560ms SMT Verify possible using trap constraints in natural domain returned unsat :9 sat :11
Attempting to minimize the solution found.
Minimization took 6 ms.
[2022-05-15 23:17:00] [INFO ] After 25027ms SMT Verify possible using all constraints in natural domain returned unsat :9 sat :11
Fused 21 Parikh solutions to 12 different solutions.
Parikh walk visited 2 properties in 190 ms.
Support contains 23 out of 7540 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 7540/7540 places, 13796/13796 transitions.
Drop transitions removed 559 transitions
Trivial Post-agglo rules discarded 559 transitions
Performed 559 trivial Post agglomeration. Transition count delta: 559
Iterating post reduction 0 with 559 rules applied. Total rules applied 559 place count 7540 transition count 13237
Reduce places removed 559 places and 0 transitions.
Iterating post reduction 1 with 559 rules applied. Total rules applied 1118 place count 6981 transition count 13237
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 1118 place count 6981 transition count 13236
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1120 place count 6980 transition count 13236
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 1129 place count 6971 transition count 13218
Iterating global reduction 2 with 9 rules applied. Total rules applied 1138 place count 6971 transition count 13218
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 79
Deduced a syphon composed of 79 places in 7 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 158 rules applied. Total rules applied 1296 place count 6892 transition count 13139
Free-agglomeration rule applied 142 times.
Iterating global reduction 2 with 142 rules applied. Total rules applied 1438 place count 6892 transition count 12997
Reduce places removed 142 places and 0 transitions.
Iterating post reduction 2 with 142 rules applied. Total rules applied 1580 place count 6750 transition count 12997
Partial Free-agglomeration rule applied 19 times.
Drop transitions removed 19 transitions
Iterating global reduction 3 with 19 rules applied. Total rules applied 1599 place count 6750 transition count 12997
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 1600 place count 6750 transition count 12997
Applied a total of 1600 rules in 10482 ms. Remains 6750 /7540 variables (removed 790) and now considering 12997/13796 (removed 799) transitions.
Finished structural reductions, in 1 iterations. Remains : 6750/7540 places, 12997/13796 transitions.
Incomplete random walk after 10000 steps, including 17 resets, run finished after 481 ms. (steps per millisecond=20 ) properties (out of 10) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 12997 rows 6750 cols
[2022-05-15 23:17:11] [INFO ] Computed 161 place invariants in 98 ms
[2022-05-15 23:17:13] [INFO ] After 1086ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-05-15 23:17:14] [INFO ] [Nat]Absence check using 81 positive place invariants in 137 ms returned sat
[2022-05-15 23:17:14] [INFO ] [Nat]Absence check using 81 positive and 80 generalized place invariants in 71 ms returned sat
[2022-05-15 23:17:23] [INFO ] After 8463ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2022-05-15 23:17:23] [INFO ] State equation strengthened by 12809 read => feed constraints.
[2022-05-15 23:17:27] [INFO ] After 4373ms SMT Verify possible using 12809 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2022-05-15 23:17:31] [INFO ] After 8078ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 2621 ms.
[2022-05-15 23:17:34] [INFO ] After 21012ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 31 ms.
Support contains 15 out of 6750 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 6750/6750 places, 12997/12997 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 6745 transition count 12992
Applied a total of 10 rules in 4105 ms. Remains 6745 /6750 variables (removed 5) and now considering 12992/12997 (removed 5) transitions.
Finished structural reductions, in 1 iterations. Remains : 6745/6750 places, 12992/12997 transitions.
Incomplete random walk after 10000 steps, including 18 resets, run finished after 478 ms. (steps per millisecond=20 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 12992 rows 6745 cols
[2022-05-15 23:17:38] [INFO ] Computed 161 place invariants in 89 ms
[2022-05-15 23:17:39] [INFO ] After 974ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-15 23:17:40] [INFO ] [Nat]Absence check using 81 positive place invariants in 139 ms returned sat
[2022-05-15 23:17:41] [INFO ] [Nat]Absence check using 81 positive and 80 generalized place invariants in 70 ms returned sat
[2022-05-15 23:17:49] [INFO ] After 7839ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-05-15 23:17:49] [INFO ] State equation strengthened by 12813 read => feed constraints.
[2022-05-15 23:17:53] [INFO ] After 4029ms SMT Verify possible using 12813 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2022-05-15 23:17:56] [INFO ] After 7190ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 2143 ms.
[2022-05-15 23:17:58] [INFO ] After 18884ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 2 properties in 15 ms.
Support contains 7 out of 6745 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 6745/6745 places, 12992/12992 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 6742 transition count 12989
Applied a total of 6 rules in 3945 ms. Remains 6742 /6745 variables (removed 3) and now considering 12989/12992 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 6742/6745 places, 12989/12992 transitions.
Incomplete random walk after 10000 steps, including 17 resets, run finished after 270 ms. (steps per millisecond=37 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 12989 rows 6742 cols
[2022-05-15 23:18:03] [INFO ] Computed 161 place invariants in 88 ms
[2022-05-15 23:18:03] [INFO ] After 639ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 23:18:04] [INFO ] [Nat]Absence check using 81 positive place invariants in 134 ms returned sat
[2022-05-15 23:18:04] [INFO ] [Nat]Absence check using 81 positive and 80 generalized place invariants in 67 ms returned sat
[2022-05-15 23:18:11] [INFO ] After 6594ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 23:18:11] [INFO ] State equation strengthened by 12816 read => feed constraints.
[2022-05-15 23:18:12] [INFO ] After 1526ms SMT Verify possible using 12816 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 23:18:13] [INFO ] After 2178ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 503 ms.
[2022-05-15 23:18:14] [INFO ] After 10290ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 3 out of 6742 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 6742/6742 places, 12989/12989 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 6741 transition count 12988
Applied a total of 2 rules in 3992 ms. Remains 6741 /6742 variables (removed 1) and now considering 12988/12989 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 6741/6742 places, 12988/12989 transitions.
FORMULA CANConstruction-PT-080-LTLCardinality-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 9 atomic propositions for a total of 11 simplifications.
FORMULA CANConstruction-PT-080-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-080-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-080-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 321 stabilizing places and 400 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||X(G(X(p1)))))'
Support contains 4 out of 7540 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7540/7540 places, 13796/13796 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 7523 transition count 13762
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 7523 transition count 13762
Applied a total of 34 rules in 3941 ms. Remains 7523 /7540 variables (removed 17) and now considering 13762/13796 (removed 34) transitions.
// Phase 1: matrix 13762 rows 7523 cols
[2022-05-15 23:18:22] [INFO ] Computed 161 place invariants in 85 ms
[2022-05-15 23:18:27] [INFO ] Implicit Places using invariants in 5286 ms returned []
Implicit Place search using SMT only with invariants took 5287 ms to find 0 implicit places.
// Phase 1: matrix 13762 rows 7523 cols
[2022-05-15 23:18:27] [INFO ] Computed 161 place invariants in 78 ms
[2022-05-15 23:18:36] [INFO ] Dead Transitions using invariants and state equation in 9165 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 7523/7540 places, 13762/13796 transitions.
Finished structural reductions, in 1 iterations. Remains : 7523/7540 places, 13762/13796 transitions.
Stuttering acceptance computed with spot in 242 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : CANConstruction-PT-080-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(GT s1843 s7301), p1:(GT s1378 s6912)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 3 ms.
FORMULA CANConstruction-PT-080-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-080-LTLCardinality-00 finished in 18728 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G((false U p0)))))'
Support contains 2 out of 7540 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7540/7540 places, 13796/13796 transitions.
Drop transitions removed 560 transitions
Trivial Post-agglo rules discarded 560 transitions
Performed 560 trivial Post agglomeration. Transition count delta: 560
Iterating post reduction 0 with 560 rules applied. Total rules applied 560 place count 7540 transition count 13236
Reduce places removed 560 places and 0 transitions.
Iterating post reduction 1 with 560 rules applied. Total rules applied 1120 place count 6980 transition count 13236
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 1137 place count 6963 transition count 13202
Iterating global reduction 2 with 17 rules applied. Total rules applied 1154 place count 6963 transition count 13202
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 3 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 1314 place count 6883 transition count 13122
Applied a total of 1314 rules in 5709 ms. Remains 6883 /7540 variables (removed 657) and now considering 13122/13796 (removed 674) transitions.
// Phase 1: matrix 13122 rows 6883 cols
[2022-05-15 23:18:42] [INFO ] Computed 161 place invariants in 76 ms
[2022-05-15 23:18:48] [INFO ] Implicit Places using invariants in 5585 ms returned []
Implicit Place search using SMT only with invariants took 5588 ms to find 0 implicit places.
// Phase 1: matrix 13122 rows 6883 cols
[2022-05-15 23:18:48] [INFO ] Computed 161 place invariants in 75 ms
[2022-05-15 23:18:56] [INFO ] Dead Transitions using invariants and state equation in 8067 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6883/7540 places, 13122/13796 transitions.
Finished structural reductions, in 1 iterations. Remains : 6883/7540 places, 13122/13796 transitions.
Stuttering acceptance computed with spot in 285 ms :[(NOT p0)]
Running random walk in product with property : CANConstruction-PT-080-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s1052 s4968)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 141 reset in 2048 ms.
Product exploration explored 100000 steps with 140 reset in 1899 ms.
Computed a total of 242 stabilizing places and 240 stable transitions
Computed a total of 242 stabilizing places and 240 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 113 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 14 resets, run finished after 201 ms. (steps per millisecond=49 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 358909 steps, run timeout after 3001 ms. (steps per millisecond=119 ) properties seen :{}
Probabilistic random walk after 358909 steps, saw 347075 distinct states, run finished after 3002 ms. (steps per millisecond=119 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 13122 rows 6883 cols
[2022-05-15 23:19:04] [INFO ] Computed 161 place invariants in 99 ms
[2022-05-15 23:19:04] [INFO ] After 641ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 23:19:05] [INFO ] [Nat]Absence check using 81 positive place invariants in 147 ms returned sat
[2022-05-15 23:19:05] [INFO ] [Nat]Absence check using 81 positive and 80 generalized place invariants in 69 ms returned sat
[2022-05-15 23:19:12] [INFO ] After 6467ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 23:19:12] [INFO ] State equation strengthened by 12800 read => feed constraints.
[2022-05-15 23:19:13] [INFO ] After 1569ms SMT Verify possible using 12800 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 23:19:14] [INFO ] After 2189ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 402 ms.
[2022-05-15 23:19:14] [INFO ] After 10131ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 6883 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 6883/6883 places, 13122/13122 transitions.
Free-agglomeration rule applied 158 times.
Iterating global reduction 0 with 158 rules applied. Total rules applied 158 place count 6883 transition count 12964
Reduce places removed 158 places and 0 transitions.
Iterating post reduction 0 with 158 rules applied. Total rules applied 316 place count 6725 transition count 12964
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 318 place count 6725 transition count 12964
Applied a total of 318 rules in 5578 ms. Remains 6725 /6883 variables (removed 158) and now considering 12964/13122 (removed 158) transitions.
Finished structural reductions, in 1 iterations. Remains : 6725/6883 places, 12964/13122 transitions.
Incomplete random walk after 10000 steps, including 17 resets, run finished after 224 ms. (steps per millisecond=44 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Finished probabilistic random walk after 70668 steps, run visited all 1 properties in 691 ms. (steps per millisecond=102 )
Probabilistic random walk after 70668 steps, saw 68984 distinct states, run finished after 691 ms. (steps per millisecond=102 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 138 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Support contains 2 out of 6883 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6883/6883 places, 13122/13122 transitions.
Applied a total of 0 rules in 2097 ms. Remains 6883 /6883 variables (removed 0) and now considering 13122/13122 (removed 0) transitions.
// Phase 1: matrix 13122 rows 6883 cols
[2022-05-15 23:19:23] [INFO ] Computed 161 place invariants in 75 ms
[2022-05-15 23:19:29] [INFO ] Implicit Places using invariants in 5528 ms returned []
Implicit Place search using SMT only with invariants took 5529 ms to find 0 implicit places.
// Phase 1: matrix 13122 rows 6883 cols
[2022-05-15 23:19:29] [INFO ] Computed 161 place invariants in 75 ms
[2022-05-15 23:19:37] [INFO ] Dead Transitions using invariants and state equation in 8223 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 6883/6883 places, 13122/13122 transitions.
Computed a total of 242 stabilizing places and 240 stable transitions
Computed a total of 242 stabilizing places and 240 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 110 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 13 resets, run finished after 191 ms. (steps per millisecond=52 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 380477 steps, run timeout after 3001 ms. (steps per millisecond=126 ) properties seen :{}
Probabilistic random walk after 380477 steps, saw 367975 distinct states, run finished after 3003 ms. (steps per millisecond=126 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 13122 rows 6883 cols
[2022-05-15 23:19:41] [INFO ] Computed 161 place invariants in 114 ms
[2022-05-15 23:19:41] [INFO ] After 616ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 23:19:42] [INFO ] [Nat]Absence check using 81 positive place invariants in 134 ms returned sat
[2022-05-15 23:19:42] [INFO ] [Nat]Absence check using 81 positive and 80 generalized place invariants in 70 ms returned sat
[2022-05-15 23:19:49] [INFO ] After 6891ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 23:19:49] [INFO ] State equation strengthened by 12800 read => feed constraints.
[2022-05-15 23:19:51] [INFO ] After 1529ms SMT Verify possible using 12800 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 23:19:51] [INFO ] After 2141ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 387 ms.
[2022-05-15 23:19:52] [INFO ] After 10457ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 6883 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 6883/6883 places, 13122/13122 transitions.
Free-agglomeration rule applied 158 times.
Iterating global reduction 0 with 158 rules applied. Total rules applied 158 place count 6883 transition count 12964
Reduce places removed 158 places and 0 transitions.
Iterating post reduction 0 with 158 rules applied. Total rules applied 316 place count 6725 transition count 12964
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 318 place count 6725 transition count 12964
Applied a total of 318 rules in 6402 ms. Remains 6725 /6883 variables (removed 158) and now considering 12964/13122 (removed 158) transitions.
Finished structural reductions, in 1 iterations. Remains : 6725/6883 places, 12964/13122 transitions.
Incomplete random walk after 10000 steps, including 18 resets, run finished after 232 ms. (steps per millisecond=43 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Finished probabilistic random walk after 70668 steps, run visited all 1 properties in 727 ms. (steps per millisecond=97 )
Probabilistic random walk after 70668 steps, saw 68984 distinct states, run finished after 730 ms. (steps per millisecond=96 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 122 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Product exploration explored 100000 steps with 140 reset in 1795 ms.
Stack based approach found an accepted trace after 12044 steps with 16 reset with depth 629 and stack size 629 in 237 ms.
FORMULA CANConstruction-PT-080-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property CANConstruction-PT-080-LTLCardinality-05 finished in 84890 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X((X(G(X(!(G(p0) U p1))))||F(p0)||p0))))'
Support contains 4 out of 7540 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7540/7540 places, 13796/13796 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 7523 transition count 13762
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 7523 transition count 13762
Applied a total of 34 rules in 4594 ms. Remains 7523 /7540 variables (removed 17) and now considering 13762/13796 (removed 34) transitions.
// Phase 1: matrix 13762 rows 7523 cols
[2022-05-15 23:20:06] [INFO ] Computed 161 place invariants in 82 ms
[2022-05-15 23:20:12] [INFO ] Implicit Places using invariants in 5736 ms returned []
Implicit Place search using SMT only with invariants took 5738 ms to find 0 implicit places.
// Phase 1: matrix 13762 rows 7523 cols
[2022-05-15 23:20:12] [INFO ] Computed 161 place invariants in 75 ms
[2022-05-15 23:20:21] [INFO ] Dead Transitions using invariants and state equation in 9003 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 7523/7540 places, 13762/13796 transitions.
Finished structural reductions, in 1 iterations. Remains : 7523/7540 places, 13762/13796 transitions.
Stuttering acceptance computed with spot in 89 ms :[(AND p1 (NOT p0)), (AND p1 (NOT p0))]
Running random walk in product with property : CANConstruction-PT-080-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(LEQ s5930 s221), p0:(LEQ s2336 s2967)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 4829 ms.
Product exploration explored 100000 steps with 50000 reset in 4775 ms.
Computed a total of 321 stabilizing places and 400 stable transitions
Computed a total of 321 stabilizing places and 400 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p1 p0)
Knowledge based reduction with 5 factoid took 150 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA CANConstruction-PT-080-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANConstruction-PT-080-LTLCardinality-07 finished in 29265 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(F(p0)))&&p1)))'
Support contains 4 out of 7540 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7540/7540 places, 13796/13796 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 7524 transition count 13764
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 7524 transition count 13764
Applied a total of 32 rules in 4587 ms. Remains 7524 /7540 variables (removed 16) and now considering 13764/13796 (removed 32) transitions.
// Phase 1: matrix 13764 rows 7524 cols
[2022-05-15 23:20:35] [INFO ] Computed 161 place invariants in 76 ms
[2022-05-15 23:20:41] [INFO ] Implicit Places using invariants in 5562 ms returned []
Implicit Place search using SMT only with invariants took 5564 ms to find 0 implicit places.
// Phase 1: matrix 13764 rows 7524 cols
[2022-05-15 23:20:41] [INFO ] Computed 161 place invariants in 75 ms
[2022-05-15 23:20:50] [INFO ] Dead Transitions using invariants and state equation in 9256 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 7524/7540 places, 13764/13796 transitions.
Finished structural reductions, in 1 iterations. Remains : 7524/7540 places, 13764/13796 transitions.
Stuttering acceptance computed with spot in 194 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-080-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 3}, { cond=p1, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(GT s6433 s1588), p0:(GT s4294 s2943)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, 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 CANConstruction-PT-080-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-080-LTLCardinality-08 finished in 19645 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(F((G(p0)&&p1)))))'
Support contains 4 out of 7540 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7540/7540 places, 13796/13796 transitions.
Drop transitions removed 560 transitions
Trivial Post-agglo rules discarded 560 transitions
Performed 560 trivial Post agglomeration. Transition count delta: 560
Iterating post reduction 0 with 560 rules applied. Total rules applied 560 place count 7540 transition count 13236
Reduce places removed 560 places and 0 transitions.
Iterating post reduction 1 with 560 rules applied. Total rules applied 1120 place count 6980 transition count 13236
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 1137 place count 6963 transition count 13202
Iterating global reduction 2 with 17 rules applied. Total rules applied 1154 place count 6963 transition count 13202
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 2 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 1314 place count 6883 transition count 13122
Applied a total of 1314 rules in 6224 ms. Remains 6883 /7540 variables (removed 657) and now considering 13122/13796 (removed 674) transitions.
// Phase 1: matrix 13122 rows 6883 cols
[2022-05-15 23:20:57] [INFO ] Computed 161 place invariants in 79 ms
[2022-05-15 23:21:02] [INFO ] Implicit Places using invariants in 5468 ms returned []
Implicit Place search using SMT only with invariants took 5468 ms to find 0 implicit places.
// Phase 1: matrix 13122 rows 6883 cols
[2022-05-15 23:21:02] [INFO ] Computed 161 place invariants in 71 ms
[2022-05-15 23:21:11] [INFO ] Dead Transitions using invariants and state equation in 8593 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6883/7540 places, 13122/13796 transitions.
Finished structural reductions, in 1 iterations. Remains : 6883/7540 places, 13122/13796 transitions.
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-080-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ s879 s144), p0:(LEQ s3942 s1430)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 139 reset in 1866 ms.
Product exploration explored 100000 steps with 140 reset in 1878 ms.
Computed a total of 242 stabilizing places and 240 stable transitions
Computed a total of 242 stabilizing places and 240 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (OR (NOT p1) (NOT p0)))), (X (AND p1 p0)), (X (X (NOT (OR (NOT p1) (NOT p0))))), (X (X (AND p1 p0))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 311 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0)]
Incomplete random walk after 10000 steps, including 13 resets, run finished after 359 ms. (steps per millisecond=27 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :2
Running SMT prover for 1 properties.
// Phase 1: matrix 13122 rows 6883 cols
[2022-05-15 23:21:15] [INFO ] Computed 161 place invariants in 79 ms
[2022-05-15 23:21:16] [INFO ] After 600ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 23:21:17] [INFO ] [Nat]Absence check using 81 positive place invariants in 136 ms returned sat
[2022-05-15 23:21:17] [INFO ] [Nat]Absence check using 81 positive and 80 generalized place invariants in 71 ms returned sat
[2022-05-15 23:21:24] [INFO ] After 6844ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 23:21:24] [INFO ] State equation strengthened by 12800 read => feed constraints.
[2022-05-15 23:21:25] [INFO ] After 1304ms SMT Verify possible using 12800 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 23:21:26] [INFO ] After 1878ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 451 ms.
[2022-05-15 23:21:26] [INFO ] After 10186ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 5 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=2 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [(AND p1 p0), (X (NOT (OR (NOT p1) (NOT p0)))), (X (AND p1 p0)), (X (X (NOT (OR (NOT p1) (NOT p0))))), (X (X (AND p1 p0))), (X (X p0))]
False Knowledge obtained : [(F (OR (NOT p1) (NOT p0))), (F (NOT p0)), (F (NOT (AND p1 p0)))]
Knowledge based reduction with 6 factoid took 283 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 98 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0)]
Support contains 4 out of 6883 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6883/6883 places, 13122/13122 transitions.
Applied a total of 0 rules in 2205 ms. Remains 6883 /6883 variables (removed 0) and now considering 13122/13122 (removed 0) transitions.
// Phase 1: matrix 13122 rows 6883 cols
[2022-05-15 23:21:29] [INFO ] Computed 161 place invariants in 77 ms
[2022-05-15 23:21:34] [INFO ] Implicit Places using invariants in 5052 ms returned []
Implicit Place search using SMT only with invariants took 5054 ms to find 0 implicit places.
// Phase 1: matrix 13122 rows 6883 cols
[2022-05-15 23:21:34] [INFO ] Computed 161 place invariants in 71 ms
[2022-05-15 23:21:43] [INFO ] Dead Transitions using invariants and state equation in 8622 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 6883/6883 places, 13122/13122 transitions.
Computed a total of 242 stabilizing places and 240 stable transitions
Computed a total of 242 stabilizing places and 240 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (OR (NOT p1) (NOT p0)))), (X (AND p1 p0)), (X (X (NOT (OR (NOT p1) (NOT p0))))), (X (X (AND p1 p0))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 220 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0)]
Incomplete random walk after 10000 steps, including 13 resets, run finished after 367 ms. (steps per millisecond=27 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 132146 steps, run timeout after 3002 ms. (steps per millisecond=44 ) properties seen :{}
Probabilistic random walk after 132146 steps, saw 126270 distinct states, run finished after 3002 ms. (steps per millisecond=44 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 13122 rows 6883 cols
[2022-05-15 23:21:47] [INFO ] Computed 161 place invariants in 71 ms
[2022-05-15 23:21:47] [INFO ] After 834ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-15 23:21:48] [INFO ] [Nat]Absence check using 81 positive place invariants in 141 ms returned sat
[2022-05-15 23:21:48] [INFO ] [Nat]Absence check using 81 positive and 80 generalized place invariants in 64 ms returned sat
[2022-05-15 23:21:56] [INFO ] After 7669ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-15 23:21:57] [INFO ] State equation strengthened by 12800 read => feed constraints.
[2022-05-15 23:21:59] [INFO ] After 2312ms SMT Verify possible using 12800 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-05-15 23:22:01] [INFO ] After 4146ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1236 ms.
[2022-05-15 23:22:02] [INFO ] After 14463ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 9 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=4 )
Parikh walk visited 3 properties in 3 ms.
Knowledge obtained : [(AND p1 p0), (X (NOT (OR (NOT p1) (NOT p0)))), (X (AND p1 p0)), (X (X (NOT (OR (NOT p1) (NOT p0))))), (X (X (AND p1 p0))), (X (X p0))]
False Knowledge obtained : [(F (OR (NOT p1) (NOT p0))), (F (NOT p0)), (F (NOT (AND p1 p0)))]
Knowledge based reduction with 6 factoid took 303 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 122 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 101 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0)]
Product exploration explored 100000 steps with 141 reset in 1829 ms.
Product exploration explored 100000 steps with 140 reset in 1914 ms.
Built C files in :
/tmp/ltsmin5227934103174331062
[2022-05-15 23:22:06] [INFO ] Too many transitions (13122) to apply POR reductions. Disabling POR matrices.
[2022-05-15 23:22:07] [INFO ] Built C files in 164ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5227934103174331062
Running compilation step : cd /tmp/ltsmin5227934103174331062;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5227934103174331062;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5227934103174331062;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 4 out of 6883 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6883/6883 places, 13122/13122 transitions.
Applied a total of 0 rules in 2240 ms. Remains 6883 /6883 variables (removed 0) and now considering 13122/13122 (removed 0) transitions.
// Phase 1: matrix 13122 rows 6883 cols
[2022-05-15 23:22:12] [INFO ] Computed 161 place invariants in 74 ms
[2022-05-15 23:22:17] [INFO ] Implicit Places using invariants in 5514 ms returned []
Implicit Place search using SMT only with invariants took 5516 ms to find 0 implicit places.
// Phase 1: matrix 13122 rows 6883 cols
[2022-05-15 23:22:17] [INFO ] Computed 161 place invariants in 71 ms
[2022-05-15 23:22:26] [INFO ] Dead Transitions using invariants and state equation in 8600 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 6883/6883 places, 13122/13122 transitions.
Built C files in :
/tmp/ltsmin3747657331619631380
[2022-05-15 23:22:26] [INFO ] Too many transitions (13122) to apply POR reductions. Disabling POR matrices.
[2022-05-15 23:22:26] [INFO ] Built C files in 124ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3747657331619631380
Running compilation step : cd /tmp/ltsmin3747657331619631380;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3747657331619631380;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3747657331619631380;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-15 23:22:30] [INFO ] Flatten gal took : 374 ms
[2022-05-15 23:22:30] [INFO ] Flatten gal took : 424 ms
[2022-05-15 23:22:30] [INFO ] Time to serialize gal into /tmp/LTL3831047854057845778.gal : 79 ms
[2022-05-15 23:22:30] [INFO ] Time to serialize properties into /tmp/LTL8749867864274430504.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3831047854057845778.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8749867864274430504.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3831047...266
Read 1 LTL properties
Checking formula 0 : !((X(G(F((G("(Node42requestsent62<=Node10GiveAnswer78)"))&&("(Node4requestsent1<=Node23OKshare)"))))))
Formula 0 simplified : !XGF("(Node4requestsent1<=Node23OKshare)" & G"(Node42requestsent62<=Node10GiveAnswer78)")
Detected timeout of ITS tools.
[2022-05-15 23:22:46] [INFO ] Flatten gal took : 412 ms
[2022-05-15 23:22:46] [INFO ] Applying decomposition
[2022-05-15 23:22:46] [INFO ] Flatten gal took : 349 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph13771515980354673102.txt' '-o' '/tmp/graph13771515980354673102.bin' '-w' '/tmp/graph13771515980354673102.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13771515980354673102.bin' '-l' '-1' '-v' '-w' '/tmp/graph13771515980354673102.weights' '-q' '0' '-e' '0.001'
[2022-05-15 23:22:47] [INFO ] Decomposing Gal with order
[2022-05-15 23:22:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 23:22:50] [INFO ] Removed a total of 12631 redundant transitions.
[2022-05-15 23:22:51] [INFO ] Flatten gal took : 2933 ms
[2022-05-15 23:22:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 12478 labels/synchronizations in 1793 ms.
[2022-05-15 23:22:54] [INFO ] Time to serialize gal into /tmp/LTL5978735214677263902.gal : 60 ms
[2022-05-15 23:22:54] [INFO ] Time to serialize properties into /tmp/LTL4504891905606163671.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5978735214677263902.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4504891905606163671.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL5978735...266
Read 1 LTL properties
Checking formula 0 : !((X(G(F((G("(gu82.Node42requestsent62<=gu82.Node10GiveAnswer78)"))&&("(gu81.Node4requestsent1<=gu81.Node23OKshare)"))))))
Formula 0 simplified : !XGF("(gu81.Node4requestsent1<=gu81.Node23OKshare)" & G"(gu82.Node42requestsent62<=gu82.Node10GiveAnswer78)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11487009154056079698
[2022-05-15 23:23:09] [INFO ] Built C files in 90ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11487009154056079698
Running compilation step : cd /tmp/ltsmin11487009154056079698;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11487009154056079698;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11487009154056079698;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property CANConstruction-PT-080-LTLCardinality-09 finished in 141412 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(!(G(p0) U X(p1))))'
Support contains 4 out of 7540 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7540/7540 places, 13796/13796 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 7523 transition count 13762
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 7523 transition count 13762
Applied a total of 34 rules in 5284 ms. Remains 7523 /7540 variables (removed 17) and now considering 13762/13796 (removed 34) transitions.
// Phase 1: matrix 13762 rows 7523 cols
[2022-05-15 23:23:17] [INFO ] Computed 161 place invariants in 75 ms
[2022-05-15 23:23:18] [INFO ] Implicit Places using invariants in 778 ms returned []
Implicit Place search using SMT only with invariants took 778 ms to find 0 implicit places.
// Phase 1: matrix 13762 rows 7523 cols
[2022-05-15 23:23:18] [INFO ] Computed 161 place invariants in 154 ms
[2022-05-15 23:23:19] [INFO ] Dead Transitions using invariants and state equation in 753 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 7523/7540 places, 13762/13796 transitions.
Finished structural reductions, in 1 iterations. Remains : 7523/7540 places, 13762/13796 transitions.
Stuttering acceptance computed with spot in 168 ms :[true, p1, p0, p1, p1, p1, (AND p0 p1)]
Running random walk in product with property : CANConstruction-PT-080-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 0}], [{ cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 1}, { cond=p0, acceptance={} source=4 dest: 5}], [{ cond=p1, acceptance={} source=5 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 6}], [{ cond=(AND p0 p1), acceptance={} source=6 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 6}]], initial=3, aps=[p1:(LEQ s1120 s3657), p0:(LEQ s1569 s1322)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], 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 CANConstruction-PT-080-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-080-LTLCardinality-11 finished in 7027 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 3 out of 7540 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7540/7540 places, 13796/13796 transitions.
Drop transitions removed 560 transitions
Trivial Post-agglo rules discarded 560 transitions
Performed 560 trivial Post agglomeration. Transition count delta: 560
Iterating post reduction 0 with 560 rules applied. Total rules applied 560 place count 7540 transition count 13236
Reduce places removed 560 places and 0 transitions.
Iterating post reduction 1 with 560 rules applied. Total rules applied 1120 place count 6980 transition count 13236
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 1137 place count 6963 transition count 13202
Iterating global reduction 2 with 17 rules applied. Total rules applied 1154 place count 6963 transition count 13202
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 3 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 1314 place count 6883 transition count 13122
Applied a total of 1314 rules in 6869 ms. Remains 6883 /7540 variables (removed 657) and now considering 13122/13796 (removed 674) transitions.
// Phase 1: matrix 13122 rows 6883 cols
[2022-05-15 23:23:26] [INFO ] Computed 161 place invariants in 75 ms
[2022-05-15 23:23:30] [INFO ] Implicit Places using invariants in 4673 ms returned []
Implicit Place search using SMT only with invariants took 4674 ms to find 0 implicit places.
// Phase 1: matrix 13122 rows 6883 cols
[2022-05-15 23:23:30] [INFO ] Computed 161 place invariants in 75 ms
[2022-05-15 23:23:38] [INFO ] Dead Transitions using invariants and state equation in 7335 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6883/7540 places, 13122/13796 transitions.
Finished structural reductions, in 1 iterations. Remains : 6883/7540 places, 13122/13796 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : CANConstruction-PT-080-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LEQ 3 s869) (AND (GT s3804 s2818) (GT 3 s869)))], 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 668 steps with 0 reset in 15 ms.
FORMULA CANConstruction-PT-080-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-080-LTLCardinality-12 finished in 18945 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(X(X((F(X(p1))&&p0))))))'
Support contains 6 out of 7540 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7540/7540 places, 13796/13796 transitions.
Drop transitions removed 560 transitions
Trivial Post-agglo rules discarded 560 transitions
Performed 560 trivial Post agglomeration. Transition count delta: 560
Iterating post reduction 0 with 560 rules applied. Total rules applied 560 place count 7540 transition count 13236
Reduce places removed 560 places and 0 transitions.
Iterating post reduction 1 with 560 rules applied. Total rules applied 1120 place count 6980 transition count 13236
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 1135 place count 6965 transition count 13206
Iterating global reduction 2 with 15 rules applied. Total rules applied 1150 place count 6965 transition count 13206
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 3 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 1310 place count 6885 transition count 13126
Applied a total of 1310 rules in 6975 ms. Remains 6885 /7540 variables (removed 655) and now considering 13126/13796 (removed 670) transitions.
// Phase 1: matrix 13126 rows 6885 cols
[2022-05-15 23:23:45] [INFO ] Computed 161 place invariants in 77 ms
[2022-05-15 23:23:49] [INFO ] Implicit Places using invariants in 4662 ms returned []
Implicit Place search using SMT only with invariants took 4663 ms to find 0 implicit places.
// Phase 1: matrix 13126 rows 6885 cols
[2022-05-15 23:23:49] [INFO ] Computed 161 place invariants in 75 ms
[2022-05-15 23:23:57] [INFO ] Dead Transitions using invariants and state equation in 7743 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6885/7540 places, 13126/13796 transitions.
Finished structural reductions, in 1 iterations. Remains : 6885/7540 places, 13126/13796 transitions.
Stuttering acceptance computed with spot in 75 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : CANConstruction-PT-080-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GT s806 s6035) (GT s6780 s2997)), p1:(GT s2372 s947)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 700 steps with 0 reset in 19 ms.
FORMULA CANConstruction-PT-080-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-080-LTLCardinality-14 finished in 19507 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(F((G(p0)&&p1)))))'
[2022-05-15 23:23:58] [INFO ] Flatten gal took : 376 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin10010086124907698647
[2022-05-15 23:23:58] [INFO ] Too many transitions (13796) to apply POR reductions. Disabling POR matrices.
[2022-05-15 23:23:58] [INFO ] Built C files in 96ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10010086124907698647
Running compilation step : cd /tmp/ltsmin10010086124907698647;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-15 23:23:58] [INFO ] Applying decomposition
[2022-05-15 23:23:59] [INFO ] Flatten gal took : 432 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph11648494184453978227.txt' '-o' '/tmp/graph11648494184453978227.bin' '-w' '/tmp/graph11648494184453978227.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph11648494184453978227.bin' '-l' '-1' '-v' '-w' '/tmp/graph11648494184453978227.weights' '-q' '0' '-e' '0.001'
[2022-05-15 23:24:00] [INFO ] Decomposing Gal with order
[2022-05-15 23:24:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 23:24:02] [INFO ] Removed a total of 12861 redundant transitions.
[2022-05-15 23:24:02] [INFO ] Flatten gal took : 2045 ms
[2022-05-15 23:24:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 12504 labels/synchronizations in 1823 ms.
[2022-05-15 23:24:06] [INFO ] Time to serialize gal into /tmp/LTLCardinality15049501610670915648.gal : 91 ms
[2022-05-15 23:24:06] [INFO ] Time to serialize properties into /tmp/LTLCardinality14287747241183441199.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality15049501610670915648.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality14287747241183441199.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...290
Read 1 LTL properties
Checking formula 0 : !((X(G(F((G("(gu332.Node42requestsent62<=gu332.Node10GiveAnswer78)"))&&("(gu330.Node4requestsent1<=gu330.Node23OKshare)"))))))
Formula 0 simplified : !XGF("(gu330.Node4requestsent1<=gu330.Node23OKshare)" & G"(gu332.Node42requestsent62<=gu332.Node10GiveAnswer78)")
Compilation finished in 107957 ms.
Running link step : cd /tmp/ltsmin10010086124907698647;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 119 ms.
Running LTSmin : cd /tmp/ltsmin10010086124907698647;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([](<>(([]((LTLAPp0==true))&&(LTLAPp1==true)))))' '--buchi-type=spotba'
ITS-tools command line returned an error code 137
[2022-05-15 23:46:28] [INFO ] Flatten gal took : 901 ms
[2022-05-15 23:46:29] [INFO ] Time to serialize gal into /tmp/LTLCardinality17669473148084174067.gal : 123 ms
[2022-05-15 23:46:29] [INFO ] Time to serialize properties into /tmp/LTLCardinality5355613843770318164.ltl : 16 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality17669473148084174067.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality5355613843770318164.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...289
Read 1 LTL properties
Checking formula 0 : !((X(G(F((G("(Node42requestsent62<=Node10GiveAnswer78)"))&&("(Node4requestsent1<=Node23OKshare)"))))))
Formula 0 simplified : !XGF("(Node4requestsent1<=Node23OKshare)" & G"(Node42requestsent62<=Node10GiveAnswer78)")
Detected timeout of ITS tools.
[2022-05-16 00:09:09] [INFO ] Flatten gal took : 2302 ms
[2022-05-16 00:09:11] [INFO ] Input system was already deterministic with 13796 transitions.
[2022-05-16 00:09:12] [INFO ] Transformed 7540 places.
[2022-05-16 00:09:12] [INFO ] Transformed 13796 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-16 00:09:46] [INFO ] Time to serialize gal into /tmp/LTLCardinality17964557046621712922.gal : 116 ms
[2022-05-16 00:09:46] [INFO ] Time to serialize properties into /tmp/LTLCardinality1930319590867484926.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality17964557046621712922.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality1930319590867484926.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...334
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(G(F((G("(Node42requestsent62<=Node10GiveAnswer78)"))&&("(Node4requestsent1<=Node23OKshare)"))))))
Formula 0 simplified : !XGF("(Node4requestsent1<=Node23OKshare)" & G"(Node42requestsent62<=Node10GiveAnswer78)")

BK_TIME_CONFINEMENT_REACHED

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="CANConstruction-PT-080"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is CANConstruction-PT-080, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r024-tall-165251918700547"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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