Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2022-input.r204-oct2-165281599400523.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/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 ServersAndClients-PT-200320, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r204-oct2-165281599400523
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 41M
-rw-r--r-- 1 mcc users 8.0K Apr 29 17:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Apr 29 17:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 29 17:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K Apr 29 17:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.6K May 9 08:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 9 08:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 9 08:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 9 08:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 9 08:45 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 7 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 41M 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 ServersAndClients-PT-200320-LTLCardinality-00
FORMULA_NAME ServersAndClients-PT-200320-LTLCardinality-01
FORMULA_NAME ServersAndClients-PT-200320-LTLCardinality-02
FORMULA_NAME ServersAndClients-PT-200320-LTLCardinality-03
FORMULA_NAME ServersAndClients-PT-200320-LTLCardinality-04
FORMULA_NAME ServersAndClients-PT-200320-LTLCardinality-05
FORMULA_NAME ServersAndClients-PT-200320-LTLCardinality-06
FORMULA_NAME ServersAndClients-PT-200320-LTLCardinality-07
FORMULA_NAME ServersAndClients-PT-200320-LTLCardinality-08
FORMULA_NAME ServersAndClients-PT-200320-LTLCardinality-09
FORMULA_NAME ServersAndClients-PT-200320-LTLCardinality-10
FORMULA_NAME ServersAndClients-PT-200320-LTLCardinality-11
FORMULA_NAME ServersAndClients-PT-200320-LTLCardinality-12
FORMULA_NAME ServersAndClients-PT-200320-LTLCardinality-13
FORMULA_NAME ServersAndClients-PT-200320-LTLCardinality-14
FORMULA_NAME ServersAndClients-PT-200320-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652975585834

