Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r512-smll-171654407400330.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is PhaseVariation-PT-D10CS010, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r512-smll-171654407400330
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.4M
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 98K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 5.0K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:25 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 18:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.4K Apr 11 21:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 52K Apr 11 21:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 17K Apr 11 21:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 94K Apr 11 21:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 9 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 2.9M May 18 16:43 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 PhaseVariation-PT-D10CS010-CTLFireability-2024-00
FORMULA_NAME PhaseVariation-PT-D10CS010-CTLFireability-2024-01
FORMULA_NAME PhaseVariation-PT-D10CS010-CTLFireability-2024-02
FORMULA_NAME PhaseVariation-PT-D10CS010-CTLFireability-2024-03
FORMULA_NAME PhaseVariation-PT-D10CS010-CTLFireability-2024-04
FORMULA_NAME PhaseVariation-PT-D10CS010-CTLFireability-2024-05
FORMULA_NAME PhaseVariation-PT-D10CS010-CTLFireability-2024-06
FORMULA_NAME PhaseVariation-PT-D10CS010-CTLFireability-2024-07
FORMULA_NAME PhaseVariation-PT-D10CS010-CTLFireability-2024-08
FORMULA_NAME PhaseVariation-PT-D10CS010-CTLFireability-2024-09
FORMULA_NAME PhaseVariation-PT-D10CS010-CTLFireability-2024-10
FORMULA_NAME PhaseVariation-PT-D10CS010-CTLFireability-2024-11
FORMULA_NAME PhaseVariation-PT-D10CS010-CTLFireability-2023-12
FORMULA_NAME PhaseVariation-PT-D10CS010-CTLFireability-2023-13
FORMULA_NAME PhaseVariation-PT-D10CS010-CTLFireability-2023-14
FORMULA_NAME PhaseVariation-PT-D10CS010-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717285837034

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PhaseVariation-PT-D10CS010
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 23:50:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 23:50:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 23:50:40] [INFO ] Load time of PNML (sax parser for PT used): 790 ms
[2024-06-01 23:50:40] [INFO ] Transformed 302 places.
[2024-06-01 23:50:40] [INFO ] Transformed 3137 transitions.
[2024-06-01 23:50:40] [INFO ] Parsed PT model containing 302 places and 3137 transitions and 21755 arcs in 1118 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 38 ms.
Deduced a syphon composed of 2 places in 8 ms
Reduce places removed 2 places and 52 transitions.
Reduce places removed 1 places and 0 transitions.
Support contains 151 out of 299 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 299/299 places, 3085/3085 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 256 transitions
Redundant transition composition rules discarded 256 transitions
Iterating global reduction 0 with 256 rules applied. Total rules applied 256 place count 299 transition count 2829
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 259 place count 296 transition count 2807
Iterating global reduction 0 with 3 rules applied. Total rules applied 262 place count 296 transition count 2807
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 265 place count 296 transition count 2804
Applied a total of 265 rules in 138 ms. Remains 296 /299 variables (removed 3) and now considering 2804/3085 (removed 281) transitions.
Running 2791 sub problems to find dead transitions.
[2024-06-01 23:50:41] [INFO ] Flow matrix only has 196 transitions (discarded 2608 similar events)
// Phase 1: matrix 196 rows 296 cols
[2024-06-01 23:50:41] [INFO ] Computed 100 invariants in 40 ms
[2024-06-01 23:50:41] [INFO ] State equation strengthened by 183 read => feed constraints.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/288 variables, 91/91 constraints. Problems are: Problem set: 364 solved, 2427 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 288/492 variables, and 91 constraints, problems are : Problem set: 364 solved, 2427 unsolved in 20209 ms.
Refiners :[Positive P Invariants (semi-flows): 91/100 constraints, State Equation: 0/296 constraints, ReadFeed: 0/183 constraints, PredecessorRefiner: 2791/2791 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 364 solved, 2427 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/288 variables, 91/91 constraints. Problems are: Problem set: 364 solved, 2427 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 1)
(s4 0)
(s5 1)
(s6 0)
(s7 1)
(s8 1)
(s9 0)
(s10 0)
(s11 0)
(s12 1)
(s13 0)
(s14 0)
(s15 1)
(s16 0)
(s17 1)
(s18 0)
(s19 1)
(s20 0)
(s21 1)
(s22 0)
(s23 1)
(s24 0)
(s25 1)
(s26 0)
(s27 1)
(s28 0)
(s29 1)
(s30 0)
(s31 1)
(s32 0)
(s33 1)
(s34 0)
(s35 1)
(s36 0)
(s37 1)
(s38 0)
(s39 1)
(s40 0)
(s41 1)
(s42 0)
(s43 1)
(s44 0)
(s45 1)
(s46 0)
(s47 1)
(s48 0)
(s49 1)
(s50 0)
(s51 1)
(s52 0)
(s53 1)
(s54 0)
(s55 1)
(s56 0)
(s57 1)
(s58 0)
(s59 1)
(s60 0)
(s61 1)
(s62 0)
(s63 1)
(s64 0)
(s65 1)
(s66 0)
(s67 1)
(s68 0)
(s69 1)
(s70 0)
(s71 1)
(s72 0)
(s73 1)
(s74 0)
(s75 1)
(s76 0)
(s77 1)
(s78 0)
(s79 1)
(s80 0)
(s81 1)
(s82 0)
(s83 1)
(s84 0)
(s85 1)
(s86 0)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 0)
(s94 1)
(s95 0)
(s96 1)
(s97 0)
(s98 1)
(s99 0)
(s100 1)
(s101 0)
(s102 1)
(s103 0)
(s104 1)
(s105 0)
(s106 1)
(s107 1)
(s108 1)
(s109 0)
(s110 1)
(s111 0)
(s112 1)
(s113 0)
(s114 1)
(s115 0)
(s116 1)
(s117 0)
(s118 1)
(s119 0)
(s120 1)
(s121 0)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 0)
(s130 1)
(s131 0)
(s132 1)
(s133 0)
(s134 1)
(s135 0)
(s136 1)
(s137 0)
(s138 1)
(s139 0)
(s140 1)
(s141 0)
(s142 1)
(s143 0)
(s144 1)
(s145 0)
(s146 1)
(s147 0)
(s148 1)
(s149 0)
(s150 1)
(s151 0)
(s152 1)
(s153 0)
(s154 1)
(s155 0)
(s156 1)
(s157 0)
(s158 1)
(s159 0)
(s160 1)
(s161 0)
(s162 1)
(s163 0)
(s164 timeout
1 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 288/492 variables, and 91 constraints, problems are : Problem set: 364 solved, 2427 unsolved in 20083 ms.
Refiners :[Positive P Invariants (semi-flows): 91/100 constraints, State Equation: 0/296 constraints, ReadFeed: 0/183 constraints, PredecessorRefiner: 0/2791 constraints, Known Traps: 0/0 constraints]
After SMT, in 42245ms problems are : Problem set: 364 solved, 2427 unsolved
Search for dead transitions found 364 dead transitions in 42376ms
Found 364 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 364 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 364 transitions.
[2024-06-01 23:51:23] [INFO ] Flow matrix only has 196 transitions (discarded 2244 similar events)
// Phase 1: matrix 196 rows 296 cols
[2024-06-01 23:51:23] [INFO ] Computed 100 invariants in 6 ms
[2024-06-01 23:51:23] [INFO ] Implicit Places using invariants in 523 ms returned []
[2024-06-01 23:51:23] [INFO ] Flow matrix only has 196 transitions (discarded 2244 similar events)
[2024-06-01 23:51:23] [INFO ] Invariant cache hit.
[2024-06-01 23:51:24] [INFO ] State equation strengthened by 183 read => feed constraints.
[2024-06-01 23:51:24] [INFO ] Implicit Places using invariants and state equation in 823 ms returned []
Implicit Place search using SMT with State Equation took 1357 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 296/299 places, 2440/3085 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 265 transition count 2062
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 265 transition count 2062
Ensure Unique test removed 349 transitions
Reduce isomorphic transitions removed 349 transitions.
Iterating post reduction 0 with 349 rules applied. Total rules applied 411 place count 265 transition count 1713
Applied a total of 411 rules in 29 ms. Remains 265 /296 variables (removed 31) and now considering 1713/2440 (removed 727) transitions.
[2024-06-01 23:51:24] [INFO ] Flow matrix only has 165 transitions (discarded 1548 similar events)
// Phase 1: matrix 165 rows 265 cols
[2024-06-01 23:51:24] [INFO ] Computed 100 invariants in 3 ms
[2024-06-01 23:51:25] [INFO ] Implicit Places using invariants in 294 ms returned []
[2024-06-01 23:51:25] [INFO ] Flow matrix only has 165 transitions (discarded 1548 similar events)
[2024-06-01 23:51:25] [INFO ] Invariant cache hit.
[2024-06-01 23:51:25] [INFO ] State equation strengthened by 152 read => feed constraints.
[2024-06-01 23:51:25] [INFO ] Implicit Places using invariants and state equation in 801 ms returned []
Implicit Place search using SMT with State Equation took 1105 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 265/299 places, 1713/3085 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 45105 ms. Remains : 265/299 places, 1713/3085 transitions.
Support contains 151 out of 265 places after structural reductions.
[2024-06-01 23:51:26] [INFO ] Flatten gal took : 484 ms
[2024-06-01 23:51:26] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA PhaseVariation-PT-D10CS010-CTLFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 23:51:27] [INFO ] Flatten gal took : 235 ms
[2024-06-01 23:51:27] [INFO ] Input system was already deterministic with 1713 transitions.
Support contains 146 out of 265 places (down from 151) after GAL structural reductions.
RANDOM walk for 40000 steps (705 resets) in 2779 ms. (14 steps per ms) remains 11/78 properties
BEST_FIRST walk for 40004 steps (8 resets) in 266 ms. (149 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 183 ms. (217 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 199 ms. (200 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 235 ms. (169 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 239 ms. (166 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 579 ms. (68 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 189 ms. (210 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 175 ms. (227 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 173 ms. (229 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 181 ms. (219 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 235 ms. (169 steps per ms) remains 11/11 properties
[2024-06-01 23:51:29] [INFO ] Flow matrix only has 165 transitions (discarded 1548 similar events)
[2024-06-01 23:51:29] [INFO ] Invariant cache hit.
[2024-06-01 23:51:29] [INFO ] State equation strengthened by 152 read => feed constraints.
Problem AtomicPropp13 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 10 unsolved
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp64 is UNSAT
After SMT solving in domain Real declared 148/430 variables, and 27 constraints, problems are : Problem set: 11 solved, 0 unsolved in 222 ms.
Refiners :[Positive P Invariants (semi-flows): 27/100 constraints, State Equation: 0/265 constraints, ReadFeed: 0/152 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
After SMT, in 300ms problems are : Problem set: 11 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 11 atomic propositions for a total of 15 simplifications.
FORMULA PhaseVariation-PT-D10CS010-CTLFireability-2023-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 23:51:29] [INFO ] Flatten gal took : 136 ms
[2024-06-01 23:51:29] [INFO ] Flatten gal took : 142 ms
[2024-06-01 23:51:30] [INFO ] Input system was already deterministic with 1713 transitions.
Support contains 112 out of 265 places (down from 124) after GAL structural reductions.
Computed a total of 265 stabilizing places and 1713 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 265 transition count 1713
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
AF dead knowledge conclusive for 2 formulas.
Starting structural reductions in LTL mode, iteration 0 : 265/265 places, 1713/1713 transitions.
Discarding 55 places :
Symmetric choice reduction at 0 with 55 rule applications. Total rules 55 place count 210 transition count 1149
Iterating global reduction 0 with 55 rules applied. Total rules applied 110 place count 210 transition count 1149
Ensure Unique test removed 387 transitions
Reduce isomorphic transitions removed 387 transitions.
Iterating post reduction 0 with 387 rules applied. Total rules applied 497 place count 210 transition count 762
Applied a total of 497 rules in 17 ms. Remains 210 /265 variables (removed 55) and now considering 762/1713 (removed 951) transitions.
Running 753 sub problems to find dead transitions.
[2024-06-01 23:51:30] [INFO ] Flow matrix only has 110 transitions (discarded 652 similar events)
// Phase 1: matrix 110 rows 210 cols
[2024-06-01 23:51:30] [INFO ] Computed 100 invariants in 4 ms
[2024-06-01 23:51:30] [INFO ] State equation strengthened by 101 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 753 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/202 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 753 unsolved
At refinement iteration 2 (OVERLAPS) 8/210 variables, 9/100 constraints. Problems are: Problem set: 0 solved, 753 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/210 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 753 unsolved
SMT process timed out in 20230ms, After SMT, problems are : Problem set: 0 solved, 753 unsolved
Search for dead transitions found 0 dead transitions in 20244ms
Finished structural reductions in LTL mode , in 1 iterations and 20265 ms. Remains : 210/265 places, 762/1713 transitions.
[2024-06-01 23:51:50] [INFO ] Flatten gal took : 56 ms
[2024-06-01 23:51:50] [INFO ] Flatten gal took : 58 ms
[2024-06-01 23:51:50] [INFO ] Input system was already deterministic with 762 transitions.
Starting structural reductions in LTL mode, iteration 0 : 265/265 places, 1713/1713 transitions.
Discarding 61 places :
Symmetric choice reduction at 0 with 61 rule applications. Total rules 61 place count 204 transition count 1090
Iterating global reduction 0 with 61 rules applied. Total rules applied 122 place count 204 transition count 1090
Ensure Unique test removed 405 transitions
Reduce isomorphic transitions removed 405 transitions.
Iterating post reduction 0 with 405 rules applied. Total rules applied 527 place count 204 transition count 685
Applied a total of 527 rules in 23 ms. Remains 204 /265 variables (removed 61) and now considering 685/1713 (removed 1028) transitions.
Running 677 sub problems to find dead transitions.
[2024-06-01 23:51:50] [INFO ] Flow matrix only has 104 transitions (discarded 581 similar events)
// Phase 1: matrix 104 rows 204 cols
[2024-06-01 23:51:50] [INFO ] Computed 100 invariants in 6 ms
[2024-06-01 23:51:50] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 677 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/196 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 677 unsolved
At refinement iteration 2 (OVERLAPS) 8/204 variables, 9/100 constraints. Problems are: Problem set: 0 solved, 677 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 677 unsolved
SMT process timed out in 20224ms, After SMT, problems are : Problem set: 0 solved, 677 unsolved
Search for dead transitions found 0 dead transitions in 20239ms
Finished structural reductions in LTL mode , in 1 iterations and 20267 ms. Remains : 204/265 places, 685/1713 transitions.
[2024-06-01 23:52:11] [INFO ] Flatten gal took : 42 ms
[2024-06-01 23:52:11] [INFO ] Flatten gal took : 45 ms
[2024-06-01 23:52:11] [INFO ] Input system was already deterministic with 685 transitions.
Starting structural reductions in LTL mode, iteration 0 : 265/265 places, 1713/1713 transitions.
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 57 place count 208 transition count 1125
Iterating global reduction 0 with 57 rules applied. Total rules applied 114 place count 208 transition count 1125
Ensure Unique test removed 393 transitions
Reduce isomorphic transitions removed 393 transitions.
Iterating post reduction 0 with 393 rules applied. Total rules applied 507 place count 208 transition count 732
Applied a total of 507 rules in 23 ms. Remains 208 /265 variables (removed 57) and now considering 732/1713 (removed 981) transitions.
Running 724 sub problems to find dead transitions.
[2024-06-01 23:52:11] [INFO ] Flow matrix only has 108 transitions (discarded 624 similar events)
// Phase 1: matrix 108 rows 208 cols
[2024-06-01 23:52:11] [INFO ] Computed 100 invariants in 3 ms
[2024-06-01 23:52:11] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 724 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 724 unsolved
At refinement iteration 2 (OVERLAPS) 8/208 variables, 9/100 constraints. Problems are: Problem set: 0 solved, 724 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 724 unsolved
SMT process timed out in 20233ms, After SMT, problems are : Problem set: 0 solved, 724 unsolved
Search for dead transitions found 0 dead transitions in 20247ms
Finished structural reductions in LTL mode , in 1 iterations and 20274 ms. Remains : 208/265 places, 732/1713 transitions.
[2024-06-01 23:52:31] [INFO ] Flatten gal took : 44 ms
[2024-06-01 23:52:31] [INFO ] Flatten gal took : 47 ms
[2024-06-01 23:52:31] [INFO ] Input system was already deterministic with 732 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 265/265 places, 1713/1713 transitions.
Discarding 64 places :
Symmetric choice reduction at 0 with 64 rule applications. Total rules 64 place count 201 transition count 1045
Iterating global reduction 0 with 64 rules applied. Total rules applied 128 place count 201 transition count 1045
Ensure Unique test removed 414 transitions
Reduce isomorphic transitions removed 414 transitions.
Iterating post reduction 0 with 414 rules applied. Total rules applied 542 place count 201 transition count 631
Applied a total of 542 rules in 248 ms. Remains 201 /265 variables (removed 64) and now considering 631/1713 (removed 1082) transitions.
Running 623 sub problems to find dead transitions.
[2024-06-01 23:52:31] [INFO ] Flow matrix only has 101 transitions (discarded 530 similar events)
// Phase 1: matrix 101 rows 201 cols
[2024-06-01 23:52:31] [INFO ] Computed 100 invariants in 3 ms
[2024-06-01 23:52:31] [INFO ] State equation strengthened by 93 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/193 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 623 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/193 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 623 unsolved
At refinement iteration 2 (OVERLAPS) 8/201 variables, 9/100 constraints. Problems are: Problem set: 0 solved, 623 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/201 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 623 unsolved
At refinement iteration 4 (OVERLAPS) 101/302 variables, 201/301 constraints. Problems are: Problem set: 0 solved, 623 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/302 variables, 93/394 constraints. Problems are: Problem set: 0 solved, 623 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 302/302 variables, and 394 constraints, problems are : Problem set: 0 solved, 623 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 201/201 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 623/623 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 623 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/193 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 623 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/193 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 623 unsolved
At refinement iteration 2 (OVERLAPS) 8/201 variables, 9/100 constraints. Problems are: Problem set: 0 solved, 623 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/201 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 623 unsolved
At refinement iteration 4 (OVERLAPS) 101/302 variables, 201/301 constraints. Problems are: Problem set: 0 solved, 623 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/302 variables, 93/394 constraints. Problems are: Problem set: 0 solved, 623 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/302 variables, 623/1017 constraints. Problems are: Problem set: 0 solved, 623 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 302/302 variables, and 1017 constraints, problems are : Problem set: 0 solved, 623 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 201/201 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 623/623 constraints, Known Traps: 0/0 constraints]
After SMT, in 40236ms problems are : Problem set: 0 solved, 623 unsolved
Search for dead transitions found 0 dead transitions in 40253ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 40505 ms. Remains : 201/265 places, 631/1713 transitions.
[2024-06-01 23:53:12] [INFO ] Flatten gal took : 32 ms
[2024-06-01 23:53:12] [INFO ] Flatten gal took : 33 ms
[2024-06-01 23:53:12] [INFO ] Input system was already deterministic with 631 transitions.
Starting structural reductions in LTL mode, iteration 0 : 265/265 places, 1713/1713 transitions.
Discarding 65 places :
Symmetric choice reduction at 0 with 65 rule applications. Total rules 65 place count 200 transition count 1038
Iterating global reduction 0 with 65 rules applied. Total rules applied 130 place count 200 transition count 1038
Ensure Unique test removed 417 transitions
Reduce isomorphic transitions removed 417 transitions.
Iterating post reduction 0 with 417 rules applied. Total rules applied 547 place count 200 transition count 621
Applied a total of 547 rules in 26 ms. Remains 200 /265 variables (removed 65) and now considering 621/1713 (removed 1092) transitions.
Running 613 sub problems to find dead transitions.
[2024-06-01 23:53:12] [INFO ] Flow matrix only has 100 transitions (discarded 521 similar events)
// Phase 1: matrix 100 rows 200 cols
[2024-06-01 23:53:12] [INFO ] Computed 100 invariants in 4 ms
[2024-06-01 23:53:12] [INFO ] State equation strengthened by 92 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 613 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 613 unsolved
At refinement iteration 2 (OVERLAPS) 8/200 variables, 9/100 constraints. Problems are: Problem set: 0 solved, 613 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/200 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 613 unsolved
At refinement iteration 4 (OVERLAPS) 100/300 variables, 200/300 constraints. Problems are: Problem set: 0 solved, 613 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/300 variables, 92/392 constraints. Problems are: Problem set: 0 solved, 613 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 300/300 variables, and 392 constraints, problems are : Problem set: 0 solved, 613 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 200/200 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 613/613 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 613 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 613 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 613 unsolved
At refinement iteration 2 (OVERLAPS) 8/200 variables, 9/100 constraints. Problems are: Problem set: 0 solved, 613 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/200 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 613 unsolved
At refinement iteration 4 (OVERLAPS) 100/300 variables, 200/300 constraints. Problems are: Problem set: 0 solved, 613 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/300 variables, 92/392 constraints. Problems are: Problem set: 0 solved, 613 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/300 variables, 613/1005 constraints. Problems are: Problem set: 0 solved, 613 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 300/300 variables, and 1005 constraints, problems are : Problem set: 0 solved, 613 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 200/200 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 613/613 constraints, Known Traps: 0/0 constraints]
After SMT, in 40219ms problems are : Problem set: 0 solved, 613 unsolved
Search for dead transitions found 0 dead transitions in 40241ms
Finished structural reductions in LTL mode , in 1 iterations and 40270 ms. Remains : 200/265 places, 621/1713 transitions.
[2024-06-01 23:53:52] [INFO ] Flatten gal took : 31 ms
[2024-06-01 23:53:52] [INFO ] Flatten gal took : 33 ms
[2024-06-01 23:53:52] [INFO ] Input system was already deterministic with 621 transitions.
Starting structural reductions in LTL mode, iteration 0 : 265/265 places, 1713/1713 transitions.
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 60 place count 205 transition count 1087
Iterating global reduction 0 with 60 rules applied. Total rules applied 120 place count 205 transition count 1087
Ensure Unique test removed 404 transitions
Reduce isomorphic transitions removed 404 transitions.
Iterating post reduction 0 with 404 rules applied. Total rules applied 524 place count 205 transition count 683
Applied a total of 524 rules in 28 ms. Remains 205 /265 variables (removed 60) and now considering 683/1713 (removed 1030) transitions.
Running 675 sub problems to find dead transitions.
[2024-06-01 23:53:52] [INFO ] Flow matrix only has 105 transitions (discarded 578 similar events)
// Phase 1: matrix 105 rows 205 cols
[2024-06-01 23:53:52] [INFO ] Computed 100 invariants in 4 ms
[2024-06-01 23:53:52] [INFO ] State equation strengthened by 97 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 675 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/197 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 675 unsolved
At refinement iteration 2 (OVERLAPS) 8/205 variables, 9/100 constraints. Problems are: Problem set: 0 solved, 675 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 0.0)
(s4 1.0)
(s5 0.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 0.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 0.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 0.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 0.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 0.0)
(s91 0.0)
(s92 1.0)
(s93 1.0)
(s94 0.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 1.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)timeout

org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 675 unsolved
SMT process timed out in 20230ms, After SMT, problems are : Problem set: 0 solved, 675 unsolved
Search for dead transitions found 0 dead transitions in 20243ms
Finished structural reductions in LTL mode , in 1 iterations and 20275 ms. Remains : 205/265 places, 683/1713 transitions.
[2024-06-01 23:54:13] [INFO ] Flatten gal took : 35 ms
[2024-06-01 23:54:13] [INFO ] Flatten gal took : 36 ms
[2024-06-01 23:54:13] [INFO ] Input system was already deterministic with 683 transitions.
Starting structural reductions in LTL mode, iteration 0 : 265/265 places, 1713/1713 transitions.
Discarding 61 places :
Symmetric choice reduction at 0 with 61 rule applications. Total rules 61 place count 204 transition count 1081
Iterating global reduction 0 with 61 rules applied. Total rules applied 122 place count 204 transition count 1081
Ensure Unique test removed 408 transitions
Reduce isomorphic transitions removed 408 transitions.
Iterating post reduction 0 with 408 rules applied. Total rules applied 530 place count 204 transition count 673
Applied a total of 530 rules in 24 ms. Remains 204 /265 variables (removed 61) and now considering 673/1713 (removed 1040) transitions.
Running 664 sub problems to find dead transitions.
[2024-06-01 23:54:13] [INFO ] Flow matrix only has 104 transitions (discarded 569 similar events)
// Phase 1: matrix 104 rows 204 cols
[2024-06-01 23:54:13] [INFO ] Computed 100 invariants in 2 ms
[2024-06-01 23:54:13] [INFO ] State equation strengthened by 95 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 664 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/196 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 664 unsolved
At refinement iteration 2 (OVERLAPS) 8/204 variables, 9/100 constraints. Problems are: Problem set: 0 solved, 664 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 0.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 0.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 664 unsolved
SMT process timed out in 20213ms, After SMT, problems are : Problem set: 0 solved, 664 unsolved
Search for dead transitions found 0 dead transitions in 20239ms
Finished structural reductions in LTL mode , in 1 iterations and 20266 ms. Remains : 204/265 places, 673/1713 transitions.
[2024-06-01 23:54:33] [INFO ] Flatten gal took : 32 ms
[2024-06-01 23:54:33] [INFO ] Flatten gal took : 35 ms
[2024-06-01 23:54:33] [INFO ] Input system was already deterministic with 673 transitions.
Starting structural reductions in LTL mode, iteration 0 : 265/265 places, 1713/1713 transitions.
Discarding 63 places :
Symmetric choice reduction at 0 with 63 rule applications. Total rules 63 place count 202 transition count 1066
Iterating global reduction 0 with 63 rules applied. Total rules applied 126 place count 202 transition count 1066
Ensure Unique test removed 413 transitions
Reduce isomorphic transitions removed 413 transitions.
Iterating post reduction 0 with 413 rules applied. Total rules applied 539 place count 202 transition count 653
Applied a total of 539 rules in 21 ms. Remains 202 /265 variables (removed 63) and now considering 653/1713 (removed 1060) transitions.
Running 645 sub problems to find dead transitions.
[2024-06-01 23:54:33] [INFO ] Flow matrix only has 102 transitions (discarded 551 similar events)
// Phase 1: matrix 102 rows 202 cols
[2024-06-01 23:54:33] [INFO ] Computed 100 invariants in 2 ms
[2024-06-01 23:54:33] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 645 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/194 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 645 unsolved
At refinement iteration 2 (OVERLAPS) 8/202 variables, 9/100 constraints. Problems are: Problem set: 0 solved, 645 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 645 unsolved
At refinement iteration 4 (OVERLAPS) 102/304 variables, 202/302 constraints. Problems are: Problem set: 0 solved, 645 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 94/396 constraints. Problems are: Problem set: 0 solved, 645 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 304/304 variables, and 396 constraints, problems are : Problem set: 0 solved, 645 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 202/202 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 645/645 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 645 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 645 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/194 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 645 unsolved
At refinement iteration 2 (OVERLAPS) 8/202 variables, 9/100 constraints. Problems are: Problem set: 0 solved, 645 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 645 unsolved
At refinement iteration 4 (OVERLAPS) 102/304 variables, 202/302 constraints. Problems are: Problem set: 0 solved, 645 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 94/396 constraints. Problems are: Problem set: 0 solved, 645 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 645/1041 constraints. Problems are: Problem set: 0 solved, 645 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 304/304 variables, and 1041 constraints, problems are : Problem set: 0 solved, 645 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 202/202 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 645/645 constraints, Known Traps: 0/0 constraints]
After SMT, in 40257ms problems are : Problem set: 0 solved, 645 unsolved
Search for dead transitions found 0 dead transitions in 40270ms
Finished structural reductions in LTL mode , in 1 iterations and 40295 ms. Remains : 202/265 places, 653/1713 transitions.
[2024-06-01 23:55:13] [INFO ] Flatten gal took : 30 ms
[2024-06-01 23:55:13] [INFO ] Flatten gal took : 34 ms
[2024-06-01 23:55:13] [INFO ] Input system was already deterministic with 653 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 265/265 places, 1713/1713 transitions.
Discarding 62 places :
Symmetric choice reduction at 0 with 62 rule applications. Total rules 62 place count 203 transition count 1069
Iterating global reduction 0 with 62 rules applied. Total rules applied 124 place count 203 transition count 1069
Ensure Unique test removed 412 transitions
Reduce isomorphic transitions removed 412 transitions.
Iterating post reduction 0 with 412 rules applied. Total rules applied 536 place count 203 transition count 657
Applied a total of 536 rules in 125 ms. Remains 203 /265 variables (removed 62) and now considering 657/1713 (removed 1056) transitions.
Running 649 sub problems to find dead transitions.
[2024-06-01 23:55:14] [INFO ] Flow matrix only has 103 transitions (discarded 554 similar events)
// Phase 1: matrix 103 rows 203 cols
[2024-06-01 23:55:14] [INFO ] Computed 100 invariants in 2 ms
[2024-06-01 23:55:14] [INFO ] State equation strengthened by 95 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 649 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/195 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 649 unsolved
At refinement iteration 2 (OVERLAPS) 8/203 variables, 9/100 constraints. Problems are: Problem set: 0 solved, 649 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 649 unsolved
At refinement iteration 4 (OVERLAPS) 103/306 variables, 203/303 constraints. Problems are: Problem set: 0 solved, 649 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 95/398 constraints. Problems are: Problem set: 0 solved, 649 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 306/306 variables, and 398 constraints, problems are : Problem set: 0 solved, 649 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 203/203 constraints, ReadFeed: 95/95 constraints, PredecessorRefiner: 649/649 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 649 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 649 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/195 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 649 unsolved
At refinement iteration 2 (OVERLAPS) 8/203 variables, 9/100 constraints. Problems are: Problem set: 0 solved, 649 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 649 unsolved
At refinement iteration 4 (OVERLAPS) 103/306 variables, 203/303 constraints. Problems are: Problem set: 0 solved, 649 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 95/398 constraints. Problems are: Problem set: 0 solved, 649 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 649/1047 constraints. Problems are: Problem set: 0 solved, 649 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 306/306 variables, and 1047 constraints, problems are : Problem set: 0 solved, 649 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 203/203 constraints, ReadFeed: 95/95 constraints, PredecessorRefiner: 649/649 constraints, Known Traps: 0/0 constraints]
After SMT, in 40249ms problems are : Problem set: 0 solved, 649 unsolved
Search for dead transitions found 0 dead transitions in 40262ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 40389 ms. Remains : 203/265 places, 657/1713 transitions.
[2024-06-01 23:55:54] [INFO ] Flatten gal took : 31 ms
[2024-06-01 23:55:54] [INFO ] Flatten gal took : 34 ms
[2024-06-01 23:55:54] [INFO ] Input system was already deterministic with 657 transitions.
Starting structural reductions in LTL mode, iteration 0 : 265/265 places, 1713/1713 transitions.
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 60 place count 205 transition count 1079
Iterating global reduction 0 with 60 rules applied. Total rules applied 120 place count 205 transition count 1079
Ensure Unique test removed 408 transitions
Reduce isomorphic transitions removed 408 transitions.
Iterating post reduction 0 with 408 rules applied. Total rules applied 528 place count 205 transition count 671
Applied a total of 528 rules in 18 ms. Remains 205 /265 variables (removed 60) and now considering 671/1713 (removed 1042) transitions.
Running 663 sub problems to find dead transitions.
[2024-06-01 23:55:54] [INFO ] Flow matrix only has 105 transitions (discarded 566 similar events)
// Phase 1: matrix 105 rows 205 cols
[2024-06-01 23:55:54] [INFO ] Computed 100 invariants in 2 ms
[2024-06-01 23:55:54] [INFO ] State equation strengthened by 97 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 663 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/197 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 663 unsolved
At refinement iteration 2 (OVERLAPS) 8/205 variables, 9/100 constraints. Problems are: Problem set: 0 solved, 663 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 663 unsolved
SMT process timed out in 20205ms, After SMT, problems are : Problem set: 0 solved, 663 unsolved
Search for dead transitions found 0 dead transitions in 20218ms
Finished structural reductions in LTL mode , in 1 iterations and 20240 ms. Remains : 205/265 places, 671/1713 transitions.
[2024-06-01 23:56:14] [INFO ] Flatten gal took : 30 ms
[2024-06-01 23:56:14] [INFO ] Flatten gal took : 34 ms
[2024-06-01 23:56:14] [INFO ] Input system was already deterministic with 671 transitions.
Starting structural reductions in LTL mode, iteration 0 : 265/265 places, 1713/1713 transitions.
Discarding 53 places :
Symmetric choice reduction at 0 with 53 rule applications. Total rules 53 place count 212 transition count 1171
Iterating global reduction 0 with 53 rules applied. Total rules applied 106 place count 212 transition count 1171
Ensure Unique test removed 379 transitions
Reduce isomorphic transitions removed 379 transitions.
Iterating post reduction 0 with 379 rules applied. Total rules applied 485 place count 212 transition count 792
Applied a total of 485 rules in 17 ms. Remains 212 /265 variables (removed 53) and now considering 792/1713 (removed 921) transitions.
Running 784 sub problems to find dead transitions.
[2024-06-01 23:56:14] [INFO ] Flow matrix only has 112 transitions (discarded 680 similar events)
// Phase 1: matrix 112 rows 212 cols
[2024-06-01 23:56:14] [INFO ] Computed 100 invariants in 2 ms
[2024-06-01 23:56:14] [INFO ] State equation strengthened by 104 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/204 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 2 (OVERLAPS) 8/212 variables, 9/100 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/212 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 784 unsolved
SMT process timed out in 20279ms, After SMT, problems are : Problem set: 0 solved, 784 unsolved
Search for dead transitions found 0 dead transitions in 20293ms
Finished structural reductions in LTL mode , in 1 iterations and 20313 ms. Remains : 212/265 places, 792/1713 transitions.
[2024-06-01 23:56:35] [INFO ] Flatten gal took : 36 ms
[2024-06-01 23:56:35] [INFO ] Flatten gal took : 39 ms
[2024-06-01 23:56:35] [INFO ] Input system was already deterministic with 792 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 265/265 places, 1713/1713 transitions.
Discarding 63 places :
Symmetric choice reduction at 0 with 63 rule applications. Total rules 63 place count 202 transition count 1056
Iterating global reduction 0 with 63 rules applied. Total rules applied 126 place count 202 transition count 1056
Ensure Unique test removed 411 transitions
Reduce isomorphic transitions removed 411 transitions.
Iterating post reduction 0 with 411 rules applied. Total rules applied 537 place count 202 transition count 645
Applied a total of 537 rules in 105 ms. Remains 202 /265 variables (removed 63) and now considering 645/1713 (removed 1068) transitions.
Running 637 sub problems to find dead transitions.
[2024-06-01 23:56:35] [INFO ] Flow matrix only has 102 transitions (discarded 543 similar events)
// Phase 1: matrix 102 rows 202 cols
[2024-06-01 23:56:35] [INFO ] Computed 100 invariants in 2 ms
[2024-06-01 23:56:35] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 637 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/194 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 637 unsolved
At refinement iteration 2 (OVERLAPS) 8/202 variables, 9/100 constraints. Problems are: Problem set: 0 solved, 637 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 637 unsolved
At refinement iteration 4 (OVERLAPS) 102/304 variables, 202/302 constraints. Problems are: Problem set: 0 solved, 637 unsolved
SMT process timed out in 20238ms, After SMT, problems are : Problem set: 0 solved, 637 unsolved
Search for dead transitions found 0 dead transitions in 20249ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 20358 ms. Remains : 202/265 places, 645/1713 transitions.
[2024-06-01 23:56:55] [INFO ] Flatten gal took : 30 ms
[2024-06-01 23:56:55] [INFO ] Flatten gal took : 32 ms
[2024-06-01 23:56:55] [INFO ] Input system was already deterministic with 645 transitions.
Starting structural reductions in LTL mode, iteration 0 : 265/265 places, 1713/1713 transitions.
Discarding 55 places :
Symmetric choice reduction at 0 with 55 rule applications. Total rules 55 place count 210 transition count 1157
Iterating global reduction 0 with 55 rules applied. Total rules applied 110 place count 210 transition count 1157
Ensure Unique test removed 386 transitions
Reduce isomorphic transitions removed 386 transitions.
Iterating post reduction 0 with 386 rules applied. Total rules applied 496 place count 210 transition count 771
Applied a total of 496 rules in 18 ms. Remains 210 /265 variables (removed 55) and now considering 771/1713 (removed 942) transitions.
Running 762 sub problems to find dead transitions.
[2024-06-01 23:56:55] [INFO ] Flow matrix only has 110 transitions (discarded 661 similar events)
// Phase 1: matrix 110 rows 210 cols
[2024-06-01 23:56:55] [INFO ] Computed 100 invariants in 1 ms
[2024-06-01 23:56:55] [INFO ] State equation strengthened by 101 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 762 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/202 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 762 unsolved
At refinement iteration 2 (OVERLAPS) 8/210 variables, 9/100 constraints. Problems are: Problem set: 0 solved, 762 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/210 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 762 unsolved
SMT process timed out in 20300ms, After SMT, problems are : Problem set: 0 solved, 762 unsolved
Search for dead transitions found 0 dead transitions in 20315ms
Finished structural reductions in LTL mode , in 1 iterations and 20336 ms. Remains : 210/265 places, 771/1713 transitions.
[2024-06-01 23:57:16] [INFO ] Flatten gal took : 35 ms
[2024-06-01 23:57:16] [INFO ] Flatten gal took : 38 ms
[2024-06-01 23:57:16] [INFO ] Input system was already deterministic with 771 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 265/265 places, 1713/1713 transitions.
Discarding 62 places :
Symmetric choice reduction at 0 with 62 rule applications. Total rules 62 place count 203 transition count 1076
Iterating global reduction 0 with 62 rules applied. Total rules applied 124 place count 203 transition count 1076
Ensure Unique test removed 408 transitions
Reduce isomorphic transitions removed 408 transitions.
Iterating post reduction 0 with 408 rules applied. Total rules applied 532 place count 203 transition count 668
Applied a total of 532 rules in 105 ms. Remains 203 /265 variables (removed 62) and now considering 668/1713 (removed 1045) transitions.
Running 660 sub problems to find dead transitions.
[2024-06-01 23:57:16] [INFO ] Flow matrix only has 103 transitions (discarded 565 similar events)
// Phase 1: matrix 103 rows 203 cols
[2024-06-01 23:57:16] [INFO ] Computed 100 invariants in 2 ms
[2024-06-01 23:57:16] [INFO ] State equation strengthened by 95 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/195 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 2 (OVERLAPS) 8/203 variables, 9/100 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 4 (OVERLAPS) 103/306 variables, 203/303 constraints. Problems are: Problem set: 0 solved, 660 unsolved
SMT process timed out in 20204ms, After SMT, problems are : Problem set: 0 solved, 660 unsolved
Search for dead transitions found 0 dead transitions in 20216ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 20325 ms. Remains : 203/265 places, 668/1713 transitions.
[2024-06-01 23:57:36] [INFO ] Flatten gal took : 32 ms
[2024-06-01 23:57:36] [INFO ] Flatten gal took : 38 ms
[2024-06-01 23:57:36] [INFO ] Input system was already deterministic with 668 transitions.
[2024-06-01 23:57:36] [INFO ] Flatten gal took : 97 ms
[2024-06-01 23:57:36] [INFO ] Flatten gal took : 89 ms
[2024-06-01 23:57:37] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 9 ms.
[2024-06-01 23:57:37] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 265 places, 1713 transitions and 11961 arcs took 27 ms.
Total runtime 417591 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : PhaseVariation-PT-D10CS010-CTLFireability-2024-00
Could not compute solution for formula : PhaseVariation-PT-D10CS010-CTLFireability-2024-01
Could not compute solution for formula : PhaseVariation-PT-D10CS010-CTLFireability-2024-02
Could not compute solution for formula : PhaseVariation-PT-D10CS010-CTLFireability-2024-03
Could not compute solution for formula : PhaseVariation-PT-D10CS010-CTLFireability-2024-04
Could not compute solution for formula : PhaseVariation-PT-D10CS010-CTLFireability-2024-05
Could not compute solution for formula : PhaseVariation-PT-D10CS010-CTLFireability-2024-06
Could not compute solution for formula : PhaseVariation-PT-D10CS010-CTLFireability-2024-07
Could not compute solution for formula : PhaseVariation-PT-D10CS010-CTLFireability-2024-08
Could not compute solution for formula : PhaseVariation-PT-D10CS010-CTLFireability-2024-10
Could not compute solution for formula : PhaseVariation-PT-D10CS010-CTLFireability-2024-11
Could not compute solution for formula : PhaseVariation-PT-D10CS010-CTLFireability-2023-12
Could not compute solution for formula : PhaseVariation-PT-D10CS010-CTLFireability-2023-14
Could not compute solution for formula : PhaseVariation-PT-D10CS010-CTLFireability-2023-15

BK_STOP 1717286257672

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
mcc2024
ctl formula name PhaseVariation-PT-D10CS010-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/607/ctl_0_
ctl formula name PhaseVariation-PT-D10CS010-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/607/ctl_1_
ctl formula name PhaseVariation-PT-D10CS010-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/607/ctl_2_
ctl formula name PhaseVariation-PT-D10CS010-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/607/ctl_3_
ctl formula name PhaseVariation-PT-D10CS010-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/607/ctl_4_
ctl formula name PhaseVariation-PT-D10CS010-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/607/ctl_5_
ctl formula name PhaseVariation-PT-D10CS010-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/607/ctl_6_
ctl formula name PhaseVariation-PT-D10CS010-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/607/ctl_7_
ctl formula name PhaseVariation-PT-D10CS010-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/607/ctl_8_
ctl formula name PhaseVariation-PT-D10CS010-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/607/ctl_9_
ctl formula name PhaseVariation-PT-D10CS010-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/607/ctl_10_
ctl formula name PhaseVariation-PT-D10CS010-CTLFireability-2023-12
ctl formula formula --ctl=/tmp/607/ctl_11_
ctl formula name PhaseVariation-PT-D10CS010-CTLFireability-2023-14
ctl formula formula --ctl=/tmp/607/ctl_12_
ctl formula name PhaseVariation-PT-D10CS010-CTLFireability-2023-15
ctl formula formula --ctl=/tmp/607/ctl_13_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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="PhaseVariation-PT-D10CS010"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="ltsminxred"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is PhaseVariation-PT-D10CS010, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r512-smll-171654407400330"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PhaseVariation-PT-D10CS010.tgz
mv PhaseVariation-PT-D10CS010 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;