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.r222-tall-165286025300491.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 ShieldPPPs-PT-040B, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r222-tall-165286025300491
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 928K
-rw-r--r-- 1 mcc users 5.9K Apr 30 03:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Apr 30 03:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 30 03:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 30 03:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 9 08:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 08:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 9 08:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 08:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 708K May 10 09:34 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldPPPs-PT-040B-LTLCardinality-00
FORMULA_NAME ShieldPPPs-PT-040B-LTLCardinality-01
FORMULA_NAME ShieldPPPs-PT-040B-LTLCardinality-02
FORMULA_NAME ShieldPPPs-PT-040B-LTLCardinality-03
FORMULA_NAME ShieldPPPs-PT-040B-LTLCardinality-04
FORMULA_NAME ShieldPPPs-PT-040B-LTLCardinality-05
FORMULA_NAME ShieldPPPs-PT-040B-LTLCardinality-06
FORMULA_NAME ShieldPPPs-PT-040B-LTLCardinality-07
FORMULA_NAME ShieldPPPs-PT-040B-LTLCardinality-08
FORMULA_NAME ShieldPPPs-PT-040B-LTLCardinality-09
FORMULA_NAME ShieldPPPs-PT-040B-LTLCardinality-10
FORMULA_NAME ShieldPPPs-PT-040B-LTLCardinality-11
FORMULA_NAME ShieldPPPs-PT-040B-LTLCardinality-12
FORMULA_NAME ShieldPPPs-PT-040B-LTLCardinality-13
FORMULA_NAME ShieldPPPs-PT-040B-LTLCardinality-14
FORMULA_NAME ShieldPPPs-PT-040B-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1653002361710