Running Version 202205111006
[2022-05-19 15:53:07] [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 15:53:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 15:53:08] [INFO ] Load time of PNML (sax parser for PT used): 1568 ms
[2022-05-19 15:53:08] [INFO ] Transformed 65121 places.
[2022-05-19 15:53:09] [INFO ] Transformed 128400 transitions.
[2022-05-19 15:53:09] [INFO ] Parsed PT model containing 65121 places and 128400 transitions in 2045 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 58 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ServersAndClients-PT-200320-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-200320-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-200320-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-200320-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 45 out of 65121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65121/65121 places, 128400/128400 transitions.
Applied a total of 0 rules in 1652 ms. Remains 65121 /65121 variables (removed 0) and now considering 128400/128400 (removed 0) transitions.
// Phase 1: matrix 128400 rows 65121 cols
[2022-05-19 15:53:13] [INFO ] Computed 721 place invariants in 2274 ms
[2022-05-19 15:53:19] [INFO ] Implicit Places using invariants in 7613 ms returned []
Implicit Place search using SMT only with invariants took 7636 ms to find 0 implicit places.
// Phase 1: matrix 128400 rows 65121 cols
[2022-05-19 15:53:21] [INFO ] Computed 721 place invariants in 2312 ms
[2022-05-19 15:53:30] [INFO ] Dead Transitions using invariants and state equation in 11351 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 65121/65121 places, 128400/128400 transitions.
Support contains 45 out of 65121 places after structural reductions.
[2022-05-19 15:53:35] [INFO ] Flatten gal took : 4300 ms
[2022-05-19 15:53:39] [INFO ] Flatten gal took : 3995 ms
[2022-05-19 15:53:47] [INFO ] Input system was already deterministic with 128400 transitions.
Support contains 42 out of 65121 places (down from 45) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 2027 ms. (steps per millisecond=4 ) properties (out of 23) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 21) seen :0
Interrupted probabilistic random walk after 2702 steps, run timeout after 6007 ms. (steps per millisecond=0 ) properties seen :{}
Probabilistic random walk after 2702 steps, saw 1164 distinct states, run finished after 6009 ms. (steps per millisecond=0 ) properties seen :0
Running SMT prover for 21 properties.
// Phase 1: matrix 128400 rows 65121 cols
[2022-05-19 15:53:58] [INFO ] Computed 721 place invariants in 1847 ms
[2022-05-19 15:54:23] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-19 15:54:23] [INFO ] After 25239ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 21 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 38 out of 65121 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 65121/65121 places, 128400/128400 transitions.
Drop transitions removed 63962 transitions
Trivial Post-agglo rules discarded 63962 transitions
Performed 63962 trivial Post agglomeration. Transition count delta: 63962
Iterating post reduction 0 with 63962 rules applied. Total rules applied 63962 place count 65121 transition count 64438
Reduce places removed 64247 places and 0 transitions.
Ensure Unique test removed 56800 transitions
Reduce isomorphic transitions removed 56800 transitions.
Iterating post reduction 1 with 121047 rules applied. Total rules applied 185009 place count 874 transition count 7638
Drop transitions removed 6962 transitions
Redundant transition composition rules discarded 6962 transitions
Iterating global reduction 2 with 6962 rules applied. Total rules applied 191971 place count 874 transition count 676
Discarding 163 places :
Implicit places reduction removed 163 places
Drop transitions removed 326 transitions
Trivial Post-agglo rules discarded 326 transitions
Performed 326 trivial Post agglomeration. Transition count delta: 326
Iterating post reduction 2 with 489 rules applied. Total rules applied 192460 place count 711 transition count 350
Reduce places removed 489 places and 0 transitions.
Drop transitions removed 163 transitions
Reduce isomorphic transitions removed 163 transitions.
Iterating post reduction 3 with 652 rules applied. Total rules applied 193112 place count 222 transition count 187
Partial Free-agglomeration rule applied 37 times.
Drop transitions removed 37 transitions
Iterating global reduction 4 with 37 rules applied. Total rules applied 193149 place count 222 transition count 187
Applied a total of 193149 rules in 2709 ms. Remains 222 /65121 variables (removed 64899) and now considering 187/128400 (removed 128213) transitions.
Finished structural reductions, in 1 iterations. Remains : 222/65121 places, 187/128400 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 21) seen :19
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 187 rows 222 cols
[2022-05-19 15:54:26] [INFO ] Computed 110 place invariants in 1 ms
[2022-05-19 15:54:26] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-19 15:54:26] [INFO ] [Nat]Absence check using 73 positive place invariants in 10 ms returned sat
[2022-05-19 15:54:26] [INFO ] [Nat]Absence check using 73 positive and 37 generalized place invariants in 13 ms returned sat
[2022-05-19 15:54:26] [INFO ] After 75ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
FORMULA ServersAndClients-PT-200320-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(F(X(F(X(G((X(p0)||F(p1))))))))))'
Support contains 3 out of 65121 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 65121/65121 places, 128400/128400 transitions.
Drop transitions removed 63997 transitions
Trivial Post-agglo rules discarded 63997 transitions
Performed 63997 trivial Post agglomeration. Transition count delta: 63997
Iterating post reduction 0 with 63997 rules applied. Total rules applied 63997 place count 65121 transition count 64403
Reduce places removed 64314 places and 0 transitions.
Ensure Unique test removed 63200 transitions
Reduce isomorphic transitions removed 63200 transitions.
Iterating post reduction 1 with 127514 rules applied. Total rules applied 191511 place count 807 transition count 1203
Drop transitions removed 597 transitions
Redundant transition composition rules discarded 597 transitions
Iterating global reduction 2 with 597 rules applied. Total rules applied 192108 place count 807 transition count 606
Discarding 197 places :
Implicit places reduction removed 197 places
Drop transitions removed 394 transitions
Trivial Post-agglo rules discarded 394 transitions
Performed 394 trivial Post agglomeration. Transition count delta: 394
Iterating post reduction 2 with 591 rules applied. Total rules applied 192699 place count 610 transition count 212
Reduce places removed 591 places and 0 transitions.
Ensure Unique test removed 196 transitions
Reduce isomorphic transitions removed 196 transitions.
Iterating post reduction 3 with 787 rules applied. Total rules applied 193486 place count 19 transition count 16
Applied a total of 193486 rules in 2213 ms. Remains 19 /65121 variables (removed 65102) and now considering 16/128400 (removed 128384) transitions.
// Phase 1: matrix 16 rows 19 cols
[2022-05-19 15:54:29] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-19 15:54:29] [INFO ] Implicit Places using invariants in 79 ms returned [0, 1, 2, 3, 4, 5, 13, 15, 17]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 82 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/65121 places, 16/128400 transitions.
Graph (trivial) has 10 edges and 10 vertex of which 7 / 10 are part of one of the 1 SCC in 3 ms
Free SCC test removed 6 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Applied a total of 1 rules in 4 ms. Remains 4 /10 variables (removed 6) and now considering 7/16 (removed 9) transitions.
// Phase 1: matrix 7 rows 4 cols
[2022-05-19 15:54:29] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-19 15:54:29] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 7 rows 4 cols
[2022-05-19 15:54:29] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 15:54:29] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 4/65121 places, 7/128400 transitions.
Finished structural reductions, in 2 iterations. Remains : 4/65121 places, 7/128400 transitions.
Stuttering acceptance computed with spot in 236 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ServersAndClients-PT-200320-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 1 s1), p1:(LEQ s2 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 6495 reset in 162 ms.
Product exploration explored 100000 steps with 6617 reset in 86 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 3 factoid took 201 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 7 rows 4 cols
[2022-05-19 15:54:30] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 15:54:30] [INFO ] After 18ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 15:54:30] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-19 15:54:30] [INFO ] After 29ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 4 factoid took 259 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 88 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 98 ms :[(NOT p1), (NOT p1)]
Support contains 2 out of 4 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 4/4 places, 7/7 transitions.
Applied a total of 0 rules in 0 ms. Remains 4 /4 variables (removed 0) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 4 cols
[2022-05-19 15:54:31] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 15:54:31] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 7 rows 4 cols
[2022-05-19 15:54:31] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 15:54:31] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2022-05-19 15:54:31] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 4 cols
[2022-05-19 15:54:31] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 15:54:31] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4/4 places, 7/7 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p1]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 1 factoid took 105 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 64 ms :[(NOT p1), (NOT p1)]
Finished random walk after 11 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=11 )
Knowledge obtained : [p1]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F (NOT p1))]
Knowledge based reduction with 1 factoid took 174 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 79 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 89 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 6570 reset in 150 ms.
Product exploration explored 100000 steps with 6594 reset in 73 ms.
Built C files in :
/tmp/ltsmin5429724115291928526
[2022-05-19 15:54:32] [INFO ] Computing symmetric may disable matrix : 7 transitions.
[2022-05-19 15:54:32] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 15:54:32] [INFO ] Computing symmetric may enable matrix : 7 transitions.
[2022-05-19 15:54:32] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 15:54:32] [INFO ] Computing Do-Not-Accords matrix : 7 transitions.
[2022-05-19 15:54:32] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 15:54:32] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5429724115291928526
Running compilation step : cd /tmp/ltsmin5429724115291928526;'/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 192 ms.
Running link step : cd /tmp/ltsmin5429724115291928526;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin5429724115291928526;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14369367625624178887.hoa' '--buchi-type=spotba'
LTSmin run took 215 ms.
FORMULA ServersAndClients-PT-200320-LTLCardinality-00 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ServersAndClients-PT-200320-LTLCardinality-00 finished in 5263 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(G(((G(p0)||G(!p0)) U p1)))))'
Support contains 4 out of 65121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65121/65121 places, 128400/128400 transitions.
Applied a total of 0 rules in 1307 ms. Remains 65121 /65121 variables (removed 0) and now considering 128400/128400 (removed 0) transitions.
// Phase 1: matrix 128400 rows 65121 cols
[2022-05-19 15:54:36] [INFO ] Computed 721 place invariants in 2297 ms
[2022-05-19 15:54:41] [INFO ] Implicit Places using invariants in 7506 ms returned []
Implicit Place search using SMT only with invariants took 7531 ms to find 0 implicit places.
// Phase 1: matrix 128400 rows 65121 cols
[2022-05-19 15:54:43] [INFO ] Computed 721 place invariants in 2357 ms
[2022-05-19 15:54:48] [INFO ] Dead Transitions using invariants and state equation in 7194 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 65121/65121 places, 128400/128400 transitions.
Stuttering acceptance computed with spot in 342 ms :[(NOT p1), (NOT p1), (NOT p0), p0, (NOT p1), true]
Running random walk in product with property : ServersAndClients-PT-200320-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}, { cond=p0, acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 3}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(LEQ s4378 s43829), p0:(GT s14599 s44159)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration timeout after 70510 steps with 0 reset in 10001 ms.
Product exploration timeout after 70010 steps with 0 reset in 10001 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X p1), (X (NOT (AND (NOT p1) (NOT p0)))), true, (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 6 factoid took 413 ms. Reduced automaton from 6 states, 13 edges and 2 AP to 6 states, 13 edges and 2 AP.
Stuttering acceptance computed with spot in 229 ms :[(NOT p1), (NOT p1), (NOT p0), p0, (NOT p1), true]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1788 ms. (steps per millisecond=5 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 128400 rows 65121 cols
[2022-05-19 15:55:15] [INFO ] Computed 721 place invariants in 1856 ms
[2022-05-19 15:55:29] [INFO ] After 14498ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-19 15:55:51] [INFO ] [Nat]Absence check using 521 positive place invariants in 7058 ms returned sat
[2022-05-19 15:55:52] [INFO ] [Nat]Absence check using 521 positive and 200 generalized place invariants in 1429 ms returned sat
[2022-05-19 15:55:54] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-19 15:55:54] [INFO ] After 25037ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 65121 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 65121/65121 places, 128400/128400 transitions.
Drop transitions removed 63998 transitions
Trivial Post-agglo rules discarded 63998 transitions
Performed 63998 trivial Post agglomeration. Transition count delta: 63998
Iterating post reduction 0 with 63998 rules applied. Total rules applied 63998 place count 65121 transition count 64402
Reduce places removed 64316 places and 0 transitions.
Ensure Unique test removed 63400 transitions
Reduce isomorphic transitions removed 63400 transitions.
Iterating post reduction 1 with 127716 rules applied. Total rules applied 191714 place count 805 transition count 1002
Drop transitions removed 398 transitions
Redundant transition composition rules discarded 398 transitions
Iterating global reduction 2 with 398 rules applied. Total rules applied 192112 place count 805 transition count 604
Discarding 198 places :
Implicit places reduction removed 198 places
Drop transitions removed 396 transitions
Trivial Post-agglo rules discarded 396 transitions
Performed 396 trivial Post agglomeration. Transition count delta: 396
Iterating post reduction 2 with 594 rules applied. Total rules applied 192706 place count 607 transition count 208
Reduce places removed 594 places and 0 transitions.
Drop transitions removed 198 transitions
Reduce isomorphic transitions removed 198 transitions.
Iterating post reduction 3 with 792 rules applied. Total rules applied 193498 place count 13 transition count 10
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 193500 place count 13 transition count 10
Applied a total of 193500 rules in 2153 ms. Remains 13 /65121 variables (removed 65108) and now considering 10/128400 (removed 128390) transitions.
Finished structural reductions, in 1 iterations. Remains : 13/65121 places, 10/128400 transitions.
Finished random walk after 22 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=22 )
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X p1), (X (NOT (AND (NOT p1) (NOT p0)))), true, (X (X (NOT (AND (NOT p1) p0)))), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (F p0), (F (NOT p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 7 factoid took 460 ms. Reduced automaton from 6 states, 13 edges and 2 AP to 5 states, 9 edges and 2 AP.
Stuttering acceptance computed with spot in 168 ms :[(NOT p1), (NOT p1), p0, (NOT p1), true]
Stuttering acceptance computed with spot in 176 ms :[(NOT p1), (NOT p1), p0, (NOT p1), true]
Support contains 4 out of 65121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65121/65121 places, 128400/128400 transitions.
Applied a total of 0 rules in 1732 ms. Remains 65121 /65121 variables (removed 0) and now considering 128400/128400 (removed 0) transitions.
// Phase 1: matrix 128400 rows 65121 cols
[2022-05-19 15:56:01] [INFO ] Computed 721 place invariants in 2346 ms
[2022-05-19 15:56:07] [INFO ] Implicit Places using invariants in 7693 ms returned []
Implicit Place search using SMT only with invariants took 7698 ms to find 0 implicit places.
// Phase 1: matrix 128400 rows 65121 cols
[2022-05-19 15:56:09] [INFO ] Computed 721 place invariants in 2332 ms
[2022-05-19 15:56:13] [INFO ] Dead Transitions using invariants and state equation in 6747 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 65121/65121 places, 128400/128400 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), true]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 3 factoid took 193 ms. Reduced automaton from 5 states, 9 edges and 2 AP to 5 states, 9 edges and 2 AP.
Stuttering acceptance computed with spot in 142 ms :[(NOT p1), (NOT p1), p0, (NOT p1), true]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1909 ms. (steps per millisecond=5 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1931 steps, run timeout after 6003 ms. (steps per millisecond=0 ) properties seen :{}
Probabilistic random walk after 1931 steps, saw 843 distinct states, run finished after 6003 ms. (steps per millisecond=0 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 128400 rows 65121 cols
[2022-05-19 15:56:26] [INFO ] Computed 721 place invariants in 2500 ms
[2022-05-19 15:56:41] [INFO ] After 14302ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-19 15:57:04] [INFO ] [Nat]Absence check using 521 positive place invariants in 7319 ms returned sat
[2022-05-19 15:57:05] [INFO ] [Nat]Absence check using 521 positive and 200 generalized place invariants in 1231 ms returned sat
[2022-05-19 15:57:06] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-19 15:57:06] [INFO ] After 25279ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 65121 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 65121/65121 places, 128400/128400 transitions.
Drop transitions removed 63996 transitions
Trivial Post-agglo rules discarded 63996 transitions
Performed 63996 trivial Post agglomeration. Transition count delta: 63996
Iterating post reduction 0 with 63996 rules applied. Total rules applied 63996 place count 65121 transition count 64404
Reduce places removed 64312 places and 0 transitions.
Ensure Unique test removed 63000 transitions
Reduce isomorphic transitions removed 63000 transitions.
Iterating post reduction 1 with 127312 rules applied. Total rules applied 191308 place count 809 transition count 1404
Drop transitions removed 796 transitions
Redundant transition composition rules discarded 796 transitions
Iterating global reduction 2 with 796 rules applied. Total rules applied 192104 place count 809 transition count 608
Discarding 196 places :
Implicit places reduction removed 196 places
Drop transitions removed 392 transitions
Trivial Post-agglo rules discarded 392 transitions
Performed 392 trivial Post agglomeration. Transition count delta: 392
Iterating post reduction 2 with 588 rules applied. Total rules applied 192692 place count 613 transition count 216
Reduce places removed 588 places and 0 transitions.
Drop transitions removed 196 transitions
Reduce isomorphic transitions removed 196 transitions.
Iterating post reduction 3 with 784 rules applied. Total rules applied 193476 place count 25 transition count 20
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 193480 place count 25 transition count 20
Applied a total of 193480 rules in 1744 ms. Remains 25 /65121 variables (removed 65096) and now considering 20/128400 (removed 128380) transitions.
Finished structural reductions, in 1 iterations. Remains : 25/65121 places, 20/128400 transitions.
Finished random walk after 14 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), true]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (NOT p1))), (X (X p1)), (F (NOT p1)), (F p0)]
Knowledge based reduction with 3 factoid took 212 ms. Reduced automaton from 5 states, 9 edges and 2 AP to 5 states, 9 edges and 2 AP.
Stuttering acceptance computed with spot in 159 ms :[(NOT p1), (NOT p1), p0, (NOT p1), true]
Stuttering acceptance computed with spot in 153 ms :[(NOT p1), (NOT p1), p0, (NOT p1), true]
Stuttering acceptance computed with spot in 148 ms :[(NOT p1), (NOT p1), p0, (NOT p1), true]
Product exploration timeout after 72820 steps with 0 reset in 10001 ms.
Product exploration timeout after 74650 steps with 0 reset in 10002 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 147 ms :[(NOT p1), (NOT p1), p0, (NOT p1), true]
Support contains 4 out of 65121 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 65121/65121 places, 128400/128400 transitions.
Performed 18759 Post agglomeration using F-continuation condition.
Performed 37831 Post agglomeration using F-continuation condition.
Performed 60708 Post agglomeration using F-continuation condition.
Performed 63996 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 63996 rules applied. Total rules applied 63996 place count 65121 transition count 128400
Discarding 315 places :
Symmetric choice reduction at 1 with 315 rule applications. Total rules 64311 place count 64806 transition count 65400
Deduced a syphon composed of 63996 places in 29 ms
Iterating global reduction 1 with 315 rules applied. Total rules applied 64626 place count 64806 transition count 65400
Deduced a syphon composed of 63996 places in 45 ms
Applied a total of 64626 rules in 97473 ms. Remains 64806 /65121 variables (removed 315) and now considering 65400/128400 (removed 63000) transitions.
[2022-05-19 15:59:06] [INFO ] Flow matrix only has 64604 transitions (discarded 796 similar events)
// Phase 1: matrix 64604 rows 64806 cols
[2022-05-19 15:59:57] [INFO ] Computed 406 place invariants in 50227 ms
[2022-05-19 16:00:03] [INFO ] Dead Transitions using invariants and state equation in 56256 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 64806/65121 places, 65400/128400 transitions.
Finished structural reductions, in 1 iterations. Remains : 64806/65121 places, 65400/128400 transitions.
Product exploration timeout after 76500 steps with 1 reset in 10031 ms.
Product exploration timeout after 74180 steps with 0 reset in 10084 ms.
Built C files in :
/tmp/ltsmin2962715618144698386
[2022-05-19 16:00:24] [INFO ] Built C files in 925ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2962715618144698386
Running compilation step : cd /tmp/ltsmin2962715618144698386;'/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/ltsmin2962715618144698386;'/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/ltsmin2962715618144698386;'/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 65121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65121/65121 places, 128400/128400 transitions.
Applied a total of 0 rules in 1324 ms. Remains 65121 /65121 variables (removed 0) and now considering 128400/128400 (removed 0) transitions.
// Phase 1: matrix 128400 rows 65121 cols
[2022-05-19 16:00:30] [INFO ] Computed 721 place invariants in 2144 ms
[2022-05-19 16:00:36] [INFO ] Implicit Places using invariants in 7300 ms returned []
Implicit Place search using SMT only with invariants took 7323 ms to find 0 implicit places.
// Phase 1: matrix 128400 rows 65121 cols
[2022-05-19 16:00:38] [INFO ] Computed 721 place invariants in 2010 ms
[2022-05-19 16:00:42] [INFO ] Dead Transitions using invariants and state equation in 6450 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 65121/65121 places, 128400/128400 transitions.
Built C files in :
/tmp/ltsmin10941657624603175848
[2022-05-19 16:00:43] [INFO ] Built C files in 895ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10941657624603175848
Running compilation step : cd /tmp/ltsmin10941657624603175848;'/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/ltsmin10941657624603175848;'/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/ltsmin10941657624603175848;'/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 16:00:55] [INFO ] Flatten gal took : 4353 ms
[2022-05-19 16:00:59] [INFO ] Flatten gal took : 3813 ms
[2022-05-19 16:00:59] [INFO ] Time to serialize gal into /tmp/LTL12320715524942984026.gal : 419 ms
[2022-05-19 16:00:59] [INFO ] Time to serialize properties into /tmp/LTL14137272759266246698.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/LTL12320715524942984026.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14137272759266246698.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/LTL1232071...268
Read 1 LTL properties
Detected timeout of ITS tools.
[2022-05-19 16:01:19] [INFO ] Flatten gal took : 3839 ms
[2022-05-19 16:01:19] [INFO ] Applying decomposition
[2022-05-19 16:01:22] [INFO ] Flatten gal took : 3213 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/graph2945922536433185328.txt' '-o' '/tmp/graph2945922536433185328.bin' '-w' '/tmp/graph2945922536433185328.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2945922536433185328.bin' '-l' '-1' '-v' '-w' '/tmp/graph2945922536433185328.weights' '-q' '0' '-e' '0.001'
[2022-05-19 16:01:32] [INFO ] Decomposing Gal with order
[2022-05-19 16:01:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 16:02:48] [INFO ] Removed a total of 127168 redundant transitions.
[2022-05-19 16:02:53] [INFO ] Flatten gal took : 45892 ms
[2022-05-19 16:02:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 826 ms.
[2022-05-19 16:03:17] [INFO ] Time to serialize gal into /tmp/LTL16795759310900843775.gal : 906 ms
[2022-05-19 16:03:17] [INFO ] Time to serialize properties into /tmp/LTL2952238342239385362.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/LTL16795759310900843775.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2952238342239385362.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/LTL1679575...267
Read 1 LTL properties

BK_STOP 1652976207641

--------------------
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="ServersAndClients-PT-200320"
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 ServersAndClients-PT-200320, 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 r204-oct2-165281599400523"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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