fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r169-tall-167838855900435
Last Updated
May 14, 2023

About the Execution of LTSMin+red for FamilyReunion-PT-L00400M0040C020P020G001

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
14385.747 3600000.00 5605027.00 10263.90 T?F???F??????T?F normal

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.r169-tall-167838855900435.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 FamilyReunion-PT-L00400M0040C020P020G001, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r169-tall-167838855900435
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 593M
-rw-r--r-- 1 mcc users 3.2M Feb 27 00:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16M Feb 27 00:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 19M Feb 26 22:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 63M Feb 26 22:17 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 7.0K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.6M Feb 25 16:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.7M Feb 25 16:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7M Feb 25 16:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 13M Feb 25 16:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.2M Feb 27 12:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 50M Feb 27 12:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 39M Feb 27 09:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 131M Feb 27 09:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 406K Feb 25 16:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 1.1M Feb 25 16:06 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 24 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 235M Mar 5 18:22 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 FamilyReunion-PT-L00400M0040C020P020G001-LTLCardinality-00
FORMULA_NAME FamilyReunion-PT-L00400M0040C020P020G001-LTLCardinality-01
FORMULA_NAME FamilyReunion-PT-L00400M0040C020P020G001-LTLCardinality-02
FORMULA_NAME FamilyReunion-PT-L00400M0040C020P020G001-LTLCardinality-03
FORMULA_NAME FamilyReunion-PT-L00400M0040C020P020G001-LTLCardinality-04
FORMULA_NAME FamilyReunion-PT-L00400M0040C020P020G001-LTLCardinality-05
FORMULA_NAME FamilyReunion-PT-L00400M0040C020P020G001-LTLCardinality-06
FORMULA_NAME FamilyReunion-PT-L00400M0040C020P020G001-LTLCardinality-07
FORMULA_NAME FamilyReunion-PT-L00400M0040C020P020G001-LTLCardinality-08
FORMULA_NAME FamilyReunion-PT-L00400M0040C020P020G001-LTLCardinality-09
FORMULA_NAME FamilyReunion-PT-L00400M0040C020P020G001-LTLCardinality-10
FORMULA_NAME FamilyReunion-PT-L00400M0040C020P020G001-LTLCardinality-11
FORMULA_NAME FamilyReunion-PT-L00400M0040C020P020G001-LTLCardinality-12
FORMULA_NAME FamilyReunion-PT-L00400M0040C020P020G001-LTLCardinality-13
FORMULA_NAME FamilyReunion-PT-L00400M0040C020P020G001-LTLCardinality-14
FORMULA_NAME FamilyReunion-PT-L00400M0040C020P020G001-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678547293440

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=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FamilyReunion-PT-L00400M0040C020P020G001
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-11 15:08:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-11 15:08:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 15:08:21] [INFO ] Load time of PNML (sax parser for PT used): 6356 ms
[2023-03-11 15:08:22] [INFO ] Transformed 537708 places.
[2023-03-11 15:08:23] [INFO ] Transformed 508489 transitions.
[2023-03-11 15:08:23] [INFO ] Parsed PT model containing 537708 places and 508489 transitions and 1558729 arcs in 8121 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 1404112 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Reduce places removed 106 places and 0 transitions.
FORMULA FamilyReunion-PT-L00400M0040C020P020G001-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-PT-L00400M0040C020P020G001-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-PT-L00400M0040C020P020G001-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 83491 out of 537602 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 537602/537602 places, 508489/508489 transitions.
Reduce places removed 913 places and 0 transitions.
Discarding 98644 places :
Implicit places reduction removed 98644 places
Iterating post reduction 0 with 99557 rules applied. Total rules applied 99557 place count 438045 transition count 508489
Discarding 4010 places :
Symmetric choice reduction at 1 with 4010 rule applications. Total rules 103567 place count 434035 transition count 500469
Iterating global reduction 1 with 4010 rules applied. Total rules applied 107577 place count 434035 transition count 500469
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 107587 place count 434025 transition count 496459
Iterating global reduction 1 with 10 rules applied. Total rules applied 107597 place count 434025 transition count 496459
Applied a total of 107597 rules in 155667 ms. Remains 434025 /537602 variables (removed 103577) and now considering 496459/508489 (removed 12030) transitions.
// Phase 1: matrix 496459 rows 434025 cols
[2023-03-11 15:36:30] [WARNING] Invariant computation timed out after 120 seconds.
[2023-03-11 15:37:02] [INFO ] Implicit Places using invariants in 152666 ms returned []
Implicit Place search using SMT only with invariants took 152697 ms to find 0 implicit places.
// Phase 1: matrix 496459 rows 434025 cols
[2023-03-11 15:39:03] [WARNING] Invariant computation timed out after 120 seconds.
[2023-03-11 15:39:28] [INFO ] Computed 14043 place invariants in 298053 ms
[2023-03-11 15:39:38] [INFO ] Dead Transitions using invariants and state equation in 155569 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 434025/537602 places, 496459/508489 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 463995 ms. Remains : 434025/537602 places, 496459/508489 transitions.
Support contains 83491 out of 434025 places after structural reductions.
[2023-03-11 15:39:55] [INFO ] Flatten gal took : 12281 ms
[2023-03-11 15:40:08] [INFO ] Flatten gal took : 11843 ms
[2023-03-11 15:40:34] [INFO ] Input system was already deterministic with 496459 transitions.
Support contains 83488 out of 434025 places (down from 83491) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 13332 ms. (steps per millisecond=0 ) properties (out of 29) seen :4
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 243 ms. (steps per millisecond=4 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 244 ms. (steps per millisecond=4 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=20 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=20 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=18 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=20 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 245 ms. (steps per millisecond=4 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=18 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=7 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=20 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=21 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 410 ms. (steps per millisecond=2 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 407 ms. (steps per millisecond=2 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=25 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=25 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=24 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=26 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=24 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=24 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=25 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=25 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=25 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=25 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=25 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=25 ) properties (out of 25) seen :0
Running SMT prover for 25 properties.
[2023-03-11 15:40:57] [INFO ] Invariant cache hit.
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.verifyPossible(DeadlockTester.java:609)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
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.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
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-11 15:41:22] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-11 15:41:22] [INFO ] After 25016ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 25 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 41785 out of 434025 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 434025/434025 places, 496459/496459 transitions.
Graph (complete) has 641608 edges and 434025 vertex of which 433605 are kept as prefixes of interest. Removing 420 places using SCC suffix rule.595 ms
Discarding 420 places :
Also discarding 420 output transitions
Drop transitions removed 420 transitions
[2023-03-11 15:41:47] [INFO ] Computed 14043 place invariants in 284298 ms
Drop transitions removed 198077 transitions
Trivial Post-agglo rules discarded 198077 transitions
Performed 198077 trivial Post agglomeration. Transition count delta: 198077
Iterating post reduction 0 with 198077 rules applied. Total rules applied 198078 place count 433605 transition count 297962
Reduce places removed 198077 places and 0 transitions.
Performed 6444 Post agglomeration using F-continuation condition.
Performed 12917 Post agglomeration using F-continuation condition.
Performed 19111 Post agglomeration using F-continuation condition.
Performed 25120 Post agglomeration using F-continuation condition.
Performed 32039 Post agglomeration using F-continuation condition.
Performed 39973 Post agglomeration using F-continuation condition.
Performed 41706 Post agglomeration using F-continuation condition.Transition count delta: 41706
Iterating post reduction 1 with 239783 rules applied. Total rules applied 437861 place count 235528 transition count 256256
Reduce places removed 41706 places and 0 transitions.
Iterating post reduction 2 with 41706 rules applied. Total rules applied 479567 place count 193822 transition count 256256
Performed 8822 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8822 Pre rules applied. Total rules applied 479567 place count 193822 transition count 247434
Deduced a syphon composed of 8822 places in 325 ms
Ensure Unique test removed 1 places
Reduce places removed 8823 places and 0 transitions.
Iterating global reduction 3 with 17645 rules applied. Total rules applied 497212 place count 184999 transition count 247434
Discarding 8421 places :
Implicit places reduction removed 8421 places
Iterating post reduction 3 with 8421 rules applied. Total rules applied 505633 place count 176578 transition count 247434
Performed 2457 Post agglomeration using F-continuation condition.
Performed 3645 Post agglomeration using F-continuation condition.Transition count delta: 3645
Deduced a syphon composed of 3645 places in 308 ms
Ensure Unique test removed 1 places
Reduce places removed 3646 places and 0 transitions.
Iterating global reduction 4 with 7291 rules applied. Total rules applied 512924 place count 172932 transition count 243789
Free-agglomeration rule applied 8421 times.
Iterating global reduction 4 with 8421 rules applied. Total rules applied 521345 place count 172932 transition count 235368
Ensure Unique test removed 400 places
Reduce places removed 8821 places and 0 transitions.
Ensure Unique test removed 8019 transitions
Reduce isomorphic transitions removed 8019 transitions.
Iterating post reduction 4 with 16840 rules applied. Total rules applied 538185 place count 164111 transition count 227349
Performed 400 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 400 Pre rules applied. Total rules applied 538185 place count 164111 transition count 226949
Deduced a syphon composed of 400 places in 176 ms
Ensure Unique test removed 400 places
Reduce places removed 800 places and 0 transitions.
Iterating global reduction 5 with 1200 rules applied. Total rules applied 539385 place count 163311 transition count 226949
Free-agglomeration rule (complex) applied 5613 times.
Iterating global reduction 5 with 5613 rules applied. Total rules applied 544998 place count 163311 transition count 221336
Reduce places removed 5613 places and 0 transitions.
Iterating post reduction 5 with 5613 rules applied. Total rules applied 550611 place count 157698 transition count 221336
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 550612 place count 157698 transition count 221336
Applied a total of 550612 rules in 533510 ms. Remains 157698 /434025 variables (removed 276327) and now considering 221336/496459 (removed 275123) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 533516 ms. Remains : 157698/434025 places, 221336/496459 transitions.
FORMULA FamilyReunion-PT-L00400M0040C020P020G001-LTLCardinality-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 434025 stabilizing places and 496459 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 434025 transition count 496459
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((F(p0) U p1)||G((p2||X(G(p3)))))))'
Support contains 9244 out of 434025 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 434025/434025 places, 496459/496459 transitions.
Reduce places removed 25 places and 0 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 433998 transition count 496459
Applied a total of 27 rules in 38220 ms. Remains 433998 /434025 variables (removed 27) and now considering 496459/496459 (removed 0) transitions.
// Phase 1: matrix 496459 rows 433998 cols
[2023-03-11 15:52:57] [WARNING] Invariant computation timed out after 120 seconds.
[2023-03-11 15:53:31] [INFO ] Implicit Places using invariants in 154436 ms returned []
Implicit Place search using SMT only with invariants took 154456 ms to find 0 implicit places.
// Phase 1: matrix 496459 rows 433998 cols
[2023-03-11 15:55:32] [WARNING] Invariant computation timed out after 120 seconds.
[2023-03-11 15:55:54] [INFO ] Computed 14040 place invariants in 296376 ms
[2023-03-11 15:56:04] [INFO ] Dead Transitions using invariants and state equation in 152917 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 433998/434025 places, 496459/496459 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 345672 ms. Remains : 433998/434025 places, 496459/496459 transitions.
Stuttering acceptance computed with spot in 472 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p0), (NOT p1)]
Running random walk in product with property : FamilyReunion-PT-L00400M0040C020P020G001-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) p3), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0) p3), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) p3), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=6 dest: 5}, { cond=(NOT p1), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(OR (LEQ 1 (ADD s302027 s302028 s302029 s302030 s302031 s302032 s302033 s302034 s302035 s302036 s302037 s302038 s302039 s302040 s302041 s302042 s302043...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration timeout after 2570 steps with 1285 reset in 10027 ms.
Product exploration timeout after 2640 steps with 1320 reset in 10027 ms.
[2023-03-11 15:59:04] [INFO ] Computed 14040 place invariants in 332883 ms
Computed a total of 433998 stabilizing places and 496459 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 433998 transition count 496459
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Could not satisfy deadlock states : solver returned unknown
Knowledge obtained : [(AND p1 p2 (NOT p0) (NOT p3)), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3))))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) p3)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (AND (NOT p0) p2)))
Knowledge based reduction with 21 factoid took 581 ms. Reduced automaton from 7 states, 16 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-PT-L00400M0040C020P020G001-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-PT-L00400M0040C020P020G001-LTLCardinality-00 finished in 817831 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 422 out of 434025 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 434025/434025 places, 496459/496459 transitions.
Graph (complete) has 641608 edges and 434025 vertex of which 402689 are kept as prefixes of interest. Removing 31336 places using SCC suffix rule.1104 ms
Discarding 31336 places :
Also discarding 34106 output transitions
Drop transitions removed 34106 transitions
Reduce places removed 401 places and 401 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 265462 transitions
Trivial Post-agglo rules discarded 265462 transitions
Performed 265462 trivial Post agglomeration. Transition count delta: 265462
Iterating post reduction 0 with 265464 rules applied. Total rules applied 265465 place count 402286 transition count 196490
Reduce places removed 265462 places and 0 transitions.
Iterating post reduction 1 with 265462 rules applied. Total rules applied 530927 place count 136824 transition count 196490
Performed 18847 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18847 Pre rules applied. Total rules applied 530927 place count 136824 transition count 177643
Deduced a syphon composed of 18847 places in 145 ms
Ensure Unique test removed 9223 places
Reduce places removed 28070 places and 0 transitions.
Iterating global reduction 2 with 46917 rules applied. Total rules applied 577844 place count 108754 transition count 177643
Discarding 401 places :
Implicit places reduction removed 401 places
Drop transitions removed 8421 transitions
Trivial Post-agglo rules discarded 8421 transitions
Performed 8421 trivial Post agglomeration. Transition count delta: 8421
Iterating post reduction 2 with 8822 rules applied. Total rules applied 586666 place count 108353 transition count 169222
Reduce places removed 8421 places and 0 transitions.
Performed 401 Post agglomeration using F-continuation condition.Transition count delta: 401
Iterating post reduction 3 with 8822 rules applied. Total rules applied 595488 place count 99932 transition count 168821
Reduce places removed 401 places and 0 transitions.
Iterating post reduction 4 with 401 rules applied. Total rules applied 595889 place count 99531 transition count 168821
Discarding 400 places :
Symmetric choice reduction at 5 with 400 rule applications. Total rules 596289 place count 99131 transition count 160421
Iterating global reduction 5 with 400 rules applied. Total rules applied 596689 place count 99131 transition count 160421
Performed 11398 Post agglomeration using F-continuation condition.
Performed 18446 Post agglomeration using F-continuation condition.Transition count delta: 18446
Deduced a syphon composed of 18446 places in 79 ms
Reduce places removed 18446 places and 0 transitions.
Iterating global reduction 5 with 36892 rules applied. Total rules applied 633581 place count 80685 transition count 141975
Applied a total of 633581 rules in 230488 ms. Remains 80685 /434025 variables (removed 353340) and now considering 141975/496459 (removed 354484) transitions.
// Phase 1: matrix 141975 rows 80685 cols
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 6754800 kB
After kill :
MemTotal: 16393232 kB
MemFree: 15433220 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 LTLCardinality -timeout 360 -rebuildPNML

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="FamilyReunion-PT-L00400M0040C020P020G001"
export BK_EXAMINATION="LTLCardinality"
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 FamilyReunion-PT-L00400M0040C020P020G001, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r169-tall-167838855900435"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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