fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r292-tall-162124155800021
Last Updated
Jun 28, 2021

About the Execution of ITS-Tools for CANConstruction-PT-020

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16246.512 3600000.00 9443409.00 88690.00 FFFFFFF?FTFFTTFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r292-tall-162124155800021.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is CANConstruction-PT-020, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r292-tall-162124155800021
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.4M
-rw-r--r-- 1 mcc users 22K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 122K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 21K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 118K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K May 12 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 12 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 12 07:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 12 07:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 08:13 NewModel
-rw-r--r-- 1 mcc users 4.6K May 11 18:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K May 11 18:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 11 15:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K May 11 15:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 12 04:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 12 04:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 08:13 equiv_col
-rw-r--r-- 1 mcc users 4 May 12 08:13 instance
-rw-r--r-- 1 mcc users 6 May 12 08:13 iscolored
-rw-r--r-- 1 mcc users 2.0M May 12 08:13 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1621242982247

Running Version 0
[2021-05-17 09:16:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-17 09:16:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 09:16:24] [INFO ] Load time of PNML (sax parser for PT used): 181 ms
[2021-05-17 09:16:24] [INFO ] Transformed 1042 places.
[2021-05-17 09:16:24] [INFO ] Transformed 1760 transitions.
[2021-05-17 09:16:24] [INFO ] Parsed PT model containing 1042 places and 1760 transitions in 228 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
[2021-05-17 09:16:24] [INFO ] Initial state test concluded for 1 properties.
Support contains 43 out of 1042 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1042/1042 places, 1760/1760 transitions.
Discarding 348 places :
Symmetric choice reduction at 0 with 348 rule applications. Total rules 348 place count 694 transition count 1064
Iterating global reduction 0 with 348 rules applied. Total rules applied 696 place count 694 transition count 1064
Applied a total of 696 rules in 155 ms. Remains 694 /1042 variables (removed 348) and now considering 1064/1760 (removed 696) transitions.
// Phase 1: matrix 1064 rows 694 cols
[2021-05-17 09:16:24] [INFO ] Computed 41 place invariants in 33 ms
[2021-05-17 09:16:24] [INFO ] Implicit Places using invariants in 487 ms returned [12, 40, 54, 68, 82, 96, 110, 124, 138, 152, 166, 180, 194, 208, 222, 236, 250, 264, 278]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 518 ms to find 19 implicit places.
// Phase 1: matrix 1064 rows 675 cols
[2021-05-17 09:16:24] [INFO ] Computed 22 place invariants in 13 ms
[2021-05-17 09:16:25] [INFO ] Dead Transitions using invariants and state equation in 481 ms returned []
Starting structural reductions, iteration 1 : 675/1042 places, 1064/1760 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 657 transition count 1046
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 657 transition count 1046
Applied a total of 36 rules in 94 ms. Remains 657 /675 variables (removed 18) and now considering 1046/1064 (removed 18) transitions.
// Phase 1: matrix 1046 rows 657 cols
[2021-05-17 09:16:25] [INFO ] Computed 22 place invariants in 5 ms
[2021-05-17 09:16:25] [INFO ] Implicit Places using invariants in 272 ms returned []
// Phase 1: matrix 1046 rows 657 cols
[2021-05-17 09:16:25] [INFO ] Computed 22 place invariants in 9 ms
[2021-05-17 09:16:26] [INFO ] State equation strengthened by 780 read => feed constraints.
[2021-05-17 09:16:30] [INFO ] Implicit Places using invariants and state equation in 4331 ms returned []
Implicit Place search using SMT with State Equation took 4614 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 657/1042 places, 1046/1760 transitions.
[2021-05-17 09:16:30] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-17 09:16:30] [INFO ] Flatten gal took : 217 ms
FORMULA CANConstruction-PT-020-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-020-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 09:16:30] [INFO ] Flatten gal took : 141 ms
[2021-05-17 09:16:31] [INFO ] Input system was already deterministic with 1046 transitions.
Incomplete random walk after 100000 steps, including 288 resets, run finished after 747 ms. (steps per millisecond=133 ) properties (out of 26) seen :25
Running SMT prover for 1 properties.
// Phase 1: matrix 1046 rows 657 cols
[2021-05-17 09:16:31] [INFO ] Computed 22 place invariants in 5 ms
[2021-05-17 09:16:31] [INFO ] [Real]Absence check using 21 positive place invariants in 17 ms returned sat
[2021-05-17 09:16:31] [INFO ] [Real]Absence check using 21 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-17 09:16:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 09:16:32] [INFO ] [Real]Absence check using state equation in 223 ms returned sat
[2021-05-17 09:16:32] [INFO ] State equation strengthened by 780 read => feed constraints.
[2021-05-17 09:16:32] [INFO ] [Real]Added 780 Read/Feed constraints in 137 ms returned sat
[2021-05-17 09:16:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 09:16:32] [INFO ] [Nat]Absence check using 21 positive place invariants in 12 ms returned sat
[2021-05-17 09:16:32] [INFO ] [Nat]Absence check using 21 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-17 09:16:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 09:16:33] [INFO ] [Nat]Absence check using state equation in 286 ms returned sat
[2021-05-17 09:16:33] [INFO ] [Nat]Added 780 Read/Feed constraints in 57 ms returned sat
[2021-05-17 09:16:33] [INFO ] Computed and/alt/rep : 966/1866/966 causal constraints (skipped 60 transitions) in 130 ms.
[2021-05-17 09:16:42] [INFO ] Added : 795 causal constraints over 159 iterations in 9286 ms. Result :sat
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 4 out of 657 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 657/657 places, 1046/1046 transitions.
Drop transitions removed 128 transitions
Trivial Post-agglo rules discarded 128 transitions
Performed 128 trivial Post agglomeration. Transition count delta: 128
Iterating post reduction 0 with 128 rules applied. Total rules applied 128 place count 657 transition count 918
Reduce places removed 128 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 129 rules applied. Total rules applied 257 place count 529 transition count 917
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 258 place count 528 transition count 917
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 258 place count 528 transition count 898
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 296 place count 509 transition count 898
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 309 place count 496 transition count 873
Iterating global reduction 3 with 13 rules applied. Total rules applied 322 place count 496 transition count 873
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 3 with 9 rules applied. Total rules applied 331 place count 496 transition count 864
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 340 place count 487 transition count 864
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 342 place count 486 transition count 863
Applied a total of 342 rules in 155 ms. Remains 486 /657 variables (removed 171) and now considering 863/1046 (removed 183) transitions.
// Phase 1: matrix 863 rows 486 cols
[2021-05-17 09:16:42] [INFO ] Computed 22 place invariants in 4 ms
[2021-05-17 09:16:43] [INFO ] Implicit Places using invariants in 274 ms returned [10]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 277 ms to find 1 implicit places.
[2021-05-17 09:16:43] [INFO ] Redundant transitions in 92 ms returned []
// Phase 1: matrix 863 rows 485 cols
[2021-05-17 09:16:43] [INFO ] Computed 21 place invariants in 4 ms
[2021-05-17 09:16:43] [INFO ] Dead Transitions using invariants and state equation in 372 ms returned []
Starting structural reductions, iteration 1 : 485/657 places, 863/1046 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 485 transition count 862
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 484 transition count 862
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 3 place count 483 transition count 861
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 483 transition count 861
Applied a total of 4 rules in 44 ms. Remains 483 /485 variables (removed 2) and now considering 861/863 (removed 2) transitions.
// Phase 1: matrix 861 rows 483 cols
[2021-05-17 09:16:43] [INFO ] Computed 21 place invariants in 3 ms
[2021-05-17 09:16:43] [INFO ] Implicit Places using invariants in 254 ms returned []
// Phase 1: matrix 861 rows 483 cols
[2021-05-17 09:16:43] [INFO ] Computed 21 place invariants in 3 ms
[2021-05-17 09:16:44] [INFO ] State equation strengthened by 780 read => feed constraints.
[2021-05-17 09:16:45] [INFO ] Implicit Places using invariants and state equation in 1791 ms returned []
Implicit Place search using SMT with State Equation took 2057 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 483/657 places, 861/1046 transitions.
Stuttering acceptance computed with spot in 124 ms :[(NOT p0)]
Running random walk in product with property : CANConstruction-PT-020-00 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s24 1) (GEQ s62 1) (GEQ s0 1) (GEQ s38 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 125 steps with 0 reset in 3 ms.
FORMULA CANConstruction-PT-020-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-020-00 finished in 3198 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((p0&&(G(F(p1))||G(p2))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 657 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 657/657 places, 1046/1046 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 646 transition count 1025
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 646 transition count 1025
Applied a total of 22 rules in 30 ms. Remains 646 /657 variables (removed 11) and now considering 1025/1046 (removed 21) transitions.
// Phase 1: matrix 1025 rows 646 cols
[2021-05-17 09:16:45] [INFO ] Computed 22 place invariants in 4 ms
[2021-05-17 09:16:46] [INFO ] Implicit Places using invariants in 301 ms returned [24]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 312 ms to find 1 implicit places.
// Phase 1: matrix 1025 rows 645 cols
[2021-05-17 09:16:46] [INFO ] Computed 21 place invariants in 5 ms
[2021-05-17 09:16:46] [INFO ] Dead Transitions using invariants and state equation in 509 ms returned []
Starting structural reductions, iteration 1 : 645/657 places, 1025/1046 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 644 transition count 1024
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 644 transition count 1024
Applied a total of 2 rules in 38 ms. Remains 644 /645 variables (removed 1) and now considering 1024/1025 (removed 1) transitions.
// Phase 1: matrix 1024 rows 644 cols
[2021-05-17 09:16:46] [INFO ] Computed 21 place invariants in 3 ms
[2021-05-17 09:16:47] [INFO ] Implicit Places using invariants in 297 ms returned []
// Phase 1: matrix 1024 rows 644 cols
[2021-05-17 09:16:47] [INFO ] Computed 21 place invariants in 12 ms
[2021-05-17 09:16:47] [INFO ] State equation strengthened by 780 read => feed constraints.
[2021-05-17 09:16:50] [INFO ] Implicit Places using invariants and state equation in 3016 ms returned []
Implicit Place search using SMT with State Equation took 3329 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 644/657 places, 1024/1046 transitions.
Stuttering acceptance computed with spot in 216 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : CANConstruction-PT-020-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p2), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=1 dest: 5}], [{ cond=p2, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 5}], [{ cond=(AND p0 p2), acceptance={} source=4 dest: 2}, { cond=(OR (NOT p0) (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), acceptance={} source=4 dest: 5}], [{ cond=(AND p0 (NOT p1) p2), acceptance={} source=5 dest: 3}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(OR (GEQ s165 1) (GEQ s596 1)), p2:(GEQ s165 1), p1:(LT s384 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 2127 steps with 6 reset in 27 ms.
FORMULA CANConstruction-PT-020-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-020-01 finished in 4487 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G((p0 U p1))||F(p2)))], workingDir=/home/mcc/execution]
Support contains 4 out of 657 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 657/657 places, 1046/1046 transitions.
Drop transitions removed 130 transitions
Trivial Post-agglo rules discarded 130 transitions
Performed 130 trivial Post agglomeration. Transition count delta: 130
Iterating post reduction 0 with 130 rules applied. Total rules applied 130 place count 657 transition count 916
Reduce places removed 130 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 131 rules applied. Total rules applied 261 place count 527 transition count 915
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 262 place count 526 transition count 915
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 262 place count 526 transition count 896
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 300 place count 507 transition count 896
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 312 place count 495 transition count 872
Iterating global reduction 3 with 12 rules applied. Total rules applied 324 place count 495 transition count 872
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 8 rules applied. Total rules applied 332 place count 495 transition count 864
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 340 place count 487 transition count 864
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 5 with 36 rules applied. Total rules applied 376 place count 469 transition count 846
Applied a total of 376 rules in 99 ms. Remains 469 /657 variables (removed 188) and now considering 846/1046 (removed 200) transitions.
// Phase 1: matrix 846 rows 469 cols
[2021-05-17 09:16:50] [INFO ] Computed 22 place invariants in 3 ms
[2021-05-17 09:16:50] [INFO ] Implicit Places using invariants in 259 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 261 ms to find 1 implicit places.
[2021-05-17 09:16:50] [INFO ] Redundant transitions in 97 ms returned []
// Phase 1: matrix 846 rows 468 cols
[2021-05-17 09:16:50] [INFO ] Computed 21 place invariants in 3 ms
[2021-05-17 09:16:51] [INFO ] Dead Transitions using invariants and state equation in 315 ms returned []
Starting structural reductions, iteration 1 : 468/657 places, 846/1046 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 468 transition count 844
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 466 transition count 844
Applied a total of 4 rules in 28 ms. Remains 466 /468 variables (removed 2) and now considering 844/846 (removed 2) transitions.
// Phase 1: matrix 844 rows 466 cols
[2021-05-17 09:16:51] [INFO ] Computed 21 place invariants in 2 ms
[2021-05-17 09:16:51] [INFO ] Implicit Places using invariants in 251 ms returned []
// Phase 1: matrix 844 rows 466 cols
[2021-05-17 09:16:51] [INFO ] Computed 21 place invariants in 2 ms
[2021-05-17 09:16:51] [INFO ] State equation strengthened by 780 read => feed constraints.
[2021-05-17 09:16:53] [INFO ] Implicit Places using invariants and state equation in 2083 ms returned []
Implicit Place search using SMT with State Equation took 2336 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 466/657 places, 844/1046 transitions.
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : CANConstruction-PT-020-02 automaton TGBA [mat=[[{ cond=(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (LT s13 1) (LT s126 1)), p2:(GEQ s54 1), p0:(AND (GEQ s54 1) (OR (LT s13 1) (LT s45 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 34606 steps with 1246 reset in 198 ms.
FORMULA CANConstruction-PT-020-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-020-02 finished in 3442 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0||G(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 657 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 657/657 places, 1046/1046 transitions.
Drop transitions removed 132 transitions
Trivial Post-agglo rules discarded 132 transitions
Performed 132 trivial Post agglomeration. Transition count delta: 132
Iterating post reduction 0 with 132 rules applied. Total rules applied 132 place count 657 transition count 914
Reduce places removed 132 places and 0 transitions.
Iterating post reduction 1 with 132 rules applied. Total rules applied 264 place count 525 transition count 914
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 264 place count 525 transition count 895
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 302 place count 506 transition count 895
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 313 place count 495 transition count 873
Iterating global reduction 2 with 11 rules applied. Total rules applied 324 place count 495 transition count 873
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 8 rules applied. Total rules applied 332 place count 495 transition count 865
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 340 place count 487 transition count 865
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 4 with 38 rules applied. Total rules applied 378 place count 468 transition count 846
Applied a total of 378 rules in 69 ms. Remains 468 /657 variables (removed 189) and now considering 846/1046 (removed 200) transitions.
// Phase 1: matrix 846 rows 468 cols
[2021-05-17 09:16:53] [INFO ] Computed 22 place invariants in 4 ms
[2021-05-17 09:16:54] [INFO ] Implicit Places using invariants in 221 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 223 ms to find 1 implicit places.
[2021-05-17 09:16:54] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 846 rows 467 cols
[2021-05-17 09:16:54] [INFO ] Computed 21 place invariants in 3 ms
[2021-05-17 09:16:54] [INFO ] Dead Transitions using invariants and state equation in 349 ms returned []
Starting structural reductions, iteration 1 : 467/657 places, 846/1046 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 467 transition count 844
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 465 transition count 844
Applied a total of 4 rules in 24 ms. Remains 465 /467 variables (removed 2) and now considering 844/846 (removed 2) transitions.
// Phase 1: matrix 844 rows 465 cols
[2021-05-17 09:16:54] [INFO ] Computed 21 place invariants in 3 ms
[2021-05-17 09:16:54] [INFO ] Implicit Places using invariants in 221 ms returned []
// Phase 1: matrix 844 rows 465 cols
[2021-05-17 09:16:54] [INFO ] Computed 21 place invariants in 3 ms
[2021-05-17 09:16:54] [INFO ] State equation strengthened by 780 read => feed constraints.
[2021-05-17 09:16:56] [INFO ] Implicit Places using invariants and state equation in 2073 ms returned []
Implicit Place search using SMT with State Equation took 2296 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 465/657 places, 844/1046 transitions.
Stuttering acceptance computed with spot in 47 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CANConstruction-PT-020-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(OR (LT s11 1) (LT s56 1)), p0:(LT s95 1)], 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 725 reset in 461 ms.
Product exploration explored 100000 steps with 728 reset in 446 ms.
Knowledge obtained : [p1, p0]
Stuttering acceptance computed with spot in 45 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 720 reset in 385 ms.
Product exploration explored 100000 steps with 726 reset in 389 ms.
[2021-05-17 09:16:58] [INFO ] Flatten gal took : 41 ms
[2021-05-17 09:16:58] [INFO ] Flatten gal took : 37 ms
[2021-05-17 09:16:58] [INFO ] Time to serialize gal into /tmp/LTL14333711559899147871.gal : 11 ms
[2021-05-17 09:16:58] [INFO ] Time to serialize properties into /tmp/LTL8460414572767288000.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL14333711559899147871.gal, -t, CGAL, -LTL, /tmp/LTL8460414572767288000.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL14333711559899147871.gal -t CGAL -LTL /tmp/LTL8460414572767288000.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F(("(Node0GiveAnswer16<1)")||(G("((Node2Request<1)||(Node17IsInserted<1))"))))))
Formula 0 simplified : !GF("(Node0GiveAnswer16<1)" | G"((Node2Request<1)||(Node17IsInserted<1))")
Detected timeout of ITS tools.
[2021-05-17 09:17:13] [INFO ] Flatten gal took : 52 ms
[2021-05-17 09:17:13] [INFO ] Applying decomposition
[2021-05-17 09:17:13] [INFO ] Flatten gal took : 72 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph1294638866431287107.txt, -o, /tmp/graph1294638866431287107.bin, -w, /tmp/graph1294638866431287107.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph1294638866431287107.bin, -l, -1, -v, -w, /tmp/graph1294638866431287107.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 09:17:14] [INFO ] Decomposing Gal with order
[2021-05-17 09:17:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 09:17:14] [INFO ] Removed a total of 775 redundant transitions.
[2021-05-17 09:17:14] [INFO ] Flatten gal took : 246 ms
[2021-05-17 09:17:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 760 labels/synchronizations in 40 ms.
[2021-05-17 09:17:14] [INFO ] Time to serialize gal into /tmp/LTL1651948106215370862.gal : 10 ms
[2021-05-17 09:17:14] [INFO ] Time to serialize properties into /tmp/LTL8483180003586706122.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL1651948106215370862.gal, -t, CGAL, -LTL, /tmp/LTL8483180003586706122.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1651948106215370862.gal -t CGAL -LTL /tmp/LTL8483180003586706122.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((G(F(("(u15.Node0GiveAnswer16<1)")||(G("((u3.Node2Request<1)||(u13.Node17IsInserted<1))"))))))
Formula 0 simplified : !GF("(u15.Node0GiveAnswer16<1)" | G"((u3.Node2Request<1)||(u13.Node17IsInserted<1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5843082688353466798
[2021-05-17 09:17:29] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5843082688353466798
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin5843082688353466798]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin5843082688353466798] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin5843082688353466798] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property CANConstruction-PT-020-03 finished in 36878 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((p0 U X(G(p1))))], workingDir=/home/mcc/execution]
Support contains 6 out of 657 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 657/657 places, 1046/1046 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 644 transition count 1021
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 644 transition count 1021
Applied a total of 26 rules in 48 ms. Remains 644 /657 variables (removed 13) and now considering 1021/1046 (removed 25) transitions.
// Phase 1: matrix 1021 rows 644 cols
[2021-05-17 09:17:30] [INFO ] Computed 22 place invariants in 3 ms
[2021-05-17 09:17:31] [INFO ] Implicit Places using invariants in 616 ms returned [24]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 617 ms to find 1 implicit places.
// Phase 1: matrix 1021 rows 643 cols
[2021-05-17 09:17:31] [INFO ] Computed 21 place invariants in 4 ms
[2021-05-17 09:17:31] [INFO ] Dead Transitions using invariants and state equation in 478 ms returned []
Starting structural reductions, iteration 1 : 643/657 places, 1021/1046 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 642 transition count 1020
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 642 transition count 1020
Applied a total of 2 rules in 28 ms. Remains 642 /643 variables (removed 1) and now considering 1020/1021 (removed 1) transitions.
// Phase 1: matrix 1020 rows 642 cols
[2021-05-17 09:17:31] [INFO ] Computed 21 place invariants in 3 ms
[2021-05-17 09:17:32] [INFO ] Implicit Places using invariants in 265 ms returned []
// Phase 1: matrix 1020 rows 642 cols
[2021-05-17 09:17:32] [INFO ] Computed 21 place invariants in 3 ms
[2021-05-17 09:17:32] [INFO ] State equation strengthened by 780 read => feed constraints.
[2021-05-17 09:17:36] [INFO ] Implicit Places using invariants and state equation in 4439 ms returned []
Implicit Place search using SMT with State Equation took 4707 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 642/657 places, 1020/1046 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : CANConstruction-PT-020-04 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(OR (LT s107 1) (LT s186 1)), p0:(AND (GEQ s66 1) (GEQ s323 1) (GEQ s107 1) (GEQ s186 1) (GEQ s54 1) (GEQ s131 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 216 steps with 0 reset in 1 ms.
FORMULA CANConstruction-PT-020-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-020-04 finished in 5977 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 657 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 657/657 places, 1046/1046 transitions.
Drop transitions removed 131 transitions
Trivial Post-agglo rules discarded 131 transitions
Performed 131 trivial Post agglomeration. Transition count delta: 131
Iterating post reduction 0 with 131 rules applied. Total rules applied 131 place count 657 transition count 915
Reduce places removed 131 places and 0 transitions.
Iterating post reduction 1 with 131 rules applied. Total rules applied 262 place count 526 transition count 915
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 262 place count 526 transition count 896
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 300 place count 507 transition count 896
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 312 place count 495 transition count 872
Iterating global reduction 2 with 12 rules applied. Total rules applied 324 place count 495 transition count 872
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 2 with 9 rules applied. Total rules applied 333 place count 495 transition count 863
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 342 place count 486 transition count 863
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 4 with 38 rules applied. Total rules applied 380 place count 467 transition count 844
Applied a total of 380 rules in 61 ms. Remains 467 /657 variables (removed 190) and now considering 844/1046 (removed 202) transitions.
// Phase 1: matrix 844 rows 467 cols
[2021-05-17 09:17:36] [INFO ] Computed 22 place invariants in 15 ms
[2021-05-17 09:17:36] [INFO ] Implicit Places using invariants in 271 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 273 ms to find 1 implicit places.
[2021-05-17 09:17:36] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 844 rows 466 cols
[2021-05-17 09:17:36] [INFO ] Computed 21 place invariants in 3 ms
[2021-05-17 09:17:37] [INFO ] Dead Transitions using invariants and state equation in 357 ms returned []
Starting structural reductions, iteration 1 : 466/657 places, 844/1046 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 466 transition count 842
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 464 transition count 842
Applied a total of 4 rules in 27 ms. Remains 464 /466 variables (removed 2) and now considering 842/844 (removed 2) transitions.
// Phase 1: matrix 842 rows 464 cols
[2021-05-17 09:17:37] [INFO ] Computed 21 place invariants in 3 ms
[2021-05-17 09:17:37] [INFO ] Implicit Places using invariants in 223 ms returned []
// Phase 1: matrix 842 rows 464 cols
[2021-05-17 09:17:37] [INFO ] Computed 21 place invariants in 3 ms
[2021-05-17 09:17:37] [INFO ] State equation strengthened by 780 read => feed constraints.
[2021-05-17 09:17:39] [INFO ] Implicit Places using invariants and state equation in 2110 ms returned []
Implicit Place search using SMT with State Equation took 2335 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 464/657 places, 842/1046 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : CANConstruction-PT-020-06 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s19 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 101 steps with 0 reset in 1 ms.
FORMULA CANConstruction-PT-020-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-020-06 finished in 3104 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0||G(F(p1))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 657 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 657/657 places, 1046/1046 transitions.
Drop transitions removed 131 transitions
Trivial Post-agglo rules discarded 131 transitions
Performed 131 trivial Post agglomeration. Transition count delta: 131
Iterating post reduction 0 with 131 rules applied. Total rules applied 131 place count 657 transition count 915
Reduce places removed 131 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 132 rules applied. Total rules applied 263 place count 526 transition count 914
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 264 place count 525 transition count 914
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 264 place count 525 transition count 896
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 300 place count 507 transition count 896
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 311 place count 496 transition count 874
Iterating global reduction 3 with 11 rules applied. Total rules applied 322 place count 496 transition count 874
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 8 rules applied. Total rules applied 330 place count 496 transition count 866
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 338 place count 488 transition count 866
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 5 with 40 rules applied. Total rules applied 378 place count 468 transition count 846
Applied a total of 378 rules in 75 ms. Remains 468 /657 variables (removed 189) and now considering 846/1046 (removed 200) transitions.
// Phase 1: matrix 846 rows 468 cols
[2021-05-17 09:17:39] [INFO ] Computed 22 place invariants in 3 ms
[2021-05-17 09:17:40] [INFO ] Implicit Places using invariants in 305 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 315 ms to find 1 implicit places.
[2021-05-17 09:17:40] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 846 rows 467 cols
[2021-05-17 09:17:40] [INFO ] Computed 21 place invariants in 15 ms
[2021-05-17 09:17:40] [INFO ] Dead Transitions using invariants and state equation in 331 ms returned []
Starting structural reductions, iteration 1 : 467/657 places, 846/1046 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 467 transition count 844
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 465 transition count 844
Applied a total of 4 rules in 19 ms. Remains 465 /467 variables (removed 2) and now considering 844/846 (removed 2) transitions.
// Phase 1: matrix 844 rows 465 cols
[2021-05-17 09:17:40] [INFO ] Computed 21 place invariants in 3 ms
[2021-05-17 09:17:40] [INFO ] Implicit Places using invariants in 224 ms returned []
// Phase 1: matrix 844 rows 465 cols
[2021-05-17 09:17:40] [INFO ] Computed 21 place invariants in 13 ms
[2021-05-17 09:17:40] [INFO ] State equation strengthened by 780 read => feed constraints.
[2021-05-17 09:17:42] [INFO ] Implicit Places using invariants and state equation in 2044 ms returned []
Implicit Place search using SMT with State Equation took 2286 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 465/657 places, 844/1046 transitions.
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CANConstruction-PT-020-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LT s59 1), p1:(LT s438 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 716 reset in 403 ms.
Product exploration explored 100000 steps with 721 reset in 434 ms.
Knowledge obtained : [p0, p1]
Stuttering acceptance computed with spot in 56 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 717 reset in 402 ms.
Product exploration explored 100000 steps with 713 reset in 425 ms.
[2021-05-17 09:17:44] [INFO ] Flatten gal took : 53 ms
[2021-05-17 09:17:44] [INFO ] Flatten gal took : 44 ms
[2021-05-17 09:17:44] [INFO ] Time to serialize gal into /tmp/LTL5659033973557823488.gal : 4 ms
[2021-05-17 09:17:44] [INFO ] Time to serialize properties into /tmp/LTL3921773065826238192.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL5659033973557823488.gal, -t, CGAL, -LTL, /tmp/LTL3921773065826238192.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL5659033973557823488.gal -t CGAL -LTL /tmp/LTL3921773065826238192.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F(("(Node18ID2<1)")||(G(F("(Node18GiveAnswer11<1)")))))))
Formula 0 simplified : !GF("(Node18ID2<1)" | GF"(Node18GiveAnswer11<1)")
Detected timeout of ITS tools.
[2021-05-17 09:17:59] [INFO ] Flatten gal took : 32 ms
[2021-05-17 09:17:59] [INFO ] Applying decomposition
[2021-05-17 09:17:59] [INFO ] Flatten gal took : 71 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph429683661885938744.txt, -o, /tmp/graph429683661885938744.bin, -w, /tmp/graph429683661885938744.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph429683661885938744.bin, -l, -1, -v, -w, /tmp/graph429683661885938744.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 09:18:00] [INFO ] Decomposing Gal with order
[2021-05-17 09:18:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 09:18:00] [INFO ] Removed a total of 780 redundant transitions.
[2021-05-17 09:18:00] [INFO ] Flatten gal took : 225 ms
[2021-05-17 09:18:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 760 labels/synchronizations in 71 ms.
[2021-05-17 09:18:00] [INFO ] Time to serialize gal into /tmp/LTL12991993115033399351.gal : 17 ms
[2021-05-17 09:18:00] [INFO ] Time to serialize properties into /tmp/LTL13600400595888778861.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL12991993115033399351.gal, -t, CGAL, -LTL, /tmp/LTL13600400595888778861.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL12991993115033399351.gal -t CGAL -LTL /tmp/LTL13600400595888778861.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((G(F(("(i18.u18.Node18ID2<1)")||(G(F("(u21.Node18GiveAnswer11<1)")))))))
Formula 0 simplified : !GF("(i18.u18.Node18ID2<1)" | GF"(u21.Node18GiveAnswer11<1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5122236451283608868
[2021-05-17 09:18:15] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5122236451283608868
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin5122236451283608868]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin5122236451283608868] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin5122236451283608868] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property CANConstruction-PT-020-07 finished in 36757 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(p0)||X((X(G(p0)) U G(p1))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 657 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 657/657 places, 1046/1046 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 645 transition count 1023
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 645 transition count 1023
Applied a total of 24 rules in 27 ms. Remains 645 /657 variables (removed 12) and now considering 1023/1046 (removed 23) transitions.
// Phase 1: matrix 1023 rows 645 cols
[2021-05-17 09:18:16] [INFO ] Computed 22 place invariants in 14 ms
[2021-05-17 09:18:16] [INFO ] Implicit Places using invariants in 439 ms returned [24]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 446 ms to find 1 implicit places.
// Phase 1: matrix 1023 rows 644 cols
[2021-05-17 09:18:16] [INFO ] Computed 21 place invariants in 3 ms
[2021-05-17 09:18:17] [INFO ] Dead Transitions using invariants and state equation in 633 ms returned []
Starting structural reductions, iteration 1 : 644/657 places, 1023/1046 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 643 transition count 1022
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 643 transition count 1022
Applied a total of 2 rules in 27 ms. Remains 643 /644 variables (removed 1) and now considering 1022/1023 (removed 1) transitions.
// Phase 1: matrix 1022 rows 643 cols
[2021-05-17 09:18:17] [INFO ] Computed 21 place invariants in 10 ms
[2021-05-17 09:18:17] [INFO ] Implicit Places using invariants in 287 ms returned []
// Phase 1: matrix 1022 rows 643 cols
[2021-05-17 09:18:17] [INFO ] Computed 21 place invariants in 3 ms
[2021-05-17 09:18:18] [INFO ] State equation strengthened by 780 read => feed constraints.
[2021-05-17 09:18:20] [INFO ] Implicit Places using invariants and state equation in 2756 ms returned []
Implicit Place search using SMT with State Equation took 3045 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 643/657 places, 1022/1046 transitions.
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CANConstruction-PT-020-08 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s186 1) (GEQ s543 1)), p1:(GEQ s307 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 400 steps with 0 reset in 2 ms.
FORMULA CANConstruction-PT-020-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-020-08 finished in 4314 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 657 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 657/657 places, 1046/1046 transitions.
Drop transitions removed 133 transitions
Trivial Post-agglo rules discarded 133 transitions
Performed 133 trivial Post agglomeration. Transition count delta: 133
Iterating post reduction 0 with 133 rules applied. Total rules applied 133 place count 657 transition count 913
Reduce places removed 133 places and 0 transitions.
Iterating post reduction 1 with 133 rules applied. Total rules applied 266 place count 524 transition count 913
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 266 place count 524 transition count 894
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 304 place count 505 transition count 894
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 315 place count 494 transition count 872
Iterating global reduction 2 with 11 rules applied. Total rules applied 326 place count 494 transition count 872
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 8 rules applied. Total rules applied 334 place count 494 transition count 864
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 342 place count 486 transition count 864
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 4 with 40 rules applied. Total rules applied 382 place count 466 transition count 844
Applied a total of 382 rules in 50 ms. Remains 466 /657 variables (removed 191) and now considering 844/1046 (removed 202) transitions.
// Phase 1: matrix 844 rows 466 cols
[2021-05-17 09:18:20] [INFO ] Computed 22 place invariants in 3 ms
[2021-05-17 09:18:21] [INFO ] Implicit Places using invariants in 249 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 250 ms to find 1 implicit places.
[2021-05-17 09:18:21] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 844 rows 465 cols
[2021-05-17 09:18:21] [INFO ] Computed 21 place invariants in 2 ms
[2021-05-17 09:18:21] [INFO ] Dead Transitions using invariants and state equation in 331 ms returned []
Starting structural reductions, iteration 1 : 465/657 places, 844/1046 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 465 transition count 842
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 463 transition count 842
Applied a total of 4 rules in 19 ms. Remains 463 /465 variables (removed 2) and now considering 842/844 (removed 2) transitions.
// Phase 1: matrix 842 rows 463 cols
[2021-05-17 09:18:21] [INFO ] Computed 21 place invariants in 2 ms
[2021-05-17 09:18:21] [INFO ] Implicit Places using invariants in 261 ms returned []
// Phase 1: matrix 842 rows 463 cols
[2021-05-17 09:18:21] [INFO ] Computed 21 place invariants in 3 ms
[2021-05-17 09:18:21] [INFO ] State equation strengthened by 780 read => feed constraints.
[2021-05-17 09:18:23] [INFO ] Implicit Places using invariants and state equation in 2049 ms returned []
Implicit Place search using SMT with State Equation took 2311 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 463/657 places, 842/1046 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : CANConstruction-PT-020-10 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(LT s360 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 741 reset in 425 ms.
Stack based approach found an accepted trace after 18058 steps with 132 reset with depth 95 and stack size 95 in 73 ms.
FORMULA CANConstruction-PT-020-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-020-10 finished in 3525 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((p0&&X(G(p1))) U (G((p0&&X(G(p1))))||(X(G(p1))&&p2))))], workingDir=/home/mcc/execution]
Support contains 5 out of 657 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 657/657 places, 1046/1046 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 645 transition count 1023
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 645 transition count 1023
Applied a total of 24 rules in 27 ms. Remains 645 /657 variables (removed 12) and now considering 1023/1046 (removed 23) transitions.
// Phase 1: matrix 1023 rows 645 cols
[2021-05-17 09:18:24] [INFO ] Computed 22 place invariants in 3 ms
[2021-05-17 09:18:24] [INFO ] Implicit Places using invariants in 274 ms returned [24]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 275 ms to find 1 implicit places.
// Phase 1: matrix 1023 rows 644 cols
[2021-05-17 09:18:24] [INFO ] Computed 21 place invariants in 3 ms
[2021-05-17 09:18:25] [INFO ] Dead Transitions using invariants and state equation in 435 ms returned []
Starting structural reductions, iteration 1 : 644/657 places, 1023/1046 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 643 transition count 1022
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 643 transition count 1022
Applied a total of 2 rules in 34 ms. Remains 643 /644 variables (removed 1) and now considering 1022/1023 (removed 1) transitions.
// Phase 1: matrix 1022 rows 643 cols
[2021-05-17 09:18:25] [INFO ] Computed 21 place invariants in 3 ms
[2021-05-17 09:18:25] [INFO ] Implicit Places using invariants in 273 ms returned []
// Phase 1: matrix 1022 rows 643 cols
[2021-05-17 09:18:25] [INFO ] Computed 21 place invariants in 3 ms
[2021-05-17 09:18:25] [INFO ] State equation strengthened by 780 read => feed constraints.
[2021-05-17 09:18:28] [INFO ] Implicit Places using invariants and state equation in 2998 ms returned []
Implicit Place search using SMT with State Equation took 3273 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 643/657 places, 1022/1046 transitions.
Stuttering acceptance computed with spot in 66 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), true, (NOT p1)]
Running random walk in product with property : CANConstruction-PT-020-11 automaton TGBA [mat=[[{ cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(OR p2 p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p2:(AND (LT s605 1) (OR (LT s102 1) (LT s307 1))), p0:(OR (LT s102 1) (LT s307 1)), p1:(OR (LT s167 1) (LT s198 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1464 steps with 3 reset in 5 ms.
FORMULA CANConstruction-PT-020-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-020-11 finished in 4134 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X((X(p0)&&F(p1))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 657 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 657/657 places, 1046/1046 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 645 transition count 1023
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 645 transition count 1023
Applied a total of 24 rules in 27 ms. Remains 645 /657 variables (removed 12) and now considering 1023/1046 (removed 23) transitions.
// Phase 1: matrix 1023 rows 645 cols
[2021-05-17 09:18:28] [INFO ] Computed 22 place invariants in 3 ms
[2021-05-17 09:18:28] [INFO ] Implicit Places using invariants in 276 ms returned []
// Phase 1: matrix 1023 rows 645 cols
[2021-05-17 09:18:28] [INFO ] Computed 22 place invariants in 3 ms
[2021-05-17 09:18:29] [INFO ] State equation strengthened by 780 read => feed constraints.
[2021-05-17 09:18:33] [INFO ] Implicit Places using invariants and state equation in 4265 ms returned []
Implicit Place search using SMT with State Equation took 4543 ms to find 0 implicit places.
// Phase 1: matrix 1023 rows 645 cols
[2021-05-17 09:18:33] [INFO ] Computed 22 place invariants in 2 ms
[2021-05-17 09:18:33] [INFO ] Dead Transitions using invariants and state equation in 437 ms returned []
Finished structural reductions, in 1 iterations. Remains : 645/657 places, 1023/1046 transitions.
Stuttering acceptance computed with spot in 215 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Running random walk in product with property : CANConstruction-PT-020-12 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}, { cond=(NOT p1), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={} source=4 dest: 6}], [{ cond=(NOT p1), acceptance={} source=5 dest: 5}], [{ cond=true, acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(OR (LT s18 1) (LT s97 1) (GEQ s353 1)), p0:(OR (LT s24 1) (LT s25 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 20000 reset in 456 ms.
Product exploration explored 100000 steps with 20000 reset in 434 ms.
Knowledge obtained : [p1, p0]
Stuttering acceptance computed with spot in 165 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Product exploration explored 100000 steps with 20000 reset in 375 ms.
Product exploration explored 100000 steps with 20000 reset in 377 ms.
Applying partial POR strategy [false, false, false, false, true, true, true]
Stuttering acceptance computed with spot in 183 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Support contains 5 out of 645 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 645/645 places, 1023/1023 transitions.
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 78 rules applied. Total rules applied 78 place count 645 transition count 1023
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 23 Pre rules applied. Total rules applied 78 place count 645 transition count 1023
Deduced a syphon composed of 101 places in 0 ms
Iterating global reduction 1 with 23 rules applied. Total rules applied 101 place count 645 transition count 1023
Discarding 40 places :
Symmetric choice reduction at 1 with 40 rule applications. Total rules 141 place count 605 transition count 983
Deduced a syphon composed of 61 places in 0 ms
Iterating global reduction 1 with 40 rules applied. Total rules applied 181 place count 605 transition count 983
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 136 places in 0 ms
Iterating global reduction 1 with 75 rules applied. Total rules applied 256 place count 605 transition count 983
Discarding 93 places :
Symmetric choice reduction at 1 with 93 rule applications. Total rules 349 place count 512 transition count 890
Deduced a syphon composed of 43 places in 0 ms
Iterating global reduction 1 with 93 rules applied. Total rules applied 442 place count 512 transition count 890
Deduced a syphon composed of 43 places in 0 ms
Applied a total of 442 rules in 115 ms. Remains 512 /645 variables (removed 133) and now considering 890/1023 (removed 133) transitions.
[2021-05-17 09:18:36] [INFO ] Redundant transitions in 10 ms returned []
// Phase 1: matrix 890 rows 512 cols
[2021-05-17 09:18:36] [INFO ] Computed 22 place invariants in 4 ms
[2021-05-17 09:18:36] [INFO ] Dead Transitions using invariants and state equation in 476 ms returned []
Finished structural reductions, in 1 iterations. Remains : 512/645 places, 890/1023 transitions.
Product exploration explored 100000 steps with 20000 reset in 1524 ms.
Product exploration explored 100000 steps with 20000 reset in 1449 ms.
[2021-05-17 09:18:39] [INFO ] Flatten gal took : 28 ms
[2021-05-17 09:18:39] [INFO ] Flatten gal took : 28 ms
[2021-05-17 09:18:39] [INFO ] Time to serialize gal into /tmp/LTL7692393714897729024.gal : 4 ms
[2021-05-17 09:18:39] [INFO ] Time to serialize properties into /tmp/LTL13180963695295954367.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL7692393714897729024.gal, -t, CGAL, -LTL, /tmp/LTL13180963695295954367.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL7692393714897729024.gal -t CGAL -LTL /tmp/LTL13180963695295954367.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(X((X("((Node1WaitAnswer<1)||(Node1OKshare<1))"))&&(F("(((Node1IsInserted<1)||(Node7Request<1))||(Node4GiveAnswer13>=1))")))))))
Formula 0 simplified : !XXX(X"((Node1WaitAnswer<1)||(Node1OKshare<1))" & F"(((Node1IsInserted<1)||(Node7Request<1))||(Node4GiveAnswer13>=1))")
Detected timeout of ITS tools.
[2021-05-17 09:18:54] [INFO ] Flatten gal took : 25 ms
[2021-05-17 09:18:54] [INFO ] Applying decomposition
[2021-05-17 09:18:54] [INFO ] Flatten gal took : 26 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph14880606464613704545.txt, -o, /tmp/graph14880606464613704545.bin, -w, /tmp/graph14880606464613704545.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph14880606464613704545.bin, -l, -1, -v, -w, /tmp/graph14880606464613704545.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 09:18:54] [INFO ] Decomposing Gal with order
[2021-05-17 09:18:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 09:18:54] [INFO ] Removed a total of 792 redundant transitions.
[2021-05-17 09:18:54] [INFO ] Flatten gal took : 81 ms
[2021-05-17 09:18:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 1468 labels/synchronizations in 25 ms.
[2021-05-17 09:18:54] [INFO ] Time to serialize gal into /tmp/LTL17530656025195552127.gal : 7 ms
[2021-05-17 09:18:54] [INFO ] Time to serialize properties into /tmp/LTL18321750938336803481.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL17530656025195552127.gal, -t, CGAL, -LTL, /tmp/LTL18321750938336803481.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL17530656025195552127.gal -t CGAL -LTL /tmp/LTL18321750938336803481.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(X(X((X("((i1.u6.Node1WaitAnswer<1)||(i1.u7.Node1OKshare<1))"))&&(F("(((i0.u2.Node1IsInserted<1)||(i7.u32.Node7Request<1))||(i13.u56.Node4GiveAnswer13>=1))")))))))
Formula 0 simplified : !XXX(X"((i1.u6.Node1WaitAnswer<1)||(i1.u7.Node1OKshare<1))" & F"(((i0.u2.Node1IsInserted<1)||(i7.u32.Node7Request<1))||(i13.u56.Node4GiveAnswer13>=1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7796715237270436839
[2021-05-17 09:19:09] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7796715237270436839
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin7796715237270436839]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin7796715237270436839] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin7796715237270436839] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property CANConstruction-PT-020-12 finished in 42429 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(p1)||p0)))], workingDir=/home/mcc/execution]
Support contains 4 out of 657 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 657/657 places, 1046/1046 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 644 transition count 1021
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 644 transition count 1021
Applied a total of 26 rules in 26 ms. Remains 644 /657 variables (removed 13) and now considering 1021/1046 (removed 25) transitions.
// Phase 1: matrix 1021 rows 644 cols
[2021-05-17 09:19:10] [INFO ] Computed 22 place invariants in 2 ms
[2021-05-17 09:19:11] [INFO ] Implicit Places using invariants in 279 ms returned [24]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 281 ms to find 1 implicit places.
// Phase 1: matrix 1021 rows 643 cols
[2021-05-17 09:19:11] [INFO ] Computed 21 place invariants in 3 ms
[2021-05-17 09:19:11] [INFO ] Dead Transitions using invariants and state equation in 412 ms returned []
Starting structural reductions, iteration 1 : 643/657 places, 1021/1046 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 642 transition count 1020
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 642 transition count 1020
Applied a total of 2 rules in 24 ms. Remains 642 /643 variables (removed 1) and now considering 1020/1021 (removed 1) transitions.
// Phase 1: matrix 1020 rows 642 cols
[2021-05-17 09:19:11] [INFO ] Computed 21 place invariants in 3 ms
[2021-05-17 09:19:11] [INFO ] Implicit Places using invariants in 288 ms returned []
// Phase 1: matrix 1020 rows 642 cols
[2021-05-17 09:19:11] [INFO ] Computed 21 place invariants in 3 ms
[2021-05-17 09:19:12] [INFO ] State equation strengthened by 780 read => feed constraints.
[2021-05-17 09:19:17] [INFO ] Implicit Places using invariants and state equation in 5065 ms returned []
Implicit Place search using SMT with State Equation took 5360 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 642/657 places, 1020/1046 transitions.
Stuttering acceptance computed with spot in 82 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CANConstruction-PT-020-13 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(OR (LT s30 1) (LT s454 1)), p0:(OR (LT s210 1) (LT s354 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 597 ms.
Product exploration explored 100000 steps with 50000 reset in 631 ms.
Knowledge obtained : [p1, p0]
Stuttering acceptance computed with spot in 76 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 50000 reset in 603 ms.
Product exploration explored 100000 steps with 50000 reset in 624 ms.
Applying partial POR strategy [true, false, true, true]
Stuttering acceptance computed with spot in 83 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 642 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 642/642 places, 1020/1020 transitions.
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 80 rules applied. Total rules applied 80 place count 642 transition count 1020
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 20 Pre rules applied. Total rules applied 80 place count 642 transition count 1020
Deduced a syphon composed of 100 places in 0 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 100 place count 642 transition count 1020
Discarding 40 places :
Symmetric choice reduction at 1 with 40 rule applications. Total rules 140 place count 602 transition count 980
Deduced a syphon composed of 60 places in 0 ms
Iterating global reduction 1 with 40 rules applied. Total rules applied 180 place count 602 transition count 980
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 138 places in 0 ms
Iterating global reduction 1 with 78 rules applied. Total rules applied 258 place count 602 transition count 980
Discarding 98 places :
Symmetric choice reduction at 1 with 98 rule applications. Total rules 356 place count 504 transition count 882
Deduced a syphon composed of 40 places in 1 ms
Iterating global reduction 1 with 98 rules applied. Total rules applied 454 place count 504 transition count 882
Deduced a syphon composed of 40 places in 0 ms
Applied a total of 454 rules in 90 ms. Remains 504 /642 variables (removed 138) and now considering 882/1020 (removed 138) transitions.
[2021-05-17 09:19:19] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 882 rows 504 cols
[2021-05-17 09:19:19] [INFO ] Computed 21 place invariants in 3 ms
[2021-05-17 09:19:20] [INFO ] Dead Transitions using invariants and state equation in 328 ms returned []
Finished structural reductions, in 1 iterations. Remains : 504/642 places, 882/1020 transitions.
Product exploration explored 100000 steps with 50000 reset in 3051 ms.
Product exploration explored 100000 steps with 50000 reset in 3099 ms.
[2021-05-17 09:19:26] [INFO ] Flatten gal took : 51 ms
[2021-05-17 09:19:26] [INFO ] Flatten gal took : 32 ms
[2021-05-17 09:19:26] [INFO ] Time to serialize gal into /tmp/LTL8127710251292255392.gal : 3 ms
[2021-05-17 09:19:26] [INFO ] Time to serialize properties into /tmp/LTL10455396659247730527.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL8127710251292255392.gal, -t, CGAL, -LTL, /tmp/LTL10455396659247730527.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8127710251292255392.gal -t CGAL -LTL /tmp/LTL10455396659247730527.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(("((Node17IsInserted<1)||(Node4requestsent17<1))")||(G("((Node2IsInserted<1)||(Node10requestsent2<1))")))))
Formula 0 simplified : !X("((Node17IsInserted<1)||(Node4requestsent17<1))" | G"((Node2IsInserted<1)||(Node10requestsent2<1))")
Detected timeout of ITS tools.
[2021-05-17 09:19:41] [INFO ] Flatten gal took : 25 ms
[2021-05-17 09:19:41] [INFO ] Applying decomposition
[2021-05-17 09:19:41] [INFO ] Flatten gal took : 24 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph6907544588241782475.txt, -o, /tmp/graph6907544588241782475.bin, -w, /tmp/graph6907544588241782475.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph6907544588241782475.bin, -l, -1, -v, -w, /tmp/graph6907544588241782475.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 09:19:41] [INFO ] Decomposing Gal with order
[2021-05-17 09:19:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 09:19:41] [INFO ] Removed a total of 795 redundant transitions.
[2021-05-17 09:19:41] [INFO ] Flatten gal took : 74 ms
[2021-05-17 09:19:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 1480 labels/synchronizations in 20 ms.
[2021-05-17 09:19:41] [INFO ] Time to serialize gal into /tmp/LTL2572409492937987782.gal : 6 ms
[2021-05-17 09:19:41] [INFO ] Time to serialize properties into /tmp/LTL2716956417242449390.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL2572409492937987782.gal, -t, CGAL, -LTL, /tmp/LTL2716956417242449390.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL2572409492937987782.gal -t CGAL -LTL /tmp/LTL2716956417242449390.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(("((i1.u6.Node17IsInserted<1)||(i4.u19.Node4requestsent17<1))")||(G("((i0.u2.Node2IsInserted<1)||(i10.u46.Node10requestsent2<1))")))))
Formula 0 simplified : !X("((i1.u6.Node17IsInserted<1)||(i4.u19.Node4requestsent17<1))" | G"((i0.u2.Node2IsInserted<1)||(i10.u46.Node10requestsent2<1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3747857111472064131
[2021-05-17 09:19:56] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3747857111472064131
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin3747857111472064131]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin3747857111472064131] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin3747857111472064131] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property CANConstruction-PT-020-13 finished in 47030 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 657 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 657/657 places, 1046/1046 transitions.
Drop transitions removed 133 transitions
Trivial Post-agglo rules discarded 133 transitions
Performed 133 trivial Post agglomeration. Transition count delta: 133
Iterating post reduction 0 with 133 rules applied. Total rules applied 133 place count 657 transition count 913
Reduce places removed 133 places and 0 transitions.
Iterating post reduction 1 with 133 rules applied. Total rules applied 266 place count 524 transition count 913
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 266 place count 524 transition count 894
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 304 place count 505 transition count 894
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 316 place count 493 transition count 870
Iterating global reduction 2 with 12 rules applied. Total rules applied 328 place count 493 transition count 870
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 2 with 9 rules applied. Total rules applied 337 place count 493 transition count 861
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 346 place count 484 transition count 861
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 382 place count 466 transition count 843
Applied a total of 382 rules in 93 ms. Remains 466 /657 variables (removed 191) and now considering 843/1046 (removed 203) transitions.
// Phase 1: matrix 843 rows 466 cols
[2021-05-17 09:19:58] [INFO ] Computed 22 place invariants in 3 ms
[2021-05-17 09:19:58] [INFO ] Implicit Places using invariants in 457 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 459 ms to find 1 implicit places.
[2021-05-17 09:19:58] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 843 rows 465 cols
[2021-05-17 09:19:58] [INFO ] Computed 21 place invariants in 3 ms
[2021-05-17 09:19:58] [INFO ] Dead Transitions using invariants and state equation in 313 ms returned []
Starting structural reductions, iteration 1 : 465/657 places, 843/1046 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 465 transition count 841
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 463 transition count 841
Applied a total of 4 rules in 17 ms. Remains 463 /465 variables (removed 2) and now considering 841/843 (removed 2) transitions.
// Phase 1: matrix 841 rows 463 cols
[2021-05-17 09:19:58] [INFO ] Computed 21 place invariants in 3 ms
[2021-05-17 09:19:59] [INFO ] Implicit Places using invariants in 224 ms returned []
// Phase 1: matrix 841 rows 463 cols
[2021-05-17 09:19:59] [INFO ] Computed 21 place invariants in 2 ms
[2021-05-17 09:19:59] [INFO ] State equation strengthened by 780 read => feed constraints.
[2021-05-17 09:20:01] [INFO ] Implicit Places using invariants and state equation in 2185 ms returned []
Implicit Place search using SMT with State Equation took 2419 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 463/657 places, 841/1046 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : CANConstruction-PT-020-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s49 1) (GEQ s116 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 111 steps with 0 reset in 0 ms.
FORMULA CANConstruction-PT-020-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-020-14 finished in 3374 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 657 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 657/657 places, 1046/1046 transitions.
Drop transitions removed 133 transitions
Trivial Post-agglo rules discarded 133 transitions
Performed 133 trivial Post agglomeration. Transition count delta: 133
Iterating post reduction 0 with 133 rules applied. Total rules applied 133 place count 657 transition count 913
Reduce places removed 133 places and 0 transitions.
Iterating post reduction 1 with 133 rules applied. Total rules applied 266 place count 524 transition count 913
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 266 place count 524 transition count 894
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 304 place count 505 transition count 894
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 314 place count 495 transition count 874
Iterating global reduction 2 with 10 rules applied. Total rules applied 324 place count 495 transition count 874
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 2 with 7 rules applied. Total rules applied 331 place count 495 transition count 867
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 338 place count 488 transition count 867
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 4 with 42 rules applied. Total rules applied 380 place count 467 transition count 846
Applied a total of 380 rules in 43 ms. Remains 467 /657 variables (removed 190) and now considering 846/1046 (removed 200) transitions.
// Phase 1: matrix 846 rows 467 cols
[2021-05-17 09:20:01] [INFO ] Computed 22 place invariants in 2 ms
[2021-05-17 09:20:01] [INFO ] Implicit Places using invariants in 217 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 227 ms to find 1 implicit places.
[2021-05-17 09:20:01] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 846 rows 466 cols
[2021-05-17 09:20:01] [INFO ] Computed 21 place invariants in 3 ms
[2021-05-17 09:20:01] [INFO ] Dead Transitions using invariants and state equation in 315 ms returned []
Starting structural reductions, iteration 1 : 466/657 places, 846/1046 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 466 transition count 844
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 464 transition count 844
Applied a total of 4 rules in 30 ms. Remains 464 /466 variables (removed 2) and now considering 844/846 (removed 2) transitions.
// Phase 1: matrix 844 rows 464 cols
[2021-05-17 09:20:01] [INFO ] Computed 21 place invariants in 2 ms
[2021-05-17 09:20:02] [INFO ] Implicit Places using invariants in 314 ms returned []
// Phase 1: matrix 844 rows 464 cols
[2021-05-17 09:20:02] [INFO ] Computed 21 place invariants in 3 ms
[2021-05-17 09:20:02] [INFO ] State equation strengthened by 780 read => feed constraints.
[2021-05-17 09:20:04] [INFO ] Implicit Places using invariants and state equation in 2130 ms returned []
Implicit Place search using SMT with State Equation took 2458 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 464/657 places, 844/1046 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-020-15 automaton TGBA [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:(AND (LT s326 1) (LT s251 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 788 reset in 380 ms.
Stack based approach found an accepted trace after 32133 steps with 253 reset with depth 101 and stack size 100 in 129 ms.
FORMULA CANConstruction-PT-020-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-020-15 finished in 3666 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin6882761748320885137
[2021-05-17 09:20:04] [INFO ] Computing symmetric may disable matrix : 1046 transitions.
[2021-05-17 09:20:04] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-17 09:20:04] [INFO ] Computing symmetric may enable matrix : 1046 transitions.
[2021-05-17 09:20:04] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-17 09:20:04] [INFO ] Applying decomposition
[2021-05-17 09:20:05] [INFO ] Flatten gal took : 24 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph10379099064969624521.txt, -o, /tmp/graph10379099064969624521.bin, -w, /tmp/graph10379099064969624521.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph10379099064969624521.bin, -l, -1, -v, -w, /tmp/graph10379099064969624521.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 09:20:05] [INFO ] Decomposing Gal with order
[2021-05-17 09:20:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 09:20:05] [INFO ] Removed a total of 789 redundant transitions.
[2021-05-17 09:20:05] [INFO ] Flatten gal took : 125 ms
[2021-05-17 09:20:05] [INFO ] Computing Do-Not-Accords matrix : 1046 transitions.
[2021-05-17 09:20:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 1436 labels/synchronizations in 22 ms.
[2021-05-17 09:20:05] [INFO ] Computation of Completed DNA matrix. took 33 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-17 09:20:05] [INFO ] Time to serialize gal into /tmp/LTLFireability4950098971199199360.gal : 6 ms
[2021-05-17 09:20:05] [INFO ] Time to serialize properties into /tmp/LTLFireability1678818330602469393.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLFireability4950098971199199360.gal, -t, CGAL, -LTL, /tmp/LTLFireability1678818330602469393.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
[2021-05-17 09:20:05] [INFO ] Built C files in 350ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6882761748320885137
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin6882761748320885137]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireability4950098971199199360.gal -t CGAL -LTL /tmp/LTLFireability1678818330602469393.ltl -c -stutter-deadlock
Read 4 LTL properties
Checking formula 0 : !((G(F(("(i15.u62.Node0GiveAnswer16<1)")||(G(!("((i2.u9.Node2Request>=1)&&(i9.u35.Node17IsInserted>=1))")))))))
Formula 0 simplified : !GF("(i15.u62.Node0GiveAnswer16<1)" | G!"((i2.u9.Node2Request>=1)&&(i9.u35.Node17IsInserted>=1))")
Compilation finished in 7689 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin6882761748320885137]
Link finished in 79 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, [](<>(((LTLAPp0==true)||[]((LTLAPp1==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin6882761748320885137]
LTSmin run took 11261 ms.
FORMULA CANConstruction-PT-020-03 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, [](<>(((LTLAPp2==true)||[](<>((LTLAPp3==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin6882761748320885137]
WARNING : LTSmin timed out (>257 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, [](<>(((LTLAPp2==true)||[](<>((LTLAPp3==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin6882761748320885137]
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(X(X((X((LTLAPp4==true))&&<>((LTLAPp5==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin6882761748320885137]
LTSmin run took 507 ms.
FORMULA CANConstruction-PT-020-12 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(([]((LTLAPp7==true))||(LTLAPp6==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin6882761748320885137]
LTSmin run took 497 ms.
FORMULA CANConstruction-PT-020-13 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Retrying LTSmin with larger timeout 2056 s
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, [](<>(((LTLAPp2==true)||[](<>((LTLAPp3==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin6882761748320885137]
Detected timeout of ITS tools.
[2021-05-17 09:41:19] [INFO ] Flatten gal took : 59 ms
[2021-05-17 09:41:19] [INFO ] Time to serialize gal into /tmp/LTLFireability1987666266574820352.gal : 20 ms
[2021-05-17 09:41:19] [INFO ] Time to serialize properties into /tmp/LTLFireability10675754997500257041.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLFireability1987666266574820352.gal, -t, CGAL, -LTL, /tmp/LTLFireability10675754997500257041.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireability1987666266574820352.gal -t CGAL -LTL /tmp/LTLFireability10675754997500257041.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F(("(Node18ID2<1)")||(G(F("(Node18GiveAnswer11<1)")))))))
Formula 0 simplified : !GF("(Node18ID2<1)" | GF"(Node18GiveAnswer11<1)")
WARNING : LTSmin timed out (>2056 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, [](<>(((LTLAPp2==true)||[](<>((LTLAPp3==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin6882761748320885137]
Detected timeout of ITS tools.
[2021-05-17 10:02:32] [INFO ] Flatten gal took : 47 ms
[2021-05-17 10:02:32] [INFO ] Input system was already deterministic with 1046 transitions.
[2021-05-17 10:02:32] [INFO ] Transformed 657 places.
[2021-05-17 10:02:33] [INFO ] Transformed 1046 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-05-17 10:02:36] [INFO ] Time to serialize gal into /tmp/LTLFireability6588391744679924276.gal : 3 ms
[2021-05-17 10:02:36] [INFO ] Time to serialize properties into /tmp/LTLFireability6383038166377681675.ltl : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLFireability6588391744679924276.gal, -t, CGAL, -LTL, /tmp/LTLFireability6383038166377681675.ltl, -c, -stutter-deadlock, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireability6588391744679924276.gal -t CGAL -LTL /tmp/LTLFireability6383038166377681675.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F(("(Node18ID2<1)")||(G(F("(Node18GiveAnswer11<1)")))))))
Formula 0 simplified : !GF("(Node18ID2<1)" | GF"(Node18GiveAnswer11<1)")

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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