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.r024-tall-165251918800603.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 CSRepetitions-COL-07, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r024-tall-165251918800603
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 240K
-rw-r--r-- 1 mcc users 7.1K Apr 30 06:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Apr 30 06:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Apr 30 06:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 30 06:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K May 9 07:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 07:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 9 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 07:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 9 07:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:33 equiv_pt
-rw-r--r-- 1 mcc users 3 May 10 09:33 instance
-rw-r--r-- 1 mcc users 5 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 16K May 10 09:33 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 CSRepetitions-COL-07-LTLCardinality-00
FORMULA_NAME CSRepetitions-COL-07-LTLCardinality-01
FORMULA_NAME CSRepetitions-COL-07-LTLCardinality-02
FORMULA_NAME CSRepetitions-COL-07-LTLCardinality-03
FORMULA_NAME CSRepetitions-COL-07-LTLCardinality-04
FORMULA_NAME CSRepetitions-COL-07-LTLCardinality-05
FORMULA_NAME CSRepetitions-COL-07-LTLCardinality-06
FORMULA_NAME CSRepetitions-COL-07-LTLCardinality-07
FORMULA_NAME CSRepetitions-COL-07-LTLCardinality-08
FORMULA_NAME CSRepetitions-COL-07-LTLCardinality-09
FORMULA_NAME CSRepetitions-COL-07-LTLCardinality-10
FORMULA_NAME CSRepetitions-COL-07-LTLCardinality-11
FORMULA_NAME CSRepetitions-COL-07-LTLCardinality-12
FORMULA_NAME CSRepetitions-COL-07-LTLCardinality-13
FORMULA_NAME CSRepetitions-COL-07-LTLCardinality-14
FORMULA_NAME CSRepetitions-COL-07-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652666518054

