fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r168-tall-165277016700459
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for PolyORBLF-COL-S02J04T10

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
6729.668 961276.00 3020216.00 5720.40 FFFTFFFFFFFFTTFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r168-tall-165277016700459.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is PolyORBLF-COL-S02J04T10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-tall-165277016700459
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 360K
-rw-r--r-- 1 mcc users 6.0K Apr 29 13:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 50K Apr 29 13:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Apr 29 13:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Apr 29 13:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K May 9 08:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 08:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 9 08:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 08:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 08:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_pt
-rw-r--r-- 1 mcc users 10 May 10 09:34 instance
-rw-r--r-- 1 mcc users 5 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 154K May 10 09:34 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1652853740903

Running Version 202205111006
[2022-05-18 06:02:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-18 06:02:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-18 06:02:22] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2022-05-18 06:02:22] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-18 06:02:22] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 675 ms
[2022-05-18 06:02:22] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 752 PT places and 1664.0 transition bindings in 25 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
FORMULA PolyORBLF-COL-S02J04T10-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-18 06:02:22] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 7 ms.
[2022-05-18 06:02:22] [INFO ] Skeletonized 15 HLPN properties in 0 ms.
Initial state reduction rules removed 2 formulas.
FORMULA PolyORBLF-COL-S02J04T10-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T10-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 13 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Incomplete random walk after 10000 steps, including 3 resets, run finished after 315 ms. (steps per millisecond=31 ) properties (out of 23) seen :19
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 155 ms. (steps per millisecond=64 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2022-05-18 06:02:23] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2022-05-18 06:02:23] [INFO ] Computed 26 place invariants in 14 ms
[2022-05-18 06:02:24] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2022-05-18 06:02:24] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 5 ms returned sat
[2022-05-18 06:02:24] [INFO ] After 180ms SMT Verify possible using all constraints in real domain returned unsat :4 sat :0
Fused 4 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 4 atomic propositions for a total of 12 simplifications.
FORMULA PolyORBLF-COL-S02J04T10-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-18 06:02:24] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2022-05-18 06:02:24] [INFO ] Flatten gal took : 29 ms
FORMULA PolyORBLF-COL-S02J04T10-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T10-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-18 06:02:24] [INFO ] Flatten gal took : 9 ms
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
[2022-05-18 06:02:24] [INFO ] Unfolded HLPN to a Petri net with 752 places and 1572 transitions 7262 arcs in 29 ms.
[2022-05-18 06:02:24] [INFO ] Unfolded 10 HLPN properties in 1 ms.
Ensure Unique test removed 160 transitions
Reduce redundant transitions removed 160 transitions.
Support contains 180 out of 752 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 752/752 places, 1412/1412 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 750 transition count 1412
Applied a total of 2 rules in 70 ms. Remains 750 /752 variables (removed 2) and now considering 1412/1412 (removed 0) transitions.
[2022-05-18 06:02:24] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
// Phase 1: matrix 1392 rows 750 cols
[2022-05-18 06:02:24] [INFO ] Computed 52 place invariants in 74 ms
[2022-05-18 06:02:25] [INFO ] Dead Transitions using invariants and state equation in 777 ms found 110 transitions.
Found 110 dead transitions using SMT.
Drop transitions removed 110 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 110 transitions.
[2022-05-18 06:02:25] [INFO ] Flow matrix only has 1282 transitions (discarded 20 similar events)
// Phase 1: matrix 1282 rows 750 cols
[2022-05-18 06:02:25] [INFO ] Computed 52 place invariants in 55 ms
[2022-05-18 06:02:25] [INFO ] Implicit Places using invariants in 444 ms returned [574, 575, 576, 577, 578, 579, 580, 581, 582, 583]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 452 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 740/752 places, 1302/1412 transitions.
Reduce places removed 1 places and 20 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 739 transition count 1282
Reduce places removed 20 places and 20 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 21 place count 719 transition count 1262
Deduced a syphon composed of 1 places in 3 ms
Applied a total of 21 rules in 27 ms. Remains 719 /740 variables (removed 21) and now considering 1262/1302 (removed 40) transitions.
[2022-05-18 06:02:25] [INFO ] Flow matrix only has 1242 transitions (discarded 20 similar events)
// Phase 1: matrix 1242 rows 719 cols
[2022-05-18 06:02:25] [INFO ] Computed 43 place invariants in 35 ms
[2022-05-18 06:02:25] [INFO ] Implicit Places using invariants in 412 ms returned []
[2022-05-18 06:02:25] [INFO ] Flow matrix only has 1242 transitions (discarded 20 similar events)
// Phase 1: matrix 1242 rows 719 cols
[2022-05-18 06:02:26] [INFO ] Computed 43 place invariants in 48 ms
[2022-05-18 06:02:26] [INFO ] State equation strengthened by 120 read => feed constraints.
[2022-05-18 06:02:31] [INFO ] Implicit Places using invariants and state equation in 5290 ms returned []
Implicit Place search using SMT with State Equation took 5706 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 719/752 places, 1262/1412 transitions.
Finished structural reductions, in 2 iterations. Remains : 719/752 places, 1262/1412 transitions.
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 0 transitions.
Support contains 179 out of 718 places after structural reductions.
[2022-05-18 06:02:31] [INFO ] Flatten gal took : 107 ms
[2022-05-18 06:02:31] [INFO ] Flatten gal took : 93 ms
[2022-05-18 06:02:31] [INFO ] Input system was already deterministic with 1262 transitions.
Support contains 169 out of 718 places (down from 179) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 15) seen :13
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2022-05-18 06:02:32] [INFO ] Flow matrix only has 1242 transitions (discarded 20 similar events)
// Phase 1: matrix 1242 rows 718 cols
[2022-05-18 06:02:32] [INFO ] Computed 42 place invariants in 39 ms
[2022-05-18 06:02:32] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2022-05-18 06:02:32] [INFO ] [Real]Absence check using 10 positive and 32 generalized place invariants in 40 ms returned sat
[2022-05-18 06:02:32] [INFO ] After 153ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
FORMULA PolyORBLF-COL-S02J04T10-LTLCardinality-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 9 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 11 out of 718 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 718/718 places, 1262/1262 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 708 transition count 1252
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 708 transition count 1252
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 30 place count 698 transition count 1242
Iterating global reduction 0 with 10 rules applied. Total rules applied 40 place count 698 transition count 1242
Applied a total of 40 rules in 75 ms. Remains 698 /718 variables (removed 20) and now considering 1242/1262 (removed 20) transitions.
[2022-05-18 06:02:32] [INFO ] Flow matrix only has 1222 transitions (discarded 20 similar events)
// Phase 1: matrix 1222 rows 698 cols
[2022-05-18 06:02:32] [INFO ] Computed 42 place invariants in 19 ms
[2022-05-18 06:02:33] [INFO ] Dead Transitions using invariants and state equation in 562 ms found 0 transitions.
[2022-05-18 06:02:33] [INFO ] Flow matrix only has 1222 transitions (discarded 20 similar events)
// Phase 1: matrix 1222 rows 698 cols
[2022-05-18 06:02:33] [INFO ] Computed 42 place invariants in 14 ms
[2022-05-18 06:02:33] [INFO ] Implicit Places using invariants in 408 ms returned []
[2022-05-18 06:02:33] [INFO ] Flow matrix only has 1222 transitions (discarded 20 similar events)
// Phase 1: matrix 1222 rows 698 cols
[2022-05-18 06:02:33] [INFO ] Computed 42 place invariants in 14 ms
[2022-05-18 06:02:33] [INFO ] State equation strengthened by 120 read => feed constraints.
[2022-05-18 06:02:41] [INFO ] Implicit Places using invariants and state equation in 8274 ms returned []
Implicit Place search using SMT with State Equation took 8686 ms to find 0 implicit places.
[2022-05-18 06:02:41] [INFO ] Flow matrix only has 1222 transitions (discarded 20 similar events)
// Phase 1: matrix 1222 rows 698 cols
[2022-05-18 06:02:41] [INFO ] Computed 42 place invariants in 22 ms
[2022-05-18 06:02:42] [INFO ] Dead Transitions using invariants and state equation in 526 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 698/718 places, 1242/1262 transitions.
Finished structural reductions, in 1 iterations. Remains : 698/718 places, 1242/1262 transitions.
Stuttering acceptance computed with spot in 804 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S02J04T10-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(GT s248 (ADD s348 s349 s350 s351 s352 s353 s354 s355 s356 s357))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA PolyORBLF-COL-S02J04T10-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S02J04T10-LTLCardinality-00 finished in 10705 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((G(p0)&&F(p0)))&&X(X(p1)))))'
Support contains 31 out of 718 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 718/718 places, 1262/1262 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 708 transition count 1252
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 708 transition count 1252
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 30 place count 698 transition count 1242
Iterating global reduction 0 with 10 rules applied. Total rules applied 40 place count 698 transition count 1242
Applied a total of 40 rules in 66 ms. Remains 698 /718 variables (removed 20) and now considering 1242/1262 (removed 20) transitions.
[2022-05-18 06:02:43] [INFO ] Flow matrix only has 1222 transitions (discarded 20 similar events)
// Phase 1: matrix 1222 rows 698 cols
[2022-05-18 06:02:43] [INFO ] Computed 42 place invariants in 20 ms
[2022-05-18 06:02:43] [INFO ] Dead Transitions using invariants and state equation in 519 ms found 0 transitions.
[2022-05-18 06:02:43] [INFO ] Flow matrix only has 1222 transitions (discarded 20 similar events)
// Phase 1: matrix 1222 rows 698 cols
[2022-05-18 06:02:43] [INFO ] Computed 42 place invariants in 16 ms
[2022-05-18 06:02:44] [INFO ] Implicit Places using invariants in 408 ms returned []
[2022-05-18 06:02:44] [INFO ] Flow matrix only has 1222 transitions (discarded 20 similar events)
// Phase 1: matrix 1222 rows 698 cols
[2022-05-18 06:02:44] [INFO ] Computed 42 place invariants in 23 ms
[2022-05-18 06:02:44] [INFO ] State equation strengthened by 120 read => feed constraints.
[2022-05-18 06:02:51] [INFO ] Implicit Places using invariants and state equation in 7117 ms returned []
Implicit Place search using SMT with State Equation took 7530 ms to find 0 implicit places.
[2022-05-18 06:02:51] [INFO ] Flow matrix only has 1222 transitions (discarded 20 similar events)
// Phase 1: matrix 1222 rows 698 cols
[2022-05-18 06:02:51] [INFO ] Computed 42 place invariants in 17 ms
[2022-05-18 06:02:51] [INFO ] Dead Transitions using invariants and state equation in 494 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 698/718 places, 1242/1262 transitions.
Finished structural reductions, in 1 iterations. Remains : 698/718 places, 1242/1262 transitions.
Stuttering acceptance computed with spot in 988 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S02J04T10-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}, { cond=p1, acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=p0, acceptance={} source=5 dest: 5}, { cond=(NOT p0), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(GT s371 (ADD s510 s511 s512 s513 s514 s515 s516 s517 s518 s519)), p0:(LEQ (ADD s192 s193 s194 s195 s196 s197 s198 s199 s200 s201) (ADD s2 s3 s4 s5 s6 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 15 reset in 393 ms.
Stack based approach found an accepted trace after 2334 steps with 0 reset with depth 2335 and stack size 2335 in 10 ms.
FORMULA PolyORBLF-COL-S02J04T10-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property PolyORBLF-COL-S02J04T10-LTLCardinality-01 finished in 10023 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 20 out of 718 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 718/718 places, 1262/1262 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 718 transition count 1212
Reduce places removed 50 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 60 rules applied. Total rules applied 110 place count 668 transition count 1202
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 120 place count 658 transition count 1202
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 90 Pre rules applied. Total rules applied 120 place count 658 transition count 1112
Deduced a syphon composed of 90 places in 0 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 3 with 180 rules applied. Total rules applied 300 place count 568 transition count 1112
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 310 place count 558 transition count 1102
Iterating global reduction 3 with 10 rules applied. Total rules applied 320 place count 558 transition count 1102
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 1 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 3 with 140 rules applied. Total rules applied 460 place count 488 transition count 1032
Applied a total of 460 rules in 131 ms. Remains 488 /718 variables (removed 230) and now considering 1032/1262 (removed 230) transitions.
[2022-05-18 06:02:53] [INFO ] Flow matrix only has 1012 transitions (discarded 20 similar events)
// Phase 1: matrix 1012 rows 488 cols
[2022-05-18 06:02:53] [INFO ] Computed 42 place invariants in 10 ms
[2022-05-18 06:02:53] [INFO ] Dead Transitions using invariants and state equation in 554 ms found 0 transitions.
[2022-05-18 06:02:53] [INFO ] Flow matrix only has 1012 transitions (discarded 20 similar events)
// Phase 1: matrix 1012 rows 488 cols
[2022-05-18 06:02:53] [INFO ] Computed 42 place invariants in 9 ms
[2022-05-18 06:02:54] [INFO ] Implicit Places using invariants in 345 ms returned []
[2022-05-18 06:02:54] [INFO ] Flow matrix only has 1012 transitions (discarded 20 similar events)
// Phase 1: matrix 1012 rows 488 cols
[2022-05-18 06:02:54] [INFO ] Computed 42 place invariants in 12 ms
[2022-05-18 06:02:54] [INFO ] State equation strengthened by 120 read => feed constraints.
[2022-05-18 06:02:58] [INFO ] Implicit Places using invariants and state equation in 4767 ms returned []
Implicit Place search using SMT with State Equation took 5114 ms to find 0 implicit places.
[2022-05-18 06:02:59] [INFO ] Redundant transitions in 64 ms returned []
[2022-05-18 06:02:59] [INFO ] Flow matrix only has 1012 transitions (discarded 20 similar events)
// Phase 1: matrix 1012 rows 488 cols
[2022-05-18 06:02:59] [INFO ] Computed 42 place invariants in 16 ms
[2022-05-18 06:02:59] [INFO ] Dead Transitions using invariants and state equation in 435 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 488/718 places, 1032/1262 transitions.
Finished structural reductions, in 1 iterations. Remains : 488/718 places, 1032/1262 transitions.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S02J04T10-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT (ADD s277 s278 s279 s280 s281 s282 s283 s284 s285 s286) (ADD s339 s340 s341 s342 s343 s344 s345 s346 s347 s348))], 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 5302 reset in 316 ms.
Product exploration explored 100000 steps with 5302 reset in 337 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 232 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Finished random walk after 23 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=11 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 135 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
[2022-05-18 06:03:00] [INFO ] Flow matrix only has 1012 transitions (discarded 20 similar events)
// Phase 1: matrix 1012 rows 488 cols
[2022-05-18 06:03:00] [INFO ] Computed 42 place invariants in 16 ms
[2022-05-18 06:03:01] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2022-05-18 06:03:01] [INFO ] [Real]Absence check using 11 positive and 31 generalized place invariants in 46 ms returned sat
[2022-05-18 06:03:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 06:03:01] [INFO ] [Real]Absence check using state equation in 620 ms returned sat
[2022-05-18 06:03:02] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 06:03:02] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2022-05-18 06:03:02] [INFO ] [Nat]Absence check using 11 positive and 31 generalized place invariants in 43 ms returned sat
[2022-05-18 06:03:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 06:03:03] [INFO ] [Nat]Absence check using state equation in 1102 ms returned sat
[2022-05-18 06:03:03] [INFO ] State equation strengthened by 120 read => feed constraints.
[2022-05-18 06:03:03] [INFO ] [Nat]Added 120 Read/Feed constraints in 210 ms returned sat
[2022-05-18 06:03:03] [INFO ] Deduced a trap composed of 41 places in 72 ms of which 3 ms to minimize.
[2022-05-18 06:03:04] [INFO ] Deduced a trap composed of 41 places in 79 ms of which 0 ms to minimize.
[2022-05-18 06:03:04] [INFO ] Deduced a trap composed of 41 places in 65 ms of which 1 ms to minimize.
[2022-05-18 06:03:04] [INFO ] Deduced a trap composed of 41 places in 93 ms of which 0 ms to minimize.
[2022-05-18 06:03:04] [INFO ] Deduced a trap composed of 41 places in 88 ms of which 1 ms to minimize.
[2022-05-18 06:03:04] [INFO ] Deduced a trap composed of 41 places in 55 ms of which 2 ms to minimize.
[2022-05-18 06:03:04] [INFO ] Deduced a trap composed of 41 places in 50 ms of which 1 ms to minimize.
[2022-05-18 06:03:04] [INFO ] Deduced a trap composed of 41 places in 34 ms of which 1 ms to minimize.
[2022-05-18 06:03:05] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1206 ms
[2022-05-18 06:03:05] [INFO ] Computed and/alt/rep : 370/758/360 causal constraints (skipped 650 transitions) in 113 ms.
[2022-05-18 06:03:06] [INFO ] Added : 114 causal constraints over 23 iterations in 1686 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 20 out of 488 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 488/488 places, 1032/1032 transitions.
Applied a total of 0 rules in 23 ms. Remains 488 /488 variables (removed 0) and now considering 1032/1032 (removed 0) transitions.
[2022-05-18 06:03:06] [INFO ] Flow matrix only has 1012 transitions (discarded 20 similar events)
// Phase 1: matrix 1012 rows 488 cols
[2022-05-18 06:03:06] [INFO ] Computed 42 place invariants in 11 ms
[2022-05-18 06:03:07] [INFO ] Dead Transitions using invariants and state equation in 401 ms found 0 transitions.
[2022-05-18 06:03:07] [INFO ] Flow matrix only has 1012 transitions (discarded 20 similar events)
// Phase 1: matrix 1012 rows 488 cols
[2022-05-18 06:03:07] [INFO ] Computed 42 place invariants in 9 ms
[2022-05-18 06:03:07] [INFO ] Implicit Places using invariants in 336 ms returned []
[2022-05-18 06:03:07] [INFO ] Flow matrix only has 1012 transitions (discarded 20 similar events)
// Phase 1: matrix 1012 rows 488 cols
[2022-05-18 06:03:07] [INFO ] Computed 42 place invariants in 17 ms
[2022-05-18 06:03:07] [INFO ] State equation strengthened by 120 read => feed constraints.
[2022-05-18 06:03:12] [INFO ] Implicit Places using invariants and state equation in 4721 ms returned []
Implicit Place search using SMT with State Equation took 5060 ms to find 0 implicit places.
[2022-05-18 06:03:12] [INFO ] Redundant transitions in 21 ms returned []
[2022-05-18 06:03:12] [INFO ] Flow matrix only has 1012 transitions (discarded 20 similar events)
// Phase 1: matrix 1012 rows 488 cols
[2022-05-18 06:03:12] [INFO ] Computed 42 place invariants in 15 ms
[2022-05-18 06:03:12] [INFO ] Dead Transitions using invariants and state equation in 401 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 488/488 places, 1032/1032 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 114 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Finished random walk after 14 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=14 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 139 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
[2022-05-18 06:03:13] [INFO ] Flow matrix only has 1012 transitions (discarded 20 similar events)
// Phase 1: matrix 1012 rows 488 cols
[2022-05-18 06:03:13] [INFO ] Computed 42 place invariants in 11 ms
[2022-05-18 06:03:13] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2022-05-18 06:03:13] [INFO ] [Real]Absence check using 11 positive and 31 generalized place invariants in 36 ms returned sat
[2022-05-18 06:03:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 06:03:14] [INFO ] [Real]Absence check using state equation in 624 ms returned sat
[2022-05-18 06:03:14] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 06:03:14] [INFO ] [Nat]Absence check using 11 positive place invariants in 9 ms returned sat
[2022-05-18 06:03:14] [INFO ] [Nat]Absence check using 11 positive and 31 generalized place invariants in 44 ms returned sat
[2022-05-18 06:03:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 06:03:15] [INFO ] [Nat]Absence check using state equation in 1078 ms returned sat
[2022-05-18 06:03:15] [INFO ] State equation strengthened by 120 read => feed constraints.
[2022-05-18 06:03:16] [INFO ] [Nat]Added 120 Read/Feed constraints in 201 ms returned sat
[2022-05-18 06:03:16] [INFO ] Deduced a trap composed of 41 places in 50 ms of which 1 ms to minimize.
[2022-05-18 06:03:16] [INFO ] Deduced a trap composed of 41 places in 46 ms of which 1 ms to minimize.
[2022-05-18 06:03:16] [INFO ] Deduced a trap composed of 41 places in 45 ms of which 0 ms to minimize.
[2022-05-18 06:03:16] [INFO ] Deduced a trap composed of 41 places in 47 ms of which 1 ms to minimize.
[2022-05-18 06:03:16] [INFO ] Deduced a trap composed of 41 places in 45 ms of which 0 ms to minimize.
[2022-05-18 06:03:16] [INFO ] Deduced a trap composed of 41 places in 67 ms of which 1 ms to minimize.
[2022-05-18 06:03:16] [INFO ] Deduced a trap composed of 41 places in 49 ms of which 0 ms to minimize.
[2022-05-18 06:03:16] [INFO ] Deduced a trap composed of 41 places in 35 ms of which 0 ms to minimize.
[2022-05-18 06:03:17] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1014 ms
[2022-05-18 06:03:17] [INFO ] Computed and/alt/rep : 370/758/360 causal constraints (skipped 650 transitions) in 72 ms.
[2022-05-18 06:03:18] [INFO ] Added : 114 causal constraints over 23 iterations in 1549 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 5274 reset in 281 ms.
Product exploration explored 100000 steps with 5289 reset in 305 ms.
Built C files in :
/tmp/ltsmin468146548096639996
[2022-05-18 06:03:19] [INFO ] Computing symmetric may disable matrix : 1032 transitions.
[2022-05-18 06:03:19] [INFO ] Computation of Complete disable matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 06:03:19] [INFO ] Computing symmetric may enable matrix : 1032 transitions.
[2022-05-18 06:03:19] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 06:03:19] [INFO ] Computing Do-Not-Accords matrix : 1032 transitions.
[2022-05-18 06:03:19] [INFO ] Computation of Completed DNA matrix. took 38 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 06:03:19] [INFO ] Built C files in 261ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin468146548096639996
Running compilation step : cd /tmp/ltsmin468146548096639996;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin468146548096639996;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin468146548096639996;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 20 out of 488 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 488/488 places, 1032/1032 transitions.
Applied a total of 0 rules in 25 ms. Remains 488 /488 variables (removed 0) and now considering 1032/1032 (removed 0) transitions.
[2022-05-18 06:03:22] [INFO ] Flow matrix only has 1012 transitions (discarded 20 similar events)
// Phase 1: matrix 1012 rows 488 cols
[2022-05-18 06:03:22] [INFO ] Computed 42 place invariants in 13 ms
[2022-05-18 06:03:23] [INFO ] Dead Transitions using invariants and state equation in 401 ms found 0 transitions.
[2022-05-18 06:03:23] [INFO ] Flow matrix only has 1012 transitions (discarded 20 similar events)
// Phase 1: matrix 1012 rows 488 cols
[2022-05-18 06:03:23] [INFO ] Computed 42 place invariants in 16 ms
[2022-05-18 06:03:23] [INFO ] Implicit Places using invariants in 363 ms returned []
[2022-05-18 06:03:23] [INFO ] Flow matrix only has 1012 transitions (discarded 20 similar events)
// Phase 1: matrix 1012 rows 488 cols
[2022-05-18 06:03:23] [INFO ] Computed 42 place invariants in 9 ms
[2022-05-18 06:03:23] [INFO ] State equation strengthened by 120 read => feed constraints.
[2022-05-18 06:03:28] [INFO ] Implicit Places using invariants and state equation in 5042 ms returned []
Implicit Place search using SMT with State Equation took 5407 ms to find 0 implicit places.
[2022-05-18 06:03:28] [INFO ] Redundant transitions in 15 ms returned []
[2022-05-18 06:03:28] [INFO ] Flow matrix only has 1012 transitions (discarded 20 similar events)
// Phase 1: matrix 1012 rows 488 cols
[2022-05-18 06:03:28] [INFO ] Computed 42 place invariants in 15 ms
[2022-05-18 06:03:28] [INFO ] Dead Transitions using invariants and state equation in 402 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 488/488 places, 1032/1032 transitions.
Built C files in :
/tmp/ltsmin10923243414090934830
[2022-05-18 06:03:28] [INFO ] Computing symmetric may disable matrix : 1032 transitions.
[2022-05-18 06:03:28] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 06:03:28] [INFO ] Computing symmetric may enable matrix : 1032 transitions.
[2022-05-18 06:03:28] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 06:03:28] [INFO ] Computing Do-Not-Accords matrix : 1032 transitions.
[2022-05-18 06:03:29] [INFO ] Computation of Completed DNA matrix. took 15 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 06:03:29] [INFO ] Built C files in 135ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10923243414090934830
Running compilation step : cd /tmp/ltsmin10923243414090934830;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2969 ms.
Running link step : cd /tmp/ltsmin10923243414090934830;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 67 ms.
Running LTSmin : cd /tmp/ltsmin10923243414090934830;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17352420075013044823.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-18 06:03:44] [INFO ] Flatten gal took : 57 ms
[2022-05-18 06:03:44] [INFO ] Flatten gal took : 53 ms
[2022-05-18 06:03:44] [INFO ] Time to serialize gal into /tmp/LTL3659686684251072028.gal : 12 ms
[2022-05-18 06:03:44] [INFO ] Time to serialize properties into /tmp/LTL7842662780218560498.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3659686684251072028.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7842662780218560498.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3659686...266
Read 1 LTL properties
Checking formula 0 : !((G(F("(((((ScheduleTaskB_0+ScheduleTaskB_1)+(ScheduleTaskB_2+ScheduleTaskB_3))+((ScheduleTaskB_4+ScheduleTaskB_5)+(ScheduleTaskB_6+S...321
Formula 0 simplified : !GF"(((((ScheduleTaskB_0+ScheduleTaskB_1)+(ScheduleTaskB_2+ScheduleTaskB_3))+((ScheduleTaskB_4+ScheduleTaskB_5)+(ScheduleTaskB_6+Sch...315
Detected timeout of ITS tools.
[2022-05-18 06:03:59] [INFO ] Flatten gal took : 49 ms
[2022-05-18 06:03:59] [INFO ] Applying decomposition
[2022-05-18 06:03:59] [INFO ] Flatten gal took : 45 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph4109610720000900336.txt' '-o' '/tmp/graph4109610720000900336.bin' '-w' '/tmp/graph4109610720000900336.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph4109610720000900336.bin' '-l' '-1' '-v' '-w' '/tmp/graph4109610720000900336.weights' '-q' '0' '-e' '0.001'
[2022-05-18 06:03:59] [INFO ] Decomposing Gal with order
[2022-05-18 06:03:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 06:03:59] [INFO ] Removed a total of 958 redundant transitions.
[2022-05-18 06:03:59] [INFO ] Flatten gal took : 260 ms
[2022-05-18 06:03:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 440 labels/synchronizations in 46 ms.
[2022-05-18 06:04:00] [INFO ] Time to serialize gal into /tmp/LTL10471115201798226391.gal : 13 ms
[2022-05-18 06:04:00] [INFO ] Time to serialize properties into /tmp/LTL7821615148429198390.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10471115201798226391.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7821615148429198390.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1047111...267
Read 1 LTL properties
Checking formula 0 : !((G(F("(((((gu22.ScheduleTaskB_0+gu22.ScheduleTaskB_1)+(gu22.ScheduleTaskB_2+gu22.ScheduleTaskB_3))+((gu22.ScheduleTaskB_4+gu22.Sched...421
Formula 0 simplified : !GF"(((((gu22.ScheduleTaskB_0+gu22.ScheduleTaskB_1)+(gu22.ScheduleTaskB_2+gu22.ScheduleTaskB_3))+((gu22.ScheduleTaskB_4+gu22.Schedul...415
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16764657156182110490
[2022-05-18 06:04:15] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16764657156182110490
Running compilation step : cd /tmp/ltsmin16764657156182110490;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1687 ms.
Running link step : cd /tmp/ltsmin16764657156182110490;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin16764657156182110490;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property PolyORBLF-COL-S02J04T10-LTLCardinality-05 finished in 97173 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(X(p0))))'
Support contains 11 out of 718 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 718/718 places, 1262/1262 transitions.
Drop transitions removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 90 rules applied. Total rules applied 90 place count 718 transition count 1172
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 1 with 90 rules applied. Total rules applied 180 place count 628 transition count 1172
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 180 place count 628 transition count 1092
Deduced a syphon composed of 80 places in 0 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 340 place count 548 transition count 1092
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 350 place count 538 transition count 1082
Iterating global reduction 2 with 10 rules applied. Total rules applied 360 place count 538 transition count 1082
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 1 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 2 with 140 rules applied. Total rules applied 500 place count 468 transition count 1012
Applied a total of 500 rules in 58 ms. Remains 468 /718 variables (removed 250) and now considering 1012/1262 (removed 250) transitions.
[2022-05-18 06:04:30] [INFO ] Flow matrix only has 992 transitions (discarded 20 similar events)
// Phase 1: matrix 992 rows 468 cols
[2022-05-18 06:04:30] [INFO ] Computed 42 place invariants in 9 ms
[2022-05-18 06:04:30] [INFO ] Dead Transitions using invariants and state equation in 387 ms found 0 transitions.
[2022-05-18 06:04:30] [INFO ] Flow matrix only has 992 transitions (discarded 20 similar events)
// Phase 1: matrix 992 rows 468 cols
[2022-05-18 06:04:30] [INFO ] Computed 42 place invariants in 18 ms
[2022-05-18 06:04:31] [INFO ] Implicit Places using invariants in 389 ms returned []
[2022-05-18 06:04:31] [INFO ] Flow matrix only has 992 transitions (discarded 20 similar events)
// Phase 1: matrix 992 rows 468 cols
[2022-05-18 06:04:31] [INFO ] Computed 42 place invariants in 27 ms
[2022-05-18 06:04:31] [INFO ] State equation strengthened by 120 read => feed constraints.
[2022-05-18 06:04:35] [INFO ] Implicit Places using invariants and state equation in 4512 ms returned []
Implicit Place search using SMT with State Equation took 4904 ms to find 0 implicit places.
[2022-05-18 06:04:35] [INFO ] Redundant transitions in 8 ms returned []
[2022-05-18 06:04:35] [INFO ] Flow matrix only has 992 transitions (discarded 20 similar events)
// Phase 1: matrix 992 rows 468 cols
[2022-05-18 06:04:35] [INFO ] Computed 42 place invariants in 13 ms
[2022-05-18 06:04:36] [INFO ] Dead Transitions using invariants and state equation in 453 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 468/718 places, 1012/1262 transitions.
Finished structural reductions, in 1 iterations. Remains : 468/718 places, 1012/1262 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S02J04T10-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s308 (ADD s72 s73 s74 s75 s76 s77 s78 s79 s80 s81))], 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 25 reset in 360 ms.
Stack based approach found an accepted trace after 224 steps with 0 reset with depth 225 and stack size 225 in 2 ms.
FORMULA PolyORBLF-COL-S02J04T10-LTLCardinality-06 FALSE TECHNIQUES STACK_TEST
Treatment of property PolyORBLF-COL-S02J04T10-LTLCardinality-06 finished in 6257 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)||!p0)))'
Support contains 2 out of 718 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 718/718 places, 1262/1262 transitions.
Drop transitions removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 80 rules applied. Total rules applied 80 place count 718 transition count 1182
Reduce places removed 80 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 90 rules applied. Total rules applied 170 place count 638 transition count 1172
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 180 place count 628 transition count 1172
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 80 Pre rules applied. Total rules applied 180 place count 628 transition count 1092
Deduced a syphon composed of 80 places in 0 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 160 rules applied. Total rules applied 340 place count 548 transition count 1092
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 350 place count 538 transition count 1082
Iterating global reduction 3 with 10 rules applied. Total rules applied 360 place count 538 transition count 1082
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 1 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 3 with 140 rules applied. Total rules applied 500 place count 468 transition count 1012
Applied a total of 500 rules in 85 ms. Remains 468 /718 variables (removed 250) and now considering 1012/1262 (removed 250) transitions.
[2022-05-18 06:04:36] [INFO ] Flow matrix only has 992 transitions (discarded 20 similar events)
// Phase 1: matrix 992 rows 468 cols
[2022-05-18 06:04:36] [INFO ] Computed 42 place invariants in 9 ms
[2022-05-18 06:04:42] [INFO ] Dead Transitions using invariants and state equation in 6048 ms found 0 transitions.
[2022-05-18 06:04:42] [INFO ] Flow matrix only has 992 transitions (discarded 20 similar events)
// Phase 1: matrix 992 rows 468 cols
[2022-05-18 06:04:42] [INFO ] Computed 42 place invariants in 12 ms
[2022-05-18 06:04:43] [INFO ] Implicit Places using invariants in 397 ms returned []
[2022-05-18 06:04:43] [INFO ] Flow matrix only has 992 transitions (discarded 20 similar events)
// Phase 1: matrix 992 rows 468 cols
[2022-05-18 06:04:43] [INFO ] Computed 42 place invariants in 10 ms
[2022-05-18 06:04:43] [INFO ] State equation strengthened by 120 read => feed constraints.
[2022-05-18 06:04:47] [INFO ] Implicit Places using invariants and state equation in 4464 ms returned []
Implicit Place search using SMT with State Equation took 4863 ms to find 0 implicit places.
[2022-05-18 06:04:47] [INFO ] Redundant transitions in 12 ms returned []
[2022-05-18 06:04:47] [INFO ] Flow matrix only has 992 transitions (discarded 20 similar events)
// Phase 1: matrix 992 rows 468 cols
[2022-05-18 06:04:47] [INFO ] Computed 42 place invariants in 18 ms
[2022-05-18 06:04:48] [INFO ] Dead Transitions using invariants and state equation in 406 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 468/718 places, 1012/1262 transitions.
Finished structural reductions, in 1 iterations. Remains : 468/718 places, 1012/1262 transitions.
Stuttering acceptance computed with spot in 71 ms :[true, false, (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S02J04T10-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ s277 s327)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 11 steps with 0 reset in 1 ms.
FORMULA PolyORBLF-COL-S02J04T10-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S02J04T10-LTLCardinality-07 finished in 11533 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((X(p0)||!p0))))'
Support contains 2 out of 718 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 718/718 places, 1262/1262 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 708 transition count 1252
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 708 transition count 1252
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 30 place count 698 transition count 1242
Iterating global reduction 0 with 10 rules applied. Total rules applied 40 place count 698 transition count 1242
Applied a total of 40 rules in 32 ms. Remains 698 /718 variables (removed 20) and now considering 1242/1262 (removed 20) transitions.
[2022-05-18 06:04:48] [INFO ] Flow matrix only has 1222 transitions (discarded 20 similar events)
// Phase 1: matrix 1222 rows 698 cols
[2022-05-18 06:04:48] [INFO ] Computed 42 place invariants in 15 ms
[2022-05-18 06:04:48] [INFO ] Dead Transitions using invariants and state equation in 523 ms found 0 transitions.
[2022-05-18 06:04:48] [INFO ] Flow matrix only has 1222 transitions (discarded 20 similar events)
// Phase 1: matrix 1222 rows 698 cols
[2022-05-18 06:04:48] [INFO ] Computed 42 place invariants in 16 ms
[2022-05-18 06:04:49] [INFO ] Implicit Places using invariants in 442 ms returned []
[2022-05-18 06:04:49] [INFO ] Flow matrix only has 1222 transitions (discarded 20 similar events)
// Phase 1: matrix 1222 rows 698 cols
[2022-05-18 06:04:49] [INFO ] Computed 42 place invariants in 20 ms
[2022-05-18 06:04:49] [INFO ] State equation strengthened by 120 read => feed constraints.
[2022-05-18 06:04:55] [INFO ] Implicit Places using invariants and state equation in 6652 ms returned []
Implicit Place search using SMT with State Equation took 7096 ms to find 0 implicit places.
[2022-05-18 06:04:55] [INFO ] Flow matrix only has 1222 transitions (discarded 20 similar events)
// Phase 1: matrix 1222 rows 698 cols
[2022-05-18 06:04:55] [INFO ] Computed 42 place invariants in 13 ms
[2022-05-18 06:04:56] [INFO ] Dead Transitions using invariants and state equation in 474 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 698/718 places, 1242/1262 transitions.
Finished structural reductions, in 1 iterations. Remains : 698/718 places, 1242/1262 transitions.
Stuttering acceptance computed with spot in 91 ms :[true, (NOT p0), false, false]
Running random walk in product with property : PolyORBLF-COL-S02J04T10-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 1}, { cond=(NOT p0), acceptance={} source=3 dest: 3}]], initial=2, aps=[p0:(GT 1 (ADD s369 s370))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 54 steps with 0 reset in 0 ms.
FORMULA PolyORBLF-COL-S02J04T10-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S02J04T10-LTLCardinality-08 finished in 8237 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 22 out of 718 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 718/718 places, 1262/1262 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 708 transition count 1252
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 708 transition count 1252
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 30 place count 698 transition count 1242
Iterating global reduction 0 with 10 rules applied. Total rules applied 40 place count 698 transition count 1242
Applied a total of 40 rules in 35 ms. Remains 698 /718 variables (removed 20) and now considering 1242/1262 (removed 20) transitions.
[2022-05-18 06:04:56] [INFO ] Flow matrix only has 1222 transitions (discarded 20 similar events)
// Phase 1: matrix 1222 rows 698 cols
[2022-05-18 06:04:56] [INFO ] Computed 42 place invariants in 20 ms
[2022-05-18 06:04:56] [INFO ] Dead Transitions using invariants and state equation in 511 ms found 0 transitions.
[2022-05-18 06:04:56] [INFO ] Flow matrix only has 1222 transitions (discarded 20 similar events)
// Phase 1: matrix 1222 rows 698 cols
[2022-05-18 06:04:56] [INFO ] Computed 42 place invariants in 13 ms
[2022-05-18 06:04:57] [INFO ] Implicit Places using invariants in 429 ms returned []
[2022-05-18 06:04:57] [INFO ] Flow matrix only has 1222 transitions (discarded 20 similar events)
// Phase 1: matrix 1222 rows 698 cols
[2022-05-18 06:04:57] [INFO ] Computed 42 place invariants in 18 ms
[2022-05-18 06:04:57] [INFO ] State equation strengthened by 120 read => feed constraints.
[2022-05-18 06:05:02] [INFO ] Implicit Places using invariants and state equation in 5411 ms returned []
Implicit Place search using SMT with State Equation took 5849 ms to find 0 implicit places.
[2022-05-18 06:05:02] [INFO ] Flow matrix only has 1222 transitions (discarded 20 similar events)
// Phase 1: matrix 1222 rows 698 cols
[2022-05-18 06:05:02] [INFO ] Computed 42 place invariants in 20 ms
[2022-05-18 06:05:03] [INFO ] Dead Transitions using invariants and state equation in 510 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 698/718 places, 1242/1262 transitions.
Finished structural reductions, in 1 iterations. Remains : 698/718 places, 1242/1262 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S02J04T10-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT (ADD s439 s440 s441 s442 s443 s444 s445 s446 s447 s448 s449 s450 s451 s452 s453 s454 s455 s456 s457 s458) (ADD s369 s370))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 5237 reset in 306 ms.
Product exploration explored 100000 steps with 5306 reset in 330 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 93 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Finished random walk after 24 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=12 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 178 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
[2022-05-18 06:05:04] [INFO ] Flow matrix only has 1222 transitions (discarded 20 similar events)
// Phase 1: matrix 1222 rows 698 cols
[2022-05-18 06:05:04] [INFO ] Computed 42 place invariants in 23 ms
[2022-05-18 06:05:04] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2022-05-18 06:05:05] [INFO ] [Real]Absence check using 10 positive and 32 generalized place invariants in 198 ms returned sat
[2022-05-18 06:05:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 06:05:05] [INFO ] [Real]Absence check using state equation in 813 ms returned sat
[2022-05-18 06:05:06] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 06:05:06] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2022-05-18 06:05:06] [INFO ] [Nat]Absence check using 10 positive and 32 generalized place invariants in 78 ms returned sat
[2022-05-18 06:05:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 06:05:08] [INFO ] [Nat]Absence check using state equation in 1870 ms returned sat
[2022-05-18 06:05:08] [INFO ] State equation strengthened by 120 read => feed constraints.
[2022-05-18 06:05:08] [INFO ] [Nat]Added 120 Read/Feed constraints in 399 ms returned sat
[2022-05-18 06:05:09] [INFO ] Computed and/alt/rep : 670/1268/660 causal constraints (skipped 560 transitions) in 72 ms.
[2022-05-18 06:05:13] [INFO ] Added : 270 causal constraints over 54 iterations in 4776 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 22 out of 698 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 698/698 places, 1242/1242 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 70 place count 698 transition count 1172
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 1 with 70 rules applied. Total rules applied 140 place count 628 transition count 1172
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 140 place count 628 transition count 1092
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 300 place count 548 transition count 1092
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 420 place count 488 transition count 1032
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 430 place count 478 transition count 1022
Iterating global reduction 2 with 10 rules applied. Total rules applied 440 place count 478 transition count 1022
Applied a total of 440 rules in 48 ms. Remains 478 /698 variables (removed 220) and now considering 1022/1242 (removed 220) transitions.
[2022-05-18 06:05:13] [INFO ] Flow matrix only has 1002 transitions (discarded 20 similar events)
// Phase 1: matrix 1002 rows 478 cols
[2022-05-18 06:05:13] [INFO ] Computed 42 place invariants in 12 ms
[2022-05-18 06:05:14] [INFO ] Dead Transitions using invariants and state equation in 423 ms found 0 transitions.
[2022-05-18 06:05:14] [INFO ] Flow matrix only has 1002 transitions (discarded 20 similar events)
// Phase 1: matrix 1002 rows 478 cols
[2022-05-18 06:05:14] [INFO ] Computed 42 place invariants in 11 ms
[2022-05-18 06:05:14] [INFO ] Implicit Places using invariants in 353 ms returned []
[2022-05-18 06:05:14] [INFO ] Flow matrix only has 1002 transitions (discarded 20 similar events)
// Phase 1: matrix 1002 rows 478 cols
[2022-05-18 06:05:14] [INFO ] Computed 42 place invariants in 10 ms
[2022-05-18 06:05:14] [INFO ] State equation strengthened by 120 read => feed constraints.
[2022-05-18 06:05:19] [INFO ] Implicit Places using invariants and state equation in 5053 ms returned []
Implicit Place search using SMT with State Equation took 5408 ms to find 0 implicit places.
[2022-05-18 06:05:19] [INFO ] Redundant transitions in 11 ms returned []
[2022-05-18 06:05:19] [INFO ] Flow matrix only has 1002 transitions (discarded 20 similar events)
// Phase 1: matrix 1002 rows 478 cols
[2022-05-18 06:05:19] [INFO ] Computed 42 place invariants in 14 ms
[2022-05-18 06:05:20] [INFO ] Dead Transitions using invariants and state equation in 387 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 478/698 places, 1022/1242 transitions.
Finished structural reductions, in 1 iterations. Remains : 478/698 places, 1022/1242 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Finished random walk after 17 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=17 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 95 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
[2022-05-18 06:05:20] [INFO ] Flow matrix only has 1002 transitions (discarded 20 similar events)
// Phase 1: matrix 1002 rows 478 cols
[2022-05-18 06:05:20] [INFO ] Computed 42 place invariants in 21 ms
[2022-05-18 06:05:20] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2022-05-18 06:05:20] [INFO ] [Real]Absence check using 11 positive and 31 generalized place invariants in 53 ms returned sat
[2022-05-18 06:05:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 06:05:21] [INFO ] [Real]Absence check using state equation in 1117 ms returned sat
[2022-05-18 06:05:22] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 06:05:22] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2022-05-18 06:05:22] [INFO ] [Nat]Absence check using 11 positive and 31 generalized place invariants in 49 ms returned sat
[2022-05-18 06:05:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 06:05:23] [INFO ] [Nat]Absence check using state equation in 1190 ms returned sat
[2022-05-18 06:05:23] [INFO ] State equation strengthened by 120 read => feed constraints.
[2022-05-18 06:05:23] [INFO ] [Nat]Added 120 Read/Feed constraints in 109 ms returned sat
[2022-05-18 06:05:23] [INFO ] Deduced a trap composed of 40 places in 53 ms of which 1 ms to minimize.
[2022-05-18 06:05:24] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 0 ms to minimize.
[2022-05-18 06:05:24] [INFO ] Deduced a trap composed of 40 places in 50 ms of which 0 ms to minimize.
[2022-05-18 06:05:24] [INFO ] Deduced a trap composed of 40 places in 47 ms of which 0 ms to minimize.
[2022-05-18 06:05:24] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 1 ms to minimize.
[2022-05-18 06:05:24] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 1 ms to minimize.
[2022-05-18 06:05:24] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 0 ms to minimize.
[2022-05-18 06:05:24] [INFO ] Deduced a trap composed of 40 places in 35 ms of which 1 ms to minimize.
[2022-05-18 06:05:24] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 965 ms
[2022-05-18 06:05:24] [INFO ] Computed and/alt/rep : 360/728/350 causal constraints (skipped 650 transitions) in 76 ms.
[2022-05-18 06:05:26] [INFO ] Added : 109 causal constraints over 22 iterations in 1371 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Product exploration explored 100000 steps with 6748 reset in 321 ms.
Product exploration explored 100000 steps with 6731 reset in 336 ms.
Built C files in :
/tmp/ltsmin16978089811351428213
[2022-05-18 06:05:26] [INFO ] Computing symmetric may disable matrix : 1022 transitions.
[2022-05-18 06:05:26] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 06:05:26] [INFO ] Computing symmetric may enable matrix : 1022 transitions.
[2022-05-18 06:05:26] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 06:05:26] [INFO ] Computing Do-Not-Accords matrix : 1022 transitions.
[2022-05-18 06:05:26] [INFO ] Computation of Completed DNA matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 06:05:26] [INFO ] Built C files in 143ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16978089811351428213
Running compilation step : cd /tmp/ltsmin16978089811351428213;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16978089811351428213;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16978089811351428213;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 22 out of 478 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 478/478 places, 1022/1022 transitions.
Applied a total of 0 rules in 17 ms. Remains 478 /478 variables (removed 0) and now considering 1022/1022 (removed 0) transitions.
[2022-05-18 06:05:30] [INFO ] Flow matrix only has 1002 transitions (discarded 20 similar events)
// Phase 1: matrix 1002 rows 478 cols
[2022-05-18 06:05:30] [INFO ] Computed 42 place invariants in 18 ms
[2022-05-18 06:05:30] [INFO ] Dead Transitions using invariants and state equation in 400 ms found 0 transitions.
[2022-05-18 06:05:30] [INFO ] Flow matrix only has 1002 transitions (discarded 20 similar events)
// Phase 1: matrix 1002 rows 478 cols
[2022-05-18 06:05:30] [INFO ] Computed 42 place invariants in 10 ms
[2022-05-18 06:05:30] [INFO ] Implicit Places using invariants in 355 ms returned []
[2022-05-18 06:05:30] [INFO ] Flow matrix only has 1002 transitions (discarded 20 similar events)
// Phase 1: matrix 1002 rows 478 cols
[2022-05-18 06:05:30] [INFO ] Computed 42 place invariants in 12 ms
[2022-05-18 06:05:31] [INFO ] State equation strengthened by 120 read => feed constraints.
[2022-05-18 06:05:36] [INFO ] Implicit Places using invariants and state equation in 5235 ms returned []
Implicit Place search using SMT with State Equation took 5599 ms to find 0 implicit places.
[2022-05-18 06:05:36] [INFO ] Redundant transitions in 8 ms returned []
[2022-05-18 06:05:36] [INFO ] Flow matrix only has 1002 transitions (discarded 20 similar events)
// Phase 1: matrix 1002 rows 478 cols
[2022-05-18 06:05:36] [INFO ] Computed 42 place invariants in 18 ms
[2022-05-18 06:05:36] [INFO ] Dead Transitions using invariants and state equation in 417 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 478/478 places, 1022/1022 transitions.
Built C files in :
/tmp/ltsmin5425329244356551704
[2022-05-18 06:05:36] [INFO ] Computing symmetric may disable matrix : 1022 transitions.
[2022-05-18 06:05:36] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 06:05:36] [INFO ] Computing symmetric may enable matrix : 1022 transitions.
[2022-05-18 06:05:36] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 06:05:36] [INFO ] Computing Do-Not-Accords matrix : 1022 transitions.
[2022-05-18 06:05:36] [INFO ] Computation of Completed DNA matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 06:05:36] [INFO ] Built C files in 124ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5425329244356551704
Running compilation step : cd /tmp/ltsmin5425329244356551704;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5425329244356551704;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5425329244356551704;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-18 06:05:39] [INFO ] Flatten gal took : 47 ms
[2022-05-18 06:05:39] [INFO ] Flatten gal took : 49 ms
[2022-05-18 06:05:39] [INFO ] Time to serialize gal into /tmp/LTL18404509201897694202.gal : 5 ms
[2022-05-18 06:05:39] [INFO ] Time to serialize properties into /tmp/LTL12861710167224667077.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18404509201897694202.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12861710167224667077.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1840450...268
Read 1 LTL properties
Checking formula 0 : !((X(F("((((((P_1119_0+P_1119_1)+(P_1119_2+P_1119_3))+((P_1119_4+P_1119_5)+(P_1119_6+P_1119_7)))+(((P_1119_8+P_1119_9)+(P_1119_10+P_11...295
Formula 0 simplified : !XF"((((((P_1119_0+P_1119_1)+(P_1119_2+P_1119_3))+((P_1119_4+P_1119_5)+(P_1119_6+P_1119_7)))+(((P_1119_8+P_1119_9)+(P_1119_10+P_1119...289
Detected timeout of ITS tools.
[2022-05-18 06:05:54] [INFO ] Flatten gal took : 73 ms
[2022-05-18 06:05:54] [INFO ] Applying decomposition
[2022-05-18 06:05:54] [INFO ] Flatten gal took : 110 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph15010910622103899194.txt' '-o' '/tmp/graph15010910622103899194.bin' '-w' '/tmp/graph15010910622103899194.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15010910622103899194.bin' '-l' '-1' '-v' '-w' '/tmp/graph15010910622103899194.weights' '-q' '0' '-e' '0.001'
[2022-05-18 06:05:55] [INFO ] Decomposing Gal with order
[2022-05-18 06:05:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 06:05:55] [INFO ] Removed a total of 999 redundant transitions.
[2022-05-18 06:05:55] [INFO ] Flatten gal took : 157 ms
[2022-05-18 06:05:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 558 labels/synchronizations in 39 ms.
[2022-05-18 06:05:55] [INFO ] Time to serialize gal into /tmp/LTL2289087878358385575.gal : 7 ms
[2022-05-18 06:05:55] [INFO ] Time to serialize properties into /tmp/LTL8199326497247631546.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2289087878358385575.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8199326497247631546.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL2289087...266
Read 1 LTL properties
Checking formula 0 : !((X(F("((((((gu31.P_1119_0+gu31.P_1119_1)+(gu31.P_1119_2+gu31.P_1119_3))+((gu31.P_1119_4+gu31.P_1119_5)+(gu31.P_1119_6+gu31.P_1119_7)...405
Formula 0 simplified : !XF"((((((gu31.P_1119_0+gu31.P_1119_1)+(gu31.P_1119_2+gu31.P_1119_3))+((gu31.P_1119_4+gu31.P_1119_5)+(gu31.P_1119_6+gu31.P_1119_7)))...399
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5605339164008690622
[2022-05-18 06:06:10] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5605339164008690622
Running compilation step : cd /tmp/ltsmin5605339164008690622;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1718 ms.
Running link step : cd /tmp/ltsmin5605339164008690622;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin5605339164008690622;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>((LTLAPp0==true)))' '--buchi-type=spotba'
LTSmin run took 325 ms.
FORMULA PolyORBLF-COL-S02J04T10-LTLCardinality-09 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property PolyORBLF-COL-S02J04T10-LTLCardinality-09 finished in 76380 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((false U false)||X(p0)))'
Support contains 10 out of 718 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 718/718 places, 1262/1262 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 708 transition count 1252
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 708 transition count 1252
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 30 place count 698 transition count 1242
Iterating global reduction 0 with 10 rules applied. Total rules applied 40 place count 698 transition count 1242
Applied a total of 40 rules in 42 ms. Remains 698 /718 variables (removed 20) and now considering 1242/1262 (removed 20) transitions.
[2022-05-18 06:06:12] [INFO ] Flow matrix only has 1222 transitions (discarded 20 similar events)
// Phase 1: matrix 1222 rows 698 cols
[2022-05-18 06:06:12] [INFO ] Computed 42 place invariants in 18 ms
[2022-05-18 06:06:13] [INFO ] Dead Transitions using invariants and state equation in 482 ms found 0 transitions.
[2022-05-18 06:06:13] [INFO ] Flow matrix only has 1222 transitions (discarded 20 similar events)
// Phase 1: matrix 1222 rows 698 cols
[2022-05-18 06:06:13] [INFO ] Computed 42 place invariants in 19 ms
[2022-05-18 06:06:13] [INFO ] Implicit Places using invariants in 425 ms returned []
[2022-05-18 06:06:13] [INFO ] Flow matrix only has 1222 transitions (discarded 20 similar events)
// Phase 1: matrix 1222 rows 698 cols
[2022-05-18 06:06:13] [INFO ] Computed 42 place invariants in 21 ms
[2022-05-18 06:06:14] [INFO ] State equation strengthened by 120 read => feed constraints.
[2022-05-18 06:06:21] [INFO ] Implicit Places using invariants and state equation in 7427 ms returned []
Implicit Place search using SMT with State Equation took 7861 ms to find 0 implicit places.
[2022-05-18 06:06:21] [INFO ] Flow matrix only has 1222 transitions (discarded 20 similar events)
// Phase 1: matrix 1222 rows 698 cols
[2022-05-18 06:06:21] [INFO ] Computed 42 place invariants in 18 ms
[2022-05-18 06:06:21] [INFO ] Dead Transitions using invariants and state equation in 566 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 698/718 places, 1242/1262 transitions.
Finished structural reductions, in 1 iterations. Remains : 698/718 places, 1242/1262 transitions.
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : PolyORBLF-COL-S02J04T10-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ 1 (ADD s82 s83 s84 s85 s86 s87 s88 s89 s90 s91))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PolyORBLF-COL-S02J04T10-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S02J04T10-LTLCardinality-11 finished in 9104 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(!(p0 U p1))))'
Support contains 2 out of 718 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 718/718 places, 1262/1262 transitions.
Drop transitions removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 90 rules applied. Total rules applied 90 place count 718 transition count 1172
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 1 with 90 rules applied. Total rules applied 180 place count 628 transition count 1172
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 180 place count 628 transition count 1092
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 340 place count 548 transition count 1092
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 350 place count 538 transition count 1082
Iterating global reduction 2 with 10 rules applied. Total rules applied 360 place count 538 transition count 1082
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 0 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 520 place count 458 transition count 1002
Applied a total of 520 rules in 44 ms. Remains 458 /718 variables (removed 260) and now considering 1002/1262 (removed 260) transitions.
[2022-05-18 06:06:21] [INFO ] Flow matrix only has 982 transitions (discarded 20 similar events)
// Phase 1: matrix 982 rows 458 cols
[2022-05-18 06:06:21] [INFO ] Computed 42 place invariants in 18 ms
[2022-05-18 06:06:22] [INFO ] Dead Transitions using invariants and state equation in 384 ms found 0 transitions.
[2022-05-18 06:06:22] [INFO ] Flow matrix only has 982 transitions (discarded 20 similar events)
// Phase 1: matrix 982 rows 458 cols
[2022-05-18 06:06:22] [INFO ] Computed 42 place invariants in 18 ms
[2022-05-18 06:06:22] [INFO ] Implicit Places using invariants in 333 ms returned []
[2022-05-18 06:06:22] [INFO ] Flow matrix only has 982 transitions (discarded 20 similar events)
// Phase 1: matrix 982 rows 458 cols
[2022-05-18 06:06:22] [INFO ] Computed 42 place invariants in 18 ms
[2022-05-18 06:06:22] [INFO ] State equation strengthened by 120 read => feed constraints.
[2022-05-18 06:06:26] [INFO ] Implicit Places using invariants and state equation in 3861 ms returned []
Implicit Place search using SMT with State Equation took 4195 ms to find 0 implicit places.
[2022-05-18 06:06:26] [INFO ] Redundant transitions in 12 ms returned []
[2022-05-18 06:06:26] [INFO ] Flow matrix only has 982 transitions (discarded 20 similar events)
// Phase 1: matrix 982 rows 458 cols
[2022-05-18 06:06:26] [INFO ] Computed 42 place invariants in 16 ms
[2022-05-18 06:06:26] [INFO ] Dead Transitions using invariants and state equation in 384 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 458/718 places, 1002/1262 transitions.
Finished structural reductions, in 1 iterations. Remains : 458/718 places, 1002/1262 transitions.
Stuttering acceptance computed with spot in 83 ms :[p1, p1]
Running random walk in product with property : PolyORBLF-COL-S02J04T10-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ 1 s174), p0:(LEQ 1 s241)], 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 3795 reset in 289 ms.
Product exploration explored 100000 steps with 3810 reset in 312 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 177 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 65 ms :[p1, p1]
Finished random walk after 38 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=12 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 5 factoid took 234 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 72 ms :[p1, p1]
Stuttering acceptance computed with spot in 69 ms :[p1, p1]
[2022-05-18 06:06:28] [INFO ] Flow matrix only has 982 transitions (discarded 20 similar events)
// Phase 1: matrix 982 rows 458 cols
[2022-05-18 06:06:28] [INFO ] Computed 42 place invariants in 19 ms
[2022-05-18 06:06:28] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2022-05-18 06:06:28] [INFO ] [Real]Absence check using 11 positive and 31 generalized place invariants in 90 ms returned sat
[2022-05-18 06:06:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 06:06:30] [INFO ] [Real]Absence check using state equation in 1773 ms returned sat
[2022-05-18 06:06:30] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 06:06:30] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2022-05-18 06:06:30] [INFO ] [Nat]Absence check using 11 positive and 31 generalized place invariants in 58 ms returned sat
[2022-05-18 06:06:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 06:06:31] [INFO ] [Nat]Absence check using state equation in 921 ms returned sat
[2022-05-18 06:06:31] [INFO ] State equation strengthened by 120 read => feed constraints.
[2022-05-18 06:06:32] [INFO ] [Nat]Added 120 Read/Feed constraints in 136 ms returned sat
[2022-05-18 06:06:32] [INFO ] Deduced a trap composed of 38 places in 49 ms of which 1 ms to minimize.
[2022-05-18 06:06:32] [INFO ] Deduced a trap composed of 38 places in 44 ms of which 1 ms to minimize.
[2022-05-18 06:06:32] [INFO ] Deduced a trap composed of 38 places in 47 ms of which 0 ms to minimize.
[2022-05-18 06:06:32] [INFO ] Deduced a trap composed of 38 places in 41 ms of which 1 ms to minimize.
[2022-05-18 06:06:32] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 0 ms to minimize.
[2022-05-18 06:06:32] [INFO ] Deduced a trap composed of 39 places in 40 ms of which 1 ms to minimize.
[2022-05-18 06:06:32] [INFO ] Deduced a trap composed of 39 places in 46 ms of which 1 ms to minimize.
[2022-05-18 06:06:32] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 840 ms
[2022-05-18 06:06:32] [INFO ] Computed and/alt/rep : 340/708/330 causal constraints (skipped 650 transitions) in 48 ms.
[2022-05-18 06:06:34] [INFO ] Added : 127 causal constraints over 26 iterations in 1599 ms. Result :sat
Could not prove EG p1
Support contains 2 out of 458 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 458/458 places, 1002/1002 transitions.
Applied a total of 0 rules in 20 ms. Remains 458 /458 variables (removed 0) and now considering 1002/1002 (removed 0) transitions.
[2022-05-18 06:06:34] [INFO ] Flow matrix only has 982 transitions (discarded 20 similar events)
// Phase 1: matrix 982 rows 458 cols
[2022-05-18 06:06:34] [INFO ] Computed 42 place invariants in 13 ms
[2022-05-18 06:06:34] [INFO ] Dead Transitions using invariants and state equation in 402 ms found 0 transitions.
[2022-05-18 06:06:34] [INFO ] Flow matrix only has 982 transitions (discarded 20 similar events)
// Phase 1: matrix 982 rows 458 cols
[2022-05-18 06:06:34] [INFO ] Computed 42 place invariants in 29 ms
[2022-05-18 06:06:35] [INFO ] Implicit Places using invariants in 337 ms returned []
[2022-05-18 06:06:35] [INFO ] Flow matrix only has 982 transitions (discarded 20 similar events)
// Phase 1: matrix 982 rows 458 cols
[2022-05-18 06:06:35] [INFO ] Computed 42 place invariants in 10 ms
[2022-05-18 06:06:35] [INFO ] State equation strengthened by 120 read => feed constraints.
[2022-05-18 06:06:39] [INFO ] Implicit Places using invariants and state equation in 4444 ms returned []
Implicit Place search using SMT with State Equation took 4782 ms to find 0 implicit places.
[2022-05-18 06:06:39] [INFO ] Redundant transitions in 13 ms returned []
[2022-05-18 06:06:39] [INFO ] Flow matrix only has 982 transitions (discarded 20 similar events)
// Phase 1: matrix 982 rows 458 cols
[2022-05-18 06:06:39] [INFO ] Computed 42 place invariants in 15 ms
[2022-05-18 06:06:40] [INFO ] Dead Transitions using invariants and state equation in 407 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 458/458 places, 1002/1002 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 182 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 87 ms :[p1, p1]
Finished random walk after 35 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=17 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 5 factoid took 255 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 63 ms :[p1, p1]
Stuttering acceptance computed with spot in 97 ms :[p1, p1]
[2022-05-18 06:06:40] [INFO ] Flow matrix only has 982 transitions (discarded 20 similar events)
// Phase 1: matrix 982 rows 458 cols
[2022-05-18 06:06:40] [INFO ] Computed 42 place invariants in 13 ms
[2022-05-18 06:06:41] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2022-05-18 06:06:41] [INFO ] [Real]Absence check using 11 positive and 31 generalized place invariants in 88 ms returned sat
[2022-05-18 06:06:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 06:06:43] [INFO ] [Real]Absence check using state equation in 1720 ms returned sat
[2022-05-18 06:06:43] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 06:06:43] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2022-05-18 06:06:43] [INFO ] [Nat]Absence check using 11 positive and 31 generalized place invariants in 52 ms returned sat
[2022-05-18 06:06:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 06:06:44] [INFO ] [Nat]Absence check using state equation in 898 ms returned sat
[2022-05-18 06:06:44] [INFO ] State equation strengthened by 120 read => feed constraints.
[2022-05-18 06:06:44] [INFO ] [Nat]Added 120 Read/Feed constraints in 141 ms returned sat
[2022-05-18 06:06:44] [INFO ] Deduced a trap composed of 38 places in 42 ms of which 1 ms to minimize.
[2022-05-18 06:06:44] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 0 ms to minimize.
[2022-05-18 06:06:44] [INFO ] Deduced a trap composed of 38 places in 41 ms of which 1 ms to minimize.
[2022-05-18 06:06:44] [INFO ] Deduced a trap composed of 38 places in 35 ms of which 0 ms to minimize.
[2022-05-18 06:06:45] [INFO ] Deduced a trap composed of 38 places in 49 ms of which 0 ms to minimize.
[2022-05-18 06:06:45] [INFO ] Deduced a trap composed of 39 places in 39 ms of which 0 ms to minimize.
[2022-05-18 06:06:45] [INFO ] Deduced a trap composed of 39 places in 39 ms of which 0 ms to minimize.
[2022-05-18 06:06:45] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 753 ms
[2022-05-18 06:06:45] [INFO ] Computed and/alt/rep : 340/708/330 causal constraints (skipped 650 transitions) in 43 ms.
[2022-05-18 06:06:46] [INFO ] Added : 127 causal constraints over 26 iterations in 1570 ms. Result :sat
Could not prove EG p1
Stuttering acceptance computed with spot in 136 ms :[p1, p1]
Product exploration explored 100000 steps with 3813 reset in 288 ms.
Product exploration explored 100000 steps with 3816 reset in 298 ms.
Built C files in :
/tmp/ltsmin15033107253708580583
[2022-05-18 06:06:47] [INFO ] Computing symmetric may disable matrix : 1002 transitions.
[2022-05-18 06:06:47] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 06:06:47] [INFO ] Computing symmetric may enable matrix : 1002 transitions.
[2022-05-18 06:06:47] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 06:06:47] [INFO ] Computing Do-Not-Accords matrix : 1002 transitions.
[2022-05-18 06:06:47] [INFO ] Computation of Completed DNA matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 06:06:47] [INFO ] Built C files in 129ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15033107253708580583
Running compilation step : cd /tmp/ltsmin15033107253708580583;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15033107253708580583;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15033107253708580583;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 2 out of 458 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 458/458 places, 1002/1002 transitions.
Applied a total of 0 rules in 22 ms. Remains 458 /458 variables (removed 0) and now considering 1002/1002 (removed 0) transitions.
[2022-05-18 06:06:50] [INFO ] Flow matrix only has 982 transitions (discarded 20 similar events)
// Phase 1: matrix 982 rows 458 cols
[2022-05-18 06:06:50] [INFO ] Computed 42 place invariants in 15 ms
[2022-05-18 06:06:51] [INFO ] Dead Transitions using invariants and state equation in 382 ms found 0 transitions.
[2022-05-18 06:06:51] [INFO ] Flow matrix only has 982 transitions (discarded 20 similar events)
// Phase 1: matrix 982 rows 458 cols
[2022-05-18 06:06:51] [INFO ] Computed 42 place invariants in 10 ms
[2022-05-18 06:06:51] [INFO ] Implicit Places using invariants in 316 ms returned []
[2022-05-18 06:06:51] [INFO ] Flow matrix only has 982 transitions (discarded 20 similar events)
// Phase 1: matrix 982 rows 458 cols
[2022-05-18 06:06:51] [INFO ] Computed 42 place invariants in 12 ms
[2022-05-18 06:06:51] [INFO ] State equation strengthened by 120 read => feed constraints.
[2022-05-18 06:06:55] [INFO ] Implicit Places using invariants and state equation in 3852 ms returned []
Implicit Place search using SMT with State Equation took 4169 ms to find 0 implicit places.
[2022-05-18 06:06:55] [INFO ] Redundant transitions in 11 ms returned []
[2022-05-18 06:06:55] [INFO ] Flow matrix only has 982 transitions (discarded 20 similar events)
// Phase 1: matrix 982 rows 458 cols
[2022-05-18 06:06:55] [INFO ] Computed 42 place invariants in 12 ms
[2022-05-18 06:06:55] [INFO ] Dead Transitions using invariants and state equation in 398 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 458/458 places, 1002/1002 transitions.
Built C files in :
/tmp/ltsmin4968697273460748858
[2022-05-18 06:06:55] [INFO ] Computing symmetric may disable matrix : 1002 transitions.
[2022-05-18 06:06:55] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 06:06:55] [INFO ] Computing symmetric may enable matrix : 1002 transitions.
[2022-05-18 06:06:55] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 06:06:55] [INFO ] Computing Do-Not-Accords matrix : 1002 transitions.
[2022-05-18 06:06:55] [INFO ] Computation of Completed DNA matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 06:06:55] [INFO ] Built C files in 117ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4968697273460748858
Running compilation step : cd /tmp/ltsmin4968697273460748858;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2921 ms.
Running link step : cd /tmp/ltsmin4968697273460748858;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin4968697273460748858;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9846496855648575067.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-18 06:07:10] [INFO ] Flatten gal took : 55 ms
[2022-05-18 06:07:10] [INFO ] Flatten gal took : 40 ms
[2022-05-18 06:07:10] [INFO ] Time to serialize gal into /tmp/LTL16353417579227808176.gal : 4 ms
[2022-05-18 06:07:10] [INFO ] Time to serialize properties into /tmp/LTL4121316643570128960.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16353417579227808176.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4121316643570128960.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1635341...267
Read 1 LTL properties
Checking formula 0 : !((G(F(!(("(P_1716_0>=1)")U("(cPollingAbort_0>=1)"))))))
Formula 0 simplified : !GF!("(P_1716_0>=1)" U "(cPollingAbort_0>=1)")
Detected timeout of ITS tools.
[2022-05-18 06:07:26] [INFO ] Flatten gal took : 42 ms
[2022-05-18 06:07:26] [INFO ] Applying decomposition
[2022-05-18 06:07:26] [INFO ] Flatten gal took : 39 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph9939121435103516963.txt' '-o' '/tmp/graph9939121435103516963.bin' '-w' '/tmp/graph9939121435103516963.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph9939121435103516963.bin' '-l' '-1' '-v' '-w' '/tmp/graph9939121435103516963.weights' '-q' '0' '-e' '0.001'
[2022-05-18 06:07:26] [INFO ] Decomposing Gal with order
[2022-05-18 06:07:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 06:07:26] [INFO ] Removed a total of 1066 redundant transitions.
[2022-05-18 06:07:26] [INFO ] Flatten gal took : 95 ms
[2022-05-18 06:07:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 367 labels/synchronizations in 21 ms.
[2022-05-18 06:07:26] [INFO ] Time to serialize gal into /tmp/LTL14748119586110904718.gal : 9 ms
[2022-05-18 06:07:26] [INFO ] Time to serialize properties into /tmp/LTL18088379274131091618.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14748119586110904718.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18088379274131091618.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1474811...247
Read 1 LTL properties
Checking formula 0 : !((G(F(!(("(i4.u13.P_1716_0>=1)")U("(i2.i1.u11.cPollingAbort_0>=1)"))))))
Formula 0 simplified : !GF!("(i4.u13.P_1716_0>=1)" U "(i2.i1.u11.cPollingAbort_0>=1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11421905983031379363
[2022-05-18 06:07:41] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11421905983031379363
Running compilation step : cd /tmp/ltsmin11421905983031379363;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1810 ms.
Running link step : cd /tmp/ltsmin11421905983031379363;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin11421905983031379363;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>(!((LTLAPp0==true) U (LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property PolyORBLF-COL-S02J04T10-LTLCardinality-14 finished in 94650 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(!(p0 U p1))))'
[2022-05-18 06:07:56] [INFO ] Flatten gal took : 44 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin14320299955341937779
[2022-05-18 06:07:56] [INFO ] Computing symmetric may disable matrix : 1262 transitions.
[2022-05-18 06:07:56] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 06:07:56] [INFO ] Computing symmetric may enable matrix : 1262 transitions.
[2022-05-18 06:07:56] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 06:07:56] [INFO ] Applying decomposition
[2022-05-18 06:07:56] [INFO ] Flatten gal took : 64 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph2685358521953863899.txt' '-o' '/tmp/graph2685358521953863899.bin' '-w' '/tmp/graph2685358521953863899.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2685358521953863899.bin' '-l' '-1' '-v' '-w' '/tmp/graph2685358521953863899.weights' '-q' '0' '-e' '0.001'
[2022-05-18 06:07:56] [INFO ] Decomposing Gal with order
[2022-05-18 06:07:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 06:07:57] [INFO ] Computing Do-Not-Accords matrix : 1262 transitions.
[2022-05-18 06:07:57] [INFO ] Computation of Completed DNA matrix. took 19 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 06:07:57] [INFO ] Built C files in 216ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14320299955341937779
Running compilation step : cd /tmp/ltsmin14320299955341937779;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-18 06:07:57] [INFO ] Removed a total of 1092 redundant transitions.
[2022-05-18 06:07:57] [INFO ] Flatten gal took : 134 ms
[2022-05-18 06:07:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 172 labels/synchronizations in 17 ms.
[2022-05-18 06:07:57] [INFO ] Time to serialize gal into /tmp/LTLCardinality15732427726310719127.gal : 7 ms
[2022-05-18 06:07:57] [INFO ] Time to serialize properties into /tmp/LTLCardinality32253557873921248.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality15732427726310719127.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality32253557873921248.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...287
Read 2 LTL properties
Checking formula 0 : !((G(F("(((((gu81.ScheduleTaskB_0+gu81.ScheduleTaskB_1)+(gu81.ScheduleTaskB_2+gu81.ScheduleTaskB_3))+((gu81.ScheduleTaskB_4+gu81.Sched...421
Formula 0 simplified : !GF"(((((gu81.ScheduleTaskB_0+gu81.ScheduleTaskB_1)+(gu81.ScheduleTaskB_2+gu81.ScheduleTaskB_3))+((gu81.ScheduleTaskB_4+gu81.Schedul...415
Compilation finished in 4160 ms.
Running link step : cd /tmp/ltsmin14320299955341937779;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 62 ms.
Running LTSmin : cd /tmp/ltsmin14320299955341937779;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
LTSmin run took 601451 ms.
FORMULA PolyORBLF-COL-S02J04T10-LTLCardinality-05 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin14320299955341937779;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>(!((LTLAPp1==true) U (LTLAPp2==true))))' '--buchi-type=spotba'
LTSmin run took 19167 ms.
FORMULA PolyORBLF-COL-S02J04T10-LTLCardinality-14 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 960073 ms.

BK_STOP 1652854702179

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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