Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r297-tall-167873950900778.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is PolyORBNT-PT-S10J60, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r297-tall-167873950900778
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 19M
-rw-r--r-- 1 mcc users 64K Feb 26 00:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 276K Feb 26 00:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 518K Feb 26 00:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 2.0M Feb 26 00:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 14K Feb 25 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 50K Feb 25 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 36K Feb 25 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 120K Feb 25 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 53K Feb 26 01:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 254K Feb 26 01:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 300K Feb 26 01:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 981K Feb 26 01:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 14M Mar 5 18:23 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-S10J60-CTLFireability-00
FORMULA_NAME PolyORBNT-PT-S10J60-CTLFireability-01
FORMULA_NAME PolyORBNT-PT-S10J60-CTLFireability-02
FORMULA_NAME PolyORBNT-PT-S10J60-CTLFireability-03
FORMULA_NAME PolyORBNT-PT-S10J60-CTLFireability-04
FORMULA_NAME PolyORBNT-PT-S10J60-CTLFireability-05
FORMULA_NAME PolyORBNT-PT-S10J60-CTLFireability-06
FORMULA_NAME PolyORBNT-PT-S10J60-CTLFireability-07
FORMULA_NAME PolyORBNT-PT-S10J60-CTLFireability-08
FORMULA_NAME PolyORBNT-PT-S10J60-CTLFireability-09
FORMULA_NAME PolyORBNT-PT-S10J60-CTLFireability-10
FORMULA_NAME PolyORBNT-PT-S10J60-CTLFireability-11
FORMULA_NAME PolyORBNT-PT-S10J60-CTLFireability-12
FORMULA_NAME PolyORBNT-PT-S10J60-CTLFireability-13
FORMULA_NAME PolyORBNT-PT-S10J60-CTLFireability-14
FORMULA_NAME PolyORBNT-PT-S10J60-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679646421565

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=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-PT-S10J60
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-24 08:27:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-24 08:27:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-24 08:27:04] [INFO ] Load time of PNML (sax parser for PT used): 638 ms
[2023-03-24 08:27:04] [INFO ] Transformed 1234 places.
[2023-03-24 08:27:04] [INFO ] Transformed 12920 transitions.
[2023-03-24 08:27:04] [INFO ] Parsed PT model containing 1234 places and 12920 transitions and 116879 arcs in 805 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 88 ms.
[2023-03-24 08:27:04] [INFO ] Reduced 45 identical enabling conditions.
[2023-03-24 08:27:04] [INFO ] Reduced 9285 identical enabling conditions.
[2023-03-24 08:27:04] [INFO ] Reduced 45 identical enabling conditions.
[2023-03-24 08:27:04] [INFO ] Reduced 9285 identical enabling conditions.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
Support contains 1230 out of 1234 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1234/1234 places, 2810/2810 transitions.
Applied a total of 0 rules in 69 ms. Remains 1234 /1234 variables (removed 0) and now considering 2810/2810 (removed 0) transitions.
[2023-03-24 08:27:04] [INFO ] Flow matrix only has 2801 transitions (discarded 9 similar events)
// Phase 1: matrix 2801 rows 1234 cols
[2023-03-24 08:27:04] [INFO ] Computed 152 place invariants in 200 ms
[2023-03-24 08:27:09] [INFO ] Dead Transitions using invariants and state equation in 4588 ms found 615 transitions.
Found 615 dead transitions using SMT.
Drop transitions removed 615 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 615 transitions.
[2023-03-24 08:27:09] [INFO ] Flow matrix only has 2186 transitions (discarded 9 similar events)
// Phase 1: matrix 2186 rows 1234 cols
[2023-03-24 08:27:09] [INFO ] Computed 152 place invariants in 89 ms
[2023-03-24 08:27:09] [INFO ] Implicit Places using invariants in 350 ms returned []
[2023-03-24 08:27:09] [INFO ] Flow matrix only has 2186 transitions (discarded 9 similar events)
[2023-03-24 08:27:09] [INFO ] Invariant cache hit.
[2023-03-24 08:27:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 08:27:11] [INFO ] Implicit Places using invariants and state equation in 1593 ms returned []
Implicit Place search using SMT with State Equation took 1952 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1234/1234 places, 2195/2810 transitions.
Applied a total of 0 rules in 18 ms. Remains 1234 /1234 variables (removed 0) and now considering 2195/2195 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6661 ms. Remains : 1234/1234 places, 2195/2810 transitions.
Support contains 1230 out of 1234 places after structural reductions.
[2023-03-24 08:27:11] [INFO ] Flatten gal took : 329 ms
[2023-03-24 08:27:12] [INFO ] Flatten gal took : 204 ms
[2023-03-24 08:27:13] [INFO ] Input system was already deterministic with 2195 transitions.
Incomplete random walk after 10000 steps, including 561 resets, run finished after 1327 ms. (steps per millisecond=7 ) properties (out of 63) seen :6
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 57) seen :11
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 162 ms. (steps per millisecond=6 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 46) seen :2
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 140 ms. (steps per millisecond=7 ) properties (out of 44) seen :1
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 109 ms. (steps per millisecond=9 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 43) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 42) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 41) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 40) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 39) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 38) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 37) seen :1
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 36) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 35) seen :1
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 34) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 33) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 32) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 31) seen :1
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 30) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 29) seen :0
Running SMT prover for 29 properties.
[2023-03-24 08:27:15] [INFO ] Flow matrix only has 2186 transitions (discarded 9 similar events)
[2023-03-24 08:27:15] [INFO ] Invariant cache hit.
[2023-03-24 08:27:20] [INFO ] [Real]Absence check using 121 positive place invariants in 62 ms returned sat
[2023-03-24 08:27:20] [INFO ] [Real]Absence check using 121 positive and 31 generalized place invariants in 72 ms returned sat
[2023-03-24 08:27:21] [INFO ] After 1212ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:27
[2023-03-24 08:27:21] [INFO ] [Nat]Absence check using 121 positive place invariants in 39 ms returned sat
[2023-03-24 08:27:22] [INFO ] [Nat]Absence check using 121 positive and 31 generalized place invariants in 55 ms returned sat
[2023-03-24 08:27:40] [INFO ] After 18345ms SMT Verify possible using state equation in natural domain returned unsat :20 sat :8
[2023-03-24 08:27:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 08:27:43] [INFO ] After 2567ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :20 sat :8
[2023-03-24 08:27:45] [INFO ] Deduced a trap composed of 577 places in 744 ms of which 8 ms to minimize.
[2023-03-24 08:27:47] [INFO ] Deduced a trap composed of 575 places in 1376 ms of which 34 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:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:626)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
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)
[2023-03-24 08:27:47] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-24 08:27:47] [INFO ] After 26017ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0 real:27
Fused 29 Parikh solutions to 9 different solutions.
Parikh walk visited 0 properties in 56 ms.
Support contains 197 out of 1234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1234/1234 places, 2195/2195 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 73 rules applied. Total rules applied 73 place count 1224 transition count 2132
Reduce places removed 63 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 64 rules applied. Total rules applied 137 place count 1161 transition count 2131
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 138 place count 1160 transition count 2131
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 64 Pre rules applied. Total rules applied 138 place count 1160 transition count 2067
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 266 place count 1096 transition count 2067
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 267 place count 1095 transition count 2066
Iterating global reduction 3 with 1 rules applied. Total rules applied 268 place count 1095 transition count 2066
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 3 with 4 rules applied. Total rules applied 272 place count 1093 transition count 2064
Applied a total of 272 rules in 479 ms. Remains 1093 /1234 variables (removed 141) and now considering 2064/2195 (removed 131) transitions.
[2023-03-24 08:27:47] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
// Phase 1: matrix 2055 rows 1093 cols
[2023-03-24 08:27:47] [INFO ] Computed 142 place invariants in 42 ms
[2023-03-24 08:27:49] [INFO ] Dead Transitions using invariants and state equation in 2050 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2532 ms. Remains : 1093/1234 places, 2064/2195 transitions.
Incomplete random walk after 10000 steps, including 710 resets, run finished after 220 ms. (steps per millisecond=45 ) properties (out of 9) seen :7
Incomplete Best-First random walk after 10001 steps, including 81 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 78 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2023-03-24 08:27:49] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
[2023-03-24 08:27:49] [INFO ] Invariant cache hit.
[2023-03-24 08:27:50] [INFO ] [Real]Absence check using 121 positive place invariants in 30 ms returned sat
[2023-03-24 08:27:50] [INFO ] [Real]Absence check using 121 positive and 21 generalized place invariants in 63 ms returned sat
[2023-03-24 08:27:50] [INFO ] After 275ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 08:27:50] [INFO ] [Nat]Absence check using 121 positive place invariants in 28 ms returned sat
[2023-03-24 08:27:50] [INFO ] [Nat]Absence check using 121 positive and 21 generalized place invariants in 54 ms returned sat
[2023-03-24 08:27:54] [INFO ] After 3986ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-24 08:27:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 08:27:55] [INFO ] After 567ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-24 08:27:55] [INFO ] Deduced a trap composed of 444 places in 635 ms of which 1 ms to minimize.
[2023-03-24 08:27:56] [INFO ] Deduced a trap composed of 462 places in 625 ms of which 1 ms to minimize.
[2023-03-24 08:27:57] [INFO ] Deduced a trap composed of 479 places in 602 ms of which 1 ms to minimize.
[2023-03-24 08:27:57] [INFO ] Deduced a trap composed of 459 places in 696 ms of which 1 ms to minimize.
[2023-03-24 08:27:58] [INFO ] Deduced a trap composed of 461 places in 661 ms of which 1 ms to minimize.
[2023-03-24 08:27:59] [INFO ] Deduced a trap composed of 457 places in 658 ms of which 1 ms to minimize.
[2023-03-24 08:28:00] [INFO ] Deduced a trap composed of 453 places in 650 ms of which 1 ms to minimize.
[2023-03-24 08:28:00] [INFO ] Deduced a trap composed of 448 places in 601 ms of which 1 ms to minimize.
[2023-03-24 08:28:01] [INFO ] Deduced a trap composed of 464 places in 626 ms of which 1 ms to minimize.
[2023-03-24 08:28:02] [INFO ] Deduced a trap composed of 454 places in 665 ms of which 1 ms to minimize.
[2023-03-24 08:28:03] [INFO ] Deduced a trap composed of 475 places in 674 ms of which 1 ms to minimize.
[2023-03-24 08:28:04] [INFO ] Deduced a trap composed of 457 places in 660 ms of which 4 ms to minimize.
[2023-03-24 08:28:04] [INFO ] Deduced a trap composed of 464 places in 687 ms of which 1 ms to minimize.
[2023-03-24 08:28:06] [INFO ] Deduced a trap composed of 460 places in 696 ms of which 1 ms to minimize.
[2023-03-24 08:28:06] [INFO ] Deduced a trap composed of 436 places in 710 ms of which 1 ms to minimize.
[2023-03-24 08:28:07] [INFO ] Deduced a trap composed of 432 places in 635 ms of which 1 ms to minimize.
[2023-03-24 08:28:09] [INFO ] Deduced a trap composed of 447 places in 682 ms of which 1 ms to minimize.
[2023-03-24 08:28:10] [INFO ] Deduced a trap composed of 447 places in 682 ms of which 1 ms to minimize.
[2023-03-24 08:28:10] [INFO ] Deduced a trap composed of 442 places in 613 ms of which 1 ms to minimize.
[2023-03-24 08:28:11] [INFO ] Deduced a trap composed of 448 places in 666 ms of which 1 ms to minimize.
[2023-03-24 08:28:12] [INFO ] Deduced a trap composed of 440 places in 666 ms of which 1 ms to minimize.
[2023-03-24 08:28:13] [INFO ] Deduced a trap composed of 448 places in 700 ms of which 1 ms to minimize.
[2023-03-24 08:28:13] [INFO ] Deduced a trap composed of 458 places in 657 ms of which 2 ms to minimize.
[2023-03-24 08:28:14] [INFO ] Deduced a trap composed of 448 places in 670 ms of which 2 ms to minimize.
[2023-03-24 08:28:15] [INFO ] Deduced a trap composed of 438 places in 598 ms of which 2 ms to minimize.
[2023-03-24 08:28:15] [INFO ] Deduced a trap composed of 438 places in 603 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:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:626)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
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)
[2023-03-24 08:28:15] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-24 08:28:15] [INFO ] After 25630ms 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 1093 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1093/1093 places, 2064/2064 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 1093 transition count 2061
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 1090 transition count 2061
Applied a total of 6 rules in 94 ms. Remains 1090 /1093 variables (removed 3) and now considering 2061/2064 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 95 ms. Remains : 1090/1093 places, 2061/2064 transitions.
Incomplete random walk after 10000 steps, including 738 resets, run finished after 153 ms. (steps per millisecond=65 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 62 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 108789 steps, run timeout after 3001 ms. (steps per millisecond=36 ) properties seen :{}
Probabilistic random walk after 108789 steps, saw 19534 distinct states, run finished after 3002 ms. (steps per millisecond=36 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-24 08:28:19] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
// Phase 1: matrix 2052 rows 1090 cols
[2023-03-24 08:28:19] [INFO ] Computed 142 place invariants in 48 ms
[2023-03-24 08:28:19] [INFO ] [Real]Absence check using 121 positive place invariants in 39 ms returned sat
[2023-03-24 08:28:19] [INFO ] [Real]Absence check using 121 positive and 21 generalized place invariants in 55 ms returned sat
[2023-03-24 08:28:19] [INFO ] After 268ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 08:28:19] [INFO ] [Nat]Absence check using 121 positive place invariants in 28 ms returned sat
[2023-03-24 08:28:19] [INFO ] [Nat]Absence check using 121 positive and 21 generalized place invariants in 50 ms returned sat
[2023-03-24 08:28:20] [INFO ] After 669ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-24 08:28:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 08:28:22] [INFO ] After 1942ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-24 08:28:23] [INFO ] Deduced a trap composed of 445 places in 636 ms of which 1 ms to minimize.
[2023-03-24 08:28:23] [INFO ] Deduced a trap composed of 482 places in 624 ms of which 1 ms to minimize.
[2023-03-24 08:28:24] [INFO ] Deduced a trap composed of 454 places in 637 ms of which 1 ms to minimize.
[2023-03-24 08:28:25] [INFO ] Deduced a trap composed of 450 places in 615 ms of which 1 ms to minimize.
[2023-03-24 08:28:26] [INFO ] Deduced a trap composed of 463 places in 628 ms of which 1 ms to minimize.
[2023-03-24 08:28:26] [INFO ] Deduced a trap composed of 452 places in 628 ms of which 1 ms to minimize.
[2023-03-24 08:28:27] [INFO ] Deduced a trap composed of 462 places in 665 ms of which 3 ms to minimize.
[2023-03-24 08:28:28] [INFO ] Deduced a trap composed of 455 places in 630 ms of which 1 ms to minimize.
[2023-03-24 08:28:28] [INFO ] Deduced a trap composed of 450 places in 634 ms of which 1 ms to minimize.
[2023-03-24 08:28:29] [INFO ] Deduced a trap composed of 460 places in 638 ms of which 1 ms to minimize.
[2023-03-24 08:28:30] [INFO ] Deduced a trap composed of 467 places in 632 ms of which 2 ms to minimize.
[2023-03-24 08:28:31] [INFO ] Deduced a trap composed of 455 places in 629 ms of which 2 ms to minimize.
[2023-03-24 08:28:32] [INFO ] Deduced a trap composed of 435 places in 608 ms of which 1 ms to minimize.
[2023-03-24 08:28:33] [INFO ] Deduced a trap composed of 488 places in 646 ms of which 1 ms to minimize.
[2023-03-24 08:28:33] [INFO ] Deduced a trap composed of 464 places in 624 ms of which 1 ms to minimize.
[2023-03-24 08:28:34] [INFO ] Deduced a trap composed of 463 places in 681 ms of which 2 ms to minimize.
[2023-03-24 08:28:35] [INFO ] Deduced a trap composed of 449 places in 665 ms of which 1 ms to minimize.
[2023-03-24 08:28:36] [INFO ] Deduced a trap composed of 456 places in 679 ms of which 1 ms to minimize.
[2023-03-24 08:28:36] [INFO ] Deduced a trap composed of 459 places in 690 ms of which 1 ms to minimize.
[2023-03-24 08:28:37] [INFO ] Deduced a trap composed of 462 places in 686 ms of which 1 ms to minimize.
[2023-03-24 08:28:38] [INFO ] Deduced a trap composed of 457 places in 692 ms of which 1 ms to minimize.
[2023-03-24 08:28:39] [INFO ] Deduced a trap composed of 438 places in 652 ms of which 1 ms to minimize.
[2023-03-24 08:28:40] [INFO ] Deduced a trap composed of 451 places in 692 ms of which 1 ms to minimize.
[2023-03-24 08:28:41] [INFO ] Deduced a trap composed of 440 places in 646 ms of which 1 ms to minimize.
[2023-03-24 08:28:42] [INFO ] Deduced a trap composed of 458 places in 640 ms of which 3 ms to minimize.
[2023-03-24 08:28:42] [INFO ] Deduced a trap composed of 458 places in 636 ms of which 1 ms to minimize.
[2023-03-24 08:28:43] [INFO ] Deduced a trap composed of 466 places in 615 ms of which 1 ms to minimize.
[2023-03-24 08:28:44] [INFO ] Deduced a trap composed of 453 places in 627 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:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:626)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
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)
[2023-03-24 08:28:44] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-24 08:28:44] [INFO ] After 25074ms 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 1090 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 2061/2061 transitions.
Applied a total of 0 rules in 97 ms. Remains 1090 /1090 variables (removed 0) and now considering 2061/2061 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106 ms. Remains : 1090/1090 places, 2061/2061 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 2061/2061 transitions.
Applied a total of 0 rules in 148 ms. Remains 1090 /1090 variables (removed 0) and now considering 2061/2061 (removed 0) transitions.
[2023-03-24 08:28:44] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
[2023-03-24 08:28:44] [INFO ] Invariant cache hit.
[2023-03-24 08:28:47] [INFO ] Implicit Places using invariants in 2323 ms returned []
[2023-03-24 08:28:47] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
[2023-03-24 08:28:47] [INFO ] Invariant cache hit.
[2023-03-24 08:28:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 08:29:18] [INFO ] Performed 1057/1090 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-24 08:29:19] [INFO ] Implicit Places using invariants and state equation in 32001 ms returned []
Implicit Place search using SMT with State Equation took 34327 ms to find 0 implicit places.
[2023-03-24 08:29:19] [INFO ] Redundant transitions in 138 ms returned []
[2023-03-24 08:29:19] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
[2023-03-24 08:29:19] [INFO ] Invariant cache hit.
[2023-03-24 08:29:21] [INFO ] Dead Transitions using invariants and state equation in 1905 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36529 ms. Remains : 1090/1090 places, 2061/2061 transitions.
Successfully simplified 20 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA PolyORBNT-PT-S10J60-CTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J60-CTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J60-CTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-24 08:29:21] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2023-03-24 08:29:21] [INFO ] Flatten gal took : 125 ms
FORMULA PolyORBNT-PT-S10J60-CTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J60-CTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J60-CTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-24 08:29:21] [INFO ] Flatten gal took : 135 ms
[2023-03-24 08:29:21] [INFO ] Input system was already deterministic with 2195 transitions.
Support contains 359 out of 1234 places (down from 360) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 1234/1234 places, 2195/2195 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 66 place count 1224 transition count 2129
Reduce places removed 66 places and 0 transitions.
Iterating post reduction 1 with 66 rules applied. Total rules applied 132 place count 1158 transition count 2129
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 132 place count 1158 transition count 2064
Deduced a syphon composed of 65 places in 0 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 262 place count 1093 transition count 2064
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 263 place count 1092 transition count 2063
Iterating global reduction 2 with 1 rules applied. Total rules applied 264 place count 1092 transition count 2063
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 268 place count 1090 transition count 2061
Applied a total of 268 rules in 252 ms. Remains 1090 /1234 variables (removed 144) and now considering 2061/2195 (removed 134) transitions.
[2023-03-24 08:29:22] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
// Phase 1: matrix 2052 rows 1090 cols
[2023-03-24 08:29:22] [INFO ] Computed 142 place invariants in 67 ms
[2023-03-24 08:29:24] [INFO ] Dead Transitions using invariants and state equation in 1850 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2104 ms. Remains : 1090/1234 places, 2061/2195 transitions.
[2023-03-24 08:29:24] [INFO ] Flatten gal took : 136 ms
[2023-03-24 08:29:24] [INFO ] Flatten gal took : 115 ms
[2023-03-24 08:29:24] [INFO ] Input system was already deterministic with 2061 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1234/1234 places, 2195/2195 transitions.
Applied a total of 0 rules in 37 ms. Remains 1234 /1234 variables (removed 0) and now considering 2195/2195 (removed 0) transitions.
[2023-03-24 08:29:24] [INFO ] Flow matrix only has 2186 transitions (discarded 9 similar events)
// Phase 1: matrix 2186 rows 1234 cols
[2023-03-24 08:29:24] [INFO ] Computed 152 place invariants in 65 ms
[2023-03-24 08:29:28] [INFO ] Dead Transitions using invariants and state equation in 3435 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3489 ms. Remains : 1234/1234 places, 2195/2195 transitions.
[2023-03-24 08:29:28] [INFO ] Flatten gal took : 101 ms
[2023-03-24 08:29:28] [INFO ] Flatten gal took : 93 ms
[2023-03-24 08:29:28] [INFO ] Input system was already deterministic with 2195 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1234/1234 places, 2195/2195 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1233 transition count 2194
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1233 transition count 2194
Applied a total of 2 rules in 126 ms. Remains 1233 /1234 variables (removed 1) and now considering 2194/2195 (removed 1) transitions.
[2023-03-24 08:29:28] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
// Phase 1: matrix 2185 rows 1233 cols
[2023-03-24 08:29:28] [INFO ] Computed 152 place invariants in 37 ms
[2023-03-24 08:29:32] [INFO ] Dead Transitions using invariants and state equation in 3474 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3609 ms. Remains : 1233/1234 places, 2194/2195 transitions.
[2023-03-24 08:29:32] [INFO ] Flatten gal took : 88 ms
[2023-03-24 08:29:32] [INFO ] Flatten gal took : 111 ms
[2023-03-24 08:29:32] [INFO ] Input system was already deterministic with 2194 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1234/1234 places, 2195/2195 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 1224 transition count 2195
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 1223 transition count 2194
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 1223 transition count 2194
Applied a total of 12 rules in 75 ms. Remains 1223 /1234 variables (removed 11) and now considering 2194/2195 (removed 1) transitions.
[2023-03-24 08:29:32] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
// Phase 1: matrix 2185 rows 1223 cols
[2023-03-24 08:29:32] [INFO ] Computed 142 place invariants in 44 ms
[2023-03-24 08:29:35] [INFO ] Dead Transitions using invariants and state equation in 3306 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3384 ms. Remains : 1223/1234 places, 2194/2195 transitions.
[2023-03-24 08:29:36] [INFO ] Flatten gal took : 82 ms
[2023-03-24 08:29:36] [INFO ] Flatten gal took : 86 ms
[2023-03-24 08:29:36] [INFO ] Input system was already deterministic with 2194 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1234/1234 places, 2195/2195 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 1224 transition count 2195
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 1223 transition count 2194
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 1223 transition count 2194
Applied a total of 12 rules in 64 ms. Remains 1223 /1234 variables (removed 11) and now considering 2194/2195 (removed 1) transitions.
[2023-03-24 08:29:36] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
[2023-03-24 08:29:36] [INFO ] Invariant cache hit.
[2023-03-24 08:29:39] [INFO ] Dead Transitions using invariants and state equation in 3198 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3263 ms. Remains : 1223/1234 places, 2194/2195 transitions.
[2023-03-24 08:29:39] [INFO ] Flatten gal took : 84 ms
[2023-03-24 08:29:39] [INFO ] Flatten gal took : 90 ms
[2023-03-24 08:29:39] [INFO ] Input system was already deterministic with 2194 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1234/1234 places, 2195/2195 transitions.
Ensure Unique test removed 10 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 65 rules applied. Total rules applied 65 place count 1224 transition count 2130
Reduce places removed 65 places and 0 transitions.
Iterating post reduction 1 with 65 rules applied. Total rules applied 130 place count 1159 transition count 2130
Performed 63 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 63 Pre rules applied. Total rules applied 130 place count 1159 transition count 2067
Deduced a syphon composed of 63 places in 0 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 2 with 126 rules applied. Total rules applied 256 place count 1096 transition count 2067
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 257 place count 1095 transition count 2066
Iterating global reduction 2 with 1 rules applied. Total rules applied 258 place count 1095 transition count 2066
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 260 place count 1094 transition count 2065
Applied a total of 260 rules in 198 ms. Remains 1094 /1234 variables (removed 140) and now considering 2065/2195 (removed 130) transitions.
[2023-03-24 08:29:40] [INFO ] Flow matrix only has 2056 transitions (discarded 9 similar events)
// Phase 1: matrix 2056 rows 1094 cols
[2023-03-24 08:29:40] [INFO ] Computed 142 place invariants in 41 ms
[2023-03-24 08:29:42] [INFO ] Dead Transitions using invariants and state equation in 1929 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2129 ms. Remains : 1094/1234 places, 2065/2195 transitions.
[2023-03-24 08:29:42] [INFO ] Flatten gal took : 78 ms
[2023-03-24 08:29:42] [INFO ] Flatten gal took : 103 ms
[2023-03-24 08:29:42] [INFO ] Input system was already deterministic with 2065 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1234/1234 places, 2195/2195 transitions.
Ensure Unique test removed 10 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 65 rules applied. Total rules applied 65 place count 1224 transition count 2130
Reduce places removed 65 places and 0 transitions.
Iterating post reduction 1 with 65 rules applied. Total rules applied 130 place count 1159 transition count 2130
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 64 Pre rules applied. Total rules applied 130 place count 1159 transition count 2066
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 258 place count 1095 transition count 2066
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 259 place count 1094 transition count 2065
Iterating global reduction 2 with 1 rules applied. Total rules applied 260 place count 1094 transition count 2065
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 264 place count 1092 transition count 2063
Applied a total of 264 rules in 177 ms. Remains 1092 /1234 variables (removed 142) and now considering 2063/2195 (removed 132) transitions.
[2023-03-24 08:29:42] [INFO ] Flow matrix only has 2054 transitions (discarded 9 similar events)
// Phase 1: matrix 2054 rows 1092 cols
[2023-03-24 08:29:42] [INFO ] Computed 142 place invariants in 40 ms
[2023-03-24 08:29:44] [INFO ] Dead Transitions using invariants and state equation in 2059 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2238 ms. Remains : 1092/1234 places, 2063/2195 transitions.
[2023-03-24 08:29:44] [INFO ] Flatten gal took : 83 ms
[2023-03-24 08:29:44] [INFO ] Flatten gal took : 94 ms
[2023-03-24 08:29:45] [INFO ] Input system was already deterministic with 2063 transitions.
Incomplete random walk after 10000 steps, including 658 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 1) seen :0
Finished Best-First random walk after 59 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=59 )
FORMULA PolyORBNT-PT-S10J60-CTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Starting structural reductions in LTL mode, iteration 0 : 1234/1234 places, 2195/2195 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 1224 transition count 2195
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 1223 transition count 2194
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 1223 transition count 2194
Applied a total of 12 rules in 92 ms. Remains 1223 /1234 variables (removed 11) and now considering 2194/2195 (removed 1) transitions.
[2023-03-24 08:29:45] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
// Phase 1: matrix 2185 rows 1223 cols
[2023-03-24 08:29:45] [INFO ] Computed 142 place invariants in 44 ms
[2023-03-24 08:29:48] [INFO ] Dead Transitions using invariants and state equation in 3282 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3377 ms. Remains : 1223/1234 places, 2194/2195 transitions.
[2023-03-24 08:29:48] [INFO ] Flatten gal took : 95 ms
[2023-03-24 08:29:48] [INFO ] Flatten gal took : 103 ms
[2023-03-24 08:29:49] [INFO ] Input system was already deterministic with 2194 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1234/1234 places, 2195/2195 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 1224 transition count 2131
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 128 place count 1160 transition count 2131
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 64 Pre rules applied. Total rules applied 128 place count 1160 transition count 2067
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 256 place count 1096 transition count 2067
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 257 place count 1095 transition count 2066
Iterating global reduction 2 with 1 rules applied. Total rules applied 258 place count 1095 transition count 2066
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 262 place count 1093 transition count 2064
Applied a total of 262 rules in 215 ms. Remains 1093 /1234 variables (removed 141) and now considering 2064/2195 (removed 131) transitions.
[2023-03-24 08:29:49] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
// Phase 1: matrix 2055 rows 1093 cols
[2023-03-24 08:29:49] [INFO ] Computed 142 place invariants in 47 ms
[2023-03-24 08:29:51] [INFO ] Dead Transitions using invariants and state equation in 2229 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2446 ms. Remains : 1093/1234 places, 2064/2195 transitions.
[2023-03-24 08:29:51] [INFO ] Flatten gal took : 84 ms
[2023-03-24 08:29:51] [INFO ] Flatten gal took : 87 ms
[2023-03-24 08:29:51] [INFO ] Input system was already deterministic with 2064 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1234/1234 places, 2195/2195 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 1224 transition count 2195
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 1223 transition count 2194
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 1223 transition count 2194
Applied a total of 12 rules in 76 ms. Remains 1223 /1234 variables (removed 11) and now considering 2194/2195 (removed 1) transitions.
[2023-03-24 08:29:51] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
// Phase 1: matrix 2185 rows 1223 cols
[2023-03-24 08:29:52] [INFO ] Computed 142 place invariants in 43 ms
[2023-03-24 08:29:55] [INFO ] Dead Transitions using invariants and state equation in 3277 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3358 ms. Remains : 1223/1234 places, 2194/2195 transitions.
[2023-03-24 08:29:55] [INFO ] Flatten gal took : 84 ms
[2023-03-24 08:29:55] [INFO ] Flatten gal took : 90 ms
[2023-03-24 08:29:55] [INFO ] Input system was already deterministic with 2194 transitions.
[2023-03-24 08:29:55] [INFO ] Flatten gal took : 102 ms
[2023-03-24 08:29:55] [INFO ] Flatten gal took : 103 ms
[2023-03-24 08:29:55] [INFO ] Export to MCC of 9 properties in file /home/mcc/execution/CTLFireability.sr.xml took 7 ms.
[2023-03-24 08:29:55] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1234 places, 2195 transitions and 12704 arcs took 13 ms.
Total runtime 172451 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --ctl=/tmp/724/ctl_0_ --ctl=/tmp/724/ctl_1_ --ctl=/tmp/724/ctl_2_ --ctl=/tmp/724/ctl_3_ --ctl=/tmp/724/ctl_4_ --ctl=/tmp/724/ctl_5_ --ctl=/tmp/724/ctl_6_ --ctl=/tmp/724/ctl_7_ --ctl=/tmp/724/ctl_8_ --mu-par --mu-opt
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 15022072 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16073732 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
mcc2023

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-S10J60"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is PolyORBNT-PT-S10J60, 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 r297-tall-167873950900778"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-PT-S10J60.tgz
mv PolyORBNT-PT-S10J60 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 ;