Running Version 202205111006
[2022-05-16 02:01:59] [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-16 02:01:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 02:01:59] [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-16 02:01:59] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-16 02:01:59] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 524 ms
[2022-05-16 02:01:59] [INFO ] Imported 6 HL places and 5 HL transitions for a total of 498 PT places and 833.0 transition bindings in 17 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
[2022-05-16 02:01:59] [INFO ] Built PT skeleton of HLPN with 6 places and 5 transitions 15 arcs in 7 ms.
[2022-05-16 02:01:59] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Initial state reduction rules removed 3 formulas.
FORMULA CSRepetitions-COL-07-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-COL-07-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-COL-07-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-COL-07-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 12 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Finished random walk after 134 steps, including 1 resets, run visited all 18 properties in 13 ms. (steps per millisecond=10 )
[2022-05-16 02:02:00] [INFO ] Flatten gal took : 16 ms
[2022-05-16 02:02:00] [INFO ] Flatten gal took : 2 ms
Transition Send_Answer forces synchronizations/join behavior on parameter c of sort Client
Symmetric sort wr.t. initial and guards and successors and join/free detected :Server
Symmetric sort wr.t. initial detected :Server
Symmetric sort wr.t. initial and guards detected :Server
Applying symmetric unfolding of full symmetric sort :Server domain size was 7
[2022-05-16 02:02:00] [INFO ] Unfolded HLPN to a Petri net with 198 places and 245 transitions 735 arcs in 16 ms.
[2022-05-16 02:02:00] [INFO ] Unfolded 12 HLPN properties in 1 ms.
Support contains 149 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 245/245 transitions.
Applied a total of 0 rules in 10 ms. Remains 198 /198 variables (removed 0) and now considering 245/245 (removed 0) transitions.
// Phase 1: matrix 245 rows 198 cols
[2022-05-16 02:02:00] [INFO ] Computed 50 place invariants in 19 ms
[2022-05-16 02:02:00] [INFO ] Implicit Places using invariants in 168 ms returned []
// Phase 1: matrix 245 rows 198 cols
[2022-05-16 02:02:00] [INFO ] Computed 50 place invariants in 4 ms
[2022-05-16 02:02:00] [INFO ] State equation strengthened by 49 read => feed constraints.
[2022-05-16 02:02:00] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 347 ms to find 0 implicit places.
// Phase 1: matrix 245 rows 198 cols
[2022-05-16 02:02:00] [INFO ] Computed 50 place invariants in 6 ms
[2022-05-16 02:02:00] [INFO ] Dead Transitions using invariants and state equation in 147 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 198/198 places, 245/245 transitions.
Support contains 149 out of 198 places after structural reductions.
[2022-05-16 02:02:00] [INFO ] Flatten gal took : 27 ms
[2022-05-16 02:02:00] [INFO ] Flatten gal took : 20 ms
[2022-05-16 02:02:00] [INFO ] Input system was already deterministic with 245 transitions.
Finished random walk after 87 steps, including 0 resets, run visited all 17 properties in 13 ms. (steps per millisecond=6 )
FORMULA CSRepetitions-COL-07-LTLCardinality-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA CSRepetitions-COL-07-LTLCardinality-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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' '!(F(X((F(p0) U G((p1 U p0))))))'
Support contains 50 out of 198 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 198/198 places, 245/245 transitions.
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 0 with 147 rules applied. Total rules applied 147 place count 100 transition count 196
Applied a total of 147 rules in 32 ms. Remains 100 /198 variables (removed 98) and now considering 196/245 (removed 49) transitions.
// Phase 1: matrix 196 rows 100 cols
[2022-05-16 02:02:01] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-16 02:02:01] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 196 rows 100 cols
[2022-05-16 02:02:01] [INFO ] Computed 1 place invariants in 4 ms
[2022-05-16 02:02:01] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
[2022-05-16 02:02:01] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 196 rows 100 cols
[2022-05-16 02:02:01] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-16 02:02:01] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 100/198 places, 196/245 transitions.
Finished structural reductions, in 1 iterations. Remains : 100/198 places, 196/245 transitions.
Stuttering acceptance computed with spot in 206 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-COL-07-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(OR p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 1 s50), p1:(LEQ 1 (ADD s51 s52 s53 s54 s55 s56 s57 s58 s59 s60 s61 s62 s63 s64 s65 s66 s67 s68 s69 s70 s71 s72 s73 s74 s75 s76 s77 s78 s79 s80 s81...], 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 2888 reset in 436 ms.
Product exploration explored 100000 steps with 2911 reset in 328 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 p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (OR p0 p1)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (OR p0 p1))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 410 ms. Reduced automaton from 2 states, 5 edges and 2 AP to 2 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 290 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 196 rows 100 cols
[2022-05-16 02:02:02] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-16 02:02:02] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-16 02:02:02] [INFO ] After 54ms 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 1 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (OR p0 p1)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (OR p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (G (OR p0 p1)), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) p1))]
Knowledge based reduction with 9 factoid took 454 ms. Reduced automaton from 2 states, 5 edges and 2 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 100 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 100/100 places, 196/196 transitions.
Applied a total of 0 rules in 14 ms. Remains 100 /100 variables (removed 0) and now considering 196/196 (removed 0) transitions.
// Phase 1: matrix 196 rows 100 cols
[2022-05-16 02:02:03] [INFO ] Computed 1 place invariants in 3 ms
[2022-05-16 02:02:03] [INFO ] Implicit Places using invariants in 37 ms returned []
// Phase 1: matrix 196 rows 100 cols
[2022-05-16 02:02:03] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:02:03] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
[2022-05-16 02:02:03] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 196 rows 100 cols
[2022-05-16 02:02:03] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:02:03] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 100/100 places, 196/196 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 129 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 60 ms :[(NOT p0), (NOT p0)]
Finished random walk after 50 steps, including 2 resets, run visited all 1 properties in 1 ms. (steps per millisecond=50 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 104 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 57 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2917 reset in 296 ms.
Product exploration explored 100000 steps with 2922 reset in 377 ms.
Built C files in :
/tmp/ltsmin1880552414792664114
[2022-05-16 02:02:04] [INFO ] Computing symmetric may disable matrix : 196 transitions.
[2022-05-16 02:02:04] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 02:02:04] [INFO ] Computing symmetric may enable matrix : 196 transitions.
[2022-05-16 02:02:04] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 02:02:05] [INFO ] Computing Do-Not-Accords matrix : 196 transitions.
[2022-05-16 02:02:05] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 02:02:05] [INFO ] Built C files in 50ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1880552414792664114
Running compilation step : cd /tmp/ltsmin1880552414792664114;'/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 484 ms.
Running link step : cd /tmp/ltsmin1880552414792664114;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin1880552414792664114;'/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/stateBased5992915903201569445.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 100/100 places, 196/196 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 52 transition count 148
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 52 transition count 148
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 144 place count 4 transition count 52
Iterating global reduction 0 with 48 rules applied. Total rules applied 192 place count 4 transition count 52
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 240 place count 4 transition count 4
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 240 place count 4 transition count 3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 242 place count 3 transition count 3
Applied a total of 242 rules in 15 ms. Remains 3 /100 variables (removed 97) and now considering 3/196 (removed 193) transitions.
// Phase 1: matrix 3 rows 3 cols
[2022-05-16 02:02:20] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 02:02:20] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2022-05-16 02:02:20] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 02:02:20] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
[2022-05-16 02:02:20] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2022-05-16 02:02:20] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 02:02:20] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/100 places, 3/196 transitions.
Finished structural reductions, in 1 iterations. Remains : 3/100 places, 3/196 transitions.
Built C files in :
/tmp/ltsmin15080899567661134549
[2022-05-16 02:02:20] [INFO ] Computing symmetric may disable matrix : 3 transitions.
[2022-05-16 02:02:20] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 02:02:20] [INFO ] Computing symmetric may enable matrix : 3 transitions.
[2022-05-16 02:02:20] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 02:02:20] [INFO ] Computing Do-Not-Accords matrix : 3 transitions.
[2022-05-16 02:02:20] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 02:02:20] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15080899567661134549
Running compilation step : cd /tmp/ltsmin15080899567661134549;'/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 70 ms.
Running link step : cd /tmp/ltsmin15080899567661134549;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin15080899567661134549;'/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/stateBased17037078913678625461.hoa' '--buchi-type=spotba'
LTSmin run took 41 ms.
FORMULA CSRepetitions-COL-07-LTLCardinality-00 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CSRepetitions-COL-07-LTLCardinality-00 finished in 19305 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p0)||(G(p1)&&F(F(p0))))))'
Support contains 99 out of 198 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 198/198 places, 245/245 transitions.
Applied a total of 0 rules in 13 ms. Remains 198 /198 variables (removed 0) and now considering 245/245 (removed 0) transitions.
// Phase 1: matrix 245 rows 198 cols
[2022-05-16 02:02:20] [INFO ] Computed 50 place invariants in 1 ms
[2022-05-16 02:02:20] [INFO ] Implicit Places using invariants in 58 ms returned []
// Phase 1: matrix 245 rows 198 cols
[2022-05-16 02:02:20] [INFO ] Computed 50 place invariants in 4 ms
[2022-05-16 02:02:20] [INFO ] State equation strengthened by 49 read => feed constraints.
[2022-05-16 02:02:20] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
[2022-05-16 02:02:20] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 245 rows 198 cols
[2022-05-16 02:02:20] [INFO ] Computed 50 place invariants in 2 ms
[2022-05-16 02:02:20] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 198/198 places, 245/245 transitions.
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), true, (NOT p0), (AND (NOT p1) p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-COL-07-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(LEQ 3 (ADD s100 s101 s102 s103 s104 s105 s106 s107 s108 s109 s110 s111 s112 s113 s114 s115 s116 s117 s118 s119 s120 s121 s122 s123 s124 s125 s126 s127...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 12517 steps with 2341 reset in 87 ms.
FORMULA CSRepetitions-COL-07-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-07-LTLCardinality-01 finished in 571 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 50 out of 198 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 198/198 places, 245/245 transitions.
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 0 with 147 rules applied. Total rules applied 147 place count 100 transition count 196
Applied a total of 147 rules in 18 ms. Remains 100 /198 variables (removed 98) and now considering 196/245 (removed 49) transitions.
// Phase 1: matrix 196 rows 100 cols
[2022-05-16 02:02:20] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:02:20] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 196 rows 100 cols
[2022-05-16 02:02:20] [INFO ] Computed 1 place invariants in 4 ms
[2022-05-16 02:02:21] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
[2022-05-16 02:02:21] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 196 rows 100 cols
[2022-05-16 02:02:21] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:02:21] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 100/198 places, 196/245 transitions.
Finished structural reductions, in 1 iterations. Remains : 100/198 places, 196/245 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : CSRepetitions-COL-07-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (LEQ (ADD s51 s52 s53 s54 s55 s56 s57 s58 s59 s60 s61 s62 s63 s64 s65 s66 s67 s68 s69 s70 s71 s72 s73 s74 s75 s76 s77 s78 s79 s80 s81 s82 s83 s84 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 59 steps with 0 reset in 1 ms.
FORMULA CSRepetitions-COL-07-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-07-LTLCardinality-02 finished in 267 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(p0)))'
Support contains 49 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 245/245 transitions.
Applied a total of 0 rules in 6 ms. Remains 198 /198 variables (removed 0) and now considering 245/245 (removed 0) transitions.
// Phase 1: matrix 245 rows 198 cols
[2022-05-16 02:02:21] [INFO ] Computed 50 place invariants in 2 ms
[2022-05-16 02:02:21] [INFO ] Implicit Places using invariants in 56 ms returned []
// Phase 1: matrix 245 rows 198 cols
[2022-05-16 02:02:21] [INFO ] Computed 50 place invariants in 3 ms
[2022-05-16 02:02:21] [INFO ] State equation strengthened by 49 read => feed constraints.
[2022-05-16 02:02:21] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
// Phase 1: matrix 245 rows 198 cols
[2022-05-16 02:02:21] [INFO ] Computed 50 place invariants in 1 ms
[2022-05-16 02:02:21] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 198/198 places, 245/245 transitions.
Stuttering acceptance computed with spot in 66 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-COL-07-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, 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 2 (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 ...], 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-COL-07-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-07-LTLCardinality-04 finished in 398 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(X(p0) U X(((G(p1)&&G(X(p1)))||p2))))'
Support contains 99 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 245/245 transitions.
Applied a total of 0 rules in 7 ms. Remains 198 /198 variables (removed 0) and now considering 245/245 (removed 0) transitions.
// Phase 1: matrix 245 rows 198 cols
[2022-05-16 02:02:21] [INFO ] Computed 50 place invariants in 4 ms
[2022-05-16 02:02:21] [INFO ] Implicit Places using invariants in 51 ms returned []
// Phase 1: matrix 245 rows 198 cols
[2022-05-16 02:02:21] [INFO ] Computed 50 place invariants in 5 ms
[2022-05-16 02:02:21] [INFO ] State equation strengthened by 49 read => feed constraints.
[2022-05-16 02:02:21] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
// Phase 1: matrix 245 rows 198 cols
[2022-05-16 02:02:21] [INFO ] Computed 50 place invariants in 1 ms
[2022-05-16 02:02:21] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 198/198 places, 245/245 transitions.
Stuttering acceptance computed with spot in 126 ms :[(OR p2 p1), (OR p2 p1), true, p1]
Running random walk in product with property : CSRepetitions-COL-07-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=p2, acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ 1 s0), p2:(AND (LEQ s0 (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 120 steps with 3 reset in 1 ms.
FORMULA CSRepetitions-COL-07-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-07-LTLCardinality-05 finished in 420 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((X(p0)&&p1))||G(X(p2)))))'
Support contains 100 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 245/245 transitions.
Applied a total of 0 rules in 6 ms. Remains 198 /198 variables (removed 0) and now considering 245/245 (removed 0) transitions.
// Phase 1: matrix 245 rows 198 cols
[2022-05-16 02:02:22] [INFO ] Computed 50 place invariants in 4 ms
[2022-05-16 02:02:22] [INFO ] Implicit Places using invariants in 62 ms returned []
// Phase 1: matrix 245 rows 198 cols
[2022-05-16 02:02:22] [INFO ] Computed 50 place invariants in 2 ms
[2022-05-16 02:02:22] [INFO ] State equation strengthened by 49 read => feed constraints.
[2022-05-16 02:02:22] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
// Phase 1: matrix 245 rows 198 cols
[2022-05-16 02:02:22] [INFO ] Computed 50 place invariants in 2 ms
[2022-05-16 02:02:22] [INFO ] Dead Transitions using invariants and state equation in 113 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 198/198 places, 245/245 transitions.
Stuttering acceptance computed with spot in 242 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : CSRepetitions-COL-07-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=p1, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND p1 p2), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={} source=5 dest: 2}, { cond=p1, acceptance={} source=5 dest: 3}]], initial=4, aps=[p1:(GT (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 2721 reset in 815 ms.
Stack based approach found an accepted trace after 46127 steps with 1245 reset with depth 7 and stack size 7 in 404 ms.
FORMULA CSRepetitions-COL-07-LTLCardinality-10 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-COL-07-LTLCardinality-10 finished in 1801 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(X(p0))&&!p0)))'
Support contains 49 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 245/245 transitions.
Applied a total of 0 rules in 9 ms. Remains 198 /198 variables (removed 0) and now considering 245/245 (removed 0) transitions.
// Phase 1: matrix 245 rows 198 cols
[2022-05-16 02:02:23] [INFO ] Computed 50 place invariants in 1 ms
[2022-05-16 02:02:23] [INFO ] Implicit Places using invariants in 62 ms returned []
// Phase 1: matrix 245 rows 198 cols
[2022-05-16 02:02:23] [INFO ] Computed 50 place invariants in 8 ms
[2022-05-16 02:02:23] [INFO ] State equation strengthened by 49 read => feed constraints.
[2022-05-16 02:02:24] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
// Phase 1: matrix 245 rows 198 cols
[2022-05-16 02:02:24] [INFO ] Computed 50 place invariants in 1 ms
[2022-05-16 02:02:24] [INFO ] Dead Transitions using invariants and state equation in 106 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 198/198 places, 245/245 transitions.
Stuttering acceptance computed with spot in 711 ms :[true, true, true, (NOT p0)]
Running random walk in product with property : CSRepetitions-COL-07-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(GT 3 (ADD s149 s150 s151 s152 s153 s154 s155 s156 s157 s158 s159 s160 s161 s162 s163 s164 s165 s166 s167 s168 s169 s170 s171 s172 s173 s174 s175 s176 ...], 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 1 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-COL-07-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-07-LTLCardinality-11 finished in 1058 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G(X(p0)))))'
Support contains 50 out of 198 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 198/198 places, 245/245 transitions.
Applied a total of 0 rules in 11 ms. Remains 198 /198 variables (removed 0) and now considering 245/245 (removed 0) transitions.
// Phase 1: matrix 245 rows 198 cols
[2022-05-16 02:02:24] [INFO ] Computed 50 place invariants in 4 ms
[2022-05-16 02:02:24] [INFO ] Implicit Places using invariants in 74 ms returned []
// Phase 1: matrix 245 rows 198 cols
[2022-05-16 02:02:24] [INFO ] Computed 50 place invariants in 2 ms
[2022-05-16 02:02:25] [INFO ] State equation strengthened by 49 read => feed constraints.
[2022-05-16 02:02:25] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 248 ms to find 0 implicit places.
[2022-05-16 02:02:25] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 245 rows 198 cols
[2022-05-16 02:02:25] [INFO ] Computed 50 place invariants in 2 ms
[2022-05-16 02:02:25] [INFO ] Dead Transitions using invariants and state equation in 119 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 198/198 places, 245/245 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : CSRepetitions-COL-07-LTLCardinality-12 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 (ADD s100 s101 s102 s103 s104 s105 s106 s107 s108 s109 s110 s111 s112 s113 s114 s115 s116 s117 s118 s119 s120 s121 s122 s123 s124 s125 s126 s127 s...], 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 1082 reset in 602 ms.
Product exploration explored 100000 steps with 1086 reset in 636 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 106 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Finished random walk after 65 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=32 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 96 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
// Phase 1: matrix 245 rows 198 cols
[2022-05-16 02:02:26] [INFO ] Computed 50 place invariants in 4 ms
[2022-05-16 02:02:27] [INFO ] [Real]Absence check using 50 positive place invariants in 12 ms returned sat
[2022-05-16 02:02:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 02:02:27] [INFO ] [Real]Absence check using state equation in 94 ms returned sat
[2022-05-16 02:02:27] [INFO ] State equation strengthened by 49 read => feed constraints.
[2022-05-16 02:02:27] [INFO ] [Real]Added 49 Read/Feed constraints in 8 ms returned sat
[2022-05-16 02:02:27] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 02:02:27] [INFO ] [Nat]Absence check using 50 positive place invariants in 9 ms returned sat
[2022-05-16 02:02:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 02:02:27] [INFO ] [Nat]Absence check using state equation in 103 ms returned sat
[2022-05-16 02:02:27] [INFO ] [Nat]Added 49 Read/Feed constraints in 9 ms returned sat
[2022-05-16 02:02:27] [INFO ] Computed and/alt/rep : 196/245/196 causal constraints (skipped 0 transitions) in 13 ms.
[2022-05-16 02:02:27] [INFO ] Added : 4 causal constraints over 1 iterations in 74 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 50 out of 198 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 198/198 places, 245/245 transitions.
Applied a total of 0 rules in 15 ms. Remains 198 /198 variables (removed 0) and now considering 245/245 (removed 0) transitions.
// Phase 1: matrix 245 rows 198 cols
[2022-05-16 02:02:27] [INFO ] Computed 50 place invariants in 2 ms
[2022-05-16 02:02:27] [INFO ] Implicit Places using invariants in 81 ms returned []
// Phase 1: matrix 245 rows 198 cols
[2022-05-16 02:02:27] [INFO ] Computed 50 place invariants in 1 ms
[2022-05-16 02:02:27] [INFO ] State equation strengthened by 49 read => feed constraints.
[2022-05-16 02:02:27] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 261 ms to find 0 implicit places.
[2022-05-16 02:02:27] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 245 rows 198 cols
[2022-05-16 02:02:27] [INFO ] Computed 50 place invariants in 1 ms
[2022-05-16 02:02:27] [INFO ] Dead Transitions using invariants and state equation in 114 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 198/198 places, 245/245 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 1386 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Finished random walk after 59 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=59 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
// Phase 1: matrix 245 rows 198 cols
[2022-05-16 02:02:29] [INFO ] Computed 50 place invariants in 3 ms
[2022-05-16 02:02:29] [INFO ] [Real]Absence check using 50 positive place invariants in 13 ms returned sat
[2022-05-16 02:02:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 02:02:29] [INFO ] [Real]Absence check using state equation in 99 ms returned sat
[2022-05-16 02:02:29] [INFO ] State equation strengthened by 49 read => feed constraints.
[2022-05-16 02:02:29] [INFO ] [Real]Added 49 Read/Feed constraints in 6 ms returned sat
[2022-05-16 02:02:29] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 02:02:30] [INFO ] [Nat]Absence check using 50 positive place invariants in 10 ms returned sat
[2022-05-16 02:02:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 02:02:30] [INFO ] [Nat]Absence check using state equation in 87 ms returned sat
[2022-05-16 02:02:30] [INFO ] [Nat]Added 49 Read/Feed constraints in 5 ms returned sat
[2022-05-16 02:02:30] [INFO ] Computed and/alt/rep : 196/245/196 causal constraints (skipped 0 transitions) in 12 ms.
[2022-05-16 02:02:30] [INFO ] Added : 4 causal constraints over 1 iterations in 46 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1084 reset in 606 ms.
Stack based approach found an accepted trace after 22782 steps with 249 reset with depth 31 and stack size 31 in 144 ms.
FORMULA CSRepetitions-COL-07-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-COL-07-LTLCardinality-12 finished in 6160 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 98 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 245/245 transitions.
Applied a total of 0 rules in 2 ms. Remains 198 /198 variables (removed 0) and now considering 245/245 (removed 0) transitions.
// Phase 1: matrix 245 rows 198 cols
[2022-05-16 02:02:31] [INFO ] Computed 50 place invariants in 1 ms
[2022-05-16 02:02:31] [INFO ] Implicit Places using invariants in 63 ms returned []
// Phase 1: matrix 245 rows 198 cols
[2022-05-16 02:02:31] [INFO ] Computed 50 place invariants in 1 ms
[2022-05-16 02:02:31] [INFO ] State equation strengthened by 49 read => feed constraints.
[2022-05-16 02:02:31] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
// Phase 1: matrix 245 rows 198 cols
[2022-05-16 02:02:31] [INFO ] Computed 50 place invariants in 1 ms
[2022-05-16 02:02:31] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 198/198 places, 245/245 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-COL-07-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ (ADD s100 s101 s102 s103 s104 s105 s106 s107 s108 s109 s110 s111 s112 s113 s114 s115 s116 s117 s118 s119 s120 s121 s122 s123 s124 s125 s126 s127 s...], 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 1219 reset in 648 ms.
Stack based approach found an accepted trace after 61781 steps with 752 reset with depth 74 and stack size 74 in 422 ms.
FORMULA CSRepetitions-COL-07-LTLCardinality-13 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-COL-07-LTLCardinality-13 finished in 1442 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(!(X(G(X(p0))) U X((F(p1)&&p2))))))'
Support contains 99 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 245/245 transitions.
Applied a total of 0 rules in 4 ms. Remains 198 /198 variables (removed 0) and now considering 245/245 (removed 0) transitions.
// Phase 1: matrix 245 rows 198 cols
[2022-05-16 02:02:32] [INFO ] Computed 50 place invariants in 3 ms
[2022-05-16 02:02:32] [INFO ] Implicit Places using invariants in 64 ms returned []
// Phase 1: matrix 245 rows 198 cols
[2022-05-16 02:02:32] [INFO ] Computed 50 place invariants in 1 ms
[2022-05-16 02:02:32] [INFO ] State equation strengthened by 49 read => feed constraints.
[2022-05-16 02:02:32] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
// Phase 1: matrix 245 rows 198 cols
[2022-05-16 02:02:32] [INFO ] Computed 50 place invariants in 1 ms
[2022-05-16 02:02:32] [INFO ] Dead Transitions using invariants and state equation in 109 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 198/198 places, 245/245 transitions.
Stuttering acceptance computed with spot in 235 ms :[(AND p1 p2), (AND p1 p2), (AND p1 p2), (AND p2 p0 p1), (AND p1 p2), (AND p2 p0 p1)]
Running random walk in product with property : CSRepetitions-COL-07-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND p2 p1), acceptance={0, 1} source=2 dest: 2}, { cond=(OR (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={1} source=2 dest: 4}], [{ cond=(OR (AND (NOT p2) p0) (AND (NOT p1) p0)), acceptance={0} source=3 dest: 3}, { cond=(AND p2 p1 p0), acceptance={0, 1} source=3 dest: 3}, { cond=(AND p2 (NOT p1) p0), acceptance={1} source=3 dest: 5}], [{ cond=(AND p2 p1), acceptance={0, 1} source=4 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={1} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p2) p1 p0), acceptance={0} source=5 dest: 3}, { cond=(AND p2 p1 p0), acceptance={0, 1} source=5 dest: 3}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=5 dest: 5}, { cond=(AND p2 (NOT p1) p0), acceptance={1} source=5 dest: 5}]], initial=0, aps=[p2:(LEQ 3 (ADD s100 s101 s102 s103 s104 s105 s106 s107 s108 s109 s110 s111 s112 s113 s114 s115 s116 s117 s118 s119 s120 s121 s122 s123 s124 s125 s126 s127...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1087 reset in 892 ms.
Stack based approach found an accepted trace after 6076 steps with 67 reset with depth 89 and stack size 89 in 57 ms.
FORMULA CSRepetitions-COL-07-LTLCardinality-15 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-COL-07-LTLCardinality-15 finished in 1513 ms.
All properties solved by simple procedures.
Total runtime 34783 ms.

BK_STOP 1652666554044

--------------------
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="CSRepetitions-COL-07"
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 CSRepetitions-COL-07, 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 r024-tall-165251918800603"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CSRepetitions-COL-07.tgz
mv CSRepetitions-COL-07 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 ;