About the Execution of ITS-Tools for NeighborGrid-PT-d5n4m1t35
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16205.359 | 1010820.00 | 1311968.00 | 29210.30 | FFFFFTFFTTFT???? | normal |
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.r132-tall-165271821600987.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 NeighborGrid-PT-d5n4m1t35, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r132-tall-165271821600987
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 59M
-rw-r--r-- 1 mcc users 8.1K Apr 29 14:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Apr 29 14:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Apr 29 14:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Apr 29 14:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.7K May 9 08:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 9 08:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.4K May 9 08:20 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 08:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 9 08:20 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 9 08:20 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 10 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rwxr-xr-x 1 mcc users 59M May 10 09:34 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 NeighborGrid-PT-d5n4m1t35-LTLCardinality-00
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-LTLCardinality-01
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-LTLCardinality-02
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-LTLCardinality-03
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-LTLCardinality-04
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-LTLCardinality-05
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-LTLCardinality-06
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-LTLCardinality-07
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-LTLCardinality-08
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-LTLCardinality-09
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-LTLCardinality-10
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-LTLCardinality-11
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-LTLCardinality-12
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-LTLCardinality-13
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-LTLCardinality-14
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1652910936908
Running Version 202205111006
[2022-05-18 21:55:37] [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-18 21:55:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-18 21:55:39] [INFO ] Load time of PNML (sax parser for PT used): 1512 ms
[2022-05-18 21:55:39] [INFO ] Transformed 1024 places.
[2022-05-18 21:55:39] [INFO ] Transformed 196608 transitions.
[2022-05-18 21:55:39] [INFO ] Parsed PT model containing 1024 places and 196608 transitions in 1888 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA NeighborGrid-PT-d5n4m1t35-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeighborGrid-PT-d5n4m1t35-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeighborGrid-PT-d5n4m1t35-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeighborGrid-PT-d5n4m1t35-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeighborGrid-PT-d5n4m1t35-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeighborGrid-PT-d5n4m1t35-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 out of 1024 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1024/1024 places, 196608/196608 transitions.
Applied a total of 0 rules in 6865 ms. Remains 1024 /1024 variables (removed 0) and now considering 196608/196608 (removed 0) transitions.
// Phase 1: matrix 196608 rows 1024 cols
[2022-05-18 21:55:50] [INFO ] Computed 1 place invariants in 2998 ms
[2022-05-18 21:55:51] [INFO ] Implicit Places using invariants in 3360 ms returned []
Implicit Place search using SMT only with invariants took 3388 ms to find 0 implicit places.
// Phase 1: matrix 196608 rows 1024 cols
[2022-05-18 21:55:54] [INFO ] Computed 1 place invariants in 3116 ms
[2022-05-18 21:56:24] [INFO ] Performed 122219/196608 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2022-05-18 21:56:42] [INFO ] Dead Transitions using invariants and state equation in 51441 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1024/1024 places, 196608/196608 transitions.
Support contains 32 out of 1024 places after structural reductions.
[2022-05-18 21:56:45] [INFO ] Flatten gal took : 2742 ms
[2022-05-18 21:56:48] [INFO ] Flatten gal took : 2410 ms
[2022-05-18 21:56:54] [INFO ] Input system was already deterministic with 196608 transitions.
Support contains 31 out of 1024 places (down from 32) after GAL structural reductions.
Interrupted random walk after 3879 steps, including 1 resets, run timeout after 30012 ms. (steps per millisecond=0 ) properties seen 16
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 196608 rows 1024 cols
[2022-05-18 21:57:27] [INFO ] Computed 1 place invariants in 2361 ms
[2022-05-18 21:57:27] [INFO ] After 192ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-18 21:57:27] [INFO ] [Nat]Absence check using 1 positive place invariants in 8 ms returned sat
[2022-05-18 21:57:52] [INFO ] After 24802ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-18 21:57:52] [INFO ] After 24929ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 45 ms.
[2022-05-18 21:57:53] [INFO ] After 25199ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 6 out of 1024 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1024/1024 places, 196608/196608 transitions.
Graph (trivial) has 194308 edges and 1024 vertex of which 1018 / 1024 are part of one of the 1 SCC in 124 ms
Free SCC test removed 1017 places
Drop transitions removed 194308 transitions
Ensure Unique test removed 2284 transitions
Reduce isomorphic transitions removed 196592 transitions.
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 7 transition count 14
Applied a total of 3 rules in 468 ms. Remains 7 /1024 variables (removed 1017) and now considering 14/196608 (removed 196594) transitions.
Finished structural reductions, in 1 iterations. Remains : 7/1024 places, 14/196608 transitions.
Finished random walk after 5111 steps, including 1 resets, run visited all 3 properties in 3 ms. (steps per millisecond=1703 )
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((p0 U (G(p0)||p1)))))))'
Support contains 3 out of 1024 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1024/1024 places, 196608/196608 transitions.
Applied a total of 0 rules in 5889 ms. Remains 1024 /1024 variables (removed 0) and now considering 196608/196608 (removed 0) transitions.
// Phase 1: matrix 196608 rows 1024 cols
[2022-05-18 21:58:02] [INFO ] Computed 1 place invariants in 2393 ms
[2022-05-18 21:58:02] [INFO ] Implicit Places using invariants in 2576 ms returned []
Implicit Place search using SMT only with invariants took 2577 ms to find 0 implicit places.
// Phase 1: matrix 196608 rows 1024 cols
[2022-05-18 21:58:04] [INFO ] Computed 1 place invariants in 2381 ms
[2022-05-18 21:58:35] [INFO ] Performed 122311/196608 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2022-05-18 21:58:52] [INFO ] Dead Transitions using invariants and state equation in 50335 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1024/1024 places, 196608/196608 transitions.
Stuttering acceptance computed with spot in 268 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : NeighborGrid-PT-d5n4m1t35-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GT 2 s278) (GT s346 s838)), p0:(GT s346 s838)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration timeout after 890 steps with 2 reset in 10107 ms.
Product exploration timeout after 790 steps with 0 reset in 10083 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 59 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 4 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Interrupted random walk after 4134 steps, including 1 resets, run timeout after 30011 ms. (steps per millisecond=0 ) properties seen 1
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 196608 rows 1024 cols
[2022-05-18 21:59:49] [INFO ] Computed 1 place invariants in 2613 ms
[2022-05-18 21:59:49] [INFO ] After 123ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-18 21:59:49] [INFO ] [Nat]Absence check using 1 positive place invariants in 6 ms returned sat
[2022-05-18 22:00:14] [INFO ] After 25028ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 1024 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1024/1024 places, 196608/196608 transitions.
Graph (trivial) has 195456 edges and 1024 vertex of which 1021 / 1024 are part of one of the 1 SCC in 36 ms
Free SCC test removed 1020 places
Drop transitions removed 195456 transitions
Ensure Unique test removed 1146 transitions
Reduce isomorphic transitions removed 196602 transitions.
Applied a total of 1 rules in 327 ms. Remains 4 /1024 variables (removed 1020) and now considering 6/196608 (removed 196602) transitions.
Finished structural reductions, in 1 iterations. Remains : 4/1024 places, 6/196608 transitions.
Incomplete random walk after 10238 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=3412 ) properties (out of 1) seen :0
Finished Best-First random walk after 13 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=13 )
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 1 factoid took 95 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 4 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 196608 rows 1024 cols
[2022-05-18 22:00:18] [INFO ] Computed 1 place invariants in 2419 ms
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 3 out of 1024 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1024/1024 places, 196608/196608 transitions.
Applied a total of 0 rules in 5269 ms. Remains 1024 /1024 variables (removed 0) and now considering 196608/196608 (removed 0) transitions.
// Phase 1: matrix 196608 rows 1024 cols
[2022-05-18 22:00:41] [INFO ] Computed 1 place invariants in 2395 ms
[2022-05-18 22:00:41] [INFO ] Implicit Places using invariants in 2569 ms returned []
Implicit Place search using SMT only with invariants took 2571 ms to find 0 implicit places.
// Phase 1: matrix 196608 rows 1024 cols
[2022-05-18 22:00:43] [INFO ] Computed 1 place invariants in 2591 ms
[2022-05-18 22:01:14] [INFO ] Performed 119367/196608 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2022-05-18 22:01:32] [INFO ] Dead Transitions using invariants and state equation in 51264 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1024/1024 places, 196608/196608 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 51 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 4 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 136 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 381 steps, including 0 resets, run visited all 2 properties in 3931 ms. (steps per millisecond=0 )
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 1 factoid took 84 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 4 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 196608 rows 1024 cols
[2022-05-18 22:01:43] [INFO ] Computed 1 place invariants in 2795 ms
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration timeout after 820 steps with 0 reset in 10043 ms.
Product exploration timeout after 860 steps with 2 reset in 10077 ms.
Applying partial POR strategy [false, false, false, true]
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 1024 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1024/1024 places, 196608/196608 transitions.
Graph (trivial) has 195456 edges and 1024 vertex of which 1021 / 1024 are part of one of the 1 SCC in 36 ms
Free SCC test removed 1020 places
Ensure Unique test removed 196601 transitions
Reduce isomorphic transitions removed 196601 transitions.
Applied a total of 1 rules in 178 ms. Remains 4 /1024 variables (removed 1020) and now considering 7/196608 (removed 196601) transitions.
[2022-05-18 22:02:19] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 4 cols
[2022-05-18 22:02:19] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-18 22:02:19] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/1024 places, 7/196608 transitions.
Finished structural reductions, in 1 iterations. Remains : 4/1024 places, 7/196608 transitions.
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 35 ms.
FORMULA NeighborGrid-PT-d5n4m1t35-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeighborGrid-PT-d5n4m1t35-LTLCardinality-00 finished in 265533 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 3 out of 1024 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1024/1024 places, 196608/196608 transitions.
Applied a total of 0 rules in 4761 ms. Remains 1024 /1024 variables (removed 0) and now considering 196608/196608 (removed 0) transitions.
// Phase 1: matrix 196608 rows 1024 cols
[2022-05-18 22:02:26] [INFO ] Computed 1 place invariants in 2342 ms
[2022-05-18 22:02:26] [INFO ] Implicit Places using invariants in 2518 ms returned []
Implicit Place search using SMT only with invariants took 2519 ms to find 0 implicit places.
// Phase 1: matrix 196608 rows 1024 cols
[2022-05-18 22:02:29] [INFO ] Computed 1 place invariants in 2755 ms
[2022-05-18 22:02:59] [INFO ] Performed 124508/196608 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2022-05-18 22:03:17] [INFO ] Dead Transitions using invariants and state equation in 50214 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1024/1024 places, 196608/196608 transitions.
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : NeighborGrid-PT-d5n4m1t35-LTLCardinality-01 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: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GT s523 s707) (LEQ 3 s824))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 24 ms.
FORMULA NeighborGrid-PT-d5n4m1t35-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeighborGrid-PT-d5n4m1t35-LTLCardinality-01 finished in 57783 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||X(G(p1))))'
Support contains 4 out of 1024 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1024/1024 places, 196608/196608 transitions.
Applied a total of 0 rules in 5014 ms. Remains 1024 /1024 variables (removed 0) and now considering 196608/196608 (removed 0) transitions.
// Phase 1: matrix 196608 rows 1024 cols
[2022-05-18 22:03:24] [INFO ] Computed 1 place invariants in 2464 ms
[2022-05-18 22:03:24] [INFO ] Implicit Places using invariants in 2639 ms returned []
Implicit Place search using SMT only with invariants took 2640 ms to find 0 implicit places.
// Phase 1: matrix 196608 rows 1024 cols
[2022-05-18 22:03:27] [INFO ] Computed 1 place invariants in 2655 ms
[2022-05-18 22:03:57] [INFO ] Performed 124295/196608 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2022-05-18 22:04:15] [INFO ] Dead Transitions using invariants and state equation in 50078 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1024/1024 places, 196608/196608 transitions.
Stuttering acceptance computed with spot in 121 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : NeighborGrid-PT-d5n4m1t35-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(GT s474 s455), p0:(AND (LEQ 2 s977) (LEQ 1 s941))], 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 1 steps with 0 reset in 23 ms.
FORMULA NeighborGrid-PT-d5n4m1t35-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeighborGrid-PT-d5n4m1t35-LTLCardinality-02 finished in 58055 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(G(p0))))'
Support contains 2 out of 1024 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1024/1024 places, 196608/196608 transitions.
Graph (trivial) has 195842 edges and 1024 vertex of which 1022 / 1024 are part of one of the 1 SCC in 25 ms
Free SCC test removed 1021 places
Ensure Unique test removed 196601 transitions
Reduce isomorphic transitions removed 196601 transitions.
Applied a total of 1 rules in 144 ms. Remains 3 /1024 variables (removed 1021) and now considering 7/196608 (removed 196601) transitions.
// Phase 1: matrix 7 rows 3 cols
[2022-05-18 22:04:15] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-18 22:04:15] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 7 rows 3 cols
[2022-05-18 22:04:15] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-18 22:04:15] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
[2022-05-18 22:04:15] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 3 cols
[2022-05-18 22:04:15] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-18 22:04:15] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/1024 places, 7/196608 transitions.
Finished structural reductions, in 1 iterations. Remains : 3/1024 places, 7/196608 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : NeighborGrid-PT-d5n4m1t35-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s0 s1)], 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 NeighborGrid-PT-d5n4m1t35-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeighborGrid-PT-d5n4m1t35-LTLCardinality-03 finished in 307 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(F(p1))))))'
Support contains 4 out of 1024 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1024/1024 places, 196608/196608 transitions.
Graph (trivial) has 195076 edges and 1024 vertex of which 1020 / 1024 are part of one of the 1 SCC in 96 ms
Free SCC test removed 1019 places
Ensure Unique test removed 196595 transitions
Reduce isomorphic transitions removed 196595 transitions.
Applied a total of 1 rules in 228 ms. Remains 5 /1024 variables (removed 1019) and now considering 13/196608 (removed 196595) transitions.
// Phase 1: matrix 13 rows 5 cols
[2022-05-18 22:04:15] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-18 22:04:15] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 13 rows 5 cols
[2022-05-18 22:04:15] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-18 22:04:15] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2022-05-18 22:04:15] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 13 rows 5 cols
[2022-05-18 22:04:15] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-18 22:04:15] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/1024 places, 13/196608 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/1024 places, 13/196608 transitions.
Stuttering acceptance computed with spot in 58 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : NeighborGrid-PT-d5n4m1t35-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s1 s3), p1:(LEQ s0 s2)], 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 68 steps with 0 reset in 1 ms.
FORMULA NeighborGrid-PT-d5n4m1t35-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeighborGrid-PT-d5n4m1t35-LTLCardinality-06 finished in 423 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(F(p0)))||G(p1)))'
Support contains 3 out of 1024 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1024/1024 places, 196608/196608 transitions.
Graph (trivial) has 195460 edges and 1024 vertex of which 1021 / 1024 are part of one of the 1 SCC in 24 ms
Free SCC test removed 1020 places
Ensure Unique test removed 196597 transitions
Reduce isomorphic transitions removed 196597 transitions.
Applied a total of 1 rules in 140 ms. Remains 4 /1024 variables (removed 1020) and now considering 11/196608 (removed 196597) transitions.
// Phase 1: matrix 11 rows 4 cols
[2022-05-18 22:04:16] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-18 22:04:16] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 11 rows 4 cols
[2022-05-18 22:04:16] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-18 22:04:16] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2022-05-18 22:04:16] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 11 rows 4 cols
[2022-05-18 22:04:16] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-18 22:04:16] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/1024 places, 11/196608 transitions.
Finished structural reductions, in 1 iterations. Remains : 4/1024 places, 11/196608 transitions.
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : NeighborGrid-PT-d5n4m1t35-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ 2 s0), p0:(LEQ s1 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA NeighborGrid-PT-d5n4m1t35-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeighborGrid-PT-d5n4m1t35-LTLCardinality-10 finished in 370 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U ((p0 U X(p0))&&(G(p1)||p2))))))'
Support contains 5 out of 1024 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1024/1024 places, 196608/196608 transitions.
Applied a total of 0 rules in 4841 ms. Remains 1024 /1024 variables (removed 0) and now considering 196608/196608 (removed 0) transitions.
// Phase 1: matrix 196608 rows 1024 cols
[2022-05-18 22:04:23] [INFO ] Computed 1 place invariants in 2349 ms
[2022-05-18 22:04:23] [INFO ] Implicit Places using invariants in 2516 ms returned []
Implicit Place search using SMT only with invariants took 2517 ms to find 0 implicit places.
// Phase 1: matrix 196608 rows 1024 cols
[2022-05-18 22:04:26] [INFO ] Computed 1 place invariants in 2952 ms
[2022-05-18 22:04:56] [INFO ] Performed 123581/196608 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2022-05-18 22:05:14] [INFO ] Dead Transitions using invariants and state equation in 50884 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1024/1024 places, 196608/196608 transitions.
Stuttering acceptance computed with spot in 354 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : NeighborGrid-PT-d5n4m1t35-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(OR p0 p2 p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), acceptance={0, 1} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={1} source=0 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0, 1} source=0 dest: 3}, { cond=(OR (AND p0 p2) (AND p0 p1)), acceptance={0, 1} source=0 dest: 4}, { cond=(AND p0 (NOT p2) p1), acceptance={1} source=0 dest: 5}], [{ cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=1 dest: 0}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={1} source=1 dest: 2}], [{ cond=(OR (AND p0 (NOT p1)) (AND p2 (NOT p1))), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={0, 1} source=2 dest: 1}, { cond=(OR (AND p0 p1) (AND p2 p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={1} source=2 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0, 1} source=2 dest: 3}, { cond=(AND p0 p2 (NOT p1)), acceptance={0, 1} source=2 dest: 4}, { cond=(AND p0 (NOT p2) p1), acceptance={1} source=2 dest: 5}, { cond=(AND (NOT p0) p2 p1), acceptance={1} source=2 dest: 6}, { cond=(AND p0 p2 p1), acceptance={1} source=2 dest: 7}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=3 dest: 0}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={1} source=3 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0, 1} source=3 dest: 3}, { cond=(OR (AND p0 p2) (AND p0 p1)), acceptance={0, 1} source=3 dest: 4}, { cond=(AND p0 (NOT p2) p1), acceptance={1} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={0, 1} source=4 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=5 dest: 0}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={0, 1} source=5 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={1} source=5 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0, 1} source=5 dest: 3}, { cond=(AND p0 p2 (NOT p1)), acceptance={0, 1} source=5 dest: 4}, { cond=(AND p0 (NOT p2) p1), acceptance={1} source=5 dest: 5}, { cond=(AND (NOT p0) p2 p1), acceptance={1} source=5 dest: 6}, { cond=(AND p0 p2 p1), acceptance={1} source=5 dest: 7}], [{ cond=(AND (NOT p0) p2 (NOT p1)), acceptance={0} source=6 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=6 dest: 0}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={0, 1} source=6 dest: 1}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={1} source=6 dest: 2}, { cond=(AND (NOT p0) p2 p1), acceptance={1} source=6 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=7 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={1} source=7 dest: 6}]], initial=0, aps=[p0:(LEQ s267 s355), p2:(LEQ 3 s585), p1:(LEQ s110 s229)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration timeout after 760 steps with 1 reset in 10016 ms.
Product exploration timeout after 760 steps with 2 reset in 10037 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND p0 p2 p1)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2) p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (OR (AND (NOT p0) p2) (AND (NOT p0) p1))), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1)))), (X (AND p0 (NOT p2) p1)), (X (NOT (AND p0 (NOT p2) p1))), (X (OR (AND p0 p1) (AND p2 p1))), (X (NOT (OR (AND p0 p1) (AND p2 p1)))), (X (OR p0 p2 p1)), (X (NOT (OR p0 p2 p1))), (X (OR (AND p0 (NOT p1)) (AND p2 (NOT p1)))), (X (NOT (OR (AND p0 (NOT p1)) (AND p2 (NOT p1))))), (X (AND p0 (NOT p2) (NOT p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (OR (AND p0 p2) (AND p0 p1))), (X (NOT (OR (AND p0 p2) (AND p0 p1)))), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT p0)), (X p0)]
Knowledge based reduction with 5 factoid took 862 ms. Reduced automaton from 8 states, 44 edges and 3 AP to 8 states, 44 edges and 3 AP.
Stuttering acceptance computed with spot in 335 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Interrupted random walk after 3785 steps, including 1 resets, run timeout after 30005 ms. (steps per millisecond=0 ) properties seen 9
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 154 ms. (steps per millisecond=64 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 294 ms. (steps per millisecond=34 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 196608 rows 1024 cols
[2022-05-18 22:06:13] [INFO ] Computed 1 place invariants in 2421 ms
[2022-05-18 22:06:13] [INFO ] [Real]Absence check using 1 positive place invariants in 8 ms returned sat
[2022-05-18 22:06:13] [INFO ] After 257ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2022-05-18 22:06:13] [INFO ] [Nat]Absence check using 1 positive place invariants in 6 ms returned sat
[2022-05-18 22:06:38] [INFO ] After 24704ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2022-05-18 22:06:38] [INFO ] After 24762ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 19 ms.
[2022-05-18 22:06:38] [INFO ] After 25102ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 7 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 1024 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1024/1024 places, 196608/196608 transitions.
Graph (trivial) has 194690 edges and 1024 vertex of which 1019 / 1024 are part of one of the 1 SCC in 29 ms
Free SCC test removed 1018 places
Drop transitions removed 194690 transitions
Ensure Unique test removed 1906 transitions
Reduce isomorphic transitions removed 196596 transitions.
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 6 transition count 10
Applied a total of 3 rules in 308 ms. Remains 6 /1024 variables (removed 1018) and now considering 10/196608 (removed 196598) transitions.
Finished structural reductions, in 1 iterations. Remains : 6/1024 places, 10/196608 transitions.
Incomplete random walk after 10245 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=5122 ) properties (out of 7) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 2) seen :1
Finished Best-First random walk after 33 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=33 )
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND p0 p2 p1)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2) p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (OR (AND (NOT p0) p2) (AND (NOT p0) p1))), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1)))), (X (AND p0 (NOT p2) p1)), (X (NOT (AND p0 (NOT p2) p1))), (X (OR (AND p0 p1) (AND p2 p1))), (X (NOT (OR (AND p0 p1) (AND p2 p1)))), (X (OR p0 p2 p1)), (X (NOT (OR p0 p2 p1))), (X (OR (AND p0 (NOT p1)) (AND p2 (NOT p1)))), (X (NOT (OR (AND p0 (NOT p1)) (AND p2 (NOT p1))))), (X (AND p0 (NOT p2) (NOT p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (OR (AND p0 p2) (AND p0 p1))), (X (NOT (OR (AND p0 p2) (AND p0 p1)))), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT p0)), (X p0), (F (AND (NOT p0) (NOT p1) p2)), (F (OR (AND p0 (NOT p1)) (AND (NOT p1) p2))), (F (NOT (OR (AND p0 p1) (AND p1 p2)))), (F (AND (NOT p0) p1)), (F (AND p0 (NOT p1) (NOT p2))), (F (AND (NOT p0) p1 (NOT p2))), (F (AND (NOT p0) (NOT p1))), (F (NOT p0)), (F (NOT (AND p0 p1 (NOT p2)))), (F (NOT (OR (AND p0 p1) (AND p0 p2)))), (F (AND p0 p1 p2)), (F (NOT (OR p0 p1 p2))), (F (OR (AND (NOT p0) p1) (AND (NOT p0) p2))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND (NOT p0) p1 p2)), (F (AND p0 (NOT p1) p2))]
Knowledge based reduction with 5 factoid took 1045 ms. Reduced automaton from 8 states, 44 edges and 3 AP to 8 states, 44 edges and 3 AP.
Stuttering acceptance computed with spot in 309 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 335 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 1024 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1024/1024 places, 196608/196608 transitions.
Applied a total of 0 rules in 4570 ms. Remains 1024 /1024 variables (removed 0) and now considering 196608/196608 (removed 0) transitions.
// Phase 1: matrix 196608 rows 1024 cols
[2022-05-18 22:06:47] [INFO ] Computed 1 place invariants in 2299 ms
[2022-05-18 22:06:47] [INFO ] Implicit Places using invariants in 2470 ms returned []
Implicit Place search using SMT only with invariants took 2471 ms to find 0 implicit places.
// Phase 1: matrix 196608 rows 1024 cols
[2022-05-18 22:06:50] [INFO ] Computed 1 place invariants in 2322 ms
[2022-05-18 22:07:20] [INFO ] Performed 116690/196608 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2022-05-18 22:07:40] [INFO ] Dead Transitions using invariants and state equation in 52479 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1024/1024 places, 196608/196608 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 p1 p2)))]
False Knowledge obtained : [(X (OR (AND (NOT p0) p1) (AND (NOT p0) p2))), (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2)))), (X (AND (NOT p0) p1 (NOT p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (OR (AND p0 (NOT p1)) (AND (NOT p1) p2))), (X (NOT (OR (AND p0 (NOT p1)) (AND (NOT p1) p2)))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (OR (AND p0 p1) (AND p1 p2))), (X (NOT (OR (AND p0 p1) (AND p1 p2)))), (X (OR p0 p1 p2)), (X (NOT (OR p0 p1 p2))), (X (AND p0 p1 (NOT p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (OR (AND p0 p1) (AND p0 p2))), (X (NOT (OR (AND p0 p1) (AND p0 p2)))), (X (NOT p0)), (X p0)]
Knowledge based reduction with 5 factoid took 750 ms. Reduced automaton from 8 states, 44 edges and 3 AP to 8 states, 44 edges and 3 AP.
Stuttering acceptance computed with spot in 387 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Interrupted random walk after 4186 steps, including 1 resets, run timeout after 30009 ms. (steps per millisecond=0 ) properties seen 14
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 155 ms. (steps per millisecond=64 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 155 ms. (steps per millisecond=64 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 196608 rows 1024 cols
[2022-05-18 22:08:17] [INFO ] Computed 1 place invariants in 2343 ms
[2022-05-18 22:08:17] [INFO ] After 131ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-18 22:08:17] [INFO ] [Nat]Absence check using 1 positive place invariants in 9 ms returned sat
[2022-05-18 22:08:42] [INFO ] After 24842ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-18 22:08:42] [INFO ] After 24909ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2022-05-18 22:08:42] [INFO ] After 25099ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 1024 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1024/1024 places, 196608/196608 transitions.
Graph (trivial) has 194690 edges and 1024 vertex of which 1019 / 1024 are part of one of the 1 SCC in 29 ms
Free SCC test removed 1018 places
Drop transitions removed 194690 transitions
Ensure Unique test removed 1906 transitions
Reduce isomorphic transitions removed 196596 transitions.
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 6 transition count 10
Applied a total of 3 rules in 251 ms. Remains 6 /1024 variables (removed 1018) and now considering 10/196608 (removed 196598) transitions.
Finished structural reductions, in 1 iterations. Remains : 6/1024 places, 10/196608 transitions.
Finished random walk after 2 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 p1 p2)))]
False Knowledge obtained : [(X (OR (AND (NOT p0) p1) (AND (NOT p0) p2))), (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2)))), (X (AND (NOT p0) p1 (NOT p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (OR (AND p0 (NOT p1)) (AND (NOT p1) p2))), (X (NOT (OR (AND p0 (NOT p1)) (AND (NOT p1) p2)))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (OR (AND p0 p1) (AND p1 p2))), (X (NOT (OR (AND p0 p1) (AND p1 p2)))), (X (OR p0 p1 p2)), (X (NOT (OR p0 p1 p2))), (X (AND p0 p1 (NOT p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (OR (AND p0 p1) (AND p0 p2))), (X (NOT (OR (AND p0 p1) (AND p0 p2)))), (X (NOT p0)), (X p0), (F (AND (NOT p0) (NOT p1) p2)), (F (OR (AND p0 (NOT p1)) (AND (NOT p1) p2))), (F (NOT (OR (AND p0 p1) (AND p1 p2)))), (F (AND (NOT p0) p1)), (F (AND p0 (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1 (NOT p2))), (F (NOT p0)), (F (NOT (AND p0 p1 (NOT p2)))), (F (AND p0 p1 p2)), (F (NOT (OR (AND p0 p1) (AND p0 p2)))), (F (NOT (OR p0 p1 p2))), (F (OR (AND (NOT p0) p1) (AND (NOT p0) p2))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND (NOT p0) p1 p2)), (F (AND p0 (NOT p1) p2))]
Knowledge based reduction with 5 factoid took 1027 ms. Reduced automaton from 8 states, 44 edges and 3 AP to 8 states, 44 edges and 3 AP.
Stuttering acceptance computed with spot in 313 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 318 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 339 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration timeout after 800 steps with 2 reset in 10034 ms.
Product exploration timeout after 790 steps with 0 reset in 10081 ms.
Built C files in :
/tmp/ltsmin15431030418784652915
[2022-05-18 22:09:06] [INFO ] Built C files in 1451ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15431030418784652915
Running compilation step : cd /tmp/ltsmin15431030418784652915;'/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/ltsmin15431030418784652915;'/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/ltsmin15431030418784652915;'/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 5 out of 1024 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1024/1024 places, 196608/196608 transitions.
Applied a total of 0 rules in 5004 ms. Remains 1024 /1024 variables (removed 0) and now considering 196608/196608 (removed 0) transitions.
// Phase 1: matrix 196608 rows 1024 cols
[2022-05-18 22:09:17] [INFO ] Computed 1 place invariants in 2433 ms
[2022-05-18 22:09:17] [INFO ] Implicit Places using invariants in 2607 ms returned []
Implicit Place search using SMT only with invariants took 2608 ms to find 0 implicit places.
// Phase 1: matrix 196608 rows 1024 cols
[2022-05-18 22:09:20] [INFO ] Computed 1 place invariants in 2722 ms
[2022-05-18 22:09:50] [INFO ] Performed 125000/196608 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2022-05-18 22:10:07] [INFO ] Dead Transitions using invariants and state equation in 50031 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1024/1024 places, 196608/196608 transitions.
Built C files in :
/tmp/ltsmin9998082476517947096
[2022-05-18 22:10:08] [INFO ] Built C files in 807ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9998082476517947096
Running compilation step : cd /tmp/ltsmin9998082476517947096;'/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/ltsmin9998082476517947096;'/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/ltsmin9998082476517947096;'/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-18 22:10:16] [INFO ] Flatten gal took : 2568 ms
[2022-05-18 22:10:18] [INFO ] Flatten gal took : 2625 ms
[2022-05-18 22:10:18] [INFO ] Time to serialize gal into /tmp/LTL5490119704374106425.gal : 363 ms
[2022-05-18 22:10:18] [INFO ] Time to serialize properties into /tmp/LTL7381072178022686216.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/LTL5490119704374106425.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7381072178022686216.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/LTL5490119...266
Read 1 LTL properties
Checking formula 0 : !((F(G(("(p_1_0_0_2_3<=p_1_1_2_0_3)")U((("(p_1_0_0_2_3<=p_1_1_2_0_3)")U(X("(p_1_0_0_2_3<=p_1_1_2_0_3)")))&&((G("(p_0_1_2_3_2<=p_0_3_2_...190
Formula 0 simplified : !FG("(p_1_0_0_2_3<=p_1_1_2_0_3)" U (("(p_1_0_0_2_3<=p_1_1_2_0_3)" U X"(p_1_0_0_2_3<=p_1_1_2_0_3)") & ("(p_2_1_0_2_1>=3)" | G"(p_0_1_...178
Detected timeout of ITS tools.
[2022-05-18 22:10:36] [INFO ] Flatten gal took : 2663 ms
[2022-05-18 22:10:36] [INFO ] Applying decomposition
[2022-05-18 22:10:39] [INFO ] Flatten gal took : 2397 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/graph12515506255748358970.txt' '-o' '/tmp/graph12515506255748358970.bin' '-w' '/tmp/graph12515506255748358970.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12515506255748358970.bin' '-l' '-1' '-v' '-w' '/tmp/graph12515506255748358970.weights' '-q' '0' '-e' '0.001'
[2022-05-18 22:10:45] [INFO ] Decomposing Gal with order
[2022-05-18 22:10:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 22:10:51] [INFO ] Removed a total of 1940 redundant transitions.
[2022-05-18 22:10:52] [INFO ] Flatten gal took : 5646 ms
[2022-05-18 22:10:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 1120 labels/synchronizations in 554 ms.
[2022-05-18 22:11:00] [INFO ] Time to serialize gal into /tmp/LTL355497429802814027.gal : 277 ms
[2022-05-18 22:11:00] [INFO ] Time to serialize properties into /tmp/LTL1504661640705887673.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/LTL355497429802814027.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1504661640705887673.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/LTL3554974...265
Read 1 LTL properties
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2991094855654198933
[2022-05-18 22:11:32] [INFO ] Built C files in 1935ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2991094855654198933
Running compilation step : cd /tmp/ltsmin2991094855654198933;'/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/ltsmin2991094855654198933;'/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/ltsmin2991094855654198933;'/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 NeighborGrid-PT-d5n4m1t35-LTLCardinality-12 finished in 439247 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(F(p0)))&&F(X((G(X(!p0))||!(p1 U p2))))))'
Support contains 4 out of 1024 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1024/1024 places, 196608/196608 transitions.
Applied a total of 0 rules in 7518 ms. Remains 1024 /1024 variables (removed 0) and now considering 196608/196608 (removed 0) transitions.
// Phase 1: matrix 196608 rows 1024 cols
[2022-05-18 22:11:46] [INFO ] Computed 1 place invariants in 3155 ms
[2022-05-18 22:11:48] [INFO ] Implicit Places using invariants in 4925 ms returned []
Implicit Place search using SMT only with invariants took 4933 ms to find 0 implicit places.
// Phase 1: matrix 196608 rows 1024 cols
[2022-05-18 22:11:53] [INFO ] Computed 1 place invariants in 5048 ms
BK_STOP 1652911947728
--------------------
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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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="NeighborGrid-PT-d5n4m1t35"
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 NeighborGrid-PT-d5n4m1t35, 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 r132-tall-165271821600987"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/NeighborGrid-PT-d5n4m1t35.tgz
mv NeighborGrid-PT-d5n4m1t35 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 '
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 ;