Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r307-tajo-171654460900295.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.........................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is PolyORBNT-PT-S05J60, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r307-tajo-171654460900295
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.0M
-rw-r--r-- 1 mcc users 27K Apr 12 09:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 124K Apr 12 09:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 47K Apr 12 09:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 242K Apr 12 09:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 38K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 117K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 40K Apr 12 10:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 206K Apr 12 10:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 106K Apr 12 10:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 436K Apr 12 10:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 9.0K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 20K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.5M 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 PolyORBNT-PT-S05J60-ReachabilityFireability-2024-00
FORMULA_NAME PolyORBNT-PT-S05J60-ReachabilityFireability-2024-01
FORMULA_NAME PolyORBNT-PT-S05J60-ReachabilityFireability-2024-02
FORMULA_NAME PolyORBNT-PT-S05J60-ReachabilityFireability-2024-03
FORMULA_NAME PolyORBNT-PT-S05J60-ReachabilityFireability-2024-04
FORMULA_NAME PolyORBNT-PT-S05J60-ReachabilityFireability-2024-05
FORMULA_NAME PolyORBNT-PT-S05J60-ReachabilityFireability-2024-06
FORMULA_NAME PolyORBNT-PT-S05J60-ReachabilityFireability-2024-07
FORMULA_NAME PolyORBNT-PT-S05J60-ReachabilityFireability-2024-08
FORMULA_NAME PolyORBNT-PT-S05J60-ReachabilityFireability-2024-09
FORMULA_NAME PolyORBNT-PT-S05J60-ReachabilityFireability-2024-10
FORMULA_NAME PolyORBNT-PT-S05J60-ReachabilityFireability-2024-11
FORMULA_NAME PolyORBNT-PT-S05J60-ReachabilityFireability-2024-12
FORMULA_NAME PolyORBNT-PT-S05J60-ReachabilityFireability-2024-13
FORMULA_NAME PolyORBNT-PT-S05J60-ReachabilityFireability-2024-14
FORMULA_NAME PolyORBNT-PT-S05J60-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717132320179

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-PT-S05J60
Applying reductions before tool lola
Invoking reducer
Running Version 202304061127
[2024-05-31 05:12:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 05:12:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 05:12:01] [INFO ] Load time of PNML (sax parser for PT used): 131 ms
[2024-05-31 05:12:01] [INFO ] Transformed 909 places.
[2024-05-31 05:12:01] [INFO ] Transformed 1970 transitions.
[2024-05-31 05:12:01] [INFO ] Parsed PT model containing 909 places and 1970 transitions and 12584 arcs in 210 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 19 ms.
Working with output stream class java.io.PrintStream
[2024-05-31 05:12:01] [INFO ] Reduced 555 identical enabling conditions.
[2024-05-31 05:12:01] [INFO ] Reduced 555 identical enabling conditions.
[2024-05-31 05:12:01] [INFO ] Reduced 555 identical enabling conditions.
[2024-05-31 05:12:01] [INFO ] Reduced 90 identical enabling conditions.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
Incomplete random walk after 10000 steps, including 701 resets, run finished after 613 ms. (steps per millisecond=16 ) properties (out of 16) seen :2
FORMULA PolyORBNT-PT-S05J60-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-PT-S05J60-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 251 resets, run finished after 691 ms. (steps per millisecond=14 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 222 resets, run finished after 409 ms. (steps per millisecond=24 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 151 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 515 ms. (steps per millisecond=19 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 99 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 274 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 90 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 14) seen :1
FORMULA PolyORBNT-PT-S05J60-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 109 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 13) seen :1
FORMULA PolyORBNT-PT-S05J60-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
[2024-05-31 05:12:04] [INFO ] Flow matrix only has 1311 transitions (discarded 4 similar events)
// Phase 1: matrix 1311 rows 909 cols
[2024-05-31 05:12:05] [INFO ] Computed 142 invariants in 143 ms
[2024-05-31 05:12:08] [INFO ] [Real]Absence check using 111 positive place invariants in 30 ms returned sat
[2024-05-31 05:12:08] [INFO ] [Real]Absence check using 111 positive and 31 generalized place invariants in 96 ms returned sat
[2024-05-31 05:12:08] [INFO ] After 798ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:11
[2024-05-31 05:12:08] [INFO ] [Nat]Absence check using 111 positive place invariants in 31 ms returned sat
[2024-05-31 05:12:09] [INFO ] [Nat]Absence check using 111 positive and 31 generalized place invariants in 96 ms returned sat
[2024-05-31 05:12:11] [INFO ] After 1959ms SMT Verify possible using state equation in natural domain returned unsat :10 sat :2
[2024-05-31 05:12:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 05:12:11] [INFO ] After 760ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :10 sat :2
[2024-05-31 05:12:12] [INFO ] After 1659ms SMT Verify possible using trap constraints in natural domain returned unsat :10 sat :2
Attempting to minimize the solution found.
Minimization took 504 ms.
[2024-05-31 05:12:13] [INFO ] After 4561ms SMT Verify possible using all constraints in natural domain returned unsat :10 sat :2
FORMULA PolyORBNT-PT-S05J60-ReachabilityFireability-2024-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBNT-PT-S05J60-ReachabilityFireability-2024-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBNT-PT-S05J60-ReachabilityFireability-2024-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBNT-PT-S05J60-ReachabilityFireability-2024-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBNT-PT-S05J60-ReachabilityFireability-2024-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBNT-PT-S05J60-ReachabilityFireability-2024-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBNT-PT-S05J60-ReachabilityFireability-2024-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBNT-PT-S05J60-ReachabilityFireability-2024-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBNT-PT-S05J60-ReachabilityFireability-2024-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBNT-PT-S05J60-ReachabilityFireability-2024-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 12 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 10 ms.
Support contains 3 out of 909 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 909/909 places, 1315/1315 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 70 rules applied. Total rules applied 70 place count 904 transition count 1250
Reduce places removed 65 places and 0 transitions.
Iterating post reduction 1 with 65 rules applied. Total rules applied 135 place count 839 transition count 1250
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 135 place count 839 transition count 1185
Deduced a syphon composed of 65 places in 2 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 265 place count 774 transition count 1185
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 266 place count 773 transition count 1184
Iterating global reduction 2 with 1 rules applied. Total rules applied 267 place count 773 transition count 1184
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 271 place count 771 transition count 1182
Applied a total of 271 rules in 395 ms. Remains 771 /909 variables (removed 138) and now considering 1182/1315 (removed 133) transitions.
[2024-05-31 05:12:13] [INFO ] Flow matrix only has 1178 transitions (discarded 4 similar events)
// Phase 1: matrix 1178 rows 771 cols
[2024-05-31 05:12:13] [INFO ] Computed 137 invariants in 178 ms
[2024-05-31 05:12:15] [INFO ] Dead Transitions using invariants and state equation in 1415 ms found 95 transitions.
Found 95 dead transitions using SMT.
Drop transitions removed 95 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 95 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 771/909 places, 1087/1315 transitions.
Applied a total of 0 rules in 49 ms. Remains 771 /771 variables (removed 0) and now considering 1087/1087 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1862 ms. Remains : 771/909 places, 1087/1315 transitions.
Incomplete random walk after 10000 steps, including 519 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :1
FORMULA PolyORBNT-PT-S05J60-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 1 properties.
[2024-05-31 05:12:15] [INFO ] Flow matrix only has 1083 transitions (discarded 4 similar events)
// Phase 1: matrix 1083 rows 771 cols
[2024-05-31 05:12:15] [INFO ] Computed 137 invariants in 18 ms
[2024-05-31 05:12:15] [INFO ] [Real]Absence check using 112 positive place invariants in 370 ms returned sat
[2024-05-31 05:12:15] [INFO ] [Real]Absence check using 112 positive and 25 generalized place invariants in 40 ms returned sat
[2024-05-31 05:12:16] [INFO ] After 348ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-31 05:12:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 05:12:16] [INFO ] After 87ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 05:12:16] [INFO ] After 1012ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 05:12:16] [INFO ] [Nat]Absence check using 112 positive place invariants in 40 ms returned sat
[2024-05-31 05:12:16] [INFO ] [Nat]Absence check using 112 positive and 25 generalized place invariants in 74 ms returned sat
[2024-05-31 05:12:16] [INFO ] After 409ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 05:12:17] [INFO ] After 943ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-31 05:12:18] [INFO ] Deduced a trap composed of 255 places in 298 ms of which 1 ms to minimize.
[2024-05-31 05:12:18] [INFO ] Deduced a trap composed of 222 places in 357 ms of which 1 ms to minimize.
[2024-05-31 05:12:19] [INFO ] Deduced a trap composed of 255 places in 352 ms of which 2 ms to minimize.
[2024-05-31 05:12:20] [INFO ] Deduced a trap composed of 234 places in 375 ms of which 1 ms to minimize.
[2024-05-31 05:12:20] [INFO ] Deduced a trap composed of 274 places in 347 ms of which 1 ms to minimize.
[2024-05-31 05:12:21] [INFO ] Deduced a trap composed of 238 places in 342 ms of which 1 ms to minimize.
[2024-05-31 05:12:21] [INFO ] Deduced a trap composed of 240 places in 346 ms of which 2 ms to minimize.
[2024-05-31 05:12:21] [INFO ] Deduced a trap composed of 246 places in 342 ms of which 1 ms to minimize.
[2024-05-31 05:12:22] [INFO ] Deduced a trap composed of 250 places in 332 ms of which 1 ms to minimize.
[2024-05-31 05:12:22] [INFO ] Deduced a trap composed of 252 places in 335 ms of which 1 ms to minimize.
[2024-05-31 05:12:22] [INFO ] Deduced a trap composed of 240 places in 314 ms of which 2 ms to minimize.
[2024-05-31 05:12:24] [INFO ] Deduced a trap composed of 252 places in 350 ms of which 0 ms to minimize.
[2024-05-31 05:12:24] [INFO ] Deduced a trap composed of 249 places in 325 ms of which 1 ms to minimize.
[2024-05-31 05:12:24] [INFO ] Deduced a trap composed of 240 places in 298 ms of which 0 ms to minimize.
[2024-05-31 05:12:25] [INFO ] Deduced a trap composed of 264 places in 271 ms of which 1 ms to minimize.
[2024-05-31 05:12:25] [INFO ] Deduced a trap composed of 253 places in 285 ms of which 1 ms to minimize.
[2024-05-31 05:12:25] [INFO ] Deduced a trap composed of 250 places in 293 ms of which 1 ms to minimize.
[2024-05-31 05:12:26] [INFO ] Deduced a trap composed of 252 places in 281 ms of which 1 ms to minimize.
[2024-05-31 05:12:26] [INFO ] Deduced a trap composed of 232 places in 312 ms of which 0 ms to minimize.
[2024-05-31 05:12:27] [INFO ] Deduced a trap composed of 237 places in 357 ms of which 1 ms to minimize.
[2024-05-31 05:12:28] [INFO ] Deduced a trap composed of 231 places in 362 ms of which 1 ms to minimize.
[2024-05-31 05:12:28] [INFO ] Deduced a trap composed of 240 places in 359 ms of which 1 ms to minimize.
[2024-05-31 05:12:29] [INFO ] Deduced a trap composed of 228 places in 356 ms of which 1 ms to minimize.
[2024-05-31 05:12:29] [INFO ] Deduced a trap composed of 256 places in 350 ms of which 1 ms to minimize.
[2024-05-31 05:12:30] [INFO ] Deduced a trap composed of 228 places in 351 ms of which 1 ms to minimize.
[2024-05-31 05:12:31] [INFO ] Deduced a trap composed of 234 places in 349 ms of which 1 ms to minimize.
[2024-05-31 05:12:31] [INFO ] Deduced a trap composed of 246 places in 342 ms of which 1 ms to minimize.
[2024-05-31 05:12:31] [INFO ] Deduced a trap composed of 246 places in 318 ms of which 0 ms to minimize.
[2024-05-31 05:12:32] [INFO ] Deduced a trap composed of 238 places in 351 ms of which 1 ms to minimize.
[2024-05-31 05:12:32] [INFO ] Deduced a trap composed of 252 places in 353 ms of which 1 ms to minimize.
[2024-05-31 05:12:33] [INFO ] Deduced a trap composed of 253 places in 335 ms of which 1 ms to minimize.
[2024-05-31 05:12:33] [INFO ] Deduced a trap composed of 229 places in 326 ms of which 2 ms to minimize.
[2024-05-31 05:12:34] [INFO ] Deduced a trap composed of 238 places in 299 ms of which 1 ms to minimize.
[2024-05-31 05:12:34] [INFO ] Deduced a trap composed of 244 places in 304 ms of which 5 ms to minimize.
[2024-05-31 05:12:35] [INFO ] Deduced a trap composed of 231 places in 314 ms of which 1 ms to minimize.
[2024-05-31 05:12:35] [INFO ] Deduced a trap composed of 237 places in 307 ms of which 1 ms to minimize.
[2024-05-31 05:12:36] [INFO ] Deduced a trap composed of 252 places in 338 ms of which 1 ms to minimize.
[2024-05-31 05:12:37] [INFO ] Deduced a trap composed of 254 places in 340 ms of which 1 ms to minimize.
[2024-05-31 05:12:37] [INFO ] Deduced a trap composed of 273 places in 329 ms of which 2 ms to minimize.
[2024-05-31 05:12:37] [INFO ] Deduced a trap composed of 261 places in 334 ms of which 1 ms to minimize.
[2024-05-31 05:12:38] [INFO ] Deduced a trap composed of 260 places in 332 ms of which 1 ms to minimize.
[2024-05-31 05:12:38] [INFO ] Deduced a trap composed of 252 places in 294 ms of which 1 ms to minimize.
[2024-05-31 05:12:39] [INFO ] Deduced a trap composed of 254 places in 333 ms of which 1 ms to minimize.
[2024-05-31 05:12:39] [INFO ] Deduced a trap composed of 254 places in 302 ms of which 1 ms to minimize.
[2024-05-31 05:12:39] [INFO ] Deduced a trap composed of 248 places in 308 ms of which 1 ms to minimize.
[2024-05-31 05:12:40] [INFO ] Deduced a trap composed of 263 places in 313 ms of which 1 ms to minimize.
[2024-05-31 05:12:40] [INFO ] Deduced a trap composed of 237 places in 282 ms of which 0 ms to minimize.
[2024-05-31 05:12:41] [INFO ] Deduced a trap composed of 6 places in 553 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:944)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-31 05:12:41] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-31 05:12:41] [INFO ] After 25579ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 771 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 771/771 places, 1087/1087 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 771 transition count 1086
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 770 transition count 1086
Applied a total of 2 rules in 57 ms. Remains 770 /771 variables (removed 1) and now considering 1086/1087 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 770/771 places, 1086/1087 transitions.
Incomplete random walk after 10000 steps, including 499 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 166052 steps, run timeout after 3001 ms. (steps per millisecond=55 ) properties seen :{}
Probabilistic random walk after 166052 steps, saw 48736 distinct states, run finished after 3002 ms. (steps per millisecond=55 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-31 05:12:45] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
// Phase 1: matrix 1082 rows 770 cols
[2024-05-31 05:12:45] [INFO ] Computed 137 invariants in 37 ms
[2024-05-31 05:12:45] [INFO ] [Real]Absence check using 111 positive place invariants in 20 ms returned sat
[2024-05-31 05:12:45] [INFO ] [Real]Absence check using 111 positive and 26 generalized place invariants in 36 ms returned sat
[2024-05-31 05:12:45] [INFO ] After 179ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 05:12:45] [INFO ] [Nat]Absence check using 111 positive place invariants in 20 ms returned sat
[2024-05-31 05:12:45] [INFO ] [Nat]Absence check using 111 positive and 26 generalized place invariants in 46 ms returned sat
[2024-05-31 05:12:46] [INFO ] After 997ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 05:12:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 05:12:46] [INFO ] After 328ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-31 05:12:47] [INFO ] Deduced a trap composed of 236 places in 341 ms of which 1 ms to minimize.
[2024-05-31 05:12:47] [INFO ] Deduced a trap composed of 273 places in 301 ms of which 1 ms to minimize.
[2024-05-31 05:12:47] [INFO ] Deduced a trap composed of 249 places in 224 ms of which 0 ms to minimize.
[2024-05-31 05:12:48] [INFO ] Deduced a trap composed of 245 places in 217 ms of which 1 ms to minimize.
[2024-05-31 05:12:48] [INFO ] Deduced a trap composed of 256 places in 268 ms of which 0 ms to minimize.
[2024-05-31 05:12:48] [INFO ] Deduced a trap composed of 247 places in 244 ms of which 1 ms to minimize.
[2024-05-31 05:12:49] [INFO ] Deduced a trap composed of 253 places in 238 ms of which 8 ms to minimize.
[2024-05-31 05:12:49] [INFO ] Deduced a trap composed of 264 places in 231 ms of which 0 ms to minimize.
[2024-05-31 05:12:49] [INFO ] Deduced a trap composed of 261 places in 258 ms of which 1 ms to minimize.
[2024-05-31 05:12:49] [INFO ] Deduced a trap composed of 230 places in 242 ms of which 1 ms to minimize.
[2024-05-31 05:12:50] [INFO ] Deduced a trap composed of 275 places in 216 ms of which 0 ms to minimize.
[2024-05-31 05:12:50] [INFO ] Deduced a trap composed of 251 places in 285 ms of which 0 ms to minimize.
[2024-05-31 05:12:50] [INFO ] Deduced a trap composed of 271 places in 261 ms of which 0 ms to minimize.
[2024-05-31 05:12:51] [INFO ] Deduced a trap composed of 249 places in 271 ms of which 3 ms to minimize.
[2024-05-31 05:12:51] [INFO ] Deduced a trap composed of 243 places in 290 ms of which 1 ms to minimize.
[2024-05-31 05:12:51] [INFO ] Deduced a trap composed of 234 places in 291 ms of which 3 ms to minimize.
[2024-05-31 05:12:52] [INFO ] Deduced a trap composed of 233 places in 292 ms of which 1 ms to minimize.
[2024-05-31 05:12:52] [INFO ] Deduced a trap composed of 233 places in 326 ms of which 1 ms to minimize.
[2024-05-31 05:12:53] [INFO ] Deduced a trap composed of 242 places in 297 ms of which 15 ms to minimize.
[2024-05-31 05:12:53] [INFO ] Deduced a trap composed of 240 places in 302 ms of which 0 ms to minimize.
[2024-05-31 05:12:54] [INFO ] Deduced a trap composed of 250 places in 346 ms of which 2 ms to minimize.
[2024-05-31 05:12:55] [INFO ] Deduced a trap composed of 252 places in 355 ms of which 1 ms to minimize.
[2024-05-31 05:12:55] [INFO ] Deduced a trap composed of 238 places in 375 ms of which 0 ms to minimize.
[2024-05-31 05:12:56] [INFO ] Deduced a trap composed of 261 places in 397 ms of which 1 ms to minimize.
[2024-05-31 05:12:56] [INFO ] Deduced a trap composed of 265 places in 445 ms of which 1 ms to minimize.
[2024-05-31 05:12:57] [INFO ] Deduced a trap composed of 253 places in 431 ms of which 1 ms to minimize.
[2024-05-31 05:12:57] [INFO ] Deduced a trap composed of 254 places in 317 ms of which 1 ms to minimize.
[2024-05-31 05:12:57] [INFO ] Deduced a trap composed of 251 places in 381 ms of which 0 ms to minimize.
[2024-05-31 05:12:58] [INFO ] Deduced a trap composed of 253 places in 281 ms of which 1 ms to minimize.
[2024-05-31 05:12:59] [INFO ] Deduced a trap composed of 241 places in 370 ms of which 2 ms to minimize.
[2024-05-31 05:13:00] [INFO ] Deduced a trap composed of 237 places in 323 ms of which 2 ms to minimize.
[2024-05-31 05:13:00] [INFO ] Deduced a trap composed of 239 places in 348 ms of which 2 ms to minimize.
[2024-05-31 05:13:01] [INFO ] Deduced a trap composed of 253 places in 385 ms of which 1 ms to minimize.
[2024-05-31 05:13:01] [INFO ] Deduced a trap composed of 235 places in 344 ms of which 1 ms to minimize.
[2024-05-31 05:13:02] [INFO ] Deduced a trap composed of 250 places in 360 ms of which 1 ms to minimize.
[2024-05-31 05:13:03] [INFO ] Deduced a trap composed of 255 places in 347 ms of which 0 ms to minimize.
[2024-05-31 05:13:03] [INFO ] Deduced a trap composed of 240 places in 342 ms of which 1 ms to minimize.
[2024-05-31 05:13:04] [INFO ] Deduced a trap composed of 257 places in 339 ms of which 1 ms to minimize.
[2024-05-31 05:13:10] [INFO ] Trap strengthening (SAT) tested/added 38/38 trap constraints in 23479 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:772)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:944)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-31 05:13:10] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-31 05:13:10] [INFO ] After 25036ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 770 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1086/1086 transitions.
Applied a total of 0 rules in 76 ms. Remains 770 /770 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 770/770 places, 1086/1086 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1086/1086 transitions.
Applied a total of 0 rules in 56 ms. Remains 770 /770 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
[2024-05-31 05:13:10] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2024-05-31 05:13:10] [INFO ] Invariant cache hit.
[2024-05-31 05:13:11] [INFO ] Implicit Places using invariants in 1319 ms returned []
[2024-05-31 05:13:11] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2024-05-31 05:13:11] [INFO ] Invariant cache hit.
[2024-05-31 05:13:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 05:13:27] [INFO ] Implicit Places using invariants and state equation in 15693 ms returned []
Implicit Place search using SMT with State Equation took 17018 ms to find 0 implicit places.
[2024-05-31 05:13:27] [INFO ] Redundant transitions in 119 ms returned []
[2024-05-31 05:13:27] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2024-05-31 05:13:27] [INFO ] Invariant cache hit.
[2024-05-31 05:13:28] [INFO ] Dead Transitions using invariants and state equation in 1184 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18391 ms. Remains : 770/770 places, 1086/1086 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 770 transition count 1082
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 4 place count 770 transition count 1081
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 769 transition count 1081
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 769 transition count 1080
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 768 transition count 1080
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 13 place count 768 transition count 1075
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 18 place count 763 transition count 1075
Applied a total of 18 rules in 124 ms. Remains 763 /770 variables (removed 7) and now considering 1075/1086 (removed 11) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1075 rows 763 cols
[2024-05-31 05:13:28] [INFO ] Computed 137 invariants in 38 ms
[2024-05-31 05:13:29] [INFO ] [Real]Absence check using 112 positive place invariants in 25 ms returned sat
[2024-05-31 05:13:29] [INFO ] [Real]Absence check using 112 positive and 25 generalized place invariants in 37 ms returned sat
[2024-05-31 05:13:29] [INFO ] After 174ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 05:13:29] [INFO ] [Nat]Absence check using 112 positive place invariants in 19 ms returned sat
[2024-05-31 05:13:29] [INFO ] [Nat]Absence check using 112 positive and 25 generalized place invariants in 35 ms returned sat
[2024-05-31 05:13:29] [INFO ] After 300ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 05:13:29] [INFO ] Deduced a trap composed of 255 places in 315 ms of which 1 ms to minimize.
[2024-05-31 05:13:30] [INFO ] Deduced a trap composed of 228 places in 383 ms of which 0 ms to minimize.
[2024-05-31 05:13:30] [INFO ] Deduced a trap composed of 258 places in 339 ms of which 1 ms to minimize.
[2024-05-31 05:13:31] [INFO ] Deduced a trap composed of 240 places in 324 ms of which 1 ms to minimize.
[2024-05-31 05:13:31] [INFO ] Deduced a trap composed of 243 places in 316 ms of which 1 ms to minimize.
[2024-05-31 05:13:31] [INFO ] Deduced a trap composed of 231 places in 296 ms of which 1 ms to minimize.
[2024-05-31 05:13:32] [INFO ] Deduced a trap composed of 234 places in 347 ms of which 0 ms to minimize.
[2024-05-31 05:13:32] [INFO ] Deduced a trap composed of 255 places in 316 ms of which 0 ms to minimize.
[2024-05-31 05:13:33] [INFO ] Deduced a trap composed of 243 places in 318 ms of which 0 ms to minimize.
[2024-05-31 05:13:33] [INFO ] Deduced a trap composed of 228 places in 334 ms of which 1 ms to minimize.
[2024-05-31 05:13:33] [INFO ] Deduced a trap composed of 228 places in 352 ms of which 1 ms to minimize.
[2024-05-31 05:13:34] [INFO ] Deduced a trap composed of 258 places in 357 ms of which 1 ms to minimize.
[2024-05-31 05:13:34] [INFO ] Deduced a trap composed of 249 places in 338 ms of which 1 ms to minimize.
[2024-05-31 05:13:35] [INFO ] Deduced a trap composed of 261 places in 346 ms of which 1 ms to minimize.
[2024-05-31 05:13:35] [INFO ] Deduced a trap composed of 240 places in 362 ms of which 1 ms to minimize.
[2024-05-31 05:13:36] [INFO ] Deduced a trap composed of 240 places in 338 ms of which 1 ms to minimize.
[2024-05-31 05:13:37] [INFO ] Deduced a trap composed of 243 places in 349 ms of which 1 ms to minimize.
[2024-05-31 05:13:37] [INFO ] Deduced a trap composed of 240 places in 355 ms of which 1 ms to minimize.
[2024-05-31 05:13:38] [INFO ] Deduced a trap composed of 239 places in 335 ms of which 4 ms to minimize.
[2024-05-31 05:13:38] [INFO ] Deduced a trap composed of 246 places in 363 ms of which 1 ms to minimize.
[2024-05-31 05:13:38] [INFO ] Deduced a trap composed of 252 places in 364 ms of which 0 ms to minimize.
[2024-05-31 05:13:39] [INFO ] Deduced a trap composed of 240 places in 353 ms of which 0 ms to minimize.
[2024-05-31 05:13:40] [INFO ] Deduced a trap composed of 240 places in 356 ms of which 1 ms to minimize.
[2024-05-31 05:13:40] [INFO ] Deduced a trap composed of 243 places in 340 ms of which 1 ms to minimize.
[2024-05-31 05:13:41] [INFO ] Deduced a trap composed of 267 places in 348 ms of which 1 ms to minimize.
[2024-05-31 05:13:41] [INFO ] Deduced a trap composed of 228 places in 306 ms of which 1 ms to minimize.
[2024-05-31 05:13:41] [INFO ] Deduced a trap composed of 237 places in 323 ms of which 1 ms to minimize.
[2024-05-31 05:13:42] [INFO ] Deduced a trap composed of 270 places in 356 ms of which 0 ms to minimize.
[2024-05-31 05:13:43] [INFO ] Deduced a trap composed of 246 places in 357 ms of which 1 ms to minimize.
[2024-05-31 05:13:43] [INFO ] Deduced a trap composed of 246 places in 365 ms of which 1 ms to minimize.
[2024-05-31 05:13:44] [INFO ] Deduced a trap composed of 255 places in 371 ms of which 1 ms to minimize.
[2024-05-31 05:13:44] [INFO ] Deduced a trap composed of 240 places in 344 ms of which 1 ms to minimize.
[2024-05-31 05:13:45] [INFO ] Deduced a trap composed of 234 places in 335 ms of which 0 ms to minimize.
[2024-05-31 05:13:45] [INFO ] Deduced a trap composed of 237 places in 316 ms of which 1 ms to minimize.
[2024-05-31 05:13:47] [INFO ] Deduced a trap composed of 225 places in 351 ms of which 1 ms to minimize.
[2024-05-31 05:13:47] [INFO ] Deduced a trap composed of 246 places in 304 ms of which 1 ms to minimize.
[2024-05-31 05:13:48] [INFO ] Deduced a trap composed of 260 places in 336 ms of which 1 ms to minimize.
[2024-05-31 05:13:48] [INFO ] Deduced a trap composed of 248 places in 346 ms of which 1 ms to minimize.
[2024-05-31 05:13:48] [INFO ] Deduced a trap composed of 237 places in 337 ms of which 1 ms to minimize.
[2024-05-31 05:13:49] [INFO ] Deduced a trap composed of 240 places in 317 ms of which 1 ms to minimize.
[2024-05-31 05:13:49] [INFO ] Deduced a trap composed of 219 places in 327 ms of which 1 ms to minimize.
[2024-05-31 05:13:49] [INFO ] Deduced a trap composed of 225 places in 302 ms of which 1 ms to minimize.
[2024-05-31 05:13:50] [INFO ] Deduced a trap composed of 246 places in 342 ms of which 1 ms to minimize.
[2024-05-31 05:13:50] [INFO ] Deduced a trap composed of 222 places in 306 ms of which 1 ms to minimize.
[2024-05-31 05:13:51] [INFO ] Deduced a trap composed of 265 places in 378 ms of which 1 ms to minimize.
[2024-05-31 05:13:51] [INFO ] Deduced a trap composed of 231 places in 342 ms of which 0 ms to minimize.
[2024-05-31 05:13:52] [INFO ] Deduced a trap composed of 245 places in 344 ms of which 1 ms to minimize.
[2024-05-31 05:13:52] [INFO ] Deduced a trap composed of 242 places in 348 ms of which 1 ms to minimize.
[2024-05-31 05:13:53] [INFO ] Deduced a trap composed of 249 places in 347 ms of which 0 ms to minimize.
[2024-05-31 05:13:53] [INFO ] Deduced a trap composed of 267 places in 327 ms of which 0 ms to minimize.
[2024-05-31 05:13:53] [INFO ] Deduced a trap composed of 259 places in 319 ms of which 1 ms to minimize.
[2024-05-31 05:13:54] [INFO ] Deduced a trap composed of 234 places in 306 ms of which 1 ms to minimize.
[2024-05-31 05:13:55] [INFO ] Deduced a trap composed of 232 places in 336 ms of which 1 ms to minimize.
[2024-05-31 05:13:55] [INFO ] Deduced a trap composed of 273 places in 356 ms of which 1 ms to minimize.
[2024-05-31 05:13:56] [INFO ] Deduced a trap composed of 257 places in 367 ms of which 1 ms to minimize.
[2024-05-31 05:13:56] [INFO ] Deduced a trap composed of 256 places in 358 ms of which 3 ms to minimize.
[2024-05-31 05:13:57] [INFO ] Deduced a trap composed of 243 places in 348 ms of which 1 ms to minimize.
[2024-05-31 05:13:59] [INFO ] Deduced a trap composed of 258 places in 350 ms of which 1 ms to minimize.
[2024-05-31 05:13:59] [INFO ] Deduced a trap composed of 248 places in 327 ms of which 1 ms to minimize.
[2024-05-31 05:14:00] [INFO ] Deduced a trap composed of 239 places in 304 ms of which 1 ms to minimize.
[2024-05-31 05:14:00] [INFO ] Deduced a trap composed of 257 places in 337 ms of which 1 ms to minimize.
[2024-05-31 05:14:00] [INFO ] Deduced a trap composed of 280 places in 321 ms of which 1 ms to minimize.
[2024-05-31 05:14:01] [INFO ] Deduced a trap composed of 251 places in 309 ms of which 1 ms to minimize.
[2024-05-31 05:14:01] [INFO ] Deduced a trap composed of 225 places in 347 ms of which 2 ms to minimize.
[2024-05-31 05:14:02] [INFO ] Deduced a trap composed of 257 places in 314 ms of which 1 ms to minimize.
[2024-05-31 05:14:03] [INFO ] Deduced a trap composed of 264 places in 306 ms of which 1 ms to minimize.
[2024-05-31 05:14:03] [INFO ] Deduced a trap composed of 252 places in 313 ms of which 0 ms to minimize.
[2024-05-31 05:14:03] [INFO ] Deduced a trap composed of 252 places in 245 ms of which 0 ms to minimize.
[2024-05-31 05:14:04] [INFO ] Deduced a trap composed of 252 places in 318 ms of which 1 ms to minimize.
[2024-05-31 05:14:04] [INFO ] Deduced a trap composed of 232 places in 331 ms of which 0 ms to minimize.
[2024-05-31 05:14:05] [INFO ] Deduced a trap composed of 247 places in 386 ms of which 1 ms to minimize.
[2024-05-31 05:14:05] [INFO ] Deduced a trap composed of 240 places in 286 ms of which 0 ms to minimize.
[2024-05-31 05:14:06] [INFO ] Deduced a trap composed of 256 places in 307 ms of which 1 ms to minimize.
[2024-05-31 05:14:06] [INFO ] Deduced a trap composed of 234 places in 260 ms of which 1 ms to minimize.
[2024-05-31 05:14:06] [INFO ] Deduced a trap composed of 237 places in 276 ms of which 1 ms to minimize.
[2024-05-31 05:14:07] [INFO ] Deduced a trap composed of 242 places in 341 ms of which 1 ms to minimize.
[2024-05-31 05:14:08] [INFO ] Deduced a trap composed of 230 places in 324 ms of which 1 ms to minimize.
[2024-05-31 05:14:08] [INFO ] Deduced a trap composed of 260 places in 335 ms of which 0 ms to minimize.
[2024-05-31 05:14:09] [INFO ] Deduced a trap composed of 225 places in 347 ms of which 1 ms to minimize.
[2024-05-31 05:14:10] [INFO ] Deduced a trap composed of 261 places in 290 ms of which 1 ms to minimize.
[2024-05-31 05:14:10] [INFO ] Deduced a trap composed of 261 places in 249 ms of which 1 ms to minimize.
[2024-05-31 05:14:11] [INFO ] Deduced a trap composed of 246 places in 263 ms of which 1 ms to minimize.
[2024-05-31 05:14:11] [INFO ] Deduced a trap composed of 246 places in 264 ms of which 2 ms to minimize.
[2024-05-31 05:14:12] [INFO ] Deduced a trap composed of 255 places in 252 ms of which 1 ms to minimize.
[2024-05-31 05:14:12] [INFO ] Deduced a trap composed of 246 places in 273 ms of which 1 ms to minimize.
[2024-05-31 05:14:13] [INFO ] Deduced a trap composed of 258 places in 322 ms of which 1 ms to minimize.
[2024-05-31 05:14:13] [INFO ] Deduced a trap composed of 231 places in 246 ms of which 1 ms to minimize.
[2024-05-31 05:14:14] [INFO ] Deduced a trap composed of 222 places in 395 ms of which 0 ms to minimize.
[2024-05-31 05:14:14] [INFO ] Deduced a trap composed of 234 places in 327 ms of which 1 ms to minimize.
[2024-05-31 05:14:15] [INFO ] Deduced a trap composed of 231 places in 338 ms of which 0 ms to minimize.
[2024-05-31 05:14:15] [INFO ] Deduced a trap composed of 249 places in 271 ms of which 1 ms to minimize.
[2024-05-31 05:14:16] [INFO ] Deduced a trap composed of 237 places in 333 ms of which 1 ms to minimize.
[2024-05-31 05:14:18] [INFO ] Deduced a trap composed of 234 places in 325 ms of which 1 ms to minimize.
[2024-05-31 05:14:27] [INFO ] Trap strengthening (SAT) tested/added 93/93 trap constraints in 57590 ms
[2024-05-31 05:14:27] [INFO ] After 57999ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2024-05-31 05:14:27] [INFO ] After 58168ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
[2024-05-31 05:14:27] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 5 ms.
[2024-05-31 05:14:27] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 770 places, 1086 transitions and 5509 arcs took 16 ms.
[2024-05-31 05:14:27] [INFO ] Flatten gal took : 188 ms
Total runtime 146129 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT PolyORBNT-PT-S05J60
BK_EXAMINATION: ReachabilityFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/373
ReachabilityFireability