Running Version 202205111006
[2022-05-19 23:19:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-19 23:19:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 23:19:23] [INFO ] Load time of PNML (sax parser for PT used): 183 ms
[2022-05-19 23:19:23] [INFO ] Transformed 2723 places.
[2022-05-19 23:19:23] [INFO ] Transformed 2523 transitions.
[2022-05-19 23:19:23] [INFO ] Found NUPN structural information;
[2022-05-19 23:19:23] [INFO ] Parsed PT model containing 2723 places and 2523 transitions in 398 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ShieldPPPs-PT-040B-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-040B-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-040B-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-040B-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-040B-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-040B-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-040B-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-040B-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-040B-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 21 out of 2723 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2723/2723 places, 2523/2523 transitions.
Discarding 276 places :
Symmetric choice reduction at 0 with 276 rule applications. Total rules 276 place count 2447 transition count 2247
Iterating global reduction 0 with 276 rules applied. Total rules applied 552 place count 2447 transition count 2247
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 553 place count 2446 transition count 2246
Iterating global reduction 0 with 1 rules applied. Total rules applied 554 place count 2446 transition count 2246
Applied a total of 554 rules in 884 ms. Remains 2446 /2723 variables (removed 277) and now considering 2246/2523 (removed 277) transitions.
// Phase 1: matrix 2246 rows 2446 cols
[2022-05-19 23:19:24] [INFO ] Computed 441 place invariants in 41 ms
[2022-05-19 23:19:25] [INFO ] Implicit Places using invariants in 1053 ms returned []
// Phase 1: matrix 2246 rows 2446 cols
[2022-05-19 23:19:25] [INFO ] Computed 441 place invariants in 13 ms
[2022-05-19 23:19:27] [INFO ] Implicit Places using invariants and state equation in 2553 ms returned []
Implicit Place search using SMT with State Equation took 3637 ms to find 0 implicit places.
// Phase 1: matrix 2246 rows 2446 cols
[2022-05-19 23:19:27] [INFO ] Computed 441 place invariants in 15 ms
[2022-05-19 23:19:29] [INFO ] Dead Transitions using invariants and state equation in 1360 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2446/2723 places, 2246/2523 transitions.
Finished structural reductions, in 1 iterations. Remains : 2446/2723 places, 2246/2523 transitions.
Support contains 21 out of 2446 places after structural reductions.
[2022-05-19 23:19:29] [INFO ] Flatten gal took : 189 ms
[2022-05-19 23:19:29] [INFO ] Flatten gal took : 107 ms
[2022-05-19 23:19:30] [INFO ] Input system was already deterministic with 2246 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 399 ms. (steps per millisecond=25 ) properties (out of 12) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2246 rows 2446 cols
[2022-05-19 23:19:30] [INFO ] Computed 441 place invariants in 14 ms
[2022-05-19 23:19:30] [INFO ] After 367ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-19 23:19:31] [INFO ] [Nat]Absence check using 441 positive place invariants in 160 ms returned sat
[2022-05-19 23:19:32] [INFO ] After 1206ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-19 23:19:33] [INFO ] Deduced a trap composed of 21 places in 512 ms of which 25 ms to minimize.
[2022-05-19 23:19:33] [INFO ] Deduced a trap composed of 19 places in 524 ms of which 2 ms to minimize.
[2022-05-19 23:19:34] [INFO ] Deduced a trap composed of 26 places in 496 ms of which 2 ms to minimize.
[2022-05-19 23:19:35] [INFO ] Deduced a trap composed of 28 places in 504 ms of which 3 ms to minimize.
[2022-05-19 23:19:35] [INFO ] Deduced a trap composed of 20 places in 499 ms of which 1 ms to minimize.
[2022-05-19 23:19:36] [INFO ] Deduced a trap composed of 17 places in 485 ms of which 2 ms to minimize.
[2022-05-19 23:19:36] [INFO ] Deduced a trap composed of 23 places in 479 ms of which 2 ms to minimize.
[2022-05-19 23:19:37] [INFO ] Deduced a trap composed of 22 places in 483 ms of which 1 ms to minimize.
[2022-05-19 23:19:37] [INFO ] Deduced a trap composed of 11 places in 482 ms of which 1 ms to minimize.
[2022-05-19 23:19:38] [INFO ] Deduced a trap composed of 26 places in 467 ms of which 1 ms to minimize.
[2022-05-19 23:19:39] [INFO ] Deduced a trap composed of 21 places in 486 ms of which 1 ms to minimize.
[2022-05-19 23:19:39] [INFO ] Deduced a trap composed of 28 places in 484 ms of which 1 ms to minimize.
[2022-05-19 23:19:40] [INFO ] Deduced a trap composed of 31 places in 440 ms of which 1 ms to minimize.
[2022-05-19 23:19:40] [INFO ] Deduced a trap composed of 35 places in 418 ms of which 3 ms to minimize.
[2022-05-19 23:19:41] [INFO ] Deduced a trap composed of 24 places in 404 ms of which 1 ms to minimize.
[2022-05-19 23:19:41] [INFO ] Deduced a trap composed of 35 places in 380 ms of which 1 ms to minimize.
[2022-05-19 23:19:42] [INFO ] Deduced a trap composed of 19 places in 388 ms of which 2 ms to minimize.
[2022-05-19 23:19:42] [INFO ] Deduced a trap composed of 25 places in 396 ms of which 1 ms to minimize.
[2022-05-19 23:19:43] [INFO ] Deduced a trap composed of 30 places in 383 ms of which 1 ms to minimize.
[2022-05-19 23:19:43] [INFO ] Deduced a trap composed of 39 places in 397 ms of which 1 ms to minimize.
[2022-05-19 23:19:44] [INFO ] Deduced a trap composed of 45 places in 409 ms of which 1 ms to minimize.
[2022-05-19 23:19:44] [INFO ] Deduced a trap composed of 42 places in 386 ms of which 1 ms to minimize.
[2022-05-19 23:19:44] [INFO ] Deduced a trap composed of 33 places in 380 ms of which 1 ms to minimize.
[2022-05-19 23:19:45] [INFO ] Deduced a trap composed of 34 places in 378 ms of which 1 ms to minimize.
[2022-05-19 23:19:45] [INFO ] Deduced a trap composed of 35 places in 394 ms of which 1 ms to minimize.
[2022-05-19 23:19:46] [INFO ] Deduced a trap composed of 42 places in 400 ms of which 2 ms to minimize.
[2022-05-19 23:19:46] [INFO ] Deduced a trap composed of 31 places in 413 ms of which 2 ms to minimize.
[2022-05-19 23:19:47] [INFO ] Deduced a trap composed of 59 places in 404 ms of which 1 ms to minimize.
[2022-05-19 23:19:47] [INFO ] Deduced a trap composed of 39 places in 405 ms of which 1 ms to minimize.
[2022-05-19 23:19:48] [INFO ] Deduced a trap composed of 33 places in 424 ms of which 1 ms to minimize.
[2022-05-19 23:19:48] [INFO ] Deduced a trap composed of 34 places in 386 ms of which 1 ms to minimize.
[2022-05-19 23:19:49] [INFO ] Deduced a trap composed of 30 places in 396 ms of which 1 ms to minimize.
[2022-05-19 23:19:49] [INFO ] Deduced a trap composed of 35 places in 384 ms of which 1 ms to minimize.
[2022-05-19 23:19:50] [INFO ] Deduced a trap composed of 42 places in 372 ms of which 4 ms to minimize.
[2022-05-19 23:19:50] [INFO ] Deduced a trap composed of 26 places in 370 ms of which 1 ms to minimize.
[2022-05-19 23:19:51] [INFO ] Deduced a trap composed of 32 places in 381 ms of which 1 ms to minimize.
[2022-05-19 23:19:51] [INFO ] Deduced a trap composed of 38 places in 353 ms of which 1 ms to minimize.
[2022-05-19 23:19:52] [INFO ] Deduced a trap composed of 71 places in 328 ms of which 1 ms to minimize.
[2022-05-19 23:19:52] [INFO ] Deduced a trap composed of 47 places in 295 ms of which 1 ms to minimize.
[2022-05-19 23:19:52] [INFO ] Deduced a trap composed of 47 places in 290 ms of which 1 ms to minimize.
[2022-05-19 23:19:53] [INFO ] Deduced a trap composed of 43 places in 266 ms of which 1 ms to minimize.
[2022-05-19 23:19:53] [INFO ] Deduced a trap composed of 44 places in 258 ms of which 1 ms to minimize.
[2022-05-19 23:19:53] [INFO ] Deduced a trap composed of 53 places in 253 ms of which 1 ms to minimize.
[2022-05-19 23:19:54] [INFO ] Deduced a trap composed of 55 places in 259 ms of which 1 ms to minimize.
[2022-05-19 23:19:54] [INFO ] Deduced a trap composed of 61 places in 252 ms of which 1 ms to minimize.
[2022-05-19 23:19:54] [INFO ] Deduced a trap composed of 42 places in 256 ms of which 1 ms to minimize.
[2022-05-19 23:19:55] [INFO ] Deduced a trap composed of 50 places in 252 ms of which 1 ms to minimize.
[2022-05-19 23:19:55] [INFO ] Deduced a trap composed of 62 places in 241 ms of which 0 ms to minimize.
[2022-05-19 23:19:55] [INFO ] Deduced a trap composed of 45 places in 219 ms of which 1 ms to minimize.
[2022-05-19 23:19:56] [INFO ] Deduced a trap composed of 49 places in 216 ms of which 1 ms to minimize.
[2022-05-19 23:19:56] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-19 23:19:56] [INFO ] After 25169ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 102 ms.
Support contains 4 out of 2446 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2446/2446 places, 2246/2246 transitions.
Drop transitions removed 281 transitions
Trivial Post-agglo rules discarded 281 transitions
Performed 281 trivial Post agglomeration. Transition count delta: 281
Iterating post reduction 0 with 281 rules applied. Total rules applied 281 place count 2446 transition count 1965
Reduce places removed 281 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 282 rules applied. Total rules applied 563 place count 2165 transition count 1964
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 564 place count 2164 transition count 1964
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 199 Pre rules applied. Total rules applied 564 place count 2164 transition count 1765
Deduced a syphon composed of 199 places in 3 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 3 with 398 rules applied. Total rules applied 962 place count 1965 transition count 1765
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 965 place count 1962 transition count 1762
Iterating global reduction 3 with 3 rules applied. Total rules applied 968 place count 1962 transition count 1762
Performed 719 Post agglomeration using F-continuation condition.Transition count delta: 719
Deduced a syphon composed of 719 places in 4 ms
Reduce places removed 719 places and 0 transitions.
Iterating global reduction 3 with 1438 rules applied. Total rules applied 2406 place count 1243 transition count 1043
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 355 times.
Drop transitions removed 355 transitions
Iterating global reduction 3 with 355 rules applied. Total rules applied 2761 place count 1243 transition count 1043
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2762 place count 1242 transition count 1042
Applied a total of 2762 rules in 633 ms. Remains 1242 /2446 variables (removed 1204) and now considering 1042/2246 (removed 1204) transitions.
Finished structural reductions, in 1 iterations. Remains : 1242/2446 places, 1042/2246 transitions.
Finished random walk after 2150 steps, including 0 resets, run visited all 2 properties in 38 ms. (steps per millisecond=56 )
Computed a total of 483 stabilizing places and 483 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 2 out of 2446 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2446/2446 places, 2246/2246 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 2442 transition count 2242
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 2442 transition count 2242
Applied a total of 8 rules in 504 ms. Remains 2442 /2446 variables (removed 4) and now considering 2242/2246 (removed 4) transitions.
// Phase 1: matrix 2242 rows 2442 cols
[2022-05-19 23:19:57] [INFO ] Computed 441 place invariants in 7 ms
[2022-05-19 23:19:58] [INFO ] Implicit Places using invariants in 1066 ms returned []
// Phase 1: matrix 2242 rows 2442 cols
[2022-05-19 23:19:58] [INFO ] Computed 441 place invariants in 8 ms
[2022-05-19 23:20:01] [INFO ] Implicit Places using invariants and state equation in 2414 ms returned []
Implicit Place search using SMT with State Equation took 3494 ms to find 0 implicit places.
// Phase 1: matrix 2242 rows 2442 cols
[2022-05-19 23:20:01] [INFO ] Computed 441 place invariants in 8 ms
[2022-05-19 23:20:02] [INFO ] Dead Transitions using invariants and state equation in 1401 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2442/2446 places, 2242/2246 transitions.
Finished structural reductions, in 1 iterations. Remains : 2442/2446 places, 2242/2246 transitions.
Stuttering acceptance computed with spot in 291 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-040B-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(AND (NEQ s1742 0) (NEQ s1362 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, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 2 ms.
FORMULA ShieldPPPs-PT-040B-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-040B-LTLCardinality-01 finished in 5781 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(F(G(X((X(F((G(p2)||p1)))&&p0)))))))'
Support contains 4 out of 2446 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2446/2446 places, 2246/2246 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 280 transitions
Trivial Post-agglo rules discarded 280 transitions
Performed 280 trivial Post agglomeration. Transition count delta: 280
Iterating post reduction 0 with 280 rules applied. Total rules applied 280 place count 2445 transition count 1965
Reduce places removed 280 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 281 rules applied. Total rules applied 561 place count 2165 transition count 1964
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 562 place count 2164 transition count 1964
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 199 Pre rules applied. Total rules applied 562 place count 2164 transition count 1765
Deduced a syphon composed of 199 places in 4 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 3 with 398 rules applied. Total rules applied 960 place count 1965 transition count 1765
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 963 place count 1962 transition count 1762
Iterating global reduction 3 with 3 rules applied. Total rules applied 966 place count 1962 transition count 1762
Performed 718 Post agglomeration using F-continuation condition.Transition count delta: 718
Deduced a syphon composed of 718 places in 1 ms
Reduce places removed 718 places and 0 transitions.
Iterating global reduction 3 with 1436 rules applied. Total rules applied 2402 place count 1244 transition count 1044
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2404 place count 1242 transition count 1042
Applied a total of 2404 rules in 495 ms. Remains 1242 /2446 variables (removed 1204) and now considering 1042/2246 (removed 1204) transitions.
// Phase 1: matrix 1042 rows 1242 cols
[2022-05-19 23:20:03] [INFO ] Computed 441 place invariants in 3 ms
[2022-05-19 23:20:03] [INFO ] Implicit Places using invariants in 516 ms returned []
// Phase 1: matrix 1042 rows 1242 cols
[2022-05-19 23:20:03] [INFO ] Computed 441 place invariants in 2 ms
[2022-05-19 23:20:05] [INFO ] Implicit Places using invariants and state equation in 1215 ms returned []
Implicit Place search using SMT with State Equation took 1741 ms to find 0 implicit places.
[2022-05-19 23:20:05] [INFO ] Redundant transitions in 69 ms returned []
// Phase 1: matrix 1042 rows 1242 cols
[2022-05-19 23:20:05] [INFO ] Computed 441 place invariants in 6 ms
[2022-05-19 23:20:05] [INFO ] Dead Transitions using invariants and state equation in 541 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1242/2446 places, 1042/2246 transitions.
Finished structural reductions, in 1 iterations. Remains : 1242/2446 places, 1042/2246 transitions.
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldPPPs-PT-040B-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s137 0) (EQ s1211 1)), p1:(OR (EQ s1171 0) (EQ s1100 1)), p2:(AND (EQ s1100 0) (EQ s1171 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 2605 steps with 0 reset in 50 ms.
FORMULA ShieldPPPs-PT-040B-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-040B-LTLCardinality-06 finished in 3043 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(F(p0)))))'
Support contains 1 out of 2446 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2446/2446 places, 2246/2246 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 282 transitions
Trivial Post-agglo rules discarded 282 transitions
Performed 282 trivial Post agglomeration. Transition count delta: 282
Iterating post reduction 0 with 282 rules applied. Total rules applied 282 place count 2445 transition count 1963
Reduce places removed 282 places and 0 transitions.
Iterating post reduction 1 with 282 rules applied. Total rules applied 564 place count 2163 transition count 1963
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 564 place count 2163 transition count 1763
Deduced a syphon composed of 200 places in 3 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 964 place count 1963 transition count 1763
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 968 place count 1959 transition count 1759
Iterating global reduction 2 with 4 rules applied. Total rules applied 972 place count 1959 transition count 1759
Performed 716 Post agglomeration using F-continuation condition.Transition count delta: 716
Deduced a syphon composed of 716 places in 1 ms
Reduce places removed 716 places and 0 transitions.
Iterating global reduction 2 with 1432 rules applied. Total rules applied 2404 place count 1243 transition count 1043
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 2406 place count 1241 transition count 1041
Applied a total of 2406 rules in 511 ms. Remains 1241 /2446 variables (removed 1205) and now considering 1041/2246 (removed 1205) transitions.
// Phase 1: matrix 1041 rows 1241 cols
[2022-05-19 23:20:06] [INFO ] Computed 441 place invariants in 3 ms
[2022-05-19 23:20:06] [INFO ] Implicit Places using invariants in 559 ms returned []
// Phase 1: matrix 1041 rows 1241 cols
[2022-05-19 23:20:06] [INFO ] Computed 441 place invariants in 7 ms
[2022-05-19 23:20:08] [INFO ] Implicit Places using invariants and state equation in 1221 ms returned []
Implicit Place search using SMT with State Equation took 1781 ms to find 0 implicit places.
[2022-05-19 23:20:08] [INFO ] Redundant transitions in 74 ms returned []
// Phase 1: matrix 1041 rows 1241 cols
[2022-05-19 23:20:08] [INFO ] Computed 441 place invariants in 4 ms
[2022-05-19 23:20:08] [INFO ] Dead Transitions using invariants and state equation in 540 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1241/2446 places, 1041/2246 transitions.
Finished structural reductions, in 1 iterations. Remains : 1241/2446 places, 1041/2246 transitions.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-040B-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s633 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 29245 steps with 20 reset in 282 ms.
FORMULA ShieldPPPs-PT-040B-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-040B-LTLCardinality-07 finished in 3281 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0) U X(G(p1)))))'
Support contains 5 out of 2446 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2446/2446 places, 2246/2246 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 2444 transition count 2244
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2444 transition count 2244
Applied a total of 4 rules in 309 ms. Remains 2444 /2446 variables (removed 2) and now considering 2244/2246 (removed 2) transitions.
// Phase 1: matrix 2244 rows 2444 cols
[2022-05-19 23:20:09] [INFO ] Computed 441 place invariants in 12 ms
[2022-05-19 23:20:10] [INFO ] Implicit Places using invariants in 828 ms returned []
// Phase 1: matrix 2244 rows 2444 cols
[2022-05-19 23:20:10] [INFO ] Computed 441 place invariants in 13 ms
[2022-05-19 23:20:12] [INFO ] Implicit Places using invariants and state equation in 2525 ms returned []
Implicit Place search using SMT with State Equation took 3358 ms to find 0 implicit places.
// Phase 1: matrix 2244 rows 2444 cols
[2022-05-19 23:20:12] [INFO ] Computed 441 place invariants in 7 ms
[2022-05-19 23:20:14] [INFO ] Dead Transitions using invariants and state equation in 1310 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2444/2446 places, 2244/2246 transitions.
Finished structural reductions, in 1 iterations. Remains : 2444/2446 places, 2244/2246 transitions.
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-040B-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(AND (OR (EQ s81 0) (EQ s1763 1)) (OR (EQ s852 0) (EQ s1739 1))), p1:(AND (NEQ s1825 1) (NOT (OR (EQ s852 0) (EQ s1739 1))))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 67258 steps with 11 reset in 645 ms.
FORMULA ShieldPPPs-PT-040B-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-040B-LTLCardinality-10 finished in 5763 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 2446 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2446/2446 places, 2246/2246 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 282 transitions
Trivial Post-agglo rules discarded 282 transitions
Performed 282 trivial Post agglomeration. Transition count delta: 282
Iterating post reduction 0 with 282 rules applied. Total rules applied 282 place count 2445 transition count 1963
Reduce places removed 282 places and 0 transitions.
Iterating post reduction 1 with 282 rules applied. Total rules applied 564 place count 2163 transition count 1963
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 564 place count 2163 transition count 1763
Deduced a syphon composed of 200 places in 3 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 964 place count 1963 transition count 1763
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 968 place count 1959 transition count 1759
Iterating global reduction 2 with 4 rules applied. Total rules applied 972 place count 1959 transition count 1759
Performed 717 Post agglomeration using F-continuation condition.Transition count delta: 717
Deduced a syphon composed of 717 places in 1 ms
Reduce places removed 717 places and 0 transitions.
Iterating global reduction 2 with 1434 rules applied. Total rules applied 2406 place count 1242 transition count 1042
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 2408 place count 1240 transition count 1040
Applied a total of 2408 rules in 437 ms. Remains 1240 /2446 variables (removed 1206) and now considering 1040/2246 (removed 1206) transitions.
// Phase 1: matrix 1040 rows 1240 cols
[2022-05-19 23:20:15] [INFO ] Computed 441 place invariants in 4 ms
[2022-05-19 23:20:15] [INFO ] Implicit Places using invariants in 564 ms returned []
// Phase 1: matrix 1040 rows 1240 cols
[2022-05-19 23:20:15] [INFO ] Computed 441 place invariants in 1 ms
[2022-05-19 23:20:17] [INFO ] Implicit Places using invariants and state equation in 1211 ms returned []
Implicit Place search using SMT with State Equation took 1780 ms to find 0 implicit places.
[2022-05-19 23:20:17] [INFO ] Redundant transitions in 17 ms returned []
// Phase 1: matrix 1040 rows 1240 cols
[2022-05-19 23:20:17] [INFO ] Computed 441 place invariants in 4 ms
[2022-05-19 23:20:17] [INFO ] Dead Transitions using invariants and state equation in 515 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1240/2446 places, 1040/2246 transitions.
Finished structural reductions, in 1 iterations. Remains : 1240/2446 places, 1040/2246 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-040B-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s527 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 2589 steps with 0 reset in 25 ms.
FORMULA ShieldPPPs-PT-040B-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-040B-LTLCardinality-11 finished in 2844 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(((p1 U F(!p1))&&p0))))'
Support contains 4 out of 2446 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2446/2446 places, 2246/2246 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 2443 transition count 2243
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 2443 transition count 2243
Applied a total of 6 rules in 285 ms. Remains 2443 /2446 variables (removed 3) and now considering 2243/2246 (removed 3) transitions.
// Phase 1: matrix 2243 rows 2443 cols
[2022-05-19 23:20:18] [INFO ] Computed 441 place invariants in 15 ms
[2022-05-19 23:20:18] [INFO ] Implicit Places using invariants in 805 ms returned []
// Phase 1: matrix 2243 rows 2443 cols
[2022-05-19 23:20:18] [INFO ] Computed 441 place invariants in 11 ms
[2022-05-19 23:20:21] [INFO ] Implicit Places using invariants and state equation in 2363 ms returned []
Implicit Place search using SMT with State Equation took 3170 ms to find 0 implicit places.
// Phase 1: matrix 2243 rows 2443 cols
[2022-05-19 23:20:21] [INFO ] Computed 441 place invariants in 12 ms
[2022-05-19 23:20:22] [INFO ] Dead Transitions using invariants and state equation in 1368 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2443/2446 places, 2243/2246 transitions.
Finished structural reductions, in 1 iterations. Remains : 2443/2446 places, 2243/2246 transitions.
Stuttering acceptance computed with spot in 134 ms :[(OR (NOT p0) p1), p1, (OR (NOT p0) p1)]
Running random walk in product with property : ShieldPPPs-PT-040B-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 1}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (EQ s775 0) (EQ s547 1)), p0:(AND (EQ s1334 0) (EQ s443 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, null][false, false, false]]
Product exploration explored 100000 steps with 93 reset in 640 ms.
Product exploration explored 100000 steps with 95 reset in 792 ms.
Computed a total of 480 stabilizing places and 480 stable transitions
Computed a total of 480 stabilizing places and 480 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X (NOT (AND p0 p1))), (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 245 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 102 ms :[(OR (NOT p0) p1), p1, (OR (NOT p0) p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2243 rows 2443 cols
[2022-05-19 23:20:24] [INFO ] Computed 441 place invariants in 12 ms
[2022-05-19 23:20:25] [INFO ] [Real]Absence check using 441 positive place invariants in 144 ms returned sat
[2022-05-19 23:20:25] [INFO ] After 469ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 23:20:25] [INFO ] [Nat]Absence check using 441 positive place invariants in 149 ms returned sat
[2022-05-19 23:20:26] [INFO ] After 1146ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 23:20:27] [INFO ] Deduced a trap composed of 18 places in 518 ms of which 2 ms to minimize.
[2022-05-19 23:20:27] [INFO ] Deduced a trap composed of 22 places in 493 ms of which 2 ms to minimize.
[2022-05-19 23:20:28] [INFO ] Deduced a trap composed of 26 places in 493 ms of which 1 ms to minimize.
[2022-05-19 23:20:29] [INFO ] Deduced a trap composed of 19 places in 485 ms of which 1 ms to minimize.
[2022-05-19 23:20:29] [INFO ] Deduced a trap composed of 30 places in 484 ms of which 2 ms to minimize.
[2022-05-19 23:20:30] [INFO ] Deduced a trap composed of 23 places in 493 ms of which 6 ms to minimize.
[2022-05-19 23:20:30] [INFO ] Deduced a trap composed of 22 places in 513 ms of which 1 ms to minimize.
[2022-05-19 23:20:31] [INFO ] Deduced a trap composed of 23 places in 481 ms of which 1 ms to minimize.
[2022-05-19 23:20:32] [INFO ] Deduced a trap composed of 25 places in 482 ms of which 1 ms to minimize.
[2022-05-19 23:20:32] [INFO ] Deduced a trap composed of 30 places in 475 ms of which 1 ms to minimize.
[2022-05-19 23:20:33] [INFO ] Deduced a trap composed of 32 places in 491 ms of which 1 ms to minimize.
[2022-05-19 23:20:33] [INFO ] Deduced a trap composed of 31 places in 449 ms of which 1 ms to minimize.
[2022-05-19 23:20:34] [INFO ] Deduced a trap composed of 28 places in 446 ms of which 1 ms to minimize.
[2022-05-19 23:20:34] [INFO ] Deduced a trap composed of 25 places in 421 ms of which 1 ms to minimize.
[2022-05-19 23:20:35] [INFO ] Deduced a trap composed of 24 places in 432 ms of which 2 ms to minimize.
[2022-05-19 23:20:35] [INFO ] Deduced a trap composed of 31 places in 425 ms of which 3 ms to minimize.
[2022-05-19 23:20:36] [INFO ] Deduced a trap composed of 21 places in 437 ms of which 3 ms to minimize.
[2022-05-19 23:20:36] [INFO ] Deduced a trap composed of 28 places in 431 ms of which 3 ms to minimize.
[2022-05-19 23:20:37] [INFO ] Deduced a trap composed of 33 places in 458 ms of which 2 ms to minimize.
[2022-05-19 23:20:37] [INFO ] Deduced a trap composed of 32 places in 412 ms of which 1 ms to minimize.
[2022-05-19 23:20:38] [INFO ] Deduced a trap composed of 19 places in 427 ms of which 1 ms to minimize.
[2022-05-19 23:20:38] [INFO ] Deduced a trap composed of 43 places in 385 ms of which 1 ms to minimize.
[2022-05-19 23:20:39] [INFO ] Deduced a trap composed of 34 places in 367 ms of which 1 ms to minimize.
[2022-05-19 23:20:39] [INFO ] Deduced a trap composed of 42 places in 379 ms of which 1 ms to minimize.
[2022-05-19 23:20:40] [INFO ] Deduced a trap composed of 38 places in 366 ms of which 1 ms to minimize.
[2022-05-19 23:20:40] [INFO ] Deduced a trap composed of 42 places in 392 ms of which 1 ms to minimize.
[2022-05-19 23:20:40] [INFO ] Deduced a trap composed of 34 places in 337 ms of which 1 ms to minimize.
[2022-05-19 23:20:41] [INFO ] Deduced a trap composed of 52 places in 316 ms of which 1 ms to minimize.
[2022-05-19 23:20:41] [INFO ] Deduced a trap composed of 46 places in 312 ms of which 1 ms to minimize.
[2022-05-19 23:20:42] [INFO ] Deduced a trap composed of 40 places in 302 ms of which 1 ms to minimize.
[2022-05-19 23:20:42] [INFO ] Deduced a trap composed of 43 places in 301 ms of which 1 ms to minimize.
[2022-05-19 23:20:42] [INFO ] Deduced a trap composed of 35 places in 311 ms of which 0 ms to minimize.
[2022-05-19 23:20:43] [INFO ] Deduced a trap composed of 42 places in 309 ms of which 1 ms to minimize.
[2022-05-19 23:20:43] [INFO ] Deduced a trap composed of 46 places in 287 ms of which 1 ms to minimize.
[2022-05-19 23:20:44] [INFO ] Deduced a trap composed of 41 places in 288 ms of which 1 ms to minimize.
[2022-05-19 23:20:44] [INFO ] Deduced a trap composed of 47 places in 291 ms of which 1 ms to minimize.
[2022-05-19 23:20:44] [INFO ] Deduced a trap composed of 42 places in 279 ms of which 0 ms to minimize.
[2022-05-19 23:20:45] [INFO ] Deduced a trap composed of 46 places in 265 ms of which 1 ms to minimize.
[2022-05-19 23:20:45] [INFO ] Deduced a trap composed of 52 places in 286 ms of which 1 ms to minimize.
[2022-05-19 23:20:45] [INFO ] Deduced a trap composed of 42 places in 261 ms of which 1 ms to minimize.
[2022-05-19 23:20:46] [INFO ] Deduced a trap composed of 64 places in 252 ms of which 1 ms to minimize.
[2022-05-19 23:20:46] [INFO ] Deduced a trap composed of 48 places in 273 ms of which 1 ms to minimize.
[2022-05-19 23:20:46] [INFO ] Deduced a trap composed of 41 places in 271 ms of which 0 ms to minimize.
[2022-05-19 23:20:47] [INFO ] Deduced a trap composed of 43 places in 250 ms of which 1 ms to minimize.
[2022-05-19 23:20:47] [INFO ] Deduced a trap composed of 43 places in 261 ms of which 1 ms to minimize.
[2022-05-19 23:20:47] [INFO ] Deduced a trap composed of 65 places in 268 ms of which 1 ms to minimize.
[2022-05-19 23:20:48] [INFO ] Deduced a trap composed of 43 places in 233 ms of which 1 ms to minimize.
[2022-05-19 23:20:48] [INFO ] Deduced a trap composed of 53 places in 273 ms of which 1 ms to minimize.
[2022-05-19 23:20:48] [INFO ] Deduced a trap composed of 41 places in 234 ms of which 1 ms to minimize.
[2022-05-19 23:20:49] [INFO ] Deduced a trap composed of 52 places in 222 ms of which 1 ms to minimize.
[2022-05-19 23:20:49] [INFO ] Deduced a trap composed of 50 places in 221 ms of which 1 ms to minimize.
[2022-05-19 23:20:49] [INFO ] Deduced a trap composed of 50 places in 216 ms of which 0 ms to minimize.
[2022-05-19 23:20:50] [INFO ] Deduced a trap composed of 52 places in 216 ms of which 1 ms to minimize.
[2022-05-19 23:20:50] [INFO ] Deduced a trap composed of 58 places in 191 ms of which 1 ms to minimize.
[2022-05-19 23:20:50] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-19 23:20:50] [INFO ] After 25187ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 21 ms.
Support contains 4 out of 2443 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2443/2443 places, 2243/2243 transitions.
Drop transitions removed 281 transitions
Trivial Post-agglo rules discarded 281 transitions
Performed 281 trivial Post agglomeration. Transition count delta: 281
Iterating post reduction 0 with 281 rules applied. Total rules applied 281 place count 2443 transition count 1962
Reduce places removed 281 places and 0 transitions.
Iterating post reduction 1 with 281 rules applied. Total rules applied 562 place count 2162 transition count 1962
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 562 place count 2162 transition count 1762
Deduced a syphon composed of 200 places in 3 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 962 place count 1962 transition count 1762
Performed 716 Post agglomeration using F-continuation condition.Transition count delta: 716
Deduced a syphon composed of 716 places in 1 ms
Reduce places removed 716 places and 0 transitions.
Iterating global reduction 2 with 1432 rules applied. Total rules applied 2394 place count 1246 transition count 1046
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 356 times.
Drop transitions removed 356 transitions
Iterating global reduction 2 with 356 rules applied. Total rules applied 2750 place count 1246 transition count 1046
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 2751 place count 1245 transition count 1045
Applied a total of 2751 rules in 377 ms. Remains 1245 /2443 variables (removed 1198) and now considering 1045/2243 (removed 1198) transitions.
Finished structural reductions, in 1 iterations. Remains : 1245/2443 places, 1045/2243 transitions.
Finished random walk after 6677 steps, including 2 resets, run visited all 1 properties in 75 ms. (steps per millisecond=89 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X (NOT (AND p0 p1))), (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F p0), (F (AND p0 p1))]
Knowledge based reduction with 6 factoid took 240 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p0) p1), p1, (OR (NOT p0) p1)]
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p0) p1), p1, (OR (NOT p0) p1)]
// Phase 1: matrix 2243 rows 2443 cols
[2022-05-19 23:20:51] [INFO ] Computed 441 place invariants in 14 ms
[2022-05-19 23:20:53] [INFO ] [Real]Absence check using 441 positive place invariants in 810 ms returned sat
[2022-05-19 23:20:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 23:21:06] [INFO ] [Real]Absence check using state equation in 12755 ms returned unknown
Could not prove EG (NOT p0)
// Phase 1: matrix 2243 rows 2443 cols
[2022-05-19 23:21:06] [INFO ] Computed 441 place invariants in 16 ms
[2022-05-19 23:21:08] [INFO ] [Real]Absence check using 441 positive place invariants in 829 ms returned sat
[2022-05-19 23:21:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 23:21:21] [INFO ] [Real]Absence check using state equation in 12745 ms returned unknown
Could not prove EG p1
Support contains 4 out of 2443 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2443/2443 places, 2243/2243 transitions.
Applied a total of 0 rules in 152 ms. Remains 2443 /2443 variables (removed 0) and now considering 2243/2243 (removed 0) transitions.
// Phase 1: matrix 2243 rows 2443 cols
[2022-05-19 23:21:21] [INFO ] Computed 441 place invariants in 13 ms
[2022-05-19 23:21:22] [INFO ] Implicit Places using invariants in 782 ms returned []
// Phase 1: matrix 2243 rows 2443 cols
[2022-05-19 23:21:22] [INFO ] Computed 441 place invariants in 6 ms
[2022-05-19 23:21:24] [INFO ] Implicit Places using invariants and state equation in 2177 ms returned []
Implicit Place search using SMT with State Equation took 2960 ms to find 0 implicit places.
// Phase 1: matrix 2243 rows 2443 cols
[2022-05-19 23:21:24] [INFO ] Computed 441 place invariants in 7 ms
[2022-05-19 23:21:25] [INFO ] Dead Transitions using invariants and state equation in 1317 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2443/2443 places, 2243/2243 transitions.
Computed a total of 480 stabilizing places and 480 stable transitions
Computed a total of 480 stabilizing places and 480 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X (NOT (AND p0 p1))), (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 220 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p0) p1), p1, (OR (NOT p0) p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2243 rows 2443 cols
[2022-05-19 23:21:26] [INFO ] Computed 441 place invariants in 13 ms
[2022-05-19 23:21:26] [INFO ] [Real]Absence check using 441 positive place invariants in 147 ms returned sat
[2022-05-19 23:21:26] [INFO ] After 448ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 23:21:27] [INFO ] [Nat]Absence check using 441 positive place invariants in 141 ms returned sat
[2022-05-19 23:21:28] [INFO ] After 1083ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 23:21:29] [INFO ] Deduced a trap composed of 18 places in 521 ms of which 1 ms to minimize.
[2022-05-19 23:21:29] [INFO ] Deduced a trap composed of 22 places in 502 ms of which 1 ms to minimize.
[2022-05-19 23:21:30] [INFO ] Deduced a trap composed of 26 places in 504 ms of which 2 ms to minimize.
[2022-05-19 23:21:30] [INFO ] Deduced a trap composed of 19 places in 500 ms of which 2 ms to minimize.
[2022-05-19 23:21:31] [INFO ] Deduced a trap composed of 30 places in 535 ms of which 1 ms to minimize.
[2022-05-19 23:21:32] [INFO ] Deduced a trap composed of 23 places in 526 ms of which 1 ms to minimize.
[2022-05-19 23:21:32] [INFO ] Deduced a trap composed of 22 places in 487 ms of which 1 ms to minimize.
[2022-05-19 23:21:33] [INFO ] Deduced a trap composed of 23 places in 495 ms of which 1 ms to minimize.
[2022-05-19 23:21:33] [INFO ] Deduced a trap composed of 25 places in 528 ms of which 1 ms to minimize.
[2022-05-19 23:21:34] [INFO ] Deduced a trap composed of 30 places in 499 ms of which 1 ms to minimize.
[2022-05-19 23:21:34] [INFO ] Deduced a trap composed of 32 places in 497 ms of which 2 ms to minimize.
[2022-05-19 23:21:35] [INFO ] Deduced a trap composed of 31 places in 483 ms of which 1 ms to minimize.
[2022-05-19 23:21:36] [INFO ] Deduced a trap composed of 28 places in 478 ms of which 2 ms to minimize.
[2022-05-19 23:21:36] [INFO ] Deduced a trap composed of 25 places in 472 ms of which 1 ms to minimize.
[2022-05-19 23:21:37] [INFO ] Deduced a trap composed of 24 places in 472 ms of which 1 ms to minimize.
[2022-05-19 23:21:37] [INFO ] Deduced a trap composed of 31 places in 441 ms of which 1 ms to minimize.
[2022-05-19 23:21:38] [INFO ] Deduced a trap composed of 21 places in 417 ms of which 1 ms to minimize.
[2022-05-19 23:21:38] [INFO ] Deduced a trap composed of 28 places in 421 ms of which 1 ms to minimize.
[2022-05-19 23:21:39] [INFO ] Deduced a trap composed of 33 places in 401 ms of which 1 ms to minimize.
[2022-05-19 23:21:39] [INFO ] Deduced a trap composed of 32 places in 398 ms of which 1 ms to minimize.
[2022-05-19 23:21:40] [INFO ] Deduced a trap composed of 19 places in 398 ms of which 1 ms to minimize.
[2022-05-19 23:21:40] [INFO ] Deduced a trap composed of 43 places in 383 ms of which 1 ms to minimize.
[2022-05-19 23:21:41] [INFO ] Deduced a trap composed of 34 places in 362 ms of which 1 ms to minimize.
[2022-05-19 23:21:41] [INFO ] Deduced a trap composed of 42 places in 360 ms of which 1 ms to minimize.
[2022-05-19 23:21:41] [INFO ] Deduced a trap composed of 38 places in 362 ms of which 1 ms to minimize.
[2022-05-19 23:21:42] [INFO ] Deduced a trap composed of 42 places in 346 ms of which 1 ms to minimize.
[2022-05-19 23:21:42] [INFO ] Deduced a trap composed of 34 places in 342 ms of which 0 ms to minimize.
[2022-05-19 23:21:43] [INFO ] Deduced a trap composed of 52 places in 322 ms of which 1 ms to minimize.
[2022-05-19 23:21:43] [INFO ] Deduced a trap composed of 46 places in 309 ms of which 1 ms to minimize.
[2022-05-19 23:21:43] [INFO ] Deduced a trap composed of 40 places in 293 ms of which 1 ms to minimize.
[2022-05-19 23:21:44] [INFO ] Deduced a trap composed of 43 places in 306 ms of which 0 ms to minimize.
[2022-05-19 23:21:44] [INFO ] Deduced a trap composed of 35 places in 300 ms of which 1 ms to minimize.
[2022-05-19 23:21:45] [INFO ] Deduced a trap composed of 42 places in 296 ms of which 1 ms to minimize.
[2022-05-19 23:21:45] [INFO ] Deduced a trap composed of 46 places in 306 ms of which 1 ms to minimize.
[2022-05-19 23:21:45] [INFO ] Deduced a trap composed of 41 places in 273 ms of which 1 ms to minimize.
[2022-05-19 23:21:46] [INFO ] Deduced a trap composed of 47 places in 285 ms of which 1 ms to minimize.
[2022-05-19 23:21:46] [INFO ] Deduced a trap composed of 42 places in 273 ms of which 1 ms to minimize.
[2022-05-19 23:21:46] [INFO ] Deduced a trap composed of 46 places in 261 ms of which 1 ms to minimize.
[2022-05-19 23:21:47] [INFO ] Deduced a trap composed of 52 places in 264 ms of which 1 ms to minimize.
[2022-05-19 23:21:47] [INFO ] Deduced a trap composed of 42 places in 284 ms of which 1 ms to minimize.
[2022-05-19 23:21:48] [INFO ] Deduced a trap composed of 64 places in 276 ms of which 0 ms to minimize.
[2022-05-19 23:21:48] [INFO ] Deduced a trap composed of 48 places in 275 ms of which 1 ms to minimize.
[2022-05-19 23:21:48] [INFO ] Deduced a trap composed of 41 places in 264 ms of which 1 ms to minimize.
[2022-05-19 23:21:49] [INFO ] Deduced a trap composed of 43 places in 268 ms of which 1 ms to minimize.
[2022-05-19 23:21:49] [INFO ] Deduced a trap composed of 43 places in 265 ms of which 1 ms to minimize.
[2022-05-19 23:21:49] [INFO ] Deduced a trap composed of 65 places in 258 ms of which 1 ms to minimize.
[2022-05-19 23:21:50] [INFO ] Deduced a trap composed of 43 places in 226 ms of which 1 ms to minimize.
[2022-05-19 23:21:50] [INFO ] Deduced a trap composed of 53 places in 230 ms of which 1 ms to minimize.
[2022-05-19 23:21:50] [INFO ] Deduced a trap composed of 41 places in 238 ms of which 0 ms to minimize.
[2022-05-19 23:21:50] [INFO ] Deduced a trap composed of 52 places in 226 ms of which 0 ms to minimize.
[2022-05-19 23:21:51] [INFO ] Deduced a trap composed of 50 places in 215 ms of which 1 ms to minimize.
[2022-05-19 23:21:51] [INFO ] Deduced a trap composed of 50 places in 213 ms of which 1 ms to minimize.
[2022-05-19 23:21:51] [INFO ] Deduced a trap composed of 52 places in 189 ms of which 1 ms to minimize.
[2022-05-19 23:21:52] [INFO ] Deduced a trap composed of 58 places in 193 ms of which 1 ms to minimize.
[2022-05-19 23:21:52] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-19 23:21:52] [INFO ] After 25227ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 23 ms.
Support contains 4 out of 2443 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2443/2443 places, 2243/2243 transitions.
Drop transitions removed 281 transitions
Trivial Post-agglo rules discarded 281 transitions
Performed 281 trivial Post agglomeration. Transition count delta: 281
Iterating post reduction 0 with 281 rules applied. Total rules applied 281 place count 2443 transition count 1962
Reduce places removed 281 places and 0 transitions.
Iterating post reduction 1 with 281 rules applied. Total rules applied 562 place count 2162 transition count 1962
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 562 place count 2162 transition count 1762
Deduced a syphon composed of 200 places in 4 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 962 place count 1962 transition count 1762
Performed 716 Post agglomeration using F-continuation condition.Transition count delta: 716
Deduced a syphon composed of 716 places in 1 ms
Reduce places removed 716 places and 0 transitions.
Iterating global reduction 2 with 1432 rules applied. Total rules applied 2394 place count 1246 transition count 1046
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 356 times.
Drop transitions removed 356 transitions
Iterating global reduction 2 with 356 rules applied. Total rules applied 2750 place count 1246 transition count 1046
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 2751 place count 1245 transition count 1045
Applied a total of 2751 rules in 359 ms. Remains 1245 /2443 variables (removed 1198) and now considering 1045/2243 (removed 1198) transitions.
Finished structural reductions, in 1 iterations. Remains : 1245/2443 places, 1045/2243 transitions.
Finished random walk after 6668 steps, including 2 resets, run visited all 1 properties in 70 ms. (steps per millisecond=95 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X (NOT (AND p0 p1))), (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F p0), (F (AND p0 p1))]
Knowledge based reduction with 6 factoid took 297 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 103 ms :[(OR (NOT p0) p1), p1, (OR (NOT p0) p1)]
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) p1), p1, (OR (NOT p0) p1)]
// Phase 1: matrix 2243 rows 2443 cols
[2022-05-19 23:21:53] [INFO ] Computed 441 place invariants in 10 ms
[2022-05-19 23:21:55] [INFO ] [Real]Absence check using 441 positive place invariants in 787 ms returned sat
[2022-05-19 23:21:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 23:22:08] [INFO ] [Real]Absence check using state equation in 12792 ms returned unknown
Could not prove EG (NOT p0)
// Phase 1: matrix 2243 rows 2443 cols
[2022-05-19 23:22:08] [INFO ] Computed 441 place invariants in 10 ms
[2022-05-19 23:22:10] [INFO ] [Real]Absence check using 441 positive place invariants in 792 ms returned sat
[2022-05-19 23:22:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 23:22:23] [INFO ] [Real]Absence check using state equation in 12816 ms returned unknown
Could not prove EG p1
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p0) p1), p1, (OR (NOT p0) p1)]
Product exploration explored 100000 steps with 95 reset in 645 ms.
Product exploration explored 100000 steps with 96 reset in 753 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 128 ms :[(OR (NOT p0) p1), p1, (OR (NOT p0) p1)]
Support contains 4 out of 2443 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2443/2443 places, 2243/2243 transitions.
Performed 280 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 280 rules applied. Total rules applied 280 place count 2443 transition count 2243
Performed 81 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 81 Pre rules applied. Total rules applied 280 place count 2443 transition count 2244
Deduced a syphon composed of 361 places in 4 ms
Iterating global reduction 1 with 81 rules applied. Total rules applied 361 place count 2443 transition count 2244
Performed 836 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1197 places in 2 ms
Iterating global reduction 1 with 836 rules applied. Total rules applied 1197 place count 2443 transition count 2244
Renaming transitions due to excessive name length > 1024 char.
Discarding 282 places :
Symmetric choice reduction at 1 with 282 rule applications. Total rules 1479 place count 2161 transition count 1962
Deduced a syphon composed of 915 places in 2 ms
Iterating global reduction 1 with 282 rules applied. Total rules applied 1761 place count 2161 transition count 1962
Deduced a syphon composed of 915 places in 2 ms
Applied a total of 1761 rules in 845 ms. Remains 2161 /2443 variables (removed 282) and now considering 1962/2243 (removed 281) transitions.
[2022-05-19 23:22:25] [INFO ] Redundant transitions in 40 ms returned []
// Phase 1: matrix 1962 rows 2161 cols
[2022-05-19 23:22:25] [INFO ] Computed 441 place invariants in 24 ms
[2022-05-19 23:22:27] [INFO ] Dead Transitions using invariants and state equation in 1159 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2161/2443 places, 1962/2243 transitions.
Finished structural reductions, in 1 iterations. Remains : 2161/2443 places, 1962/2243 transitions.
Product exploration explored 100000 steps with 9563 reset in 2400 ms.
Product exploration explored 100000 steps with 9563 reset in 2426 ms.
Built C files in :
/tmp/ltsmin4247579886162793821
[2022-05-19 23:22:31] [INFO ] Built C files in 80ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4247579886162793821
Running compilation step : cd /tmp/ltsmin4247579886162793821;'/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/ltsmin4247579886162793821;'/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/ltsmin4247579886162793821;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 4 out of 2443 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2443/2443 places, 2243/2243 transitions.
Applied a total of 0 rules in 118 ms. Remains 2443 /2443 variables (removed 0) and now considering 2243/2243 (removed 0) transitions.
// Phase 1: matrix 2243 rows 2443 cols
[2022-05-19 23:22:35] [INFO ] Computed 441 place invariants in 14 ms
[2022-05-19 23:22:35] [INFO ] Implicit Places using invariants in 751 ms returned []
// Phase 1: matrix 2243 rows 2443 cols
[2022-05-19 23:22:35] [INFO ] Computed 441 place invariants in 6 ms
[2022-05-19 23:22:38] [INFO ] Implicit Places using invariants and state equation in 2250 ms returned []
Implicit Place search using SMT with State Equation took 3006 ms to find 0 implicit places.
// Phase 1: matrix 2243 rows 2443 cols
[2022-05-19 23:22:38] [INFO ] Computed 441 place invariants in 9 ms
[2022-05-19 23:22:39] [INFO ] Dead Transitions using invariants and state equation in 1362 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2443/2443 places, 2243/2243 transitions.
Built C files in :
/tmp/ltsmin7562413643405004560
[2022-05-19 23:22:39] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7562413643405004560
Running compilation step : cd /tmp/ltsmin7562413643405004560;'/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/ltsmin7562413643405004560;'/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/ltsmin7562413643405004560;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-19 23:22:42] [INFO ] Flatten gal took : 85 ms
[2022-05-19 23:22:42] [INFO ] Flatten gal took : 79 ms
[2022-05-19 23:22:42] [INFO ] Time to serialize gal into /tmp/LTL2255858370371925748.gal : 20 ms
[2022-05-19 23:22:42] [INFO ] Time to serialize properties into /tmp/LTL14975146902325757277.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/LTL2255858370371925748.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14975146902325757277.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/LTL2255858...267
Read 1 LTL properties
Checking formula 0 : !((F(X(((("((p858==0)||(p602==1))")U(F(!("((p858==0)||(p602==1))"))))&&("(p1480==0)"))&&("(p487==1)")))))
Formula 0 simplified : !FX("(p487==1)" & "(p1480==0)" & ("((p858==0)||(p602==1))" U F!"((p858==0)||(p602==1))"))
Detected timeout of ITS tools.
[2022-05-19 23:22:58] [INFO ] Flatten gal took : 106 ms
[2022-05-19 23:22:58] [INFO ] Applying decomposition
[2022-05-19 23:22:58] [INFO ] Flatten gal took : 128 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/graph14979924611580013002.txt' '-o' '/tmp/graph14979924611580013002.bin' '-w' '/tmp/graph14979924611580013002.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14979924611580013002.bin' '-l' '-1' '-v' '-w' '/tmp/graph14979924611580013002.weights' '-q' '0' '-e' '0.001'
[2022-05-19 23:22:58] [INFO ] Decomposing Gal with order
[2022-05-19 23:22:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 23:22:59] [INFO ] Removed a total of 360 redundant transitions.
[2022-05-19 23:22:59] [INFO ] Flatten gal took : 276 ms
[2022-05-19 23:22:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 48 ms.
[2022-05-19 23:22:59] [INFO ] Time to serialize gal into /tmp/LTL9142883732847533272.gal : 54 ms
[2022-05-19 23:22:59] [INFO ] Time to serialize properties into /tmp/LTL14042523512617886145.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/LTL9142883732847533272.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14042523512617886145.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/LTL9142883...246
Read 1 LTL properties
Checking formula 0 : !((F(X(((("((i14.u307.p858==0)||(i9.i3.i0.u217.p602==1))")U(F(!("((i14.u307.p858==0)||(i9.i3.i0.u217.p602==1))"))))&&("(i22.u527.p1480...195
Formula 0 simplified : !FX("(i7.i0.i1.u177.p487==1)" & "(i22.u527.p1480==0)" & ("((i14.u307.p858==0)||(i9.i3.i0.u217.p602==1))" U F!"((i14.u307.p858==0)||(...181
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15209169553495234541
[2022-05-19 23:23:14] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15209169553495234541
Running compilation step : cd /tmp/ltsmin15209169553495234541;'/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/ltsmin15209169553495234541;'/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/ltsmin15209169553495234541;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property ShieldPPPs-PT-040B-LTLCardinality-13 finished in 179954 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&F(p1)))'
Support contains 4 out of 2446 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2446/2446 places, 2246/2246 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 2442 transition count 2242
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 2442 transition count 2242
Applied a total of 8 rules in 469 ms. Remains 2442 /2446 variables (removed 4) and now considering 2242/2246 (removed 4) transitions.
// Phase 1: matrix 2242 rows 2442 cols
[2022-05-19 23:23:18] [INFO ] Computed 441 place invariants in 7 ms
[2022-05-19 23:23:19] [INFO ] Implicit Places using invariants in 1647 ms returned []
// Phase 1: matrix 2242 rows 2442 cols
[2022-05-19 23:23:19] [INFO ] Computed 441 place invariants in 6 ms
[2022-05-19 23:23:22] [INFO ] Implicit Places using invariants and state equation in 2337 ms returned []
Implicit Place search using SMT with State Equation took 3997 ms to find 0 implicit places.
// Phase 1: matrix 2242 rows 2442 cols
[2022-05-19 23:23:22] [INFO ] Computed 441 place invariants in 11 ms
[2022-05-19 23:23:23] [INFO ] Dead Transitions using invariants and state equation in 1384 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2442/2446 places, 2242/2246 transitions.
Finished structural reductions, in 1 iterations. Remains : 2442/2446 places, 2242/2246 transitions.
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Running random walk in product with property : ShieldPPPs-PT-040B-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s1999 0) (EQ s1645 1)), p0:(AND (EQ s2040 0) (EQ s1353 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, 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 366 steps with 1 reset in 2 ms.
FORMULA ShieldPPPs-PT-040B-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-040B-LTLCardinality-15 finished in 5999 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(((p1 U F(!p1))&&p0))))'
Found a CL insensitive property : ShieldPPPs-PT-040B-LTLCardinality-13
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p0) p1), p1, (OR (NOT p0) p1)]
Support contains 4 out of 2446 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 2446/2446 places, 2246/2246 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 281 transitions
Trivial Post-agglo rules discarded 281 transitions
Performed 281 trivial Post agglomeration. Transition count delta: 281
Iterating post reduction 0 with 281 rules applied. Total rules applied 281 place count 2445 transition count 1964
Reduce places removed 281 places and 0 transitions.
Iterating post reduction 1 with 281 rules applied. Total rules applied 562 place count 2164 transition count 1964
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 562 place count 2164 transition count 1764
Deduced a syphon composed of 200 places in 4 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 962 place count 1964 transition count 1764
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 965 place count 1961 transition count 1761
Iterating global reduction 2 with 3 rules applied. Total rules applied 968 place count 1961 transition count 1761
Performed 714 Post agglomeration using F-continuation condition.Transition count delta: 714
Deduced a syphon composed of 714 places in 2 ms
Reduce places removed 714 places and 0 transitions.
Iterating global reduction 2 with 1428 rules applied. Total rules applied 2396 place count 1247 transition count 1047
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 2398 place count 1245 transition count 1045
Applied a total of 2398 rules in 457 ms. Remains 1245 /2446 variables (removed 1201) and now considering 1045/2246 (removed 1201) transitions.
// Phase 1: matrix 1045 rows 1245 cols
[2022-05-19 23:23:24] [INFO ] Computed 441 place invariants in 1 ms
[2022-05-19 23:23:25] [INFO ] Implicit Places using invariants in 664 ms returned []
// Phase 1: matrix 1045 rows 1245 cols
[2022-05-19 23:23:25] [INFO ] Computed 441 place invariants in 2 ms
[2022-05-19 23:23:26] [INFO ] Implicit Places using invariants and state equation in 1121 ms returned []
Implicit Place search using SMT with State Equation took 1813 ms to find 0 implicit places.
// Phase 1: matrix 1045 rows 1245 cols
[2022-05-19 23:23:26] [INFO ] Computed 441 place invariants in 1 ms
[2022-05-19 23:23:26] [INFO ] Dead Transitions using invariants and state equation in 536 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 1245/2446 places, 1045/2246 transitions.
Finished structural reductions, in 1 iterations. Remains : 1245/2446 places, 1045/2246 transitions.
Running random walk in product with property : ShieldPPPs-PT-040B-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 1}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (EQ s380 0) (EQ s263 1)), p0:(AND (EQ s673 0) (EQ s210 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 13865 reset in 837 ms.
Product exploration explored 100000 steps with 13961 reset in 1024 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p1 (NOT p0))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (X (NOT p0))), (X (X p0)), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 1 factoid took 251 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 88 ms :[(OR (NOT p0) p1), p1, (OR (NOT p0) p1)]
Finished random walk after 7 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND p1 (NOT p0))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (X (NOT p0))), (X (X p0)), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F p0), (F (AND p0 p1))]
Knowledge based reduction with 1 factoid took 259 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p0) p1), p1, (OR (NOT p0) p1)]
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p0) p1), p1, (OR (NOT p0) p1)]
// Phase 1: matrix 1045 rows 1245 cols
[2022-05-19 23:23:29] [INFO ] Computed 441 place invariants in 2 ms
[2022-05-19 23:23:30] [INFO ] [Real]Absence check using 441 positive place invariants in 263 ms returned sat
[2022-05-19 23:23:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 23:23:33] [INFO ] [Real]Absence check using state equation in 2689 ms returned sat
[2022-05-19 23:23:33] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 23:23:34] [INFO ] [Nat]Absence check using 441 positive place invariants in 252 ms returned sat
[2022-05-19 23:23:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 23:23:36] [INFO ] [Nat]Absence check using state equation in 2803 ms returned sat
[2022-05-19 23:23:37] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 0 ms to minimize.
[2022-05-19 23:23:37] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 0 ms to minimize.
[2022-05-19 23:23:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 226 ms
[2022-05-19 23:23:37] [INFO ] Computed and/alt/rep : 1041/2014/1041 causal constraints (skipped 0 transitions) in 60 ms.
[2022-05-19 23:23:48] [INFO ] Deduced a trap composed of 4 places in 629 ms of which 1 ms to minimize.
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.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:521)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:677)
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.runSLCLLTLTest(LTLPropertySolver.java:277)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:687)
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-05-19 23:23:48] [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)
// Phase 1: matrix 1045 rows 1245 cols
[2022-05-19 23:23:48] [INFO ] Computed 441 place invariants in 2 ms
[2022-05-19 23:23:49] [INFO ] [Real]Absence check using 441 positive place invariants in 286 ms returned sat
[2022-05-19 23:23:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 23:23:53] [INFO ] [Real]Absence check using state equation in 3199 ms returned sat
[2022-05-19 23:23:53] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 23:23:54] [INFO ] [Nat]Absence check using 441 positive place invariants in 278 ms returned sat
[2022-05-19 23:23:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 23:23:56] [INFO ] [Nat]Absence check using state equation in 2840 ms returned sat
[2022-05-19 23:23:57] [INFO ] Computed and/alt/rep : 1041/2014/1041 causal constraints (skipped 0 transitions) in 59 ms.
[2022-05-19 23:24:08] [INFO ] Added : 535 causal constraints over 107 iterations in 11137 ms. Result :unknown
Could not prove EG p1
Support contains 4 out of 1245 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1245/1245 places, 1045/1045 transitions.
Applied a total of 0 rules in 27 ms. Remains 1245 /1245 variables (removed 0) and now considering 1045/1045 (removed 0) transitions.
// Phase 1: matrix 1045 rows 1245 cols
[2022-05-19 23:24:08] [INFO ] Computed 441 place invariants in 3 ms
[2022-05-19 23:24:08] [INFO ] Implicit Places using invariants in 536 ms returned []
// Phase 1: matrix 1045 rows 1245 cols
[2022-05-19 23:24:08] [INFO ] Computed 441 place invariants in 2 ms
[2022-05-19 23:24:09] [INFO ] Implicit Places using invariants and state equation in 1224 ms returned []
Implicit Place search using SMT with State Equation took 1763 ms to find 0 implicit places.
// Phase 1: matrix 1045 rows 1245 cols
[2022-05-19 23:24:09] [INFO ] Computed 441 place invariants in 3 ms
[2022-05-19 23:24:10] [INFO ] Dead Transitions using invariants and state equation in 522 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1245/1245 places, 1045/1045 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p1 (NOT p0))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (X (NOT p0))), (X (X p0)), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 1 factoid took 236 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 84 ms :[(OR (NOT p0) p1), p1, (OR (NOT p0) p1)]
Finished random walk after 5511 steps, including 2 resets, run visited all 3 properties in 56 ms. (steps per millisecond=98 )
Knowledge obtained : [(AND p1 (NOT p0))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (X (NOT p0))), (X (X p0)), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F p0), (F (AND p0 p1))]
Knowledge based reduction with 1 factoid took 271 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 84 ms :[(OR (NOT p0) p1), p1, (OR (NOT p0) p1)]
Stuttering acceptance computed with spot in 91 ms :[(OR (NOT p0) p1), p1, (OR (NOT p0) p1)]
// Phase 1: matrix 1045 rows 1245 cols
[2022-05-19 23:24:11] [INFO ] Computed 441 place invariants in 5 ms
[2022-05-19 23:24:12] [INFO ] [Real]Absence check using 441 positive place invariants in 275 ms returned sat
[2022-05-19 23:24:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 23:24:15] [INFO ] [Real]Absence check using state equation in 2804 ms returned sat
[2022-05-19 23:24:15] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 23:24:16] [INFO ] [Nat]Absence check using 441 positive place invariants in 285 ms returned sat
[2022-05-19 23:24:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 23:24:19] [INFO ] [Nat]Absence check using state equation in 3029 ms returned sat
[2022-05-19 23:24:19] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 1 ms to minimize.
[2022-05-19 23:24:19] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2022-05-19 23:24:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 237 ms
[2022-05-19 23:24:19] [INFO ] Computed and/alt/rep : 1041/2014/1041 causal constraints (skipped 0 transitions) in 56 ms.
[2022-05-19 23:24:30] [INFO ] Deduced a trap composed of 4 places in 544 ms of which 1 ms to minimize.
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.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:521)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:677)
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:356)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runSLCLLTLTest(LTLPropertySolver.java:277)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:687)
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-05-19 23:24:30] [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)
// Phase 1: matrix 1045 rows 1245 cols
[2022-05-19 23:24:30] [INFO ] Computed 441 place invariants in 4 ms
[2022-05-19 23:24:31] [INFO ] [Real]Absence check using 441 positive place invariants in 297 ms returned sat
[2022-05-19 23:24:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 23:24:34] [INFO ] [Real]Absence check using state equation in 3133 ms returned sat
[2022-05-19 23:24:34] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 23:24:36] [INFO ] [Nat]Absence check using 441 positive place invariants in 290 ms returned sat
[2022-05-19 23:24:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 23:24:38] [INFO ] [Nat]Absence check using state equation in 2802 ms returned sat
[2022-05-19 23:24:38] [INFO ] Computed and/alt/rep : 1041/2014/1041 causal constraints (skipped 0 transitions) in 48 ms.
[2022-05-19 23:24:50] [INFO ] Deduced a trap composed of 4 places in 523 ms of which 1 ms to minimize.
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.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:521)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:677)
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:356)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runSLCLLTLTest(LTLPropertySolver.java:277)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:687)
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-05-19 23:24: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 p1
Could not prove EG p1
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p0) p1), p1, (OR (NOT p0) p1)]
Product exploration explored 100000 steps with 13953 reset in 873 ms.
Product exploration explored 100000 steps with 13897 reset in 1001 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p0) p1), p1, (OR (NOT p0) p1)]
Support contains 4 out of 1245 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1245/1245 places, 1045/1045 transitions.
Applied a total of 0 rules in 39 ms. Remains 1245 /1245 variables (removed 0) and now considering 1045/1045 (removed 0) transitions.
[2022-05-19 23:24:52] [INFO ] Redundant transitions in 14 ms returned []
// Phase 1: matrix 1045 rows 1245 cols
[2022-05-19 23:24:52] [INFO ] Computed 441 place invariants in 3 ms
[2022-05-19 23:24:53] [INFO ] Dead Transitions using invariants and state equation in 503 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1245/1245 places, 1045/1045 transitions.
Product exploration explored 100000 steps with 13807 reset in 3310 ms.
Product exploration explored 100000 steps with 13912 reset in 3459 ms.
Built C files in :
/tmp/ltsmin14530682608407355055
[2022-05-19 23:25:00] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14530682608407355055
Running compilation step : cd /tmp/ltsmin14530682608407355055;'/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'
Compilation finished in 1836 ms.
Running link step : cd /tmp/ltsmin14530682608407355055;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin14530682608407355055;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14078173847848445709.hoa' '--buchi-type=spotba'
LTSmin run took 3920 ms.
Treatment of property ShieldPPPs-PT-040B-LTLCardinality-13 finished in 102200 ms.
CL/SL decision was in the wrong direction : CL + false
[2022-05-19 23:25:05] [INFO ] Flatten gal took : 63 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin4483822796974175610
[2022-05-19 23:25:06] [INFO ] Too many transitions (2246) to apply POR reductions. Disabling POR matrices.
[2022-05-19 23:25:06] [INFO ] Applying decomposition
[2022-05-19 23:25:06] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4483822796974175610
Running compilation step : cd /tmp/ltsmin4483822796974175610;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-19 23:25:06] [INFO ] Flatten gal took : 66 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/graph3076706158797132588.txt' '-o' '/tmp/graph3076706158797132588.bin' '-w' '/tmp/graph3076706158797132588.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3076706158797132588.bin' '-l' '-1' '-v' '-w' '/tmp/graph3076706158797132588.weights' '-q' '0' '-e' '0.001'
[2022-05-19 23:25:06] [INFO ] Decomposing Gal with order
[2022-05-19 23:25:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 23:25:06] [INFO ] Removed a total of 360 redundant transitions.
[2022-05-19 23:25:06] [INFO ] Flatten gal took : 118 ms
[2022-05-19 23:25:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 10 ms.
[2022-05-19 23:25:06] [INFO ] Time to serialize gal into /tmp/LTLCardinality833136799058101803.gal : 22 ms
[2022-05-19 23:25:06] [INFO ] Time to serialize properties into /tmp/LTLCardinality16622003045241386852.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality833136799058101803.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality16622003045241386852.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/LTLCardina...267
Read 1 LTL properties
Checking formula 0 : !((F(X(((("((i11.i0.i0.u304.p858==0)||(i7.i3.i0.u215.p602==1))")U(F(!("((i11.i0.i0.u304.p858==0)||(i7.i3.i0.u215.p602==1))"))))&&("(i2...208
Formula 0 simplified : !FX("(i12.u175.p487==1)" & "(i21.i2.i0.u526.p1480==0)" & ("((i11.i0.i0.u304.p858==0)||(i7.i3.i0.u215.p602==1))" U F!"((i11.i0.i0.u30...194
Compilation finished in 4911 ms.
Running link step : cd /tmp/ltsmin4483822796974175610;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin4483822796974175610;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(X((((LTLAPp1==true) U <>(!(LTLAPp1==true)))&&(LTLAPp0==true))))' '--buchi-type=spotba'
LTSmin run took 16068 ms.
FORMULA ShieldPPPs-PT-040B-LTLCardinality-13 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 364231 ms.

BK_STOP 1653002727177

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

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldPPPs-PT-040B"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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