About the Execution of ITS-Tools for StigmergyCommit-PT-11a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 6062.884 | 586734.00 | 899679.00 | 2662.60 | FFFFFFFTTFFTFTTF | 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.r294-smll-165463872600236.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 StigmergyCommit-PT-11a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r294-smll-165463872600236
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 465M
-rw-r--r-- 1 mcc users 9.2K May 30 15:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 107K May 30 15:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 30 15:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 30 15:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 25 13:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 25 13:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 25 13:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 25 13:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 29 12:20 NewModel
-rw-r--r-- 1 mcc users 12K May 30 15:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 131K May 30 15:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 30 15:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 47K May 30 15:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 25 13:03 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 25 13:03 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 12:20 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 12:20 instance
-rw-r--r-- 1 mcc users 6 May 29 12:20 iscolored
-rw-r--r-- 1 mcc users 464M May 29 12:20 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 StigmergyCommit-PT-11a-LTLFireability-00
FORMULA_NAME StigmergyCommit-PT-11a-LTLFireability-01
FORMULA_NAME StigmergyCommit-PT-11a-LTLFireability-02
FORMULA_NAME StigmergyCommit-PT-11a-LTLFireability-03
FORMULA_NAME StigmergyCommit-PT-11a-LTLFireability-04
FORMULA_NAME StigmergyCommit-PT-11a-LTLFireability-05
FORMULA_NAME StigmergyCommit-PT-11a-LTLFireability-06
FORMULA_NAME StigmergyCommit-PT-11a-LTLFireability-07
FORMULA_NAME StigmergyCommit-PT-11a-LTLFireability-08
FORMULA_NAME StigmergyCommit-PT-11a-LTLFireability-09
FORMULA_NAME StigmergyCommit-PT-11a-LTLFireability-10
FORMULA_NAME StigmergyCommit-PT-11a-LTLFireability-11
FORMULA_NAME StigmergyCommit-PT-11a-LTLFireability-12
FORMULA_NAME StigmergyCommit-PT-11a-LTLFireability-13
FORMULA_NAME StigmergyCommit-PT-11a-LTLFireability-14
FORMULA_NAME StigmergyCommit-PT-11a-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1654830115003
Running Version 202205111006
[2022-06-10 03:01:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-10 03:01:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-10 03:02:19] [INFO ] Load time of PNML (sax parser for PT used): 21531 ms
[2022-06-10 03:02:20] [INFO ] Transformed 436 places.
[2022-06-10 03:02:21] [INFO ] Transformed 373236 transitions.
[2022-06-10 03:02:21] [INFO ] Found NUPN structural information;
[2022-06-10 03:02:21] [INFO ] Parsed PT model containing 436 places and 373236 transitions in 23903 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 98 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Ensure Unique test removed 364478 transitions
Reduce redundant transitions removed 364478 transitions.
FORMULA StigmergyCommit-PT-11a-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-11a-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-11a-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-11a-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-11a-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 12 out of 436 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 436/436 places, 8758/8758 transitions.
Discarding 96 places :
Symmetric choice reduction at 0 with 96 rule applications. Total rules 96 place count 340 transition count 8650
Iterating global reduction 0 with 96 rules applied. Total rules applied 192 place count 340 transition count 8650
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 204 place count 340 transition count 8638
Discarding 49 places :
Symmetric choice reduction at 1 with 49 rule applications. Total rules 253 place count 291 transition count 8577
Iterating global reduction 1 with 49 rules applied. Total rules applied 302 place count 291 transition count 8577
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 314 place count 291 transition count 8565
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 326 place count 279 transition count 8553
Iterating global reduction 2 with 12 rules applied. Total rules applied 338 place count 279 transition count 8553
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 350 place count 267 transition count 8541
Iterating global reduction 2 with 12 rules applied. Total rules applied 362 place count 267 transition count 8541
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 374 place count 255 transition count 8529
Iterating global reduction 2 with 12 rules applied. Total rules applied 386 place count 255 transition count 8529
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 398 place count 243 transition count 8517
Iterating global reduction 2 with 12 rules applied. Total rules applied 410 place count 243 transition count 8517
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 422 place count 243 transition count 8505
Applied a total of 422 rules in 523 ms. Remains 243 /436 variables (removed 193) and now considering 8505/8758 (removed 253) transitions.
[2022-06-10 03:02:25] [INFO ] Flow matrix only has 8492 transitions (discarded 13 similar events)
// Phase 1: matrix 8492 rows 243 cols
[2022-06-10 03:02:25] [INFO ] Computed 2 place invariants in 226 ms
[2022-06-10 03:02:26] [INFO ] Implicit Places using invariants in 802 ms returned []
[2022-06-10 03:02:26] [INFO ] Flow matrix only has 8492 transitions (discarded 13 similar events)
// Phase 1: matrix 8492 rows 243 cols
[2022-06-10 03:02:26] [INFO ] Computed 2 place invariants in 88 ms
[2022-06-10 03:02:28] [INFO ] Implicit Places using invariants and state equation in 1847 ms returned []
Implicit Place search using SMT with State Equation took 2689 ms to find 0 implicit places.
[2022-06-10 03:02:28] [INFO ] Flow matrix only has 8492 transitions (discarded 13 similar events)
// Phase 1: matrix 8492 rows 243 cols
[2022-06-10 03:02:28] [INFO ] Computed 2 place invariants in 42 ms
[2022-06-10 03:02:35] [INFO ] Dead Transitions using invariants and state equation in 7490 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 243/436 places, 8505/8758 transitions.
Finished structural reductions, in 1 iterations. Remains : 243/436 places, 8505/8758 transitions.
Support contains 12 out of 243 places after structural reductions.
[2022-06-10 03:02:38] [INFO ] Flatten gal took : 1525 ms
[2022-06-10 03:02:39] [INFO ] Flatten gal took : 1074 ms
[2022-06-10 03:02:41] [INFO ] Input system was already deterministic with 8505 transitions.
Finished random walk after 75 steps, including 0 resets, run visited all 6 properties in 75 ms. (steps per millisecond=1 )
FORMULA StigmergyCommit-PT-11a-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 74 stabilizing places and 73 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F((G(p1)&&p0))&&((p1 U p1)||F(p1))))'
Support contains 12 out of 243 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 243/243 places, 8505/8505 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 121 rules applied. Total rules applied 121 place count 241 transition count 8384
Reduce places removed 120 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 155 rules applied. Total rules applied 276 place count 121 transition count 8349
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 300 place count 109 transition count 8337
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 300 place count 109 transition count 8326
Deduced a syphon composed of 11 places in 3 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 322 place count 98 transition count 8326
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 345 place count 75 transition count 8303
Iterating global reduction 3 with 23 rules applied. Total rules applied 368 place count 75 transition count 8303
Ensure Unique test removed 4095 transitions
Reduce isomorphic transitions removed 4095 transitions.
Iterating post reduction 3 with 4095 rules applied. Total rules applied 4463 place count 75 transition count 4208
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 12 Pre rules applied. Total rules applied 4463 place count 75 transition count 4196
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 4487 place count 63 transition count 4196
Performed 13 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 13 places in 3 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 4513 place count 50 transition count 4182
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 4 with 12 rules applied. Total rules applied 4525 place count 50 transition count 4170
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 3 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 4549 place count 38 transition count 4158
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 4550 place count 37 transition count 4157
Applied a total of 4550 rules in 15837 ms. Remains 37 /243 variables (removed 206) and now considering 4157/8505 (removed 4348) transitions.
[2022-06-10 03:02:58] [INFO ] Flow matrix only has 4144 transitions (discarded 13 similar events)
// Phase 1: matrix 4144 rows 37 cols
[2022-06-10 03:02:58] [INFO ] Computed 1 place invariants in 13 ms
[2022-06-10 03:02:58] [INFO ] Implicit Places using invariants in 81 ms returned []
[2022-06-10 03:02:58] [INFO ] Flow matrix only has 4144 transitions (discarded 13 similar events)
// Phase 1: matrix 4144 rows 37 cols
[2022-06-10 03:02:58] [INFO ] Computed 1 place invariants in 17 ms
[2022-06-10 03:03:00] [INFO ] State equation strengthened by 4119 read => feed constraints.
[2022-06-10 03:03:00] [INFO ] Implicit Places using invariants and state equation in 2083 ms returned []
Implicit Place search using SMT with State Equation took 2175 ms to find 0 implicit places.
[2022-06-10 03:03:02] [INFO ] Redundant transitions in 1589 ms returned []
[2022-06-10 03:03:02] [INFO ] Flow matrix only has 4144 transitions (discarded 13 similar events)
// Phase 1: matrix 4144 rows 37 cols
[2022-06-10 03:03:02] [INFO ] Computed 1 place invariants in 13 ms
[2022-06-10 03:03:05] [INFO ] Dead Transitions using invariants and state equation in 3294 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 37/243 places, 4157/8505 transitions.
Finished structural reductions, in 1 iterations. Remains : 37/243 places, 4157/8505 transitions.
Stuttering acceptance computed with spot in 281 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : StigmergyCommit-PT-11a-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s3 1) (EQ s6 1) (EQ s9 1) (EQ s12 1) (EQ s15 1) (EQ s18 1) (EQ s21 1) (EQ s24 1) (EQ s27 1) (EQ s30 1) (EQ s33 1) (EQ s36 1)), p1:(AND (EQ s3 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 11 ms.
FORMULA StigmergyCommit-PT-11a-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-11a-LTLFireability-01 finished in 23338 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))&&F(!(p1 U p1))))'
Support contains 12 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 8505/8505 transitions.
Applied a total of 0 rules in 45 ms. Remains 243 /243 variables (removed 0) and now considering 8505/8505 (removed 0) transitions.
[2022-06-10 03:03:05] [INFO ] Flow matrix only has 8492 transitions (discarded 13 similar events)
// Phase 1: matrix 8492 rows 243 cols
[2022-06-10 03:03:05] [INFO ] Computed 2 place invariants in 35 ms
[2022-06-10 03:03:06] [INFO ] Implicit Places using invariants in 199 ms returned []
[2022-06-10 03:03:06] [INFO ] Flow matrix only has 8492 transitions (discarded 13 similar events)
// Phase 1: matrix 8492 rows 243 cols
[2022-06-10 03:03:06] [INFO ] Computed 2 place invariants in 56 ms
[2022-06-10 03:03:07] [INFO ] Implicit Places using invariants and state equation in 1710 ms returned []
Implicit Place search using SMT with State Equation took 1912 ms to find 0 implicit places.
[2022-06-10 03:03:07] [INFO ] Flow matrix only has 8492 transitions (discarded 13 similar events)
// Phase 1: matrix 8492 rows 243 cols
[2022-06-10 03:03:07] [INFO ] Computed 2 place invariants in 41 ms
[2022-06-10 03:03:13] [INFO ] Dead Transitions using invariants and state equation in 5283 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 243/243 places, 8505/8505 transitions.
Stuttering acceptance computed with spot in 142 ms :[(NOT p0), true, (OR (NOT p0) p1), (OR (NOT p0) p1)]
Running random walk in product with property : StigmergyCommit-PT-11a-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 1}, { cond=(AND p1 p0), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(OR (EQ s15 0) (EQ s35 0) (EQ s55 0) (EQ s75 0) (EQ s95 0) (EQ s115 0) (EQ s135 0) (EQ s155 0) (EQ s175 0) (EQ s195 0) (EQ s215 0) (EQ s235 0)), p1:(AN...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 75 steps with 0 reset in 16 ms.
FORMULA StigmergyCommit-PT-11a-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-11a-LTLFireability-02 finished in 7469 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(!(p0 U X(F(p0)))))'
Support contains 12 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 8505/8505 transitions.
Applied a total of 0 rules in 70 ms. Remains 243 /243 variables (removed 0) and now considering 8505/8505 (removed 0) transitions.
[2022-06-10 03:03:13] [INFO ] Flow matrix only has 8492 transitions (discarded 13 similar events)
// Phase 1: matrix 8492 rows 243 cols
[2022-06-10 03:03:13] [INFO ] Computed 2 place invariants in 54 ms
[2022-06-10 03:03:13] [INFO ] Implicit Places using invariants in 224 ms returned []
[2022-06-10 03:03:13] [INFO ] Flow matrix only has 8492 transitions (discarded 13 similar events)
// Phase 1: matrix 8492 rows 243 cols
[2022-06-10 03:03:13] [INFO ] Computed 2 place invariants in 121 ms
[2022-06-10 03:03:15] [INFO ] Implicit Places using invariants and state equation in 1525 ms returned []
Implicit Place search using SMT with State Equation took 1755 ms to find 0 implicit places.
[2022-06-10 03:03:15] [INFO ] Flow matrix only has 8492 transitions (discarded 13 similar events)
// Phase 1: matrix 8492 rows 243 cols
[2022-06-10 03:03:15] [INFO ] Computed 2 place invariants in 33 ms
[2022-06-10 03:03:20] [INFO ] Dead Transitions using invariants and state equation in 5082 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 243/243 places, 8505/8505 transitions.
Stuttering acceptance computed with spot in 116 ms :[true, p0, p0, p0]
Running random walk in product with property : StigmergyCommit-PT-11a-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (EQ s15 1) (EQ s35 1) (EQ s55 1) (EQ s75 1) (EQ s95 1) (EQ s115 1) (EQ s135 1) (EQ s155 1) (EQ s175 1) (EQ s195 1) (EQ s215 1) (EQ s235 1))], 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, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 75 steps with 0 reset in 5 ms.
FORMULA StigmergyCommit-PT-11a-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-11a-LTLFireability-04 finished in 7085 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(F(X((X((G(p1)&&!(p2 U p2)))&&p0))))))'
Support contains 12 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 8505/8505 transitions.
Applied a total of 0 rules in 42 ms. Remains 243 /243 variables (removed 0) and now considering 8505/8505 (removed 0) transitions.
[2022-06-10 03:03:20] [INFO ] Flow matrix only has 8492 transitions (discarded 13 similar events)
// Phase 1: matrix 8492 rows 243 cols
[2022-06-10 03:03:20] [INFO ] Computed 2 place invariants in 33 ms
[2022-06-10 03:03:20] [INFO ] Implicit Places using invariants in 200 ms returned []
[2022-06-10 03:03:20] [INFO ] Flow matrix only has 8492 transitions (discarded 13 similar events)
// Phase 1: matrix 8492 rows 243 cols
[2022-06-10 03:03:20] [INFO ] Computed 2 place invariants in 42 ms
[2022-06-10 03:03:22] [INFO ] Implicit Places using invariants and state equation in 1657 ms returned []
Implicit Place search using SMT with State Equation took 1859 ms to find 0 implicit places.
[2022-06-10 03:03:22] [INFO ] Flow matrix only has 8492 transitions (discarded 13 similar events)
// Phase 1: matrix 8492 rows 243 cols
[2022-06-10 03:03:22] [INFO ] Computed 2 place invariants in 34 ms
[2022-06-10 03:03:29] [INFO ] Dead Transitions using invariants and state equation in 7284 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 243/243 places, 8505/8505 transitions.
Stuttering acceptance computed with spot in 253 ms :[(OR (NOT p0) (NOT p1) p2), (OR (NOT p0) (NOT p1) p2), (OR (NOT p1) p2), (NOT p1)]
Running random walk in product with property : StigmergyCommit-PT-11a-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(OR (AND (NOT p0) p2) (AND (NOT p0) (NOT p1))), acceptance={0} source=2 dest: 1}, { cond=(OR (AND p0 p2) (AND p0 (NOT p1))), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s15 1) (EQ s35 1) (EQ s55 1) (EQ s75 1) (EQ s95 1) (EQ s115 1) (EQ s135 1) (EQ s155 1) (EQ s175 1) (EQ s195 1) (EQ s215 1) (EQ s235 1)), p2:(A...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 75 steps with 0 reset in 7 ms.
FORMULA StigmergyCommit-PT-11a-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-11a-LTLFireability-06 finished in 9492 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 12 out of 243 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 243/243 places, 8505/8505 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 121 rules applied. Total rules applied 121 place count 241 transition count 8384
Reduce places removed 120 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 155 rules applied. Total rules applied 276 place count 121 transition count 8349
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 300 place count 109 transition count 8337
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 300 place count 109 transition count 8326
Deduced a syphon composed of 11 places in 4 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 322 place count 98 transition count 8326
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 345 place count 75 transition count 8303
Iterating global reduction 3 with 23 rules applied. Total rules applied 368 place count 75 transition count 8303
Ensure Unique test removed 4095 transitions
Reduce isomorphic transitions removed 4095 transitions.
Iterating post reduction 3 with 4095 rules applied. Total rules applied 4463 place count 75 transition count 4208
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 12 Pre rules applied. Total rules applied 4463 place count 75 transition count 4196
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 4487 place count 63 transition count 4196
Performed 13 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 4513 place count 50 transition count 4182
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 4 with 12 rules applied. Total rules applied 4525 place count 50 transition count 4170
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 4549 place count 38 transition count 4158
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 4550 place count 37 transition count 4157
Applied a total of 4550 rules in 14417 ms. Remains 37 /243 variables (removed 206) and now considering 4157/8505 (removed 4348) transitions.
[2022-06-10 03:03:44] [INFO ] Flow matrix only has 4144 transitions (discarded 13 similar events)
// Phase 1: matrix 4144 rows 37 cols
[2022-06-10 03:03:44] [INFO ] Computed 1 place invariants in 11 ms
[2022-06-10 03:03:44] [INFO ] Implicit Places using invariants in 57 ms returned []
[2022-06-10 03:03:44] [INFO ] Flow matrix only has 4144 transitions (discarded 13 similar events)
// Phase 1: matrix 4144 rows 37 cols
[2022-06-10 03:03:44] [INFO ] Computed 1 place invariants in 20 ms
[2022-06-10 03:03:45] [INFO ] Implicit Places using invariants and state equation in 958 ms returned []
Implicit Place search using SMT with State Equation took 1023 ms to find 0 implicit places.
[2022-06-10 03:03:47] [INFO ] Redundant transitions in 1727 ms returned []
[2022-06-10 03:03:47] [INFO ] Flow matrix only has 4144 transitions (discarded 13 similar events)
// Phase 1: matrix 4144 rows 37 cols
[2022-06-10 03:03:47] [INFO ] Computed 1 place invariants in 13 ms
[2022-06-10 03:03:50] [INFO ] Dead Transitions using invariants and state equation in 3600 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 37/243 places, 4157/8505 transitions.
Finished structural reductions, in 1 iterations. Remains : 37/243 places, 4157/8505 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-11a-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s3 1) (EQ s6 1) (EQ s9 1) (EQ s12 1) (EQ s15 1) (EQ s18 1) (EQ s21 1) (EQ s24 1) (EQ s27 1) (EQ s30 1) (EQ s33 1) (EQ s36 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration timeout after 62960 steps with 4843 reset in 10002 ms.
Product exploration timeout after 66510 steps with 5116 reset in 10002 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 118 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Finished random walk after 12 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=3 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 123 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
[2022-06-10 03:04:11] [INFO ] Flow matrix only has 4144 transitions (discarded 13 similar events)
// Phase 1: matrix 4144 rows 37 cols
[2022-06-10 03:04:11] [INFO ] Computed 1 place invariants in 25 ms
[2022-06-10 03:04:17] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2022-06-10 03:04:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-10 03:04:18] [INFO ] [Real]Absence check using state equation in 1297 ms returned sat
[2022-06-10 03:04:19] [INFO ] State equation strengthened by 4119 read => feed constraints.
[2022-06-10 03:04:20] [INFO ] [Real]Added 4119 Read/Feed constraints in 982 ms returned sat
[2022-06-10 03:04:20] [INFO ] Solution in real domain found non-integer solution.
[2022-06-10 03:04:25] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2022-06-10 03:04:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-10 03:04:26] [INFO ] [Nat]Absence check using state equation in 1377 ms returned sat
[2022-06-10 03:04:27] [INFO ] [Nat]Added 4119 Read/Feed constraints in 849 ms returned sat
[2022-06-10 03:04:29] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 4132 transitions) in 1919 ms.
[2022-06-10 03:04:30] [INFO ] Added : 0 causal constraints over 0 iterations in 2443 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 12 out of 37 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 37/37 places, 4157/4157 transitions.
Applied a total of 0 rules in 4738 ms. Remains 37 /37 variables (removed 0) and now considering 4157/4157 (removed 0) transitions.
[2022-06-10 03:04:34] [INFO ] Flow matrix only has 4144 transitions (discarded 13 similar events)
// Phase 1: matrix 4144 rows 37 cols
[2022-06-10 03:04:34] [INFO ] Computed 1 place invariants in 12 ms
[2022-06-10 03:04:34] [INFO ] Implicit Places using invariants in 59 ms returned []
[2022-06-10 03:04:34] [INFO ] Flow matrix only has 4144 transitions (discarded 13 similar events)
// Phase 1: matrix 4144 rows 37 cols
[2022-06-10 03:04:35] [INFO ] Computed 1 place invariants in 19 ms
[2022-06-10 03:04:35] [INFO ] Implicit Places using invariants and state equation in 796 ms returned []
Implicit Place search using SMT with State Equation took 867 ms to find 0 implicit places.
[2022-06-10 03:04:37] [INFO ] Redundant transitions in 1980 ms returned []
[2022-06-10 03:04:37] [INFO ] Flow matrix only has 4144 transitions (discarded 13 similar events)
// Phase 1: matrix 4144 rows 37 cols
[2022-06-10 03:04:37] [INFO ] Computed 1 place invariants in 12 ms
[2022-06-10 03:04:41] [INFO ] Dead Transitions using invariants and state equation in 3425 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 37/37 places, 4157/4157 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 119 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Finished random walk after 12 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=2 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 127 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
[2022-06-10 03:04:41] [INFO ] Flow matrix only has 4144 transitions (discarded 13 similar events)
// Phase 1: matrix 4144 rows 37 cols
[2022-06-10 03:04:41] [INFO ] Computed 1 place invariants in 13 ms
[2022-06-10 03:04:46] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2022-06-10 03:04:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-10 03:04:47] [INFO ] [Real]Absence check using state equation in 1005 ms returned sat
[2022-06-10 03:04:48] [INFO ] State equation strengthened by 4119 read => feed constraints.
[2022-06-10 03:04:49] [INFO ] [Real]Added 4119 Read/Feed constraints in 693 ms returned sat
[2022-06-10 03:04:49] [INFO ] Solution in real domain found non-integer solution.
[2022-06-10 03:04:55] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2022-06-10 03:04:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-10 03:04:56] [INFO ] [Nat]Absence check using state equation in 1341 ms returned sat
[2022-06-10 03:04:57] [INFO ] [Nat]Added 4119 Read/Feed constraints in 862 ms returned sat
[2022-06-10 03:04:59] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 4132 transitions) in 1510 ms.
[2022-06-10 03:04:59] [INFO ] Added : 0 causal constraints over 0 iterations in 2151 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Product exploration timeout after 64840 steps with 4987 reset in 10001 ms.
Product exploration timeout after 68020 steps with 5232 reset in 10001 ms.
Built C files in :
/tmp/ltsmin11139358368495637971
[2022-06-10 03:05:19] [INFO ] Too many transitions (4157) to apply POR reductions. Disabling POR matrices.
[2022-06-10 03:05:20] [INFO ] Built C files in 187ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11139358368495637971
Running compilation step : cd /tmp/ltsmin11139358368495637971;'/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/ltsmin11139358368495637971;'/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/ltsmin11139358368495637971;'/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 12 out of 37 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 37/37 places, 4157/4157 transitions.
Applied a total of 0 rules in 4146 ms. Remains 37 /37 variables (removed 0) and now considering 4157/4157 (removed 0) transitions.
[2022-06-10 03:05:27] [INFO ] Flow matrix only has 4144 transitions (discarded 13 similar events)
// Phase 1: matrix 4144 rows 37 cols
[2022-06-10 03:05:27] [INFO ] Computed 1 place invariants in 12 ms
[2022-06-10 03:05:27] [INFO ] Implicit Places using invariants in 41 ms returned []
[2022-06-10 03:05:27] [INFO ] Flow matrix only has 4144 transitions (discarded 13 similar events)
// Phase 1: matrix 4144 rows 37 cols
[2022-06-10 03:05:27] [INFO ] Computed 1 place invariants in 12 ms
[2022-06-10 03:05:28] [INFO ] State equation strengthened by 4119 read => feed constraints.
[2022-06-10 03:05:29] [INFO ] Implicit Places using invariants and state equation in 1756 ms returned []
Implicit Place search using SMT with State Equation took 1803 ms to find 0 implicit places.
[2022-06-10 03:05:30] [INFO ] Redundant transitions in 1799 ms returned []
[2022-06-10 03:05:30] [INFO ] Flow matrix only has 4144 transitions (discarded 13 similar events)
// Phase 1: matrix 4144 rows 37 cols
[2022-06-10 03:05:30] [INFO ] Computed 1 place invariants in 13 ms
[2022-06-10 03:05:33] [INFO ] Dead Transitions using invariants and state equation in 2384 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 37/37 places, 4157/4157 transitions.
Built C files in :
/tmp/ltsmin12304838920109042465
[2022-06-10 03:05:33] [INFO ] Too many transitions (4157) to apply POR reductions. Disabling POR matrices.
[2022-06-10 03:05:33] [INFO ] Built C files in 107ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12304838920109042465
Running compilation step : cd /tmp/ltsmin12304838920109042465;'/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/ltsmin12304838920109042465;'/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/ltsmin12304838920109042465;'/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-06-10 03:05:38] [INFO ] Flatten gal took : 425 ms
[2022-06-10 03:05:38] [INFO ] Flatten gal took : 404 ms
[2022-06-10 03:05:39] [INFO ] Time to serialize gal into /tmp/LTL3413905739130755319.gal : 235 ms
[2022-06-10 03:05:39] [INFO ] Time to serialize properties into /tmp/LTL1226680696607343507.ltl : 2 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/LTL3413905739130755319.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1226680696607343507.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/LTL3413905...266
Read 1 LTL properties
Checking formula 0 : !((F("(((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(((p174==1)&&(p210==1))&&((p246==1)&&(p282==1))))&&(((p318==1)&&(p354==1))&&((...181
Formula 0 simplified : !F"(((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(((p174==1)&&(p210==1))&&((p246==1)&&(p282==1))))&&(((p318==1)&&(p354==1))&&((p...177
Detected timeout of ITS tools.
[2022-06-10 03:05:54] [INFO ] Flatten gal took : 539 ms
[2022-06-10 03:05:54] [INFO ] Applying decomposition
[2022-06-10 03:05:55] [INFO ] Flatten gal took : 404 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/graph14342373667503024643.txt' '-o' '/tmp/graph14342373667503024643.bin' '-w' '/tmp/graph14342373667503024643.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14342373667503024643.bin' '-l' '-1' '-v' '-w' '/tmp/graph14342373667503024643.weights' '-q' '0' '-e' '0.001'
[2022-06-10 03:05:57] [INFO ] Decomposing Gal with order
[2022-06-10 03:05:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-10 03:05:59] [INFO ] Removed a total of 49390 redundant transitions.
[2022-06-10 03:05:59] [INFO ] Flatten gal took : 1691 ms
[2022-06-10 03:06:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 579 ms.
[2022-06-10 03:06:00] [INFO ] Time to serialize gal into /tmp/LTL15431351791972361799.gal : 89 ms
[2022-06-10 03:06:00] [INFO ] Time to serialize properties into /tmp/LTL8979019493288729224.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/LTL15431351791972361799.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8979019493288729224.ltl' '-c' '-stutter-deadlock'
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/LTL1543135...246
Read 1 LTL properties
Checking formula 0 : !((F("(((((u0.p30==1)&&(u1.p66==1))&&((u2.p102==1)&&(u3.p138==1)))&&(((u4.p174==1)&&(u5.p210==1))&&((u6.p246==1)&&(u7.p282==1))))&&(((...219
Formula 0 simplified : !F"(((((u0.p30==1)&&(u1.p66==1))&&((u2.p102==1)&&(u3.p138==1)))&&(((u4.p174==1)&&(u5.p210==1))&&((u6.p246==1)&&(u7.p282==1))))&&(((u...215
Reverse transition relation is NOT exact ! Due to transitions u0.t58, u0.t8503, u1.t53, u1.t8501, u2.t48, u2.t8499, u3.t43, u3.t8497, u4.t38, u4.t8495, u5....382
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
270 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,3.49439,52056,1,0,10746,123,38157,1605,139,236,43745
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA StigmergyCommit-PT-11a-LTLFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property StigmergyCommit-PT-11a-LTLFireability-07 finished in 154109 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(p0)))'
Support contains 12 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 8505/8505 transitions.
Applied a total of 0 rules in 44 ms. Remains 243 /243 variables (removed 0) and now considering 8505/8505 (removed 0) transitions.
[2022-06-10 03:06:04] [INFO ] Flow matrix only has 8492 transitions (discarded 13 similar events)
// Phase 1: matrix 8492 rows 243 cols
[2022-06-10 03:06:04] [INFO ] Computed 2 place invariants in 34 ms
[2022-06-10 03:06:04] [INFO ] Implicit Places using invariants in 301 ms returned []
[2022-06-10 03:06:04] [INFO ] Flow matrix only has 8492 transitions (discarded 13 similar events)
// Phase 1: matrix 8492 rows 243 cols
[2022-06-10 03:06:04] [INFO ] Computed 2 place invariants in 34 ms
[2022-06-10 03:06:05] [INFO ] Implicit Places using invariants and state equation in 1569 ms returned []
Implicit Place search using SMT with State Equation took 1875 ms to find 0 implicit places.
[2022-06-10 03:06:05] [INFO ] Flow matrix only has 8492 transitions (discarded 13 similar events)
// Phase 1: matrix 8492 rows 243 cols
[2022-06-10 03:06:05] [INFO ] Computed 2 place invariants in 33 ms
[2022-06-10 03:06:12] [INFO ] Dead Transitions using invariants and state equation in 6221 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 243/243 places, 8505/8505 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-11a-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s15 1) (EQ s35 1) (EQ s55 1) (EQ s75 1) (EQ s95 1) (EQ s115 1) (EQ s135 1) (EQ s155 1) (EQ s175 1) (EQ s195 1) (EQ s215 1) (EQ s235 1))], 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][false, false]]
Product exploration explored 100000 steps with 1315 reset in 5184 ms.
Product exploration explored 100000 steps with 1315 reset in 5169 ms.
Computed a total of 74 stabilizing places and 73 stable transitions
Computed a total of 74 stabilizing places and 73 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 132 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Finished random walk after 75 steps, including 0 resets, run visited all 1 properties in 11 ms. (steps per millisecond=6 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 184 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
[2022-06-10 03:06:23] [INFO ] Flow matrix only has 8492 transitions (discarded 13 similar events)
// Phase 1: matrix 8492 rows 243 cols
[2022-06-10 03:06:23] [INFO ] Computed 2 place invariants in 54 ms
[2022-06-10 03:06:34] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2022-06-10 03:06:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-10 03:06:37] [INFO ] [Real]Absence check using state equation in 3018 ms returned sat
[2022-06-10 03:06:38] [INFO ] Solution in real domain found non-integer solution.
[2022-06-10 03:06:48] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2022-06-10 03:06:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-10 03:06:51] [INFO ] [Nat]Absence check using state equation in 3003 ms returned sat
[2022-06-10 03:06:53] [INFO ] State equation strengthened by 8297 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:910)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:521)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:686)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:652)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:348)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:322)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:78)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:686)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-06-10 03:06:53] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Support contains 12 out of 243 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 243/243 places, 8505/8505 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 121 rules applied. Total rules applied 121 place count 241 transition count 8384
Reduce places removed 120 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 155 rules applied. Total rules applied 276 place count 121 transition count 8349
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 300 place count 109 transition count 8337
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 300 place count 109 transition count 8326
Deduced a syphon composed of 11 places in 3 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 322 place count 98 transition count 8326
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 345 place count 75 transition count 8303
Iterating global reduction 3 with 23 rules applied. Total rules applied 368 place count 75 transition count 8303
Ensure Unique test removed 4095 transitions
Reduce isomorphic transitions removed 4095 transitions.
Iterating post reduction 3 with 4095 rules applied. Total rules applied 4463 place count 75 transition count 4208
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 12 Pre rules applied. Total rules applied 4463 place count 75 transition count 4196
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 4487 place count 63 transition count 4196
Performed 13 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 4513 place count 50 transition count 4182
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 4 with 12 rules applied. Total rules applied 4525 place count 50 transition count 4170
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 4549 place count 38 transition count 4158
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 4550 place count 37 transition count 4157
Applied a total of 4550 rules in 13526 ms. Remains 37 /243 variables (removed 206) and now considering 4157/8505 (removed 4348) transitions.
[2022-06-10 03:07:06] [INFO ] Flow matrix only has 4144 transitions (discarded 13 similar events)
// Phase 1: matrix 4144 rows 37 cols
[2022-06-10 03:07:06] [INFO ] Computed 1 place invariants in 12 ms
[2022-06-10 03:07:06] [INFO ] Implicit Places using invariants in 53 ms returned []
[2022-06-10 03:07:06] [INFO ] Flow matrix only has 4144 transitions (discarded 13 similar events)
// Phase 1: matrix 4144 rows 37 cols
[2022-06-10 03:07:06] [INFO ] Computed 1 place invariants in 18 ms
[2022-06-10 03:07:07] [INFO ] Implicit Places using invariants and state equation in 896 ms returned []
Implicit Place search using SMT with State Equation took 953 ms to find 0 implicit places.
[2022-06-10 03:07:09] [INFO ] Redundant transitions in 1745 ms returned []
[2022-06-10 03:07:09] [INFO ] Flow matrix only has 4144 transitions (discarded 13 similar events)
// Phase 1: matrix 4144 rows 37 cols
[2022-06-10 03:07:09] [INFO ] Computed 1 place invariants in 12 ms
[2022-06-10 03:07:12] [INFO ] Dead Transitions using invariants and state equation in 3452 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 37/243 places, 4157/8505 transitions.
Finished structural reductions, in 1 iterations. Remains : 37/243 places, 4157/8505 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 110 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Finished random walk after 12 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=3 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 126 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
[2022-06-10 03:07:13] [INFO ] Flow matrix only has 4144 transitions (discarded 13 similar events)
// Phase 1: matrix 4144 rows 37 cols
[2022-06-10 03:07:13] [INFO ] Computed 1 place invariants in 11 ms
[2022-06-10 03:07:18] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2022-06-10 03:07:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-10 03:07:19] [INFO ] [Real]Absence check using state equation in 1114 ms returned sat
[2022-06-10 03:07:19] [INFO ] State equation strengthened by 4119 read => feed constraints.
[2022-06-10 03:07:20] [INFO ] [Real]Added 4119 Read/Feed constraints in 957 ms returned sat
[2022-06-10 03:07:20] [INFO ] Solution in real domain found non-integer solution.
[2022-06-10 03:07:25] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2022-06-10 03:07:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-10 03:07:26] [INFO ] [Nat]Absence check using state equation in 1081 ms returned sat
[2022-06-10 03:07:27] [INFO ] [Nat]Added 4119 Read/Feed constraints in 745 ms returned sat
[2022-06-10 03:07:28] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 4132 transitions) in 1150 ms.
[2022-06-10 03:07:28] [INFO ] Added : 0 causal constraints over 0 iterations in 1672 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Product exploration timeout after 64200 steps with 4938 reset in 10001 ms.
Product exploration timeout after 66160 steps with 5089 reset in 10002 ms.
Built C files in :
/tmp/ltsmin7722815173168017704
[2022-06-10 03:07:48] [INFO ] Too many transitions (4157) to apply POR reductions. Disabling POR matrices.
[2022-06-10 03:07:49] [INFO ] Built C files in 85ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7722815173168017704
Running compilation step : cd /tmp/ltsmin7722815173168017704;'/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/ltsmin7722815173168017704;'/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/ltsmin7722815173168017704;'/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 12 out of 37 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 37/37 places, 4157/4157 transitions.
Applied a total of 0 rules in 4090 ms. Remains 37 /37 variables (removed 0) and now considering 4157/4157 (removed 0) transitions.
[2022-06-10 03:07:56] [INFO ] Flow matrix only has 4144 transitions (discarded 13 similar events)
// Phase 1: matrix 4144 rows 37 cols
[2022-06-10 03:07:56] [INFO ] Computed 1 place invariants in 12 ms
[2022-06-10 03:07:56] [INFO ] Implicit Places using invariants in 46 ms returned []
[2022-06-10 03:07:56] [INFO ] Flow matrix only has 4144 transitions (discarded 13 similar events)
// Phase 1: matrix 4144 rows 37 cols
[2022-06-10 03:07:56] [INFO ] Computed 1 place invariants in 12 ms
[2022-06-10 03:07:56] [INFO ] Implicit Places using invariants and state equation in 652 ms returned []
Implicit Place search using SMT with State Equation took 699 ms to find 0 implicit places.
[2022-06-10 03:07:58] [INFO ] Redundant transitions in 1593 ms returned []
[2022-06-10 03:07:58] [INFO ] Flow matrix only has 4144 transitions (discarded 13 similar events)
// Phase 1: matrix 4144 rows 37 cols
[2022-06-10 03:07:58] [INFO ] Computed 1 place invariants in 13 ms
[2022-06-10 03:08:02] [INFO ] Dead Transitions using invariants and state equation in 3624 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 37/37 places, 4157/4157 transitions.
Built C files in :
/tmp/ltsmin6169473903770887379
[2022-06-10 03:08:02] [INFO ] Too many transitions (4157) to apply POR reductions. Disabling POR matrices.
[2022-06-10 03:08:02] [INFO ] Built C files in 135ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6169473903770887379
Running compilation step : cd /tmp/ltsmin6169473903770887379;'/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/ltsmin6169473903770887379;'/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/ltsmin6169473903770887379;'/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-06-10 03:08:06] [INFO ] Flatten gal took : 411 ms
[2022-06-10 03:08:06] [INFO ] Flatten gal took : 409 ms
[2022-06-10 03:08:07] [INFO ] Time to serialize gal into /tmp/LTL14326839501352882500.gal : 61 ms
[2022-06-10 03:08:07] [INFO ] Time to serialize properties into /tmp/LTL3851508035955897323.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/LTL14326839501352882500.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3851508035955897323.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/LTL1432683...267
Read 1 LTL properties
Checking formula 0 : !((F(X("(((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(((p174==1)&&(p210==1))&&((p246==1)&&(p282==1))))&&(((p318==1)&&(p354==1))&&...184
Formula 0 simplified : !FX"(((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(((p174==1)&&(p210==1))&&((p246==1)&&(p282==1))))&&(((p318==1)&&(p354==1))&&((...178
Detected timeout of ITS tools.
[2022-06-10 03:08:22] [INFO ] Flatten gal took : 413 ms
[2022-06-10 03:08:22] [INFO ] Applying decomposition
[2022-06-10 03:08:22] [INFO ] Flatten gal took : 406 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/graph760810227301169070.txt' '-o' '/tmp/graph760810227301169070.bin' '-w' '/tmp/graph760810227301169070.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph760810227301169070.bin' '-l' '-1' '-v' '-w' '/tmp/graph760810227301169070.weights' '-q' '0' '-e' '0.001'
[2022-06-10 03:08:24] [INFO ] Decomposing Gal with order
[2022-06-10 03:08:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-10 03:08:26] [INFO ] Removed a total of 49391 redundant transitions.
[2022-06-10 03:08:26] [INFO ] Flatten gal took : 1116 ms
[2022-06-10 03:08:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 425 ms.
[2022-06-10 03:08:26] [INFO ] Time to serialize gal into /tmp/LTL15477820339368366678.gal : 36 ms
[2022-06-10 03:08:26] [INFO ] Time to serialize properties into /tmp/LTL2737557375614423441.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/LTL15477820339368366678.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2737557375614423441.ltl' '-c' '-stutter-deadlock'
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/LTL1547782...246
Read 1 LTL properties
Checking formula 0 : !((F(X("(((((u0.p30==1)&&(u1.p66==1))&&((u2.p102==1)&&(u3.p138==1)))&&(((u4.p174==1)&&(u5.p210==1))&&((u6.p246==1)&&(u7.p282==1))))&&(...222
Formula 0 simplified : !FX"(((((u0.p30==1)&&(u1.p66==1))&&((u2.p102==1)&&(u3.p138==1)))&&(((u4.p174==1)&&(u5.p210==1))&&((u6.p246==1)&&(u7.p282==1))))&&(((...216
Reverse transition relation is NOT exact ! Due to transitions u0.t58, u0.t8503, u1.t53, u1.t8501, u2.t48, u2.t8499, u3.t43, u3.t8497, u4.t38, u4.t8495, u5....382
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
237 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,3.116,52796,1,0,10802,122,38156,1695,138,240,43857
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA StigmergyCommit-PT-11a-LTLFireability-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property StigmergyCommit-PT-11a-LTLFireability-08 finished in 145951 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((G(p1)||p0))||G((X(p2)&&X(p1))))))'
Support contains 12 out of 243 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 243/243 places, 8505/8505 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 121 rules applied. Total rules applied 121 place count 241 transition count 8384
Reduce places removed 120 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 155 rules applied. Total rules applied 276 place count 121 transition count 8349
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 300 place count 109 transition count 8337
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 300 place count 109 transition count 8326
Deduced a syphon composed of 11 places in 3 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 322 place count 98 transition count 8326
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 345 place count 75 transition count 8303
Iterating global reduction 3 with 23 rules applied. Total rules applied 368 place count 75 transition count 8303
Ensure Unique test removed 4095 transitions
Reduce isomorphic transitions removed 4095 transitions.
Iterating post reduction 3 with 4095 rules applied. Total rules applied 4463 place count 75 transition count 4208
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 12 Pre rules applied. Total rules applied 4463 place count 75 transition count 4196
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 4487 place count 63 transition count 4196
Performed 13 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 4513 place count 50 transition count 4182
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 4 with 12 rules applied. Total rules applied 4525 place count 50 transition count 4170
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 4549 place count 38 transition count 4158
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 4550 place count 37 transition count 4157
Applied a total of 4550 rules in 12806 ms. Remains 37 /243 variables (removed 206) and now considering 4157/8505 (removed 4348) transitions.
[2022-06-10 03:08:42] [INFO ] Flow matrix only has 4144 transitions (discarded 13 similar events)
// Phase 1: matrix 4144 rows 37 cols
[2022-06-10 03:08:42] [INFO ] Computed 1 place invariants in 12 ms
[2022-06-10 03:08:42] [INFO ] Implicit Places using invariants in 46 ms returned []
[2022-06-10 03:08:42] [INFO ] Flow matrix only has 4144 transitions (discarded 13 similar events)
// Phase 1: matrix 4144 rows 37 cols
[2022-06-10 03:08:42] [INFO ] Computed 1 place invariants in 12 ms
[2022-06-10 03:08:43] [INFO ] State equation strengthened by 4119 read => feed constraints.
[2022-06-10 03:08:44] [INFO ] Implicit Places using invariants and state equation in 1658 ms returned []
Implicit Place search using SMT with State Equation took 1711 ms to find 0 implicit places.
[2022-06-10 03:08:46] [INFO ] Redundant transitions in 1814 ms returned []
[2022-06-10 03:08:46] [INFO ] Flow matrix only has 4144 transitions (discarded 13 similar events)
// Phase 1: matrix 4144 rows 37 cols
[2022-06-10 03:08:46] [INFO ] Computed 1 place invariants in 14 ms
[2022-06-10 03:08:48] [INFO ] Dead Transitions using invariants and state equation in 2573 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 37/243 places, 4157/8505 transitions.
Finished structural reductions, in 1 iterations. Remains : 37/243 places, 4157/8505 transitions.
Stuttering acceptance computed with spot in 57 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : StigmergyCommit-PT-11a-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p1:(AND (EQ s3 1) (EQ s6 1) (EQ s9 1) (EQ s12 1) (EQ s15 1) (EQ s18 1) (EQ s21 1) (EQ s24 1) (EQ s27 1) (EQ s30 1) (EQ s33 1) (EQ s36 1)), p0:(OR (EQ s3 0...], nbAcceptance=2, 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 0 reset in 1612 ms.
Stack based approach found an accepted trace after 21 steps with 0 reset with depth 22 and stack size 20 in 9 ms.
FORMULA StigmergyCommit-PT-11a-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property StigmergyCommit-PT-11a-LTLFireability-09 finished in 20633 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(!(X(X((G(p0) U F(X(F(X(G(p0)))))))) U p0)))'
Support contains 12 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 8505/8505 transitions.
Applied a total of 0 rules in 42 ms. Remains 243 /243 variables (removed 0) and now considering 8505/8505 (removed 0) transitions.
[2022-06-10 03:08:50] [INFO ] Flow matrix only has 8492 transitions (discarded 13 similar events)
// Phase 1: matrix 8492 rows 243 cols
[2022-06-10 03:08:50] [INFO ] Computed 2 place invariants in 32 ms
[2022-06-10 03:08:50] [INFO ] Implicit Places using invariants in 162 ms returned []
[2022-06-10 03:08:50] [INFO ] Flow matrix only has 8492 transitions (discarded 13 similar events)
// Phase 1: matrix 8492 rows 243 cols
[2022-06-10 03:08:50] [INFO ] Computed 2 place invariants in 33 ms
[2022-06-10 03:08:52] [INFO ] Implicit Places using invariants and state equation in 1299 ms returned []
Implicit Place search using SMT with State Equation took 1485 ms to find 0 implicit places.
[2022-06-10 03:08:52] [INFO ] Flow matrix only has 8492 transitions (discarded 13 similar events)
// Phase 1: matrix 8492 rows 243 cols
[2022-06-10 03:08:52] [INFO ] Computed 2 place invariants in 35 ms
[2022-06-10 03:08:59] [INFO ] Dead Transitions using invariants and state equation in 6944 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 243/243 places, 8505/8505 transitions.
Stuttering acceptance computed with spot in 157 ms :[p0, p0, true, p0, p0]
Running random walk in product with property : StigmergyCommit-PT-11a-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=p0, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s15 1) (EQ s35 1) (EQ s55 1) (EQ s75 1) (EQ s95 1) (EQ s115 1) (EQ s135 1) (EQ s155 1) (EQ s175 1) (EQ s195 1) (EQ s215 1) (EQ s235 1))], 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]]
Stuttering criterion allowed to conclude after 75 steps with 0 reset in 3 ms.
FORMULA StigmergyCommit-PT-11a-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-11a-LTLFireability-10 finished in 8683 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(((F(G(!G(p0))) U G(X(G(p0))))||F(p0)))))'
Support contains 12 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 8505/8505 transitions.
Applied a total of 0 rules in 42 ms. Remains 243 /243 variables (removed 0) and now considering 8505/8505 (removed 0) transitions.
[2022-06-10 03:08:59] [INFO ] Flow matrix only has 8492 transitions (discarded 13 similar events)
// Phase 1: matrix 8492 rows 243 cols
[2022-06-10 03:08:59] [INFO ] Computed 2 place invariants in 33 ms
[2022-06-10 03:08:59] [INFO ] Implicit Places using invariants in 184 ms returned []
[2022-06-10 03:08:59] [INFO ] Flow matrix only has 8492 transitions (discarded 13 similar events)
// Phase 1: matrix 8492 rows 243 cols
[2022-06-10 03:08:59] [INFO ] Computed 2 place invariants in 43 ms
[2022-06-10 03:09:00] [INFO ] Implicit Places using invariants and state equation in 1403 ms returned []
Implicit Place search using SMT with State Equation took 1623 ms to find 0 implicit places.
[2022-06-10 03:09:00] [INFO ] Flow matrix only has 8492 transitions (discarded 13 similar events)
// Phase 1: matrix 8492 rows 243 cols
[2022-06-10 03:09:00] [INFO ] Computed 2 place invariants in 34 ms
[2022-06-10 03:09:07] [INFO ] Dead Transitions using invariants and state equation in 6189 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 243/243 places, 8505/8505 transitions.
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-11a-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s15 1) (EQ s35 1) (EQ s55 1) (EQ s75 1) (EQ s95 1) (EQ s115 1) (EQ s135 1) (EQ s155 1) (EQ s175 1) (EQ s195 1) (EQ s215 1) (EQ s235 1))], 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][false, false]]
Product exploration explored 100000 steps with 1315 reset in 5865 ms.
Product exploration explored 100000 steps with 1315 reset in 5475 ms.
Computed a total of 74 stabilizing places and 73 stable transitions
Computed a total of 74 stabilizing places and 73 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 146 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Finished random walk after 75 steps, including 0 resets, run visited all 1 properties in 9 ms. (steps per millisecond=8 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 171 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
[2022-06-10 03:09:19] [INFO ] Flow matrix only has 8492 transitions (discarded 13 similar events)
// Phase 1: matrix 8492 rows 243 cols
[2022-06-10 03:09:19] [INFO ] Computed 2 place invariants in 54 ms
[2022-06-10 03:09:30] [INFO ] [Real]Absence check using 2 positive place invariants in 7 ms returned sat
[2022-06-10 03:09:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-10 03:09:33] [INFO ] [Real]Absence check using state equation in 2868 ms returned sat
[2022-06-10 03:09:33] [INFO ] Solution in real domain found non-integer solution.
[2022-06-10 03:09:45] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned sat
[2022-06-10 03:09:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-10 03:09:48] [INFO ] [Nat]Absence check using state equation in 3317 ms returned sat
[2022-06-10 03:09:50] [INFO ] State equation strengthened by 8297 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:910)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:521)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:686)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:652)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:348)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:322)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:78)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:686)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-06-10 03:09:50] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Support contains 12 out of 243 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 243/243 places, 8505/8505 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 121 rules applied. Total rules applied 121 place count 241 transition count 8384
Reduce places removed 120 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 155 rules applied. Total rules applied 276 place count 121 transition count 8349
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 300 place count 109 transition count 8337
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 300 place count 109 transition count 8326
Deduced a syphon composed of 11 places in 3 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 322 place count 98 transition count 8326
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 345 place count 75 transition count 8303
Iterating global reduction 3 with 23 rules applied. Total rules applied 368 place count 75 transition count 8303
Ensure Unique test removed 4095 transitions
Reduce isomorphic transitions removed 4095 transitions.
Iterating post reduction 3 with 4095 rules applied. Total rules applied 4463 place count 75 transition count 4208
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 12 Pre rules applied. Total rules applied 4463 place count 75 transition count 4196
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 4487 place count 63 transition count 4196
Performed 13 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 4513 place count 50 transition count 4182
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 4 with 12 rules applied. Total rules applied 4525 place count 50 transition count 4170
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 4549 place count 38 transition count 4158
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 4550 place count 37 transition count 4157
Applied a total of 4550 rules in 12963 ms. Remains 37 /243 variables (removed 206) and now considering 4157/8505 (removed 4348) transitions.
[2022-06-10 03:10:03] [INFO ] Flow matrix only has 4144 transitions (discarded 13 similar events)
// Phase 1: matrix 4144 rows 37 cols
[2022-06-10 03:10:03] [INFO ] Computed 1 place invariants in 18 ms
[2022-06-10 03:10:03] [INFO ] Implicit Places using invariants in 56 ms returned []
[2022-06-10 03:10:03] [INFO ] Flow matrix only has 4144 transitions (discarded 13 similar events)
// Phase 1: matrix 4144 rows 37 cols
[2022-06-10 03:10:03] [INFO ] Computed 1 place invariants in 19 ms
[2022-06-10 03:10:04] [INFO ] Implicit Places using invariants and state equation in 729 ms returned []
Implicit Place search using SMT with State Equation took 792 ms to find 0 implicit places.
[2022-06-10 03:10:06] [INFO ] Redundant transitions in 1756 ms returned []
[2022-06-10 03:10:06] [INFO ] Flow matrix only has 4144 transitions (discarded 13 similar events)
// Phase 1: matrix 4144 rows 37 cols
[2022-06-10 03:10:06] [INFO ] Computed 1 place invariants in 24 ms
[2022-06-10 03:10:08] [INFO ] Dead Transitions using invariants and state equation in 2971 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 37/243 places, 4157/8505 transitions.
Finished structural reductions, in 1 iterations. Remains : 37/243 places, 4157/8505 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Finished random walk after 12 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=2 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 135 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
[2022-06-10 03:10:09] [INFO ] Flow matrix only has 4144 transitions (discarded 13 similar events)
// Phase 1: matrix 4144 rows 37 cols
[2022-06-10 03:10:09] [INFO ] Computed 1 place invariants in 17 ms
[2022-06-10 03:10:16] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2022-06-10 03:10:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-10 03:10:17] [INFO ] [Real]Absence check using state equation in 1226 ms returned sat
[2022-06-10 03:10:18] [INFO ] State equation strengthened by 4119 read => feed constraints.
[2022-06-10 03:10:19] [INFO ] [Real]Added 4119 Read/Feed constraints in 779 ms returned sat
[2022-06-10 03:10:19] [INFO ] Solution in real domain found non-integer solution.
[2022-06-10 03:10:25] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2022-06-10 03:10:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-10 03:10:26] [INFO ] [Nat]Absence check using state equation in 1020 ms returned sat
[2022-06-10 03:10:27] [INFO ] [Nat]Added 4119 Read/Feed constraints in 722 ms returned sat
[2022-06-10 03:10:29] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 4132 transitions) in 1889 ms.
[2022-06-10 03:10:29] [INFO ] Added : 0 causal constraints over 0 iterations in 2353 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Product exploration timeout after 62130 steps with 4779 reset in 10001 ms.
Product exploration timeout after 61770 steps with 4751 reset in 10001 ms.
Built C files in :
/tmp/ltsmin9154804839481784650
[2022-06-10 03:10:49] [INFO ] Too many transitions (4157) to apply POR reductions. Disabling POR matrices.
[2022-06-10 03:10:49] [INFO ] Built C files in 118ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9154804839481784650
Running compilation step : cd /tmp/ltsmin9154804839481784650;'/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/ltsmin9154804839481784650;'/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/ltsmin9154804839481784650;'/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 12 out of 37 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 37/37 places, 4157/4157 transitions.
Applied a total of 0 rules in 4340 ms. Remains 37 /37 variables (removed 0) and now considering 4157/4157 (removed 0) transitions.
[2022-06-10 03:10:57] [INFO ] Flow matrix only has 4144 transitions (discarded 13 similar events)
// Phase 1: matrix 4144 rows 37 cols
[2022-06-10 03:10:57] [INFO ] Computed 1 place invariants in 12 ms
[2022-06-10 03:10:57] [INFO ] Implicit Places using invariants in 40 ms returned []
[2022-06-10 03:10:57] [INFO ] Flow matrix only has 4144 transitions (discarded 13 similar events)
// Phase 1: matrix 4144 rows 37 cols
[2022-06-10 03:10:57] [INFO ] Computed 1 place invariants in 12 ms
[2022-06-10 03:10:57] [INFO ] Implicit Places using invariants and state equation in 645 ms returned []
Implicit Place search using SMT with State Equation took 687 ms to find 0 implicit places.
[2022-06-10 03:10:59] [INFO ] Redundant transitions in 1540 ms returned []
[2022-06-10 03:10:59] [INFO ] Flow matrix only has 4144 transitions (discarded 13 similar events)
// Phase 1: matrix 4144 rows 37 cols
[2022-06-10 03:10:59] [INFO ] Computed 1 place invariants in 11 ms
[2022-06-10 03:11:01] [INFO ] Dead Transitions using invariants and state equation in 2328 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 37/37 places, 4157/4157 transitions.
Built C files in :
/tmp/ltsmin109087147919272111
[2022-06-10 03:11:01] [INFO ] Too many transitions (4157) to apply POR reductions. Disabling POR matrices.
[2022-06-10 03:11:01] [INFO ] Built C files in 83ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin109087147919272111
Running compilation step : cd /tmp/ltsmin109087147919272111;'/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/ltsmin109087147919272111;'/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/ltsmin109087147919272111;'/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-06-10 03:11:05] [INFO ] Flatten gal took : 427 ms
[2022-06-10 03:11:06] [INFO ] Flatten gal took : 401 ms
[2022-06-10 03:11:06] [INFO ] Time to serialize gal into /tmp/LTL253616288979722480.gal : 60 ms
[2022-06-10 03:11:06] [INFO ] Time to serialize properties into /tmp/LTL1826694367030122252.ltl : 2 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/LTL253616288979722480.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1826694367030122252.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/LTL2536162...265
Read 1 LTL properties
Checking formula 0 : !((X(F(((F(G(!(G("(((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(((p174==1)&&(p210==1))&&((p246==1)&&(p282==1))))&&(((p318==1)&&(p...523
Formula 0 simplified : !XF((FG!G"(((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(((p174==1)&&(p210==1))&&((p246==1)&&(p282==1))))&&(((p318==1)&&(p354==1...500
Detected timeout of ITS tools.
[2022-06-10 03:11:21] [INFO ] Flatten gal took : 418 ms
[2022-06-10 03:11:21] [INFO ] Applying decomposition
[2022-06-10 03:11:22] [INFO ] Flatten gal took : 405 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/graph1102590534134509677.txt' '-o' '/tmp/graph1102590534134509677.bin' '-w' '/tmp/graph1102590534134509677.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1102590534134509677.bin' '-l' '-1' '-v' '-w' '/tmp/graph1102590534134509677.weights' '-q' '0' '-e' '0.001'
[2022-06-10 03:11:23] [INFO ] Decomposing Gal with order
[2022-06-10 03:11:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-10 03:11:25] [INFO ] Removed a total of 49391 redundant transitions.
[2022-06-10 03:11:25] [INFO ] Flatten gal took : 958 ms
[2022-06-10 03:11:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 314 ms.
[2022-06-10 03:11:26] [INFO ] Time to serialize gal into /tmp/LTL2107934527391676321.gal : 383 ms
[2022-06-10 03:11:26] [INFO ] Time to serialize properties into /tmp/LTL8427974258306872085.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/LTL2107934527391676321.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8427974258306872085.ltl' '-c' '-stutter-deadlock'
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/LTL2107934...245
Read 1 LTL properties
Checking formula 0 : !((X(F(((F(G(!(G("(((((u0.p30==1)&&(u1.p66==1))&&((u2.p102==1)&&(u3.p138==1)))&&(((u4.p174==1)&&(u5.p210==1))&&((u6.p246==1)&&(u7.p282...637
Formula 0 simplified : !XF((FG!G"(((((u0.p30==1)&&(u1.p66==1))&&((u2.p102==1)&&(u3.p138==1)))&&(((u4.p174==1)&&(u5.p210==1))&&((u6.p246==1)&&(u7.p282==1)))...614
Reverse transition relation is NOT exact ! Due to transitions u0.t58, u0.t8503, u1.t53, u1.t8501, u2.t48, u2.t8499, u3.t43, u3.t8497, u4.t38, u4.t8495, u5....382
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
253 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,3.4263,51580,1,0,10813,123,38156,1694,138,240,43857
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA StigmergyCommit-PT-11a-LTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property StigmergyCommit-PT-11a-LTLFireability-11 finished in 150389 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X((p0 U !p0))))'
Support contains 12 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 8505/8505 transitions.
Applied a total of 0 rules in 44 ms. Remains 243 /243 variables (removed 0) and now considering 8505/8505 (removed 0) transitions.
[2022-06-10 03:11:29] [INFO ] Flow matrix only has 8492 transitions (discarded 13 similar events)
// Phase 1: matrix 8492 rows 243 cols
[2022-06-10 03:11:29] [INFO ] Computed 2 place invariants in 59 ms
[2022-06-10 03:11:29] [INFO ] Implicit Places using invariants in 225 ms returned []
[2022-06-10 03:11:29] [INFO ] Flow matrix only has 8492 transitions (discarded 13 similar events)
// Phase 1: matrix 8492 rows 243 cols
[2022-06-10 03:11:29] [INFO ] Computed 2 place invariants in 54 ms
[2022-06-10 03:11:31] [INFO ] Implicit Places using invariants and state equation in 1754 ms returned []
Implicit Place search using SMT with State Equation took 1992 ms to find 0 implicit places.
[2022-06-10 03:11:31] [INFO ] Flow matrix only has 8492 transitions (discarded 13 similar events)
// Phase 1: matrix 8492 rows 243 cols
[2022-06-10 03:11:31] [INFO ] Computed 2 place invariants in 33 ms
[2022-06-10 03:11:38] [INFO ] Dead Transitions using invariants and state equation in 7213 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 243/243 places, 8505/8505 transitions.
Stuttering acceptance computed with spot in 70 ms :[p0, p0]
Running random walk in product with property : StigmergyCommit-PT-11a-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s15 1) (EQ s35 1) (EQ s55 1) (EQ s75 1) (EQ s95 1) (EQ s115 1) (EQ s135 1) (EQ s155 1) (EQ s175 1) (EQ s195 1) (EQ s215 1) (EQ s235 1))], 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][false, false]]
Product exploration explored 100000 steps with 50000 reset in 1258 ms.
Product exploration explored 100000 steps with 50000 reset in 1159 ms.
Computed a total of 74 stabilizing places and 73 stable transitions
Computed a total of 74 stabilizing places and 73 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT p0))
Knowledge based reduction with 3 factoid took 67 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA StigmergyCommit-PT-11a-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyCommit-PT-11a-LTLFireability-14 finished in 11949 ms.
All properties solved by simple procedures.
Total runtime 583906 ms.
BK_STOP 1654830701737
--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ 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 LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@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="StigmergyCommit-PT-11a"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is StigmergyCommit-PT-11a, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r294-smll-165463872600236"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/StigmergyCommit-PT-11a.tgz
mv StigmergyCommit-PT-11a execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;