FORMULA PolyORBNT-PT-S05J60-ReachabilityFireability-2024-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1717132468182

--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/373/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/373/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/373/ReachabilityFireability.xml
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 4 (type SKEL/FNDP) for 0 PolyORBNT-PT-S05J60-ReachabilityFireability-2024-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 5 (type SKEL/EQUN) for 0 PolyORBNT-PT-S05J60-ReachabilityFireability-2024-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 7 (type SKEL/SRCH) for 0 PolyORBNT-PT-S05J60-ReachabilityFireability-2024-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 8 (type SKEL/SRCH) for 0 PolyORBNT-PT-S05J60-ReachabilityFireability-2024-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 8 (type SKEL/SRCH) for PolyORBNT-PT-S05J60-ReachabilityFireability-2024-04
lola: result : false
lola: markings : 1421
lola: fired transitions : 2259
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 4 (type FNDP) for PolyORBNT-PT-S05J60-ReachabilityFireability-2024-04 (obsolete)
lola: CANCELED task # 5 (type EQUN) for PolyORBNT-PT-S05J60-ReachabilityFireability-2024-04 (obsolete)
lola: CANCELED task # 7 (type SRCH) for PolyORBNT-PT-S05J60-ReachabilityFireability-2024-04 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PolyORBNT-PT-S05J60-ReachabilityFireability-2024-04: EF false skeleton: tandem / relaxed


Time elapsed: 0 secs. Pages in use: 1

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="PolyORBNT-PT-S05J60"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="gold2023"
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 gold2023"
echo " Input is PolyORBNT-PT-S05J60, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r307-tajo-171654460900295"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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