/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/parallel/bakery-3.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-26 14:59:48,666 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-26 14:59:48,668 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-26 14:59:48,829 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-26 14:59:48,829 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-26 14:59:48,832 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-26 14:59:48,834 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-26 14:59:48,839 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-26 14:59:48,841 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-26 14:59:48,845 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-26 14:59:48,846 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-26 14:59:48,847 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-26 14:59:48,848 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-26 14:59:48,849 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-26 14:59:48,851 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-26 14:59:48,852 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-26 14:59:48,854 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-26 14:59:48,854 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-26 14:59:48,855 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-26 14:59:48,857 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-26 14:59:48,858 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-26 14:59:48,860 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-26 14:59:48,861 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-26 14:59:48,862 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-26 14:59:48,871 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-26 14:59:48,872 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-26 14:59:48,872 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-26 14:59:48,873 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-26 14:59:48,873 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-26 14:59:48,874 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-26 14:59:48,874 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-26 14:59:48,875 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-26 14:59:48,875 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-26 14:59:48,876 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-26 14:59:48,877 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-26 14:59:48,877 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-26 14:59:48,877 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-26 14:59:48,878 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-26 14:59:48,878 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-26 14:59:48,878 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-26 14:59:48,879 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-26 14:59:48,884 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2021-03-26 14:59:48,919 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-26 14:59:48,919 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-26 14:59:48,923 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-26 14:59:48,923 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-26 14:59:48,923 INFO L138 SettingsManager]: * Use SBE=true [2021-03-26 14:59:48,923 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-26 14:59:48,923 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-26 14:59:48,924 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-26 14:59:48,924 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-26 14:59:48,924 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-26 14:59:48,925 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-26 14:59:48,925 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-26 14:59:48,925 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-26 14:59:48,925 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-26 14:59:48,925 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-26 14:59:48,925 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-26 14:59:48,926 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-26 14:59:48,926 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-26 14:59:48,926 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-26 14:59:48,926 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-26 14:59:48,926 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-26 14:59:48,927 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 14:59:48,927 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-26 14:59:48,927 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-26 14:59:48,927 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-26 14:59:48,927 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-26 14:59:48,927 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-26 14:59:48,927 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES_DISJUNCTIVE [2021-03-26 14:59:48,928 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-26 14:59:48,928 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-26 14:59:48,928 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-26 14:59:49,197 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-26 14:59:49,215 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-26 14:59:49,217 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-26 14:59:49,218 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2021-03-26 14:59:49,219 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2021-03-26 14:59:49,220 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/parallel/bakery-3.wvr.bpl [2021-03-26 14:59:49,234 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/parallel/bakery-3.wvr.bpl' [2021-03-26 14:59:49,268 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-26 14:59:49,271 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-03-26 14:59:49,272 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-26 14:59:49,272 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-26 14:59:49,272 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-26 14:59:49,284 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "bakery-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.03 02:59:49" (1/1) ... [2021-03-26 14:59:49,291 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "bakery-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.03 02:59:49" (1/1) ... [2021-03-26 14:59:49,299 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-26 14:59:49,300 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-26 14:59:49,300 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-26 14:59:49,301 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-26 14:59:49,306 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "bakery-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.03 02:59:49" (1/1) ... [2021-03-26 14:59:49,307 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "bakery-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.03 02:59:49" (1/1) ... [2021-03-26 14:59:49,307 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "bakery-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.03 02:59:49" (1/1) ... [2021-03-26 14:59:49,308 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "bakery-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.03 02:59:49" (1/1) ... [2021-03-26 14:59:49,310 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "bakery-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.03 02:59:49" (1/1) ... [2021-03-26 14:59:49,311 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "bakery-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.03 02:59:49" (1/1) ... [2021-03-26 14:59:49,312 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "bakery-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.03 02:59:49" (1/1) ... [2021-03-26 14:59:49,313 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-26 14:59:49,315 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-26 14:59:49,315 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-26 14:59:49,315 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-26 14:59:49,316 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "bakery-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.03 02:59:49" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 14:59:49,365 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2021-03-26 14:59:49,366 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-03-26 14:59:49,366 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-03-26 14:59:49,366 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2021-03-26 14:59:49,366 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-03-26 14:59:49,366 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-03-26 14:59:49,366 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2021-03-26 14:59:49,366 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-26 14:59:49,367 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-26 14:59:49,367 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2021-03-26 14:59:49,367 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2021-03-26 14:59:49,367 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2021-03-26 14:59:49,368 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-26 14:59:49,543 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-26 14:59:49,543 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2021-03-26 14:59:49,544 INFO L202 PluginConnector]: Adding new model bakery-3.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 02:59:49 BoogieIcfgContainer [2021-03-26 14:59:49,544 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-26 14:59:49,545 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-26 14:59:49,545 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-26 14:59:49,548 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-26 14:59:49,548 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "bakery-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.03 02:59:49" (1/2) ... [2021-03-26 14:59:49,548 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1de1c44a and model type bakery-3.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 02:59:49, skipping insertion in model container [2021-03-26 14:59:49,549 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "bakery-3.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 02:59:49" (2/2) ... [2021-03-26 14:59:49,550 INFO L111 eAbstractionObserver]: Analyzing ICFG bakery-3.wvr.bpl [2021-03-26 14:59:49,554 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-26 14:59:49,557 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-03-26 14:59:49,558 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-26 14:59:49,591 INFO L149 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2021-03-26 14:59:49,622 INFO L253 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-03-26 14:59:49,655 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-26 14:59:49,656 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-26 14:59:49,656 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-26 14:59:49,656 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-26 14:59:49,656 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-26 14:59:49,656 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-26 14:59:49,656 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-26 14:59:49,656 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-26 14:59:49,665 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 63 places, 53 transitions, 130 flow [2021-03-26 14:59:49,739 INFO L129 PetriNetUnfolder]: 0/50 cut-off events. [2021-03-26 14:59:49,739 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-03-26 14:59:49,741 INFO L84 FinitePrefix]: Finished finitePrefix Result has 63 conditions, 50 events. 0/50 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 79 event pairs, 0 based on Foata normal form. 0/49 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-26 14:59:49,741 INFO L82 GeneralOperation]: Start removeDead. Operand has 63 places, 53 transitions, 130 flow [2021-03-26 14:59:49,746 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 48 transitions, 114 flow [2021-03-26 14:59:49,756 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 14:59:49,769 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 48 transitions, 114 flow [2021-03-26 14:59:49,777 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 48 transitions, 114 flow [2021-03-26 14:59:49,782 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 58 places, 48 transitions, 114 flow [2021-03-26 14:59:49,822 INFO L129 PetriNetUnfolder]: 0/48 cut-off events. [2021-03-26 14:59:49,822 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-03-26 14:59:49,822 INFO L84 FinitePrefix]: Finished finitePrefix Result has 61 conditions, 48 events. 0/48 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 80 event pairs, 0 based on Foata normal form. 0/48 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-26 14:59:49,825 INFO L142 LiptonReduction]: Number of co-enabled transitions 1170 [2021-03-26 14:59:50,405 INFO L154 LiptonReduction]: Checked pairs total: 2728 [2021-03-26 14:59:50,405 INFO L156 LiptonReduction]: Total number of compositions: 10 [2021-03-26 14:59:50,409 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 663 [2021-03-26 14:59:50,440 INFO L129 PetriNetUnfolder]: 0/37 cut-off events. [2021-03-26 14:59:50,440 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-03-26 14:59:50,440 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 14:59:50,441 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 14:59:50,441 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-26 14:59:50,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 14:59:50,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1589473928, now seen corresponding path program 1 times [2021-03-26 14:59:50,454 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 14:59:50,454 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645120876] [2021-03-26 14:59:50,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 14:59:50,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 14:59:50,604 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 14:59:50,605 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 14:59:50,612 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 14:59:50,613 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 14:59:50,625 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 14:59:50,626 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 14:59:50,636 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 14:59:50,637 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 14:59:50,652 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 14:59:50,654 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 14:59:50,664 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 14:59:50,665 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 14:59:50,687 INFO L142 QuantifierPusher]: treesize reduction 9, result has 43.8 percent of original size [2021-03-26 14:59:50,690 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 14:59:50,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 14:59:50,704 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645120876] [2021-03-26 14:59:50,705 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 14:59:50,706 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-26 14:59:50,706 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837836706] [2021-03-26 14:59:50,712 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-26 14:59:50,713 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 14:59:50,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-26 14:59:50,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-03-26 14:59:50,727 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 63 [2021-03-26 14:59:50,732 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 38 transitions, 94 flow. Second operand has 9 states, 9 states have (on average 53.888888888888886) internal successors, (485), 9 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 14:59:50,732 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 14:59:50,732 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 63 [2021-03-26 14:59:50,733 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 14:59:50,974 INFO L129 PetriNetUnfolder]: 29/168 cut-off events. [2021-03-26 14:59:50,975 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2021-03-26 14:59:50,977 INFO L84 FinitePrefix]: Finished finitePrefix Result has 287 conditions, 168 events. 29/168 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 852 event pairs, 3 based on Foata normal form. 1/168 useless extension candidates. Maximal degree in co-relation 249. Up to 28 conditions per place. [2021-03-26 14:59:50,979 INFO L132 encePairwiseOnDemand]: 55/63 looper letters, 21 selfloop transitions, 15 changer transitions 2/68 dead transitions. [2021-03-26 14:59:50,979 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 68 transitions, 230 flow [2021-03-26 14:59:50,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-26 14:59:50,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-03-26 14:59:50,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 622 transitions. [2021-03-26 14:59:50,992 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8975468975468975 [2021-03-26 14:59:50,993 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 622 transitions. [2021-03-26 14:59:50,993 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 622 transitions. [2021-03-26 14:59:50,995 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 14:59:50,997 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 622 transitions. [2021-03-26 14:59:51,001 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 56.54545454545455) internal successors, (622), 11 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 14:59:51,007 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 63.0) internal successors, (756), 12 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 14:59:51,008 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 63.0) internal successors, (756), 12 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 14:59:51,009 INFO L185 Difference]: Start difference. First operand has 48 places, 38 transitions, 94 flow. Second operand 11 states and 622 transitions. [2021-03-26 14:59:51,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 68 transitions, 230 flow [2021-03-26 14:59:51,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 68 transitions, 218 flow, removed 0 selfloop flow, removed 6 redundant places. [2021-03-26 14:59:51,016 INFO L241 Difference]: Finished difference. Result has 56 places, 54 transitions, 174 flow [2021-03-26 14:59:51,017 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=174, PETRI_PLACES=56, PETRI_TRANSITIONS=54} [2021-03-26 14:59:51,018 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 8 predicate places. [2021-03-26 14:59:51,018 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 14:59:51,019 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 54 transitions, 174 flow [2021-03-26 14:59:51,019 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 54 transitions, 174 flow [2021-03-26 14:59:51,020 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 54 places, 54 transitions, 174 flow [2021-03-26 14:59:51,030 INFO L129 PetriNetUnfolder]: 9/112 cut-off events. [2021-03-26 14:59:51,031 INFO L130 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2021-03-26 14:59:51,031 INFO L84 FinitePrefix]: Finished finitePrefix Result has 178 conditions, 112 events. 9/112 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 465 event pairs, 2 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 162. Up to 12 conditions per place. [2021-03-26 14:59:51,032 INFO L142 LiptonReduction]: Number of co-enabled transitions 978 [2021-03-26 14:59:51,135 INFO L154 LiptonReduction]: Checked pairs total: 3129 [2021-03-26 14:59:51,136 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 14:59:51,136 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 118 [2021-03-26 14:59:51,138 INFO L480 AbstractCegarLoop]: Abstraction has has 54 places, 54 transitions, 176 flow [2021-03-26 14:59:51,139 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 53.888888888888886) internal successors, (485), 9 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 14:59:51,139 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 14:59:51,139 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 14:59:51,140 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-26 14:59:51,140 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-26 14:59:51,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 14:59:51,141 INFO L82 PathProgramCache]: Analyzing trace with hash -748688888, now seen corresponding path program 2 times [2021-03-26 14:59:51,141 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 14:59:51,141 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687232970] [2021-03-26 14:59:51,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 14:59:51,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 14:59:51,238 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 14:59:51,239 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 14:59:51,257 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 14:59:51,258 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 14:59:51,264 INFO L142 QuantifierPusher]: treesize reduction 19, result has 57.8 percent of original size [2021-03-26 14:59:51,265 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-03-26 14:59:51,272 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 14:59:51,273 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 14:59:51,281 INFO L142 QuantifierPusher]: treesize reduction 7, result has 63.2 percent of original size [2021-03-26 14:59:51,282 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 14:59:51,292 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 14:59:51,294 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 14:59:51,304 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 14:59:51,306 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 14:59:51,315 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 14:59:51,315 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 14:59:51,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 14:59:51,322 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687232970] [2021-03-26 14:59:51,322 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 14:59:51,322 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-26 14:59:51,322 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002597057] [2021-03-26 14:59:51,325 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 14:59:51,326 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 14:59:51,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 14:59:51,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-03-26 14:59:51,331 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 65 [2021-03-26 14:59:51,332 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 54 transitions, 176 flow. Second operand has 7 states, 7 states have (on average 38.714285714285715) internal successors, (271), 7 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 14:59:51,332 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 14:59:51,332 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 65 [2021-03-26 14:59:51,332 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 14:59:51,743 INFO L129 PetriNetUnfolder]: 865/1981 cut-off events. [2021-03-26 14:59:51,744 INFO L130 PetriNetUnfolder]: For 83/83 co-relation queries the response was YES. [2021-03-26 14:59:51,749 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3871 conditions, 1981 events. 865/1981 cut-off events. For 83/83 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 13885 event pairs, 234 based on Foata normal form. 24/1915 useless extension candidates. Maximal degree in co-relation 3854. Up to 1085 conditions per place. [2021-03-26 14:59:51,758 INFO L132 encePairwiseOnDemand]: 56/65 looper letters, 51 selfloop transitions, 21 changer transitions 0/107 dead transitions. [2021-03-26 14:59:51,758 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 107 transitions, 426 flow [2021-03-26 14:59:51,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-26 14:59:51,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-26 14:59:51,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 361 transitions. [2021-03-26 14:59:51,760 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6942307692307692 [2021-03-26 14:59:51,760 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 361 transitions. [2021-03-26 14:59:51,760 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 361 transitions. [2021-03-26 14:59:51,760 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 14:59:51,761 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 361 transitions. [2021-03-26 14:59:51,762 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 45.125) internal successors, (361), 8 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 14:59:51,763 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 65.0) internal successors, (585), 9 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 14:59:51,763 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 65.0) internal successors, (585), 9 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 14:59:51,764 INFO L185 Difference]: Start difference. First operand has 54 places, 54 transitions, 176 flow. Second operand 8 states and 361 transitions. [2021-03-26 14:59:51,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 107 transitions, 426 flow [2021-03-26 14:59:51,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 107 transitions, 424 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-03-26 14:59:51,768 INFO L241 Difference]: Finished difference. Result has 64 places, 75 transitions, 300 flow [2021-03-26 14:59:51,769 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=300, PETRI_PLACES=64, PETRI_TRANSITIONS=75} [2021-03-26 14:59:51,769 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 16 predicate places. [2021-03-26 14:59:51,769 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 14:59:51,769 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 75 transitions, 300 flow [2021-03-26 14:59:51,770 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 75 transitions, 300 flow [2021-03-26 14:59:51,770 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 64 places, 75 transitions, 300 flow [2021-03-26 14:59:51,792 INFO L129 PetriNetUnfolder]: 66/391 cut-off events. [2021-03-26 14:59:51,792 INFO L130 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2021-03-26 14:59:51,794 INFO L84 FinitePrefix]: Finished finitePrefix Result has 724 conditions, 391 events. 66/391 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2647 event pairs, 14 based on Foata normal form. 0/378 useless extension candidates. Maximal degree in co-relation 668. Up to 71 conditions per place. [2021-03-26 14:59:51,797 INFO L142 LiptonReduction]: Number of co-enabled transitions 1276 [2021-03-26 14:59:51,872 INFO L154 LiptonReduction]: Checked pairs total: 1563 [2021-03-26 14:59:51,872 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 14:59:51,872 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 103 [2021-03-26 14:59:51,873 INFO L480 AbstractCegarLoop]: Abstraction has has 64 places, 75 transitions, 300 flow [2021-03-26 14:59:51,873 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 38.714285714285715) internal successors, (271), 7 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 14:59:51,874 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 14:59:51,874 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 14:59:51,874 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-26 14:59:51,874 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-26 14:59:51,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 14:59:51,874 INFO L82 PathProgramCache]: Analyzing trace with hash -1721158409, now seen corresponding path program 1 times [2021-03-26 14:59:51,875 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 14:59:51,875 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168938674] [2021-03-26 14:59:51,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 14:59:51,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 14:59:51,904 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 14:59:51,904 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 14:59:51,905 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 14:59:51,905 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 14:59:51,908 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 14:59:51,909 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 14:59:51,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 14:59:51,909 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168938674] [2021-03-26 14:59:51,909 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 14:59:51,909 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 14:59:51,910 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620622478] [2021-03-26 14:59:51,910 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 14:59:51,910 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 14:59:51,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 14:59:51,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 14:59:51,911 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 65 [2021-03-26 14:59:51,911 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 75 transitions, 300 flow. Second operand has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 14:59:51,911 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 14:59:51,911 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 65 [2021-03-26 14:59:51,911 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 14:59:51,956 INFO L129 PetriNetUnfolder]: 72/401 cut-off events. [2021-03-26 14:59:51,956 INFO L130 PetriNetUnfolder]: For 116/122 co-relation queries the response was YES. [2021-03-26 14:59:51,958 INFO L84 FinitePrefix]: Finished finitePrefix Result has 806 conditions, 401 events. 72/401 cut-off events. For 116/122 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2629 event pairs, 19 based on Foata normal form. 19/406 useless extension candidates. Maximal degree in co-relation 753. Up to 60 conditions per place. [2021-03-26 14:59:51,959 INFO L132 encePairwiseOnDemand]: 61/65 looper letters, 3 selfloop transitions, 8 changer transitions 0/75 dead transitions. [2021-03-26 14:59:51,959 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 75 transitions, 322 flow [2021-03-26 14:59:51,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 14:59:51,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 14:59:51,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 178 transitions. [2021-03-26 14:59:51,961 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9128205128205128 [2021-03-26 14:59:51,961 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 178 transitions. [2021-03-26 14:59:51,961 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 178 transitions. [2021-03-26 14:59:51,961 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 14:59:51,961 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 178 transitions. [2021-03-26 14:59:51,962 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 14:59:51,962 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 14:59:51,962 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 14:59:51,963 INFO L185 Difference]: Start difference. First operand has 64 places, 75 transitions, 300 flow. Second operand 3 states and 178 transitions. [2021-03-26 14:59:51,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 75 transitions, 322 flow [2021-03-26 14:59:51,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 75 transitions, 322 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-03-26 14:59:51,969 INFO L241 Difference]: Finished difference. Result has 67 places, 75 transitions, 328 flow [2021-03-26 14:59:51,969 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=328, PETRI_PLACES=67, PETRI_TRANSITIONS=75} [2021-03-26 14:59:51,969 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 19 predicate places. [2021-03-26 14:59:51,969 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 14:59:51,970 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 75 transitions, 328 flow [2021-03-26 14:59:51,970 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 75 transitions, 328 flow [2021-03-26 14:59:51,971 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 67 places, 75 transitions, 328 flow [2021-03-26 14:59:51,996 INFO L129 PetriNetUnfolder]: 73/426 cut-off events. [2021-03-26 14:59:51,997 INFO L130 PetriNetUnfolder]: For 149/149 co-relation queries the response was YES. [2021-03-26 14:59:51,998 INFO L84 FinitePrefix]: Finished finitePrefix Result has 878 conditions, 426 events. 73/426 cut-off events. For 149/149 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2863 event pairs, 23 based on Foata normal form. 0/418 useless extension candidates. Maximal degree in co-relation 815. Up to 68 conditions per place. [2021-03-26 14:59:52,002 INFO L142 LiptonReduction]: Number of co-enabled transitions 1194 [2021-03-26 14:59:52,044 INFO L154 LiptonReduction]: Checked pairs total: 1237 [2021-03-26 14:59:52,045 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 14:59:52,045 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 76 [2021-03-26 14:59:52,048 INFO L480 AbstractCegarLoop]: Abstraction has has 67 places, 75 transitions, 328 flow [2021-03-26 14:59:52,048 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 14:59:52,048 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 14:59:52,048 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 14:59:52,049 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-26 14:59:52,049 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-26 14:59:52,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 14:59:52,049 INFO L82 PathProgramCache]: Analyzing trace with hash 590375385, now seen corresponding path program 2 times [2021-03-26 14:59:52,050 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 14:59:52,050 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110427949] [2021-03-26 14:59:52,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 14:59:52,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 14:59:52,113 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 14:59:52,114 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 14:59:52,130 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 14:59:52,130 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 14:59:52,137 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 14:59:52,138 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 14:59:52,144 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 14:59:52,145 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 14:59:52,146 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 14:59:52,151 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 14:59:52,159 INFO L142 QuantifierPusher]: treesize reduction 7, result has 50.0 percent of original size [2021-03-26 14:59:52,160 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 14:59:52,171 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 14:59:52,171 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 14:59:52,179 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 14:59:52,180 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 14:59:52,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 14:59:52,182 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110427949] [2021-03-26 14:59:52,185 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 14:59:52,185 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-26 14:59:52,186 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380566884] [2021-03-26 14:59:52,186 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-26 14:59:52,186 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 14:59:52,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-26 14:59:52,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-03-26 14:59:52,189 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 65 [2021-03-26 14:59:52,189 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 75 transitions, 328 flow. Second operand has 8 states, 8 states have (on average 38.375) internal successors, (307), 8 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 14:59:52,189 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 14:59:52,189 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 65 [2021-03-26 14:59:52,189 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 14:59:52,825 INFO L129 PetriNetUnfolder]: 1731/3913 cut-off events. [2021-03-26 14:59:52,825 INFO L130 PetriNetUnfolder]: For 1728/1766 co-relation queries the response was YES. [2021-03-26 14:59:52,837 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9462 conditions, 3913 events. 1731/3913 cut-off events. For 1728/1766 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 31905 event pairs, 345 based on Foata normal form. 41/3819 useless extension candidates. Maximal degree in co-relation 9324. Up to 1389 conditions per place. [2021-03-26 14:59:52,856 INFO L132 encePairwiseOnDemand]: 52/65 looper letters, 93 selfloop transitions, 63 changer transitions 0/191 dead transitions. [2021-03-26 14:59:52,856 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 191 transitions, 1028 flow [2021-03-26 14:59:52,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-26 14:59:52,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-03-26 14:59:52,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 522 transitions. [2021-03-26 14:59:52,858 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.73006993006993 [2021-03-26 14:59:52,858 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 522 transitions. [2021-03-26 14:59:52,859 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 522 transitions. [2021-03-26 14:59:52,859 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 14:59:52,859 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 522 transitions. [2021-03-26 14:59:52,860 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 47.45454545454545) internal successors, (522), 11 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 14:59:52,861 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 65.0) internal successors, (780), 12 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 14:59:52,861 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 65.0) internal successors, (780), 12 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 14:59:52,861 INFO L185 Difference]: Start difference. First operand has 67 places, 75 transitions, 328 flow. Second operand 11 states and 522 transitions. [2021-03-26 14:59:52,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 191 transitions, 1028 flow [2021-03-26 14:59:52,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 191 transitions, 1000 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 14:59:52,874 INFO L241 Difference]: Finished difference. Result has 83 places, 126 transitions, 776 flow [2021-03-26 14:59:52,874 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=312, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=776, PETRI_PLACES=83, PETRI_TRANSITIONS=126} [2021-03-26 14:59:52,875 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 35 predicate places. [2021-03-26 14:59:52,875 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 14:59:52,875 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 126 transitions, 776 flow [2021-03-26 14:59:52,875 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 83 places, 126 transitions, 776 flow [2021-03-26 14:59:52,876 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 83 places, 126 transitions, 776 flow [2021-03-26 14:59:52,975 INFO L129 PetriNetUnfolder]: 349/1271 cut-off events. [2021-03-26 14:59:52,975 INFO L130 PetriNetUnfolder]: For 912/939 co-relation queries the response was YES. [2021-03-26 14:59:52,981 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3297 conditions, 1271 events. 349/1271 cut-off events. For 912/939 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 10683 event pairs, 69 based on Foata normal form. 4/1201 useless extension candidates. Maximal degree in co-relation 3197. Up to 256 conditions per place. [2021-03-26 14:59:52,997 INFO L142 LiptonReduction]: Number of co-enabled transitions 2104 [2021-03-26 14:59:53,508 INFO L154 LiptonReduction]: Checked pairs total: 4334 [2021-03-26 14:59:53,508 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 14:59:53,508 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 633 [2021-03-26 14:59:53,509 INFO L480 AbstractCegarLoop]: Abstraction has has 83 places, 126 transitions, 778 flow [2021-03-26 14:59:53,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 38.375) internal successors, (307), 8 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 14:59:53,509 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 14:59:53,509 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 14:59:53,510 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-26 14:59:53,510 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-26 14:59:53,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 14:59:53,510 INFO L82 PathProgramCache]: Analyzing trace with hash -521920061, now seen corresponding path program 3 times [2021-03-26 14:59:53,510 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 14:59:53,510 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515460312] [2021-03-26 14:59:53,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 14:59:53,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 14:59:53,526 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 14:59:53,526 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 14:59:53,526 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 14:59:53,527 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 14:59:53,529 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 14:59:53,529 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 14:59:53,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 14:59:53,530 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515460312] [2021-03-26 14:59:53,530 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 14:59:53,530 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 14:59:53,530 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969000612] [2021-03-26 14:59:53,535 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 14:59:53,535 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 14:59:53,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 14:59:53,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 14:59:53,536 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 66 [2021-03-26 14:59:53,536 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 126 transitions, 778 flow. Second operand has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 14:59:53,537 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 14:59:53,537 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 66 [2021-03-26 14:59:53,537 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 14:59:53,670 INFO L129 PetriNetUnfolder]: 338/1396 cut-off events. [2021-03-26 14:59:53,670 INFO L130 PetriNetUnfolder]: For 1180/1204 co-relation queries the response was YES. [2021-03-26 14:59:53,677 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3778 conditions, 1396 events. 338/1396 cut-off events. For 1180/1204 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 12358 event pairs, 63 based on Foata normal form. 49/1378 useless extension candidates. Maximal degree in co-relation 3668. Up to 271 conditions per place. [2021-03-26 14:59:53,683 INFO L132 encePairwiseOnDemand]: 62/66 looper letters, 3 selfloop transitions, 25 changer transitions 0/126 dead transitions. [2021-03-26 14:59:53,683 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 126 transitions, 834 flow [2021-03-26 14:59:53,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 14:59:53,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 14:59:53,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 181 transitions. [2021-03-26 14:59:53,684 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9141414141414141 [2021-03-26 14:59:53,684 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 181 transitions. [2021-03-26 14:59:53,684 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 181 transitions. [2021-03-26 14:59:53,685 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 14:59:53,685 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 181 transitions. [2021-03-26 14:59:53,685 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 14:59:53,686 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 14:59:53,686 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 14:59:53,686 INFO L185 Difference]: Start difference. First operand has 83 places, 126 transitions, 778 flow. Second operand 3 states and 181 transitions. [2021-03-26 14:59:53,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 126 transitions, 834 flow [2021-03-26 14:59:53,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 126 transitions, 808 flow, removed 13 selfloop flow, removed 0 redundant places. [2021-03-26 14:59:53,697 INFO L241 Difference]: Finished difference. Result has 86 places, 126 transitions, 831 flow [2021-03-26 14:59:53,698 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=752, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=831, PETRI_PLACES=86, PETRI_TRANSITIONS=126} [2021-03-26 14:59:53,698 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 38 predicate places. [2021-03-26 14:59:53,698 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 14:59:53,698 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 86 places, 126 transitions, 831 flow [2021-03-26 14:59:53,698 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 86 places, 126 transitions, 831 flow [2021-03-26 14:59:53,702 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 86 places, 126 transitions, 831 flow [2021-03-26 14:59:53,824 INFO L129 PetriNetUnfolder]: 350/1380 cut-off events. [2021-03-26 14:59:53,824 INFO L130 PetriNetUnfolder]: For 1157/1168 co-relation queries the response was YES. [2021-03-26 14:59:53,830 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3746 conditions, 1380 events. 350/1380 cut-off events. For 1157/1168 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 12150 event pairs, 70 based on Foata normal form. 2/1321 useless extension candidates. Maximal degree in co-relation 3638. Up to 268 conditions per place. [2021-03-26 14:59:53,842 INFO L142 LiptonReduction]: Number of co-enabled transitions 1868 [2021-03-26 14:59:54,147 INFO L154 LiptonReduction]: Checked pairs total: 3396 [2021-03-26 14:59:54,147 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 14:59:54,148 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 450 [2021-03-26 14:59:54,152 INFO L480 AbstractCegarLoop]: Abstraction has has 86 places, 126 transitions, 833 flow [2021-03-26 14:59:54,152 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 14:59:54,152 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 14:59:54,152 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 14:59:54,152 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-26 14:59:54,153 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-26 14:59:54,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 14:59:54,153 INFO L82 PathProgramCache]: Analyzing trace with hash 1392032748, now seen corresponding path program 1 times [2021-03-26 14:59:54,153 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 14:59:54,154 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125524609] [2021-03-26 14:59:54,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 14:59:54,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 14:59:54,182 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 14:59:54,183 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 14:59:54,183 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 14:59:54,183 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 14:59:54,186 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 14:59:54,186 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 14:59:54,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 14:59:54,187 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125524609] [2021-03-26 14:59:54,187 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 14:59:54,187 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 14:59:54,187 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239784690] [2021-03-26 14:59:54,187 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 14:59:54,187 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 14:59:54,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 14:59:54,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 14:59:54,188 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 67 [2021-03-26 14:59:54,189 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 126 transitions, 833 flow. Second operand has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 14:59:54,189 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 14:59:54,189 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 67 [2021-03-26 14:59:54,189 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 14:59:54,339 INFO L129 PetriNetUnfolder]: 458/1778 cut-off events. [2021-03-26 14:59:54,339 INFO L130 PetriNetUnfolder]: For 1649/1673 co-relation queries the response was YES. [2021-03-26 14:59:54,348 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4871 conditions, 1778 events. 458/1778 cut-off events. For 1649/1673 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 16227 event pairs, 104 based on Foata normal form. 32/1695 useless extension candidates. Maximal degree in co-relation 4732. Up to 349 conditions per place. [2021-03-26 14:59:54,355 INFO L132 encePairwiseOnDemand]: 62/67 looper letters, 3 selfloop transitions, 12 changer transitions 0/125 dead transitions. [2021-03-26 14:59:54,356 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 125 transitions, 856 flow [2021-03-26 14:59:54,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 14:59:54,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 14:59:54,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 182 transitions. [2021-03-26 14:59:54,357 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9054726368159204 [2021-03-26 14:59:54,357 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 182 transitions. [2021-03-26 14:59:54,357 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 182 transitions. [2021-03-26 14:59:54,357 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 14:59:54,357 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 182 transitions. [2021-03-26 14:59:54,358 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 14:59:54,358 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 14:59:54,358 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 14:59:54,359 INFO L185 Difference]: Start difference. First operand has 86 places, 126 transitions, 833 flow. Second operand 3 states and 182 transitions. [2021-03-26 14:59:54,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 125 transitions, 856 flow [2021-03-26 14:59:54,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 125 transitions, 806 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 14:59:54,375 INFO L241 Difference]: Finished difference. Result has 87 places, 125 transitions, 816 flow [2021-03-26 14:59:54,375 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=776, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=816, PETRI_PLACES=87, PETRI_TRANSITIONS=125} [2021-03-26 14:59:54,375 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 39 predicate places. [2021-03-26 14:59:54,375 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 14:59:54,375 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 87 places, 125 transitions, 816 flow [2021-03-26 14:59:54,376 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 87 places, 125 transitions, 816 flow [2021-03-26 14:59:54,376 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 87 places, 125 transitions, 816 flow [2021-03-26 14:59:54,492 INFO L129 PetriNetUnfolder]: 446/1705 cut-off events. [2021-03-26 14:59:54,492 INFO L130 PetriNetUnfolder]: For 1436/1450 co-relation queries the response was YES. [2021-03-26 14:59:54,500 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4619 conditions, 1705 events. 446/1705 cut-off events. For 1436/1450 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 15539 event pairs, 114 based on Foata normal form. 5/1611 useless extension candidates. Maximal degree in co-relation 4488. Up to 331 conditions per place. [2021-03-26 14:59:54,517 INFO L142 LiptonReduction]: Number of co-enabled transitions 1794 [2021-03-26 14:59:55,020 INFO L154 LiptonReduction]: Checked pairs total: 1941 [2021-03-26 14:59:55,021 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-26 14:59:55,021 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 646 [2021-03-26 14:59:55,022 INFO L480 AbstractCegarLoop]: Abstraction has has 87 places, 125 transitions, 822 flow [2021-03-26 14:59:55,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 14:59:55,022 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 14:59:55,022 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 14:59:55,022 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-26 14:59:55,022 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-26 14:59:55,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 14:59:55,023 INFO L82 PathProgramCache]: Analyzing trace with hash 355761542, now seen corresponding path program 2 times [2021-03-26 14:59:55,023 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 14:59:55,023 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203987559] [2021-03-26 14:59:55,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 14:59:55,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 14:59:55,101 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 14:59:55,102 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-26 14:59:55,119 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 14:59:55,120 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 14:59:55,122 INFO L142 QuantifierPusher]: treesize reduction 17, result has 62.2 percent of original size [2021-03-26 14:59:55,125 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-26 14:59:55,132 INFO L142 QuantifierPusher]: treesize reduction 17, result has 59.5 percent of original size [2021-03-26 14:59:55,133 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-26 14:59:55,152 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 14:59:55,153 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 14:59:55,163 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 14:59:55,164 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 14:59:55,165 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 14:59:55,165 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 14:59:55,177 INFO L142 QuantifierPusher]: treesize reduction 5, result has 70.6 percent of original size [2021-03-26 14:59:55,177 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 14:59:55,190 INFO L142 QuantifierPusher]: treesize reduction 15, result has 46.4 percent of original size [2021-03-26 14:59:55,194 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 14:59:55,205 INFO L142 QuantifierPusher]: treesize reduction 8, result has 11.1 percent of original size [2021-03-26 14:59:55,206 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 14:59:55,206 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 14:59:55,206 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 14:59:55,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 14:59:55,207 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203987559] [2021-03-26 14:59:55,207 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 14:59:55,207 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-26 14:59:55,207 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940220625] [2021-03-26 14:59:55,207 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-26 14:59:55,208 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 14:59:55,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-26 14:59:55,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-03-26 14:59:55,209 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 70 [2021-03-26 14:59:55,209 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 125 transitions, 822 flow. Second operand has 8 states, 8 states have (on average 38.375) internal successors, (307), 8 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 14:59:55,209 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 14:59:55,209 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 70 [2021-03-26 14:59:55,209 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 14:59:55,779 INFO L129 PetriNetUnfolder]: 2046/4799 cut-off events. [2021-03-26 14:59:55,780 INFO L130 PetriNetUnfolder]: For 6854/6998 co-relation queries the response was YES. [2021-03-26 14:59:55,802 INFO L84 FinitePrefix]: Finished finitePrefix Result has 15485 conditions, 4799 events. 2046/4799 cut-off events. For 6854/6998 co-relation queries the response was YES. Maximal size of possible extension queue 245. Compared 41152 event pairs, 618 based on Foata normal form. 48/4625 useless extension candidates. Maximal degree in co-relation 15295. Up to 2312 conditions per place. [2021-03-26 14:59:55,831 INFO L132 encePairwiseOnDemand]: 58/70 looper letters, 120 selfloop transitions, 45 changer transitions 0/200 dead transitions. [2021-03-26 14:59:55,832 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 200 transitions, 1633 flow [2021-03-26 14:59:55,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 14:59:55,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 14:59:55,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 329 transitions. [2021-03-26 14:59:55,833 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6714285714285714 [2021-03-26 14:59:55,833 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 329 transitions. [2021-03-26 14:59:55,833 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 329 transitions. [2021-03-26 14:59:55,834 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 14:59:55,834 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 329 transitions. [2021-03-26 14:59:55,834 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 47.0) internal successors, (329), 7 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 14:59:55,835 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 70.0) internal successors, (560), 8 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 14:59:55,835 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 70.0) internal successors, (560), 8 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 14:59:55,836 INFO L185 Difference]: Start difference. First operand has 87 places, 125 transitions, 822 flow. Second operand 7 states and 329 transitions. [2021-03-26 14:59:55,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 200 transitions, 1633 flow [2021-03-26 14:59:55,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 200 transitions, 1587 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-26 14:59:55,874 INFO L241 Difference]: Finished difference. Result has 95 places, 153 transitions, 1181 flow [2021-03-26 14:59:55,874 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=796, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1181, PETRI_PLACES=95, PETRI_TRANSITIONS=153} [2021-03-26 14:59:55,874 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 47 predicate places. [2021-03-26 14:59:55,874 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 14:59:55,875 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 95 places, 153 transitions, 1181 flow [2021-03-26 14:59:55,875 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 95 places, 153 transitions, 1181 flow [2021-03-26 14:59:55,876 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 95 places, 153 transitions, 1181 flow [2021-03-26 14:59:56,036 INFO L129 PetriNetUnfolder]: 573/2121 cut-off events. [2021-03-26 14:59:56,037 INFO L130 PetriNetUnfolder]: For 2457/2481 co-relation queries the response was YES. [2021-03-26 14:59:56,047 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6433 conditions, 2121 events. 573/2121 cut-off events. For 2457/2481 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 19932 event pairs, 151 based on Foata normal form. 7/2009 useless extension candidates. Maximal degree in co-relation 6282. Up to 439 conditions per place. [2021-03-26 14:59:56,067 INFO L142 LiptonReduction]: Number of co-enabled transitions 2052 [2021-03-26 14:59:56,603 INFO L154 LiptonReduction]: Checked pairs total: 1905 [2021-03-26 14:59:56,603 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 14:59:56,604 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 730 [2021-03-26 14:59:56,604 INFO L480 AbstractCegarLoop]: Abstraction has has 95 places, 153 transitions, 1183 flow [2021-03-26 14:59:56,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 38.375) internal successors, (307), 8 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 14:59:56,604 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 14:59:56,605 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 14:59:56,605 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-26 14:59:56,605 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-26 14:59:56,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 14:59:56,605 INFO L82 PathProgramCache]: Analyzing trace with hash 899971332, now seen corresponding path program 3 times [2021-03-26 14:59:56,605 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 14:59:56,605 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084064770] [2021-03-26 14:59:56,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 14:59:56,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 14:59:56,634 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 14:59:56,634 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 14:59:56,648 INFO L142 QuantifierPusher]: treesize reduction 6, result has 62.5 percent of original size [2021-03-26 14:59:56,649 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 14:59:56,653 INFO L142 QuantifierPusher]: treesize reduction 6, result has 53.8 percent of original size [2021-03-26 14:59:56,653 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 14:59:56,659 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 14:59:56,659 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 14:59:56,666 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 14:59:56,666 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 14:59:56,668 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 14:59:56,668 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 14:59:56,675 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 14:59:56,676 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 14:59:56,684 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 14:59:56,684 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 14:59:56,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 14:59:56,687 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084064770] [2021-03-26 14:59:56,687 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 14:59:56,687 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-26 14:59:56,687 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028642855] [2021-03-26 14:59:56,688 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 14:59:56,689 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 14:59:56,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 14:59:56,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-03-26 14:59:56,690 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 71 [2021-03-26 14:59:56,691 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 153 transitions, 1183 flow. Second operand has 7 states, 7 states have (on average 38.714285714285715) internal successors, (271), 7 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 14:59:56,691 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 14:59:56,691 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 71 [2021-03-26 14:59:56,691 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 14:59:57,363 INFO L129 PetriNetUnfolder]: 2175/5128 cut-off events. [2021-03-26 14:59:57,363 INFO L130 PetriNetUnfolder]: For 9029/9262 co-relation queries the response was YES. [2021-03-26 14:59:57,385 INFO L84 FinitePrefix]: Finished finitePrefix Result has 17385 conditions, 5128 events. 2175/5128 cut-off events. For 9029/9262 co-relation queries the response was YES. Maximal size of possible extension queue 280. Compared 44919 event pairs, 577 based on Foata normal form. 89/4979 useless extension candidates. Maximal degree in co-relation 17186. Up to 1774 conditions per place. [2021-03-26 14:59:57,410 INFO L132 encePairwiseOnDemand]: 57/71 looper letters, 142 selfloop transitions, 59 changer transitions 0/236 dead transitions. [2021-03-26 14:59:57,410 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 236 transitions, 2109 flow [2021-03-26 14:59:57,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 14:59:57,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 14:59:57,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 343 transitions. [2021-03-26 14:59:57,412 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6901408450704225 [2021-03-26 14:59:57,412 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 343 transitions. [2021-03-26 14:59:57,412 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 343 transitions. [2021-03-26 14:59:57,413 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 14:59:57,413 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 343 transitions. [2021-03-26 14:59:57,414 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 49.0) internal successors, (343), 7 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 14:59:57,415 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 71.0) internal successors, (568), 8 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 14:59:57,415 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 71.0) internal successors, (568), 8 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 14:59:57,415 INFO L185 Difference]: Start difference. First operand has 95 places, 153 transitions, 1183 flow. Second operand 7 states and 343 transitions. [2021-03-26 14:59:57,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 236 transitions, 2109 flow [2021-03-26 14:59:57,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 236 transitions, 2095 flow, removed 7 selfloop flow, removed 0 redundant places. [2021-03-26 14:59:57,461 INFO L241 Difference]: Finished difference. Result has 106 places, 181 transitions, 1650 flow [2021-03-26 14:59:57,461 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=1147, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1650, PETRI_PLACES=106, PETRI_TRANSITIONS=181} [2021-03-26 14:59:57,461 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 58 predicate places. [2021-03-26 14:59:57,461 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 14:59:57,462 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 106 places, 181 transitions, 1650 flow [2021-03-26 14:59:57,462 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 106 places, 181 transitions, 1650 flow [2021-03-26 14:59:57,463 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 106 places, 181 transitions, 1650 flow [2021-03-26 14:59:57,634 INFO L129 PetriNetUnfolder]: 608/2224 cut-off events. [2021-03-26 14:59:57,634 INFO L130 PetriNetUnfolder]: For 3799/3858 co-relation queries the response was YES. [2021-03-26 14:59:57,647 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7332 conditions, 2224 events. 608/2224 cut-off events. For 3799/3858 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 21076 event pairs, 152 based on Foata normal form. 18/2094 useless extension candidates. Maximal degree in co-relation 7172. Up to 427 conditions per place. [2021-03-26 14:59:57,671 INFO L142 LiptonReduction]: Number of co-enabled transitions 2156 [2021-03-26 14:59:58,296 INFO L154 LiptonReduction]: Checked pairs total: 1535 [2021-03-26 14:59:58,297 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 14:59:58,297 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 836 [2021-03-26 14:59:58,298 INFO L480 AbstractCegarLoop]: Abstraction has has 106 places, 181 transitions, 1654 flow [2021-03-26 14:59:58,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 38.714285714285715) internal successors, (271), 7 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 14:59:58,298 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 14:59:58,298 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 14:59:58,298 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-26 14:59:58,299 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-26 14:59:58,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 14:59:58,299 INFO L82 PathProgramCache]: Analyzing trace with hash -324424872, now seen corresponding path program 1 times [2021-03-26 14:59:58,299 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 14:59:58,299 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105330793] [2021-03-26 14:59:58,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 14:59:58,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 14:59:58,347 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 14:59:58,348 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 14:59:58,351 INFO L142 QuantifierPusher]: treesize reduction 7, result has 68.2 percent of original size [2021-03-26 14:59:58,351 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-26 14:59:58,383 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 14:59:58,384 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 14:59:58,391 INFO L142 QuantifierPusher]: treesize reduction 7, result has 50.0 percent of original size [2021-03-26 14:59:58,392 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 14:59:58,400 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 14:59:58,401 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-26 14:59:58,422 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 14:59:58,422 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-26 14:59:58,444 INFO L142 QuantifierPusher]: treesize reduction 16, result has 54.3 percent of original size [2021-03-26 14:59:58,444 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-26 14:59:58,463 INFO L142 QuantifierPusher]: treesize reduction 16, result has 54.3 percent of original size [2021-03-26 14:59:58,464 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-26 14:59:58,483 INFO L142 QuantifierPusher]: treesize reduction 1, result has 87.5 percent of original size [2021-03-26 14:59:58,483 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 14:59:58,496 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 14:59:58,498 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 14:59:58,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 14:59:58,498 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105330793] [2021-03-26 14:59:58,498 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 14:59:58,499 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-03-26 14:59:58,499 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713504409] [2021-03-26 14:59:58,499 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-03-26 14:59:58,499 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 14:59:58,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-03-26 14:59:58,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-03-26 14:59:58,500 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 73 [2021-03-26 14:59:58,501 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 181 transitions, 1654 flow. Second operand has 11 states, 11 states have (on average 37.72727272727273) internal successors, (415), 11 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 14:59:58,501 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 14:59:58,501 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 73 [2021-03-26 14:59:58,501 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 15:00:00,016 INFO L129 PetriNetUnfolder]: 4666/10859 cut-off events. [2021-03-26 15:00:00,016 INFO L130 PetriNetUnfolder]: For 25396/25907 co-relation queries the response was YES. [2021-03-26 15:00:00,076 INFO L84 FinitePrefix]: Finished finitePrefix Result has 39109 conditions, 10859 events. 4666/10859 cut-off events. For 25396/25907 co-relation queries the response was YES. Maximal size of possible extension queue 625. Compared 109210 event pairs, 1389 based on Foata normal form. 96/10301 useless extension candidates. Maximal degree in co-relation 38924. Up to 3196 conditions per place. [2021-03-26 15:00:00,120 INFO L132 encePairwiseOnDemand]: 57/73 looper letters, 239 selfloop transitions, 129 changer transitions 0/403 dead transitions. [2021-03-26 15:00:00,120 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 403 transitions, 4165 flow [2021-03-26 15:00:00,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-03-26 15:00:00,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2021-03-26 15:00:00,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 635 transitions. [2021-03-26 15:00:00,122 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6213307240704501 [2021-03-26 15:00:00,122 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 635 transitions. [2021-03-26 15:00:00,122 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 635 transitions. [2021-03-26 15:00:00,123 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 15:00:00,123 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 635 transitions. [2021-03-26 15:00:00,231 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 45.357142857142854) internal successors, (635), 14 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 15:00:00,232 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 73.0) internal successors, (1095), 15 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 15:00:00,233 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 73.0) internal successors, (1095), 15 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 15:00:00,233 INFO L185 Difference]: Start difference. First operand has 106 places, 181 transitions, 1654 flow. Second operand 14 states and 635 transitions. [2021-03-26 15:00:00,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 403 transitions, 4165 flow [2021-03-26 15:00:00,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 403 transitions, 4139 flow, removed 13 selfloop flow, removed 0 redundant places. [2021-03-26 15:00:00,376 INFO L241 Difference]: Finished difference. Result has 131 places, 285 transitions, 3158 flow [2021-03-26 15:00:00,376 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=1642, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=3158, PETRI_PLACES=131, PETRI_TRANSITIONS=285} [2021-03-26 15:00:00,376 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 83 predicate places. [2021-03-26 15:00:00,376 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 15:00:00,376 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 131 places, 285 transitions, 3158 flow [2021-03-26 15:00:00,377 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 131 places, 285 transitions, 3158 flow [2021-03-26 15:00:00,378 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 131 places, 285 transitions, 3158 flow [2021-03-26 15:00:00,900 INFO L129 PetriNetUnfolder]: 1836/5529 cut-off events. [2021-03-26 15:00:00,900 INFO L130 PetriNetUnfolder]: For 16048/16223 co-relation queries the response was YES. [2021-03-26 15:00:00,931 INFO L84 FinitePrefix]: Finished finitePrefix Result has 20260 conditions, 5529 events. 1836/5529 cut-off events. For 16048/16223 co-relation queries the response was YES. Maximal size of possible extension queue 415. Compared 58636 event pairs, 497 based on Foata normal form. 51/5100 useless extension candidates. Maximal degree in co-relation 20028. Up to 1227 conditions per place. [2021-03-26 15:00:00,977 INFO L142 LiptonReduction]: Number of co-enabled transitions 3220 [2021-03-26 15:00:06,603 INFO L154 LiptonReduction]: Checked pairs total: 1322 [2021-03-26 15:00:06,603 INFO L156 LiptonReduction]: Total number of compositions: 10 [2021-03-26 15:00:06,603 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 6227 [2021-03-26 15:00:06,604 INFO L480 AbstractCegarLoop]: Abstraction has has 131 places, 285 transitions, 3178 flow [2021-03-26 15:00:06,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 37.72727272727273) internal successors, (415), 11 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 15:00:06,604 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 15:00:06,604 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 15:00:06,604 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-26 15:00:06,605 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-26 15:00:06,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 15:00:06,605 INFO L82 PathProgramCache]: Analyzing trace with hash 1840607342, now seen corresponding path program 2 times [2021-03-26 15:00:06,605 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 15:00:06,605 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411911635] [2021-03-26 15:00:06,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 15:00:06,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 15:00:06,630 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 15:00:06,630 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 15:00:06,634 INFO L142 QuantifierPusher]: treesize reduction 7, result has 72.0 percent of original size [2021-03-26 15:00:06,634 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-26 15:00:06,648 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 15:00:06,649 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-03-26 15:00:06,663 INFO L142 QuantifierPusher]: treesize reduction 19, result has 26.9 percent of original size [2021-03-26 15:00:06,664 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 15:00:06,672 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 15:00:06,672 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 15:00:06,683 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 15:00:06,684 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 15:00:06,699 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 15:00:06,700 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 15:00:06,713 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 15:00:06,713 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 15:00:06,725 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 15:00:06,726 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 15:00:06,741 INFO L142 QuantifierPusher]: treesize reduction 8, result has 50.0 percent of original size [2021-03-26 15:00:06,742 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-26 15:00:06,754 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 15:00:06,754 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 15:00:06,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 15:00:06,755 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411911635] [2021-03-26 15:00:06,755 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 15:00:06,755 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-03-26 15:00:06,755 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438653404] [2021-03-26 15:00:06,756 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-03-26 15:00:06,756 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 15:00:06,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-03-26 15:00:06,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-03-26 15:00:06,757 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 83 [2021-03-26 15:00:06,758 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 285 transitions, 3178 flow. Second operand has 12 states, 12 states have (on average 37.583333333333336) internal successors, (451), 12 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 15:00:06,758 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 15:00:06,758 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 83 [2021-03-26 15:00:06,758 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 15:00:08,769 INFO L129 PetriNetUnfolder]: 3832/9202 cut-off events. [2021-03-26 15:00:08,769 INFO L130 PetriNetUnfolder]: For 41906/42477 co-relation queries the response was YES. [2021-03-26 15:00:08,818 INFO L84 FinitePrefix]: Finished finitePrefix Result has 39782 conditions, 9202 events. 3832/9202 cut-off events. For 41906/42477 co-relation queries the response was YES. Maximal size of possible extension queue 556. Compared 91811 event pairs, 1161 based on Foata normal form. 305/8994 useless extension candidates. Maximal degree in co-relation 39579. Up to 2901 conditions per place. [2021-03-26 15:00:08,861 INFO L132 encePairwiseOnDemand]: 63/83 looper letters, 251 selfloop transitions, 184 changer transitions 0/470 dead transitions. [2021-03-26 15:00:08,861 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 470 transitions, 5704 flow [2021-03-26 15:00:08,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-03-26 15:00:08,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2021-03-26 15:00:08,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 947 transitions. [2021-03-26 15:00:08,865 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5433161216293746 [2021-03-26 15:00:08,865 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 947 transitions. [2021-03-26 15:00:08,865 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 947 transitions. [2021-03-26 15:00:08,865 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 15:00:08,865 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 947 transitions. [2021-03-26 15:00:08,867 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 45.095238095238095) internal successors, (947), 21 states have internal predecessors, (947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 15:00:08,870 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 83.0) internal successors, (1826), 22 states have internal predecessors, (1826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 15:00:08,870 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 83.0) internal successors, (1826), 22 states have internal predecessors, (1826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 15:00:08,870 INFO L185 Difference]: Start difference. First operand has 131 places, 285 transitions, 3178 flow. Second operand 21 states and 947 transitions. [2021-03-26 15:00:08,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 470 transitions, 5704 flow [2021-03-26 15:00:09,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 470 transitions, 5493 flow, removed 105 selfloop flow, removed 4 redundant places. [2021-03-26 15:00:09,175 INFO L241 Difference]: Finished difference. Result has 159 places, 347 transitions, 4375 flow [2021-03-26 15:00:09,175 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=2742, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=256, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=104, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=4375, PETRI_PLACES=159, PETRI_TRANSITIONS=347} [2021-03-26 15:00:09,175 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 111 predicate places. [2021-03-26 15:00:09,175 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 15:00:09,176 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 159 places, 347 transitions, 4375 flow [2021-03-26 15:00:09,176 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 159 places, 347 transitions, 4375 flow [2021-03-26 15:00:09,178 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 159 places, 347 transitions, 4375 flow [2021-03-26 15:00:09,757 INFO L129 PetriNetUnfolder]: 1656/5133 cut-off events. [2021-03-26 15:00:09,758 INFO L130 PetriNetUnfolder]: For 23660/23971 co-relation queries the response was YES. [2021-03-26 15:00:09,786 INFO L84 FinitePrefix]: Finished finitePrefix Result has 21953 conditions, 5133 events. 1656/5133 cut-off events. For 23660/23971 co-relation queries the response was YES. Maximal size of possible extension queue 331. Compared 53912 event pairs, 423 based on Foata normal form. 53/4778 useless extension candidates. Maximal degree in co-relation 21742. Up to 1090 conditions per place. [2021-03-26 15:00:09,835 INFO L142 LiptonReduction]: Number of co-enabled transitions 3688 [2021-03-26 15:00:13,138 INFO L154 LiptonReduction]: Checked pairs total: 807 [2021-03-26 15:00:13,138 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-26 15:00:13,138 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3963 [2021-03-26 15:00:13,139 INFO L480 AbstractCegarLoop]: Abstraction has has 159 places, 347 transitions, 4381 flow [2021-03-26 15:00:13,139 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 37.583333333333336) internal successors, (451), 12 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 15:00:13,139 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 15:00:13,139 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 15:00:13,139 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-26 15:00:13,139 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-26 15:00:13,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 15:00:13,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1005211925, now seen corresponding path program 4 times [2021-03-26 15:00:13,140 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 15:00:13,140 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680774871] [2021-03-26 15:00:13,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 15:00:13,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 15:00:13,168 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 15:00:13,168 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 15:00:13,173 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 15:00:13,173 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 15:00:13,177 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 15:00:13,178 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 15:00:13,184 INFO L142 QuantifierPusher]: treesize reduction 4, result has 78.9 percent of original size [2021-03-26 15:00:13,184 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-26 15:00:13,188 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 15:00:13,189 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-26 15:00:13,202 INFO L142 QuantifierPusher]: treesize reduction 5, result has 78.3 percent of original size [2021-03-26 15:00:13,203 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-26 15:00:13,218 INFO L142 QuantifierPusher]: treesize reduction 25, result has 47.9 percent of original size [2021-03-26 15:00:13,218 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-26 15:00:13,237 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 15:00:13,237 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 15:00:13,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 15:00:13,238 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680774871] [2021-03-26 15:00:13,238 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 15:00:13,238 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-26 15:00:13,238 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108559352] [2021-03-26 15:00:13,239 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-26 15:00:13,239 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 15:00:13,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-26 15:00:13,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2021-03-26 15:00:13,240 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 86 [2021-03-26 15:00:13,240 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 347 transitions, 4381 flow. Second operand has 8 states, 8 states have (on average 38.375) internal successors, (307), 8 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 15:00:13,240 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 15:00:13,240 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 86 [2021-03-26 15:00:13,241 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 15:00:16,057 INFO L129 PetriNetUnfolder]: 6678/16291 cut-off events. [2021-03-26 15:00:16,057 INFO L130 PetriNetUnfolder]: For 115287/116499 co-relation queries the response was YES. [2021-03-26 15:00:16,170 INFO L84 FinitePrefix]: Finished finitePrefix Result has 79592 conditions, 16291 events. 6678/16291 cut-off events. For 115287/116499 co-relation queries the response was YES. Maximal size of possible extension queue 997. Compared 180538 event pairs, 1679 based on Foata normal form. 282/15642 useless extension candidates. Maximal degree in co-relation 79273. Up to 2691 conditions per place. [2021-03-26 15:00:16,246 INFO L132 encePairwiseOnDemand]: 68/86 looper letters, 462 selfloop transitions, 285 changer transitions 2/784 dead transitions. [2021-03-26 15:00:16,246 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 784 transitions, 11109 flow [2021-03-26 15:00:16,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-03-26 15:00:16,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-03-26 15:00:16,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 593 transitions. [2021-03-26 15:00:16,249 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5746124031007752 [2021-03-26 15:00:16,249 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 593 transitions. [2021-03-26 15:00:16,249 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 593 transitions. [2021-03-26 15:00:16,249 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 15:00:16,249 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 593 transitions. [2021-03-26 15:00:16,251 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 49.416666666666664) internal successors, (593), 12 states have internal predecessors, (593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 15:00:16,253 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 86.0) internal successors, (1118), 13 states have internal predecessors, (1118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 15:00:16,253 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 86.0) internal successors, (1118), 13 states have internal predecessors, (1118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 15:00:16,254 INFO L185 Difference]: Start difference. First operand has 159 places, 347 transitions, 4381 flow. Second operand 12 states and 593 transitions. [2021-03-26 15:00:16,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 784 transitions, 11109 flow [2021-03-26 15:00:17,124 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 784 transitions, 10722 flow, removed 193 selfloop flow, removed 1 redundant places. [2021-03-26 15:00:17,135 INFO L241 Difference]: Finished difference. Result has 179 places, 586 transitions, 8639 flow [2021-03-26 15:00:17,135 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=4234, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=347, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=94, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=8639, PETRI_PLACES=179, PETRI_TRANSITIONS=586} [2021-03-26 15:00:17,135 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 131 predicate places. [2021-03-26 15:00:17,135 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 15:00:17,136 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 179 places, 586 transitions, 8639 flow [2021-03-26 15:00:17,136 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 179 places, 586 transitions, 8639 flow [2021-03-26 15:00:17,140 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 179 places, 586 transitions, 8639 flow [2021-03-26 15:00:18,007 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([108] L31-->L32: Formula: (or (not (< v_n3_2 v_n1_8)) (= v_n3_2 0)) InVars {n3=v_n3_2, n1=v_n1_8} OutVars{n3=v_n3_2, n1=v_n1_8} AuxVars[] AssignedVars[][585], [Black: 116#(and (<= n1 n3) (<= n3 n2) (<= 0 n2)), Black: 117#(and (<= n1 n2) (<= n3 n2) (<= 0 n2)), Black: 118#(and (<= n3 n2) (<= 0 n2)), Black: 119#(and (<= 1 n2) (<= (+ n3 1) n2)), Black: 120#(and (= n3 n2) (<= 1 n2)), Black: 121#(and (<= (+ n2 1) n3) (<= 1 n2)), Black: 256#(and (or (<= 2 n2) (<= 2 n3)) (<= 1 n1) (<= 0 n3) (<= n3 n1) (or (<= n1 n3) (<= n1 n2))), Black: 123#(and (<= n1 n3) (<= 1 n2) (<= (+ n3 1) n2)), Black: 258#(and (<= n1 n2) (<= (+ n3 1) n1) (<= 0 n3) (<= 3 n2)), Black: 260#(and (<= (+ n3 1) n1) (or (<= 2 n2) (<= 2 n3)) (<= 0 n3)), Black: 125#(and (<= n1 n2) (<= 1 n2) (<= (+ n3 1) n2)), Black: 232#(and (<= n1 n2) (<= (+ n3 1) n1) (<= 0 n3)), Black: 236#(and (<= n1 n3) (<= 1 n1)), Black: 238#(and (<= n1 n2) (<= (+ n3 1) n1) (<= 0 n3) (<= 2 n2)), Black: 242#(and (<= n1 n3) (or (<= 3 n2) (<= 2 n3)) (<= 1 n1)), Black: 139#e3, Black: 244#(and (or (<= 1 n3) (<= 2 n2)) (<= 1 n1) (<= 0 n3) (<= n3 n1)), Black: 246#(and (= n3 n1) (or (<= 2 n2) (<= 2 n3)) (<= 1 n1)), Black: 248#(and (or (<= n1 n2) (<= 2 n3)) (or (<= 1 n3) (<= 2 n2)) (<= 1 n1) (<= 0 n3) (<= n3 n1) (or (<= n1 n3) (<= n1 n2))), Black: 250#(and (<= n1 n3) (or (<= 2 n2) (<= 2 n3)) (<= 1 n1)), Black: 144#e1, Black: 252#(and (<= (+ n3 1) n1) (or (<= 1 n3) (<= 2 n2)) (<= 0 n3)), 147#true, Black: 222#(and (= n3 n1) (<= 1 n1)), Black: 254#(and (= n3 n1) (or (<= 3 n2) (<= 2 n3)) (<= 1 n1)), 280#(<= 0 n3), Black: 151#(and (<= n3 n2) (<= 0 n3)), Black: 152#(and (<= 0 n3) (<= (+ n3 1) n2)), Black: 153#(and (<= 1 n3) (< n3 (+ n2 1))), Black: 154#(and (<= 1 n3) (< n3 (+ n2 1)) (not (= n3 n2))), 32#L77true, 164#(and (<= n2 n3) (<= 0 n2)), Black: 288#(and (<= n1 n3) (<= 1 n3) (<= n3 (+ n2 1))), 38#L64true, Black: 290#(and (<= n1 n3) (<= 1 n3) (<= n3 n2)), Black: 292#(and (<= n1 n3) (<= 1 n3) (<= n3 n2) (not (= n3 n2))), 40#thread2EXITtrue, Black: 162#(and (<= n1 n2) (<= n3 n2) (<= n2 n3) (<= 0 n2)), Black: 279#(and (<= n1 n3) (<= 0 n3)), Black: 163#(and (= n3 n2) (<= 0 n2)), Black: 165#(and (<= n2 (+ n3 1)) (<= 1 n2)), Black: 281#(and (<= n3 n2) (<= 0 n3)), Black: 166#(and (<= n2 n3) (<= 1 n2)), Black: 282#(and (<= 1 n3) (<= n3 (+ n2 1))), Black: 283#(and (<= 1 n3) (<= n3 n2)), Black: 284#(and (<= 1 n3) (<= n3 n2) (not (= n3 n2))), Black: 286#(and (<= n1 n3) (<= n3 n2) (<= 0 n3)), 55#L32true, 185#(and (<= 0 n3) (<= n3 n1)), 67#true, Black: 178#(and (= n3 n1) (<= 1 n1)), Black: 195#(and (<= 1 n1) (<= 0 n3) (<= 2 n2)), Black: 197#(and (<= 1 n1) (<= 0 n3) (<= 3 n2)), Black: 201#(and (< n2 n1) (<= 0 n3) (<= 3 n2)), Black: 187#(and (<= (+ n3 1) n1) (<= 0 n3)), Black: 189#(and (<= 1 n1) (<= 0 n3) (or (<= n1 n3) (<= 2 n2))), Black: 191#(and (<= 1 n1) (<= 0 n3) (or (<= (+ n1 1) n3) (<= 2 n2))), Black: 175#(<= 0 n3), Black: 83#(and (<= i3 0) (<= 2 i) (<= i1 1) (<= i 2) (<= 0 i3) (<= 1 i1)), Black: 69#(and (<= i 0) (<= 0 i)), Black: 79#(and (<= i3 0) (<= 1 i) (<= i 1) (<= 0 i3)), 95#true, 230#(and (<= (+ n3 1) n1) (<= 0 n3)), Black: 97#(and (<= n1 n3) (<= 0 n3) (<= n2 n1) (<= n3 n1)), Black: 98#(and (<= (+ n3 1) n1) (<= 1 n1) (<= (+ n2 1) n1)), Black: 99#(and (<= (+ n3 1) n1) (<= 1 n1) (= n2 n1)), Black: 101#(and (<= 1 n1) (<= (+ n1 1) n2)), Black: 111#e2, 114#true]) [2021-03-26 15:00:18,008 INFO L384 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2021-03-26 15:00:18,008 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2021-03-26 15:00:18,008 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2021-03-26 15:00:18,008 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2021-03-26 15:00:18,135 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([108] L31-->L32: Formula: (or (not (< v_n3_2 v_n1_8)) (= v_n3_2 0)) InVars {n3=v_n3_2, n1=v_n1_8} OutVars{n3=v_n3_2, n1=v_n1_8} AuxVars[] AssignedVars[][585], [Black: 116#(and (<= n1 n3) (<= n3 n2) (<= 0 n2)), Black: 117#(and (<= n1 n2) (<= n3 n2) (<= 0 n2)), Black: 118#(and (<= n3 n2) (<= 0 n2)), Black: 119#(and (<= 1 n2) (<= (+ n3 1) n2)), Black: 120#(and (= n3 n2) (<= 1 n2)), Black: 121#(and (<= (+ n2 1) n3) (<= 1 n2)), Black: 256#(and (or (<= 2 n2) (<= 2 n3)) (<= 1 n1) (<= 0 n3) (<= n3 n1) (or (<= n1 n3) (<= n1 n2))), Black: 123#(and (<= n1 n3) (<= 1 n2) (<= (+ n3 1) n2)), Black: 258#(and (<= n1 n2) (<= (+ n3 1) n1) (<= 0 n3) (<= 3 n2)), Black: 260#(and (<= (+ n3 1) n1) (or (<= 2 n2) (<= 2 n3)) (<= 0 n3)), Black: 125#(and (<= n1 n2) (<= 1 n2) (<= (+ n3 1) n2)), Black: 230#(and (<= (+ n3 1) n1) (<= 0 n3)), Black: 232#(and (<= n1 n2) (<= (+ n3 1) n1) (<= 0 n3)), Black: 236#(and (<= n1 n3) (<= 1 n1)), Black: 238#(and (<= n1 n2) (<= (+ n3 1) n1) (<= 0 n3) (<= 2 n2)), Black: 242#(and (<= n1 n3) (or (<= 3 n2) (<= 2 n3)) (<= 1 n1)), Black: 139#e3, Black: 244#(and (or (<= 1 n3) (<= 2 n2)) (<= 1 n1) (<= 0 n3) (<= n3 n1)), Black: 246#(and (= n3 n1) (or (<= 2 n2) (<= 2 n3)) (<= 1 n1)), Black: 248#(and (or (<= n1 n2) (<= 2 n3)) (or (<= 1 n3) (<= 2 n2)) (<= 1 n1) (<= 0 n3) (<= n3 n1) (or (<= n1 n3) (<= n1 n2))), 17#L66true, Black: 250#(and (<= n1 n3) (or (<= 2 n2) (<= 2 n3)) (<= 1 n1)), Black: 252#(and (<= (+ n3 1) n1) (or (<= 1 n3) (<= 2 n2)) (<= 0 n3)), Black: 144#e1, 147#true, Black: 222#(and (= n3 n1) (<= 1 n1)), Black: 254#(and (= n3 n1) (or (<= 3 n2) (<= 2 n3)) (<= 1 n1)), 280#(<= 0 n3), Black: 151#(and (<= n3 n2) (<= 0 n3)), Black: 152#(and (<= 0 n3) (<= (+ n3 1) n2)), Black: 153#(and (<= 1 n3) (< n3 (+ n2 1))), Black: 154#(and (<= 1 n3) (< n3 (+ n2 1)) (not (= n3 n2))), 32#L77true, 164#(and (<= n2 n3) (<= 0 n2)), Black: 288#(and (<= n1 n3) (<= 1 n3) (<= n3 (+ n2 1))), Black: 290#(and (<= n1 n3) (<= 1 n3) (<= n3 n2)), 40#thread2EXITtrue, Black: 162#(and (<= n1 n2) (<= n3 n2) (<= n2 n3) (<= 0 n2)), Black: 292#(and (<= n1 n3) (<= 1 n3) (<= n3 n2) (not (= n3 n2))), Black: 279#(and (<= n1 n3) (<= 0 n3)), Black: 163#(and (= n3 n2) (<= 0 n2)), Black: 165#(and (<= n2 (+ n3 1)) (<= 1 n2)), Black: 281#(and (<= n3 n2) (<= 0 n3)), Black: 166#(and (<= n2 n3) (<= 1 n2)), Black: 282#(and (<= 1 n3) (<= n3 (+ n2 1))), Black: 283#(and (<= 1 n3) (<= n3 n2)), Black: 284#(and (<= 1 n3) (<= n3 n2) (not (= n3 n2))), Black: 286#(and (<= n1 n3) (<= n3 n2) (<= 0 n3)), 175#(<= 0 n3), 55#L32true, 67#true, Black: 178#(and (= n3 n1) (<= 1 n1)), Black: 195#(and (<= 1 n1) (<= 0 n3) (<= 2 n2)), Black: 197#(and (<= 1 n1) (<= 0 n3) (<= 3 n2)), Black: 185#(and (<= 0 n3) (<= n3 n1)), Black: 201#(and (< n2 n1) (<= 0 n3) (<= 3 n2)), Black: 187#(and (<= (+ n3 1) n1) (<= 0 n3)), Black: 189#(and (<= 1 n1) (<= 0 n3) (or (<= n1 n3) (<= 2 n2))), Black: 191#(and (<= 1 n1) (<= 0 n3) (or (<= (+ n1 1) n3) (<= 2 n2))), 219#(<= 0 n3), Black: 83#(and (<= i3 0) (<= 2 i) (<= i1 1) (<= i 2) (<= 0 i3) (<= 1 i1)), Black: 69#(and (<= i 0) (<= 0 i)), Black: 79#(and (<= i3 0) (<= 1 i) (<= i 1) (<= 0 i3)), 95#true, Black: 97#(and (<= n1 n3) (<= 0 n3) (<= n2 n1) (<= n3 n1)), Black: 98#(and (<= (+ n3 1) n1) (<= 1 n1) (<= (+ n2 1) n1)), Black: 99#(and (<= (+ n3 1) n1) (<= 1 n1) (= n2 n1)), Black: 101#(and (<= 1 n1) (<= (+ n1 1) n2)), Black: 111#e2, 114#true]) [2021-03-26 15:00:18,135 INFO L384 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2021-03-26 15:00:18,135 INFO L387 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2021-03-26 15:00:18,136 INFO L387 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2021-03-26 15:00:18,136 INFO L387 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2021-03-26 15:00:18,417 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([108] L31-->L32: Formula: (or (not (< v_n3_2 v_n1_8)) (= v_n3_2 0)) InVars {n3=v_n3_2, n1=v_n1_8} OutVars{n3=v_n3_2, n1=v_n1_8} AuxVars[] AssignedVars[][585], [Black: 116#(and (<= n1 n3) (<= n3 n2) (<= 0 n2)), Black: 117#(and (<= n1 n2) (<= n3 n2) (<= 0 n2)), Black: 118#(and (<= n3 n2) (<= 0 n2)), Black: 119#(and (<= 1 n2) (<= (+ n3 1) n2)), Black: 120#(and (= n3 n2) (<= 1 n2)), Black: 121#(and (<= (+ n2 1) n3) (<= 1 n2)), Black: 256#(and (or (<= 2 n2) (<= 2 n3)) (<= 1 n1) (<= 0 n3) (<= n3 n1) (or (<= n1 n3) (<= n1 n2))), Black: 123#(and (<= n1 n3) (<= 1 n2) (<= (+ n3 1) n2)), Black: 258#(and (<= n1 n2) (<= (+ n3 1) n1) (<= 0 n3) (<= 3 n2)), Black: 125#(and (<= n1 n2) (<= 1 n2) (<= (+ n3 1) n2)), Black: 260#(and (<= (+ n3 1) n1) (or (<= 2 n2) (<= 2 n3)) (<= 0 n3)), Black: 232#(and (<= n1 n2) (<= (+ n3 1) n1) (<= 0 n3)), Black: 236#(and (<= n1 n3) (<= 1 n1)), Black: 238#(and (<= n1 n2) (<= (+ n3 1) n1) (<= 0 n3) (<= 2 n2)), Black: 242#(and (<= n1 n3) (or (<= 3 n2) (<= 2 n3)) (<= 1 n1)), Black: 139#e3, Black: 244#(and (or (<= 1 n3) (<= 2 n2)) (<= 1 n1) (<= 0 n3) (<= n3 n1)), Black: 246#(and (= n3 n1) (or (<= 2 n2) (<= 2 n3)) (<= 1 n1)), Black: 248#(and (or (<= n1 n2) (<= 2 n3)) (or (<= 1 n3) (<= 2 n2)) (<= 1 n1) (<= 0 n3) (<= n3 n1) (or (<= n1 n3) (<= n1 n2))), Black: 250#(and (<= n1 n3) (or (<= 2 n2) (<= 2 n3)) (<= 1 n1)), Black: 144#e1, Black: 252#(and (<= (+ n3 1) n1) (or (<= 1 n3) (<= 2 n2)) (<= 0 n3)), Black: 222#(and (= n3 n1) (<= 1 n1)), 147#true, Black: 254#(and (= n3 n1) (or (<= 3 n2) (<= 2 n3)) (<= 1 n1)), 280#(<= 0 n3), Black: 151#(and (<= n3 n2) (<= 0 n3)), Black: 152#(and (<= 0 n3) (<= (+ n3 1) n2)), Black: 153#(and (<= 1 n3) (< n3 (+ n2 1))), Black: 154#(and (<= 1 n3) (< n3 (+ n2 1)) (not (= n3 n2))), 32#L77true, 160#true, Black: 288#(and (<= n1 n3) (<= 1 n3) (<= n3 (+ n2 1))), Black: 290#(and (<= n1 n3) (<= 1 n3) (<= n3 n2)), Black: 292#(and (<= n1 n3) (<= 1 n3) (<= n3 n2) (not (= n3 n2))), 40#thread2EXITtrue, Black: 162#(and (<= n1 n2) (<= n3 n2) (<= n2 n3) (<= 0 n2)), Black: 279#(and (<= n1 n3) (<= 0 n3)), Black: 163#(and (= n3 n2) (<= 0 n2)), Black: 164#(and (<= n2 n3) (<= 0 n2)), Black: 165#(and (<= n2 (+ n3 1)) (<= 1 n2)), Black: 281#(and (<= n3 n2) (<= 0 n3)), Black: 166#(and (<= n2 n3) (<= 1 n2)), Black: 282#(and (<= 1 n3) (<= n3 (+ n2 1))), Black: 283#(and (<= 1 n3) (<= n3 n2)), Black: 284#(and (<= 1 n3) (<= n3 n2) (not (= n3 n2))), Black: 286#(and (<= n1 n3) (<= n3 n2) (<= 0 n3)), 50#thread3EXITtrue, 55#L32true, 185#(and (<= 0 n3) (<= n3 n1)), 67#true, Black: 178#(and (= n3 n1) (<= 1 n1)), Black: 195#(and (<= 1 n1) (<= 0 n3) (<= 2 n2)), Black: 197#(and (<= 1 n1) (<= 0 n3) (<= 3 n2)), Black: 201#(and (< n2 n1) (<= 0 n3) (<= 3 n2)), Black: 187#(and (<= (+ n3 1) n1) (<= 0 n3)), Black: 189#(and (<= 1 n1) (<= 0 n3) (or (<= n1 n3) (<= 2 n2))), Black: 191#(and (<= 1 n1) (<= 0 n3) (or (<= (+ n1 1) n3) (<= 2 n2))), Black: 175#(<= 0 n3), Black: 83#(and (<= i3 0) (<= 2 i) (<= i1 1) (<= i 2) (<= 0 i3) (<= 1 i1)), Black: 69#(and (<= i 0) (<= 0 i)), Black: 79#(and (<= i3 0) (<= 1 i) (<= i 1) (<= 0 i3)), 95#true, 230#(and (<= (+ n3 1) n1) (<= 0 n3)), Black: 97#(and (<= n1 n3) (<= 0 n3) (<= n2 n1) (<= n3 n1)), Black: 98#(and (<= (+ n3 1) n1) (<= 1 n1) (<= (+ n2 1) n1)), Black: 99#(and (<= (+ n3 1) n1) (<= 1 n1) (= n2 n1)), Black: 101#(and (<= 1 n1) (<= (+ n1 1) n2)), Black: 111#e2, 114#true]) [2021-03-26 15:00:18,417 INFO L384 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2021-03-26 15:00:18,417 INFO L387 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2021-03-26 15:00:18,417 INFO L387 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2021-03-26 15:00:18,417 INFO L387 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2021-03-26 15:00:18,489 INFO L129 PetriNetUnfolder]: 3387/10148 cut-off events. [2021-03-26 15:00:18,489 INFO L130 PetriNetUnfolder]: For 80982/82084 co-relation queries the response was YES. [2021-03-26 15:00:18,561 INFO L84 FinitePrefix]: Finished finitePrefix Result has 49999 conditions, 10148 events. 3387/10148 cut-off events. For 80982/82084 co-relation queries the response was YES. Maximal size of possible extension queue 704. Compared 117684 event pairs, 616 based on Foata normal form. 361/9779 useless extension candidates. Maximal degree in co-relation 49619. Up to 1810 conditions per place. [2021-03-26 15:00:18,693 INFO L142 LiptonReduction]: Number of co-enabled transitions 6014 [2021-03-26 15:00:30,474 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2021-03-26 15:00:44,262 INFO L154 LiptonReduction]: Checked pairs total: 4916 [2021-03-26 15:00:44,263 INFO L156 LiptonReduction]: Total number of compositions: 25 [2021-03-26 15:00:44,263 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 27128 [2021-03-26 15:00:44,263 INFO L480 AbstractCegarLoop]: Abstraction has has 179 places, 586 transitions, 8689 flow [2021-03-26 15:00:44,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 38.375) internal successors, (307), 8 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 15:00:44,264 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 15:00:44,264 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 15:00:44,264 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-26 15:00:44,264 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-26 15:00:44,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 15:00:44,264 INFO L82 PathProgramCache]: Analyzing trace with hash 438081739, now seen corresponding path program 5 times [2021-03-26 15:00:44,264 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 15:00:44,264 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442711210] [2021-03-26 15:00:44,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 15:00:44,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 15:00:44,295 INFO L142 QuantifierPusher]: treesize reduction 31, result has 46.6 percent of original size [2021-03-26 15:00:44,296 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-03-26 15:00:44,314 INFO L142 QuantifierPusher]: treesize reduction 6, result has 68.4 percent of original size [2021-03-26 15:00:44,314 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 15:00:44,317 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 15:00:44,317 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 15:00:44,328 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 15:00:44,328 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 15:00:44,329 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 15:00:44,329 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 15:00:44,329 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 15:00:44,330 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 15:00:44,337 INFO L142 QuantifierPusher]: treesize reduction 9, result has 64.0 percent of original size [2021-03-26 15:00:44,338 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 15:00:44,353 INFO L142 QuantifierPusher]: treesize reduction 6, result has 14.3 percent of original size [2021-03-26 15:00:44,353 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 15:00:44,356 INFO L142 QuantifierPusher]: treesize reduction 13, result has 7.1 percent of original size [2021-03-26 15:00:44,356 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 15:00:44,356 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 15:00:44,356 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 15:00:44,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 15:00:44,357 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442711210] [2021-03-26 15:00:44,357 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 15:00:44,357 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 15:00:44,357 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343617639] [2021-03-26 15:00:44,357 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 15:00:44,357 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 15:00:44,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 15:00:44,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-03-26 15:00:44,358 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 111 [2021-03-26 15:00:44,359 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 586 transitions, 8689 flow. Second operand has 6 states, 6 states have (on average 39.166666666666664) internal successors, (235), 6 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 15:00:44,359 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 15:00:44,359 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 111 [2021-03-26 15:00:44,359 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 15:00:47,520 INFO L129 PetriNetUnfolder]: 6136/15174 cut-off events. [2021-03-26 15:00:47,520 INFO L130 PetriNetUnfolder]: For 155810/157791 co-relation queries the response was YES. [2021-03-26 15:00:47,625 INFO L84 FinitePrefix]: Finished finitePrefix Result has 84186 conditions, 15174 events. 6136/15174 cut-off events. For 155810/157791 co-relation queries the response was YES. Maximal size of possible extension queue 993. Compared 168793 event pairs, 2227 based on Foata normal form. 272/14635 useless extension candidates. Maximal degree in co-relation 83806. Up to 8610 conditions per place. [2021-03-26 15:00:47,682 INFO L132 encePairwiseOnDemand]: 97/111 looper letters, 557 selfloop transitions, 68 changer transitions 1/661 dead transitions. [2021-03-26 15:00:47,682 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 661 transitions, 10867 flow [2021-03-26 15:00:47,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 15:00:47,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 15:00:47,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 314 transitions. [2021-03-26 15:00:47,684 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.47147147147147145 [2021-03-26 15:00:47,684 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 314 transitions. [2021-03-26 15:00:47,684 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 314 transitions. [2021-03-26 15:00:47,684 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 15:00:47,684 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 314 transitions. [2021-03-26 15:00:47,685 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 52.333333333333336) internal successors, (314), 6 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 15:00:47,686 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 111.0) internal successors, (777), 7 states have internal predecessors, (777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 15:00:47,686 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 111.0) internal successors, (777), 7 states have internal predecessors, (777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 15:00:47,686 INFO L185 Difference]: Start difference. First operand has 179 places, 586 transitions, 8689 flow. Second operand 6 states and 314 transitions. [2021-03-26 15:00:47,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 661 transitions, 10867 flow [2021-03-26 15:00:48,905 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 661 transitions, 10722 flow, removed 72 selfloop flow, removed 1 redundant places. [2021-03-26 15:00:48,913 INFO L241 Difference]: Finished difference. Result has 187 places, 592 transitions, 8896 flow [2021-03-26 15:00:48,914 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=8345, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=575, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=507, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=8896, PETRI_PLACES=187, PETRI_TRANSITIONS=592} [2021-03-26 15:00:48,914 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 139 predicate places. [2021-03-26 15:00:48,914 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 15:00:48,914 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 187 places, 592 transitions, 8896 flow [2021-03-26 15:00:48,914 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 187 places, 592 transitions, 8896 flow [2021-03-26 15:00:48,917 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 187 places, 592 transitions, 8896 flow [2021-03-26 15:00:50,025 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L65-->L66: Formula: (or (= v_n2_14 0) (and (not (< v_n2_14 v_n3_13)) (not (= v_n2_14 v_n3_13)))) InVars {n2=v_n2_14, n3=v_n3_13} OutVars{n2=v_n2_14, n3=v_n3_13} AuxVars[] AssignedVars[][466], [Black: 116#(and (<= n1 n3) (<= n3 n2) (<= 0 n2)), Black: 117#(and (<= n1 n2) (<= n3 n2) (<= 0 n2)), Black: 118#(and (<= n3 n2) (<= 0 n2)), Black: 119#(and (<= 1 n2) (<= (+ n3 1) n2)), Black: 120#(and (= n3 n2) (<= 1 n2)), Black: 256#(and (or (<= 2 n2) (<= 2 n3)) (<= 1 n1) (<= 0 n3) (<= n3 n1) (or (<= n1 n3) (<= n1 n2))), Black: 121#(and (<= (+ n2 1) n3) (<= 1 n2)), Black: 258#(and (<= n1 n2) (<= (+ n3 1) n1) (<= 0 n3) (<= 3 n2)), Black: 123#(and (<= n1 n3) (<= 1 n2) (<= (+ n3 1) n2)), Black: 260#(and (<= (+ n3 1) n1) (or (<= 2 n2) (<= 2 n3)) (<= 0 n3)), Black: 125#(and (<= n1 n2) (<= 1 n2) (<= (+ n3 1) n2)), Black: 230#(and (<= (+ n3 1) n1) (<= 0 n3)), Black: 232#(and (<= n1 n2) (<= (+ n3 1) n1) (<= 0 n3)), 10#thread1EXITtrue, Black: 236#(and (<= n1 n3) (<= 1 n1)), Black: 238#(and (<= n1 n2) (<= (+ n3 1) n1) (<= 0 n3) (<= 2 n2)), Black: 139#e3, Black: 242#(and (<= n1 n3) (or (<= 3 n2) (<= 2 n3)) (<= 1 n1)), Black: 244#(and (or (<= 1 n3) (<= 2 n2)) (<= 1 n1) (<= 0 n3) (<= n3 n1)), Black: 246#(and (= n3 n1) (or (<= 2 n2) (<= 2 n3)) (<= 1 n1)), Black: 248#(and (or (<= n1 n2) (<= 2 n3)) (or (<= 1 n3) (<= 2 n2)) (<= 1 n1) (<= 0 n3) (<= n3 n1) (or (<= n1 n3) (<= n1 n2))), Black: 250#(and (<= n1 n3) (or (<= 2 n2) (<= 2 n3)) (<= 1 n1)), 17#L66true, Black: 252#(and (<= (+ n3 1) n1) (or (<= 1 n3) (<= 2 n2)) (<= 0 n3)), Black: 144#e1, 147#true, Black: 222#(and (= n3 n1) (<= 1 n1)), Black: 254#(and (= n3 n1) (or (<= 3 n2) (<= 2 n3)) (<= 1 n1)), 279#(and (<= n1 n3) (<= 0 n3)), Black: 151#(and (<= n3 n2) (<= 0 n3)), Black: 152#(and (<= 0 n3) (<= (+ n3 1) n2)), Black: 153#(and (<= 1 n3) (< n3 (+ n2 1))), Black: 154#(and (<= 1 n3) (< n3 (+ n2 1)) (not (= n3 n2))), 32#L77true, 164#(and (<= n2 n3) (<= 0 n2)), Black: 288#(and (<= n1 n3) (<= 1 n3) (<= n3 (+ n2 1))), Black: 290#(and (<= n1 n3) (<= 1 n3) (<= n3 n2)), 40#thread2EXITtrue, Black: 292#(and (<= n1 n3) (<= 1 n3) (<= n3 n2) (not (= n3 n2))), Black: 162#(and (<= n1 n2) (<= n3 n2) (<= n2 n3) (<= 0 n2)), Black: 163#(and (= n3 n2) (<= 0 n2)), Black: 280#(<= 0 n3), Black: 165#(and (<= n2 (+ n3 1)) (<= 1 n2)), Black: 281#(and (<= n3 n2) (<= 0 n3)), Black: 282#(and (<= 1 n3) (<= n3 (+ n2 1))), Black: 166#(and (<= n2 n3) (<= 1 n2)), Black: 283#(and (<= 1 n3) (<= n3 n2)), Black: 284#(and (<= 1 n3) (<= n3 n2) (not (= n3 n2))), Black: 286#(and (<= n1 n3) (<= n3 n2) (<= 0 n3)), 175#(<= 0 n3), 304#true, Black: 306#(and (<= n1 n2) (< n2 (+ n3 1)) (<= n3 n2) (<= 0 n2) (<= n2 0)), Black: 307#(and (<= n2 n3) (<= n3 0) (<= 0 n2)), Black: 308#(and (<= 0 n2) (<= (+ n2 1) n3) (<= n3 1)), Black: 309#(and (< n2 (+ n3 1)) (<= n3 n2) (<= 1 n2)), 67#true, Black: 178#(and (= n3 n1) (<= 1 n1)), Black: 195#(and (<= 1 n1) (<= 0 n3) (<= 2 n2)), Black: 197#(and (<= 1 n1) (<= 0 n3) (<= 3 n2)), Black: 185#(and (<= 0 n3) (<= n3 n1)), Black: 201#(and (< n2 n1) (<= 0 n3) (<= 3 n2)), Black: 187#(and (<= (+ n3 1) n1) (<= 0 n3)), Black: 189#(and (<= 1 n1) (<= 0 n3) (or (<= n1 n3) (<= 2 n2))), Black: 191#(and (<= 1 n1) (<= 0 n3) (or (<= (+ n1 1) n3) (<= 2 n2))), Black: 83#(and (<= i3 0) (<= 2 i) (<= i1 1) (<= i 2) (<= 0 i3) (<= 1 i1)), 219#(<= 0 n3), Black: 69#(and (<= i 0) (<= 0 i)), Black: 79#(and (<= i3 0) (<= 1 i) (<= i 1) (<= 0 i3)), 95#true, Black: 97#(and (<= n1 n3) (<= 0 n3) (<= n2 n1) (<= n3 n1)), Black: 98#(and (<= (+ n3 1) n1) (<= 1 n1) (<= (+ n2 1) n1)), Black: 99#(and (<= (+ n3 1) n1) (<= 1 n1) (= n2 n1)), Black: 101#(and (<= 1 n1) (<= (+ n1 1) n2)), Black: 111#e2, 114#true]) [2021-03-26 15:00:50,025 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is not cut-off event [2021-03-26 15:00:50,025 INFO L387 tUnfolder$Statistics]: existing Event has 30 ancestors and is not cut-off event [2021-03-26 15:00:50,025 INFO L387 tUnfolder$Statistics]: existing Event has 30 ancestors and is not cut-off event [2021-03-26 15:00:50,025 INFO L387 tUnfolder$Statistics]: existing Event has 30 ancestors and is not cut-off event [2021-03-26 15:00:50,062 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([108] L31-->L32: Formula: (or (not (< v_n3_2 v_n1_8)) (= v_n3_2 0)) InVars {n3=v_n3_2, n1=v_n1_8} OutVars{n3=v_n3_2, n1=v_n1_8} AuxVars[] AssignedVars[][590], [Black: 116#(and (<= n1 n3) (<= n3 n2) (<= 0 n2)), Black: 117#(and (<= n1 n2) (<= n3 n2) (<= 0 n2)), Black: 118#(and (<= n3 n2) (<= 0 n2)), Black: 119#(and (<= 1 n2) (<= (+ n3 1) n2)), Black: 120#(and (= n3 n2) (<= 1 n2)), Black: 121#(and (<= (+ n2 1) n3) (<= 1 n2)), Black: 256#(and (or (<= 2 n2) (<= 2 n3)) (<= 1 n1) (<= 0 n3) (<= n3 n1) (or (<= n1 n3) (<= n1 n2))), Black: 123#(and (<= n1 n3) (<= 1 n2) (<= (+ n3 1) n2)), Black: 258#(and (<= n1 n2) (<= (+ n3 1) n1) (<= 0 n3) (<= 3 n2)), Black: 260#(and (<= (+ n3 1) n1) (or (<= 2 n2) (<= 2 n3)) (<= 0 n3)), Black: 125#(and (<= n1 n2) (<= 1 n2) (<= (+ n3 1) n2)), Black: 232#(and (<= n1 n2) (<= (+ n3 1) n1) (<= 0 n3)), Black: 236#(and (<= n1 n3) (<= 1 n1)), Black: 238#(and (<= n1 n2) (<= (+ n3 1) n1) (<= 0 n3) (<= 2 n2)), Black: 242#(and (<= n1 n3) (or (<= 3 n2) (<= 2 n3)) (<= 1 n1)), Black: 139#e3, Black: 244#(and (or (<= 1 n3) (<= 2 n2)) (<= 1 n1) (<= 0 n3) (<= n3 n1)), Black: 246#(and (= n3 n1) (or (<= 2 n2) (<= 2 n3)) (<= 1 n1)), Black: 248#(and (or (<= n1 n2) (<= 2 n3)) (or (<= 1 n3) (<= 2 n2)) (<= 1 n1) (<= 0 n3) (<= n3 n1) (or (<= n1 n3) (<= n1 n2))), Black: 250#(and (<= n1 n3) (or (<= 2 n2) (<= 2 n3)) (<= 1 n1)), Black: 252#(and (<= (+ n3 1) n1) (or (<= 1 n3) (<= 2 n2)) (<= 0 n3)), Black: 144#e1, 147#true, Black: 222#(and (= n3 n1) (<= 1 n1)), Black: 254#(and (= n3 n1) (or (<= 3 n2) (<= 2 n3)) (<= 1 n1)), 280#(<= 0 n3), Black: 151#(and (<= n3 n2) (<= 0 n3)), Black: 152#(and (<= 0 n3) (<= (+ n3 1) n2)), Black: 153#(and (<= 1 n3) (< n3 (+ n2 1))), Black: 154#(and (<= 1 n3) (< n3 (+ n2 1)) (not (= n3 n2))), 160#true, 32#L77true, Black: 288#(and (<= n1 n3) (<= 1 n3) (<= n3 (+ n2 1))), Black: 290#(and (<= n1 n3) (<= 1 n3) (<= n3 n2)), Black: 162#(and (<= n1 n2) (<= n3 n2) (<= n2 n3) (<= 0 n2)), Black: 292#(and (<= n1 n3) (<= 1 n3) (<= n3 n2) (not (= n3 n2))), 40#thread2EXITtrue, Black: 163#(and (= n3 n2) (<= 0 n2)), Black: 279#(and (<= n1 n3) (<= 0 n3)), Black: 164#(and (<= n2 n3) (<= 0 n2)), Black: 281#(and (<= n3 n2) (<= 0 n3)), Black: 165#(and (<= n2 (+ n3 1)) (<= 1 n2)), Black: 166#(and (<= n2 n3) (<= 1 n2)), Black: 282#(and (<= 1 n3) (<= n3 (+ n2 1))), Black: 283#(and (<= 1 n3) (<= n3 n2)), Black: 284#(and (<= 1 n3) (<= n3 n2) (not (= n3 n2))), Black: 286#(and (<= n1 n3) (<= n3 n2) (<= 0 n3)), 304#true, 50#thread3EXITtrue, Black: 306#(and (<= n1 n2) (< n2 (+ n3 1)) (<= n3 n2) (<= 0 n2) (<= n2 0)), 55#L32true, Black: 307#(and (<= n2 n3) (<= n3 0) (<= 0 n2)), 185#(and (<= 0 n3) (<= n3 n1)), Black: 308#(and (<= 0 n2) (<= (+ n2 1) n3) (<= n3 1)), Black: 309#(and (< n2 (+ n3 1)) (<= n3 n2) (<= 1 n2)), 67#true, Black: 178#(and (= n3 n1) (<= 1 n1)), Black: 195#(and (<= 1 n1) (<= 0 n3) (<= 2 n2)), Black: 197#(and (<= 1 n1) (<= 0 n3) (<= 3 n2)), Black: 201#(and (< n2 n1) (<= 0 n3) (<= 3 n2)), Black: 187#(and (<= (+ n3 1) n1) (<= 0 n3)), Black: 189#(and (<= 1 n1) (<= 0 n3) (or (<= n1 n3) (<= 2 n2))), Black: 191#(and (<= 1 n1) (<= 0 n3) (or (<= (+ n1 1) n3) (<= 2 n2))), Black: 175#(<= 0 n3), Black: 83#(and (<= i3 0) (<= 2 i) (<= i1 1) (<= i 2) (<= 0 i3) (<= 1 i1)), Black: 69#(and (<= i 0) (<= 0 i)), Black: 79#(and (<= i3 0) (<= 1 i) (<= i 1) (<= 0 i3)), 95#true, 230#(and (<= (+ n3 1) n1) (<= 0 n3)), Black: 97#(and (<= n1 n3) (<= 0 n3) (<= n2 n1) (<= n3 n1)), Black: 98#(and (<= (+ n3 1) n1) (<= 1 n1) (<= (+ n2 1) n1)), Black: 99#(and (<= (+ n3 1) n1) (<= 1 n1) (= n2 n1)), Black: 101#(and (<= 1 n1) (<= (+ n1 1) n2)), Black: 111#e2, 114#true]) [2021-03-26 15:00:50,062 INFO L384 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2021-03-26 15:00:50,062 INFO L387 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2021-03-26 15:00:50,062 INFO L387 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2021-03-26 15:00:50,062 INFO L387 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2021-03-26 15:00:50,090 INFO L129 PetriNetUnfolder]: 2924/9204 cut-off events. [2021-03-26 15:00:50,090 INFO L130 PetriNetUnfolder]: For 75143/76091 co-relation queries the response was YES. [2021-03-26 15:00:50,145 INFO L84 FinitePrefix]: Finished finitePrefix Result has 45671 conditions, 9204 events. 2924/9204 cut-off events. For 75143/76091 co-relation queries the response was YES. Maximal size of possible extension queue 651. Compared 107830 event pairs, 565 based on Foata normal form. 320/8909 useless extension candidates. Maximal degree in co-relation 45318. Up to 1572 conditions per place. [2021-03-26 15:00:50,225 INFO L142 LiptonReduction]: Number of co-enabled transitions 5590 [2021-03-26 15:01:10,833 INFO L154 LiptonReduction]: Checked pairs total: 2351 [2021-03-26 15:01:10,833 INFO L156 LiptonReduction]: Total number of compositions: 9 [2021-03-26 15:01:10,833 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 21919 [2021-03-26 15:01:10,833 INFO L480 AbstractCegarLoop]: Abstraction has has 187 places, 592 transitions, 8914 flow [2021-03-26 15:01:10,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 39.166666666666664) internal successors, (235), 6 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 15:01:10,834 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 15:01:10,834 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 15:01:10,834 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-26 15:01:10,834 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-26 15:01:10,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 15:01:10,834 INFO L82 PathProgramCache]: Analyzing trace with hash 188496307, now seen corresponding path program 1 times [2021-03-26 15:01:10,834 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 15:01:10,834 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536555588] [2021-03-26 15:01:10,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 15:01:10,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 15:01:11,011 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 15:01:11,012 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-26 15:01:11,030 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 15:01:11,030 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 15:01:11,044 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 15:01:11,045 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 15:01:11,057 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 15:01:11,057 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 15:01:11,067 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 15:01:11,067 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 15:01:11,069 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 15:01:11,069 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 15:01:11,082 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 15:01:11,083 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 15:01:11,092 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 15:01:11,093 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 15:01:11,103 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 15:01:11,105 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 15:01:11,115 INFO L142 QuantifierPusher]: treesize reduction 8, result has 66.7 percent of original size [2021-03-26 15:01:11,115 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 15:01:11,136 INFO L142 QuantifierPusher]: treesize reduction 1, result has 87.5 percent of original size [2021-03-26 15:01:11,136 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 15:01:11,145 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 15:01:11,145 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 15:01:11,145 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 15:01:11,146 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 15:01:11,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 15:01:11,146 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536555588] [2021-03-26 15:01:11,146 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 15:01:11,146 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-03-26 15:01:11,146 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258649045] [2021-03-26 15:01:11,147 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-03-26 15:01:11,147 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 15:01:11,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-03-26 15:01:11,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2021-03-26 15:01:11,148 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 120 [2021-03-26 15:01:11,148 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 592 transitions, 8914 flow. Second operand has 12 states, 12 states have (on average 37.583333333333336) internal successors, (451), 12 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 15:01:11,148 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 15:01:11,148 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 120 [2021-03-26 15:01:11,148 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 15:01:14,910 INFO L129 PetriNetUnfolder]: 6306/16596 cut-off events. [2021-03-26 15:01:14,910 INFO L130 PetriNetUnfolder]: For 178819/181040 co-relation queries the response was YES. [2021-03-26 15:01:15,024 INFO L84 FinitePrefix]: Finished finitePrefix Result has 92589 conditions, 16596 events. 6306/16596 cut-off events. For 178819/181040 co-relation queries the response was YES. Maximal size of possible extension queue 1075. Compared 194648 event pairs, 2078 based on Foata normal form. 837/16537 useless extension candidates. Maximal degree in co-relation 92480. Up to 3533 conditions per place. [2021-03-26 15:01:15,080 INFO L132 encePairwiseOnDemand]: 89/120 looper letters, 511 selfloop transitions, 402 changer transitions 4/952 dead transitions. [2021-03-26 15:01:15,080 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 952 transitions, 15797 flow [2021-03-26 15:01:15,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-03-26 15:01:15,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2021-03-26 15:01:15,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 701 transitions. [2021-03-26 15:01:15,084 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.4172619047619048 [2021-03-26 15:01:15,084 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 701 transitions. [2021-03-26 15:01:15,084 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 701 transitions. [2021-03-26 15:01:15,085 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 15:01:15,085 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 701 transitions. [2021-03-26 15:01:15,086 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 50.07142857142857) internal successors, (701), 14 states have internal predecessors, (701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 15:01:15,088 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 120.0) internal successors, (1800), 15 states have internal predecessors, (1800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 15:01:15,088 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 120.0) internal successors, (1800), 15 states have internal predecessors, (1800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 15:01:15,088 INFO L185 Difference]: Start difference. First operand has 187 places, 592 transitions, 8914 flow. Second operand 14 states and 701 transitions. [2021-03-26 15:01:15,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 952 transitions, 15797 flow [2021-03-26 15:01:16,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 952 transitions, 15611 flow, removed 41 selfloop flow, removed 4 redundant places. [2021-03-26 15:01:16,463 INFO L241 Difference]: Finished difference. Result has 204 places, 754 transitions, 13016 flow [2021-03-26 15:01:16,464 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=8275, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=558, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=237, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=250, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=13016, PETRI_PLACES=204, PETRI_TRANSITIONS=754} [2021-03-26 15:01:16,464 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 156 predicate places. [2021-03-26 15:01:16,464 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 15:01:16,464 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 204 places, 754 transitions, 13016 flow [2021-03-26 15:01:16,464 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 204 places, 754 transitions, 13016 flow [2021-03-26 15:01:16,469 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 204 places, 754 transitions, 13016 flow [2021-03-26 15:01:17,701 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([108] L31-->L32: Formula: (or (not (< v_n3_2 v_n1_8)) (= v_n3_2 0)) InVars {n3=v_n3_2, n1=v_n1_8} OutVars{n3=v_n3_2, n1=v_n1_8} AuxVars[] AssignedVars[][750], [Black: 116#(and (<= n1 n3) (<= n3 n2) (<= 0 n2)), Black: 117#(and (<= n1 n2) (<= n3 n2) (<= 0 n2)), Black: 118#(and (<= n3 n2) (<= 0 n2)), Black: 119#(and (<= 1 n2) (<= (+ n3 1) n2)), Black: 120#(and (= n3 n2) (<= 1 n2)), Black: 121#(and (<= (+ n2 1) n3) (<= 1 n2)), Black: 256#(and (or (<= 2 n2) (<= 2 n3)) (<= 1 n1) (<= 0 n3) (<= n3 n1) (or (<= n1 n3) (<= n1 n2))), Black: 123#(and (<= n1 n3) (<= 1 n2) (<= (+ n3 1) n2)), Black: 258#(and (<= n1 n2) (<= (+ n3 1) n1) (<= 0 n3) (<= 3 n2)), Black: 260#(and (<= (+ n3 1) n1) (or (<= 2 n2) (<= 2 n3)) (<= 0 n3)), Black: 125#(and (<= n1 n2) (<= 1 n2) (<= (+ n3 1) n2)), Black: 232#(and (<= n1 n2) (<= (+ n3 1) n1) (<= 0 n3)), Black: 236#(and (<= n1 n3) (<= 1 n1)), Black: 238#(and (<= n1 n2) (<= (+ n3 1) n1) (<= 0 n3) (<= 2 n2)), Black: 242#(and (<= n1 n3) (or (<= 3 n2) (<= 2 n3)) (<= 1 n1)), Black: 139#e3, Black: 244#(and (or (<= 1 n3) (<= 2 n2)) (<= 1 n1) (<= 0 n3) (<= n3 n1)), Black: 246#(and (= n3 n1) (or (<= 2 n2) (<= 2 n3)) (<= 1 n1)), Black: 248#(and (or (<= n1 n2) (<= 2 n3)) (or (<= 1 n3) (<= 2 n2)) (<= 1 n1) (<= 0 n3) (<= n3 n1) (or (<= n1 n3) (<= n1 n2))), Black: 250#(and (<= n1 n3) (or (<= 2 n2) (<= 2 n3)) (<= 1 n1)), Black: 144#e1, Black: 252#(and (<= (+ n3 1) n1) (or (<= 1 n3) (<= 2 n2)) (<= 0 n3)), 147#true, 280#(<= 0 n3), Black: 151#(and (<= n3 n2) (<= 0 n3)), Black: 152#(and (<= 0 n3) (<= (+ n3 1) n2)), Black: 153#(and (<= 1 n3) (< n3 (+ n2 1))), Black: 154#(and (<= 1 n3) (< n3 (+ n2 1)) (not (= n3 n2))), 32#L77true, 164#(and (<= n2 n3) (<= 0 n2)), Black: 288#(and (<= n1 n3) (<= 1 n3) (<= n3 (+ n2 1))), 38#L64true, Black: 290#(and (<= n1 n3) (<= 1 n3) (<= n3 n2)), Black: 162#(and (<= n1 n2) (<= n3 n2) (<= n2 n3) (<= 0 n2)), 40#thread2EXITtrue, Black: 292#(and (<= n1 n3) (<= 1 n3) (<= n3 n2) (not (= n3 n2))), Black: 163#(and (= n3 n2) (<= 0 n2)), Black: 279#(and (<= n1 n3) (<= 0 n3)), Black: 281#(and (<= n3 n2) (<= 0 n3)), Black: 165#(and (<= n2 (+ n3 1)) (<= 1 n2)), Black: 166#(and (<= n2 n3) (<= 1 n2)), Black: 282#(and (<= 1 n3) (<= n3 (+ n2 1))), Black: 283#(and (<= 1 n3) (<= n3 n2)), Black: 284#(and (<= 1 n3) (<= n3 n2) (not (= n3 n2))), Black: 286#(and (<= n1 n3) (<= n3 n2) (<= 0 n3)), Black: 306#(and (<= n1 n2) (< n2 (+ n3 1)) (<= n3 n2) (<= 0 n2) (<= n2 0)), 55#L32true, Black: 307#(and (<= n2 n3) (<= n3 0) (<= 0 n2)), Black: 308#(and (<= 0 n2) (<= (+ n2 1) n3) (<= n3 1)), 185#(and (<= 0 n3) (<= n3 n1)), Black: 309#(and (< n2 (+ n3 1)) (<= n3 n2) (<= 1 n2)), 67#true, 323#(and (<= 1 n1) (or (<= n1 n3) (<= 0 n2))), Black: 178#(and (= n3 n1) (<= 1 n1)), Black: 195#(and (<= 1 n1) (<= 0 n3) (<= 2 n2)), Black: 197#(and (<= 1 n1) (<= 0 n3) (<= 3 n2)), Black: 201#(and (< n2 n1) (<= 0 n3) (<= 3 n2)), Black: 320#(and (<= n1 n2) (<= 0 n1)), Black: 187#(and (<= (+ n3 1) n1) (<= 0 n3)), Black: 336#(and (<= 1 n1) (or (<= n1 n3) (<= 1 n2)) (or (<= n1 n3) (< n2 n1))), Black: 189#(and (<= 1 n1) (<= 0 n3) (or (<= n1 n3) (<= 2 n2))), Black: 321#(and (<= 1 n1) (<= n1 (+ n2 1))), Black: 191#(and (<= 1 n1) (<= 0 n3) (or (<= (+ n1 1) n3) (<= 2 n2))), Black: 175#(<= 0 n3), Black: 328#(and (<= n1 n2) (<= 1 n1)), Black: 332#(and (<= n1 n3) (<= n1 n2) (<= 1 n1)), Black: 317#(and (<= n1 n3) (<= n1 n2) (<= n2 n1) (<= n3 n1) (<= 0 n2)), Black: 83#(and (<= i3 0) (<= 2 i) (<= i1 1) (<= i 2) (<= 0 i3) (<= 1 i1)), Black: 318#(and (<= n1 n2) (<= n2 n1) (<= n3 n1) (<= 0 n2)), Black: 69#(and (<= i 0) (<= 0 i)), Black: 334#(and (<= n1 n2) (<= 1 n1) (<= n3 n1)), Black: 319#(and (<= n1 n2) (<= 0 n1) (<= n3 n1)), Black: 79#(and (<= i3 0) (<= 1 i) (<= i 1) (<= 0 i3)), 95#true, 230#(and (<= (+ n3 1) n1) (<= 0 n3)), Black: 97#(and (<= n1 n3) (<= 0 n3) (<= n2 n1) (<= n3 n1)), Black: 98#(and (<= (+ n3 1) n1) (<= 1 n1) (<= (+ n2 1) n1)), Black: 99#(and (<= (+ n3 1) n1) (<= 1 n1) (= n2 n1)), Black: 101#(and (<= 1 n1) (<= (+ n1 1) n2)), Black: 111#e2, 114#true]) [2021-03-26 15:01:17,701 INFO L384 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2021-03-26 15:01:17,701 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2021-03-26 15:01:17,701 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2021-03-26 15:01:17,701 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2021-03-26 15:01:18,100 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([108] L31-->L32: Formula: (or (not (< v_n3_2 v_n1_8)) (= v_n3_2 0)) InVars {n3=v_n3_2, n1=v_n1_8} OutVars{n3=v_n3_2, n1=v_n1_8} AuxVars[] AssignedVars[][750], [Black: 116#(and (<= n1 n3) (<= n3 n2) (<= 0 n2)), Black: 117#(and (<= n1 n2) (<= n3 n2) (<= 0 n2)), Black: 118#(and (<= n3 n2) (<= 0 n2)), Black: 119#(and (<= 1 n2) (<= (+ n3 1) n2)), Black: 120#(and (= n3 n2) (<= 1 n2)), Black: 256#(and (or (<= 2 n2) (<= 2 n3)) (<= 1 n1) (<= 0 n3) (<= n3 n1) (or (<= n1 n3) (<= n1 n2))), Black: 121#(and (<= (+ n2 1) n3) (<= 1 n2)), Black: 258#(and (<= n1 n2) (<= (+ n3 1) n1) (<= 0 n3) (<= 3 n2)), Black: 123#(and (<= n1 n3) (<= 1 n2) (<= (+ n3 1) n2)), Black: 125#(and (<= n1 n2) (<= 1 n2) (<= (+ n3 1) n2)), Black: 260#(and (<= (+ n3 1) n1) (or (<= 2 n2) (<= 2 n3)) (<= 0 n3)), Black: 232#(and (<= n1 n2) (<= (+ n3 1) n1) (<= 0 n3)), Black: 236#(and (<= n1 n3) (<= 1 n1)), Black: 238#(and (<= n1 n2) (<= (+ n3 1) n1) (<= 0 n3) (<= 2 n2)), Black: 139#e3, Black: 242#(and (<= n1 n3) (or (<= 3 n2) (<= 2 n3)) (<= 1 n1)), Black: 244#(and (or (<= 1 n3) (<= 2 n2)) (<= 1 n1) (<= 0 n3) (<= n3 n1)), Black: 246#(and (= n3 n1) (or (<= 2 n2) (<= 2 n3)) (<= 1 n1)), Black: 248#(and (or (<= n1 n2) (<= 2 n3)) (or (<= 1 n3) (<= 2 n2)) (<= 1 n1) (<= 0 n3) (<= n3 n1) (or (<= n1 n3) (<= n1 n2))), Black: 250#(and (<= n1 n3) (or (<= 2 n2) (<= 2 n3)) (<= 1 n1)), Black: 252#(and (<= (+ n3 1) n1) (or (<= 1 n3) (<= 2 n2)) (<= 0 n3)), Black: 144#e1, 147#true, 280#(<= 0 n3), Black: 151#(and (<= n3 n2) (<= 0 n3)), Black: 152#(and (<= 0 n3) (<= (+ n3 1) n2)), Black: 153#(and (<= 1 n3) (< n3 (+ n2 1))), Black: 154#(and (<= 1 n3) (< n3 (+ n2 1)) (not (= n3 n2))), 160#true, 32#L77true, Black: 288#(and (<= n1 n3) (<= 1 n3) (<= n3 (+ n2 1))), Black: 290#(and (<= n1 n3) (<= 1 n3) (<= n3 n2)), Black: 162#(and (<= n1 n2) (<= n3 n2) (<= n2 n3) (<= 0 n2)), 40#thread2EXITtrue, Black: 292#(and (<= n1 n3) (<= 1 n3) (<= n3 n2) (not (= n3 n2))), Black: 163#(and (= n3 n2) (<= 0 n2)), Black: 279#(and (<= n1 n3) (<= 0 n3)), Black: 164#(and (<= n2 n3) (<= 0 n2)), Black: 165#(and (<= n2 (+ n3 1)) (<= 1 n2)), Black: 281#(and (<= n3 n2) (<= 0 n3)), Black: 282#(and (<= 1 n3) (<= n3 (+ n2 1))), Black: 166#(and (<= n2 n3) (<= 1 n2)), Black: 283#(and (<= 1 n3) (<= n3 n2)), Black: 284#(and (<= 1 n3) (<= n3 n2) (not (= n3 n2))), Black: 286#(and (<= n1 n3) (<= n3 n2) (<= 0 n3)), 50#thread3EXITtrue, Black: 306#(and (<= n1 n2) (< n2 (+ n3 1)) (<= n3 n2) (<= 0 n2) (<= n2 0)), 55#L32true, Black: 307#(and (<= n2 n3) (<= n3 0) (<= 0 n2)), 185#(and (<= 0 n3) (<= n3 n1)), Black: 308#(and (<= 0 n2) (<= (+ n2 1) n3) (<= n3 1)), Black: 309#(and (< n2 (+ n3 1)) (<= n3 n2) (<= 1 n2)), 315#true, 67#true, Black: 178#(and (= n3 n1) (<= 1 n1)), Black: 195#(and (<= 1 n1) (<= 0 n3) (<= 2 n2)), Black: 197#(and (<= 1 n1) (<= 0 n3) (<= 3 n2)), Black: 201#(and (< n2 n1) (<= 0 n3) (<= 3 n2)), Black: 320#(and (<= n1 n2) (<= 0 n1)), Black: 187#(and (<= (+ n3 1) n1) (<= 0 n3)), Black: 336#(and (<= 1 n1) (or (<= n1 n3) (<= 1 n2)) (or (<= n1 n3) (< n2 n1))), Black: 189#(and (<= 1 n1) (<= 0 n3) (or (<= n1 n3) (<= 2 n2))), Black: 321#(and (<= 1 n1) (<= n1 (+ n2 1))), Black: 191#(and (<= 1 n1) (<= 0 n3) (or (<= (+ n1 1) n3) (<= 2 n2))), Black: 323#(and (<= 1 n1) (or (<= n1 n3) (<= 0 n2))), Black: 175#(<= 0 n3), Black: 328#(and (<= n1 n2) (<= 1 n1)), Black: 332#(and (<= n1 n3) (<= n1 n2) (<= 1 n1)), Black: 317#(and (<= n1 n3) (<= n1 n2) (<= n2 n1) (<= n3 n1) (<= 0 n2)), Black: 83#(and (<= i3 0) (<= 2 i) (<= i1 1) (<= i 2) (<= 0 i3) (<= 1 i1)), Black: 318#(and (<= n1 n2) (<= n2 n1) (<= n3 n1) (<= 0 n2)), Black: 334#(and (<= n1 n2) (<= 1 n1) (<= n3 n1)), Black: 69#(and (<= i 0) (<= 0 i)), Black: 319#(and (<= n1 n2) (<= 0 n1) (<= n3 n1)), Black: 79#(and (<= i3 0) (<= 1 i) (<= i 1) (<= 0 i3)), 95#true, 230#(and (<= (+ n3 1) n1) (<= 0 n3)), Black: 97#(and (<= n1 n3) (<= 0 n3) (<= n2 n1) (<= n3 n1)), Black: 98#(and (<= (+ n3 1) n1) (<= 1 n1) (<= (+ n2 1) n1)), Black: 99#(and (<= (+ n3 1) n1) (<= 1 n1) (= n2 n1)), Black: 101#(and (<= 1 n1) (<= (+ n1 1) n2)), Black: 111#e2, 114#true]) [2021-03-26 15:01:18,100 INFO L384 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2021-03-26 15:01:18,100 INFO L387 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2021-03-26 15:01:18,100 INFO L387 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2021-03-26 15:01:18,100 INFO L387 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2021-03-26 15:01:18,138 INFO L129 PetriNetUnfolder]: 3475/11399 cut-off events. [2021-03-26 15:01:18,138 INFO L130 PetriNetUnfolder]: For 134022/135717 co-relation queries the response was YES. [2021-03-26 15:01:18,215 INFO L84 FinitePrefix]: Finished finitePrefix Result has 62455 conditions, 11399 events. 3475/11399 cut-off events. For 134022/135717 co-relation queries the response was YES. Maximal size of possible extension queue 869. Compared 141661 event pairs, 828 based on Foata normal form. 453/11056 useless extension candidates. Maximal degree in co-relation 61930. Up to 1965 conditions per place. [2021-03-26 15:01:18,320 INFO L142 LiptonReduction]: Number of co-enabled transitions 6188 [2021-03-26 15:01:50,072 INFO L154 LiptonReduction]: Checked pairs total: 3626 [2021-03-26 15:01:50,072 INFO L156 LiptonReduction]: Total number of compositions: 12 [2021-03-26 15:01:50,072 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 33608 [2021-03-26 15:01:50,073 INFO L480 AbstractCegarLoop]: Abstraction has has 204 places, 754 transitions, 13040 flow [2021-03-26 15:01:50,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 37.583333333333336) internal successors, (451), 12 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 15:01:50,073 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 15:01:50,073 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 15:01:50,073 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-26 15:01:50,074 INFO L428 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-26 15:01:50,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 15:01:50,074 INFO L82 PathProgramCache]: Analyzing trace with hash 2093544197, now seen corresponding path program 1 times [2021-03-26 15:01:50,074 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 15:01:50,074 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764120548] [2021-03-26 15:01:50,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 15:01:50,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 15:01:50,110 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 15:01:50,111 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 15:01:50,124 INFO L142 QuantifierPusher]: treesize reduction 3, result has 76.9 percent of original size [2021-03-26 15:01:50,124 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 15:01:50,127 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 15:01:50,127 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 15:01:50,129 INFO L142 QuantifierPusher]: treesize reduction 7, result has 58.8 percent of original size [2021-03-26 15:01:50,130 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 15:01:50,132 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 15:01:50,132 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 15:01:50,138 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 15:01:50,139 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 15:01:50,146 INFO L142 QuantifierPusher]: treesize reduction 9, result has 57.1 percent of original size [2021-03-26 15:01:50,147 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 15:01:50,154 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 15:01:50,154 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 15:01:50,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 15:01:50,155 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764120548] [2021-03-26 15:01:50,155 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 15:01:50,155 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 15:01:50,155 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754148898] [2021-03-26 15:01:50,155 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 15:01:50,155 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 15:01:50,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 15:01:50,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-26 15:01:50,156 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 132 [2021-03-26 15:01:50,156 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 754 transitions, 13040 flow. Second operand has 6 states, 6 states have (on average 39.166666666666664) internal successors, (235), 6 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 15:01:50,156 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 15:01:50,156 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 132 [2021-03-26 15:01:50,156 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 15:01:54,131 INFO L129 PetriNetUnfolder]: 5796/15460 cut-off events. [2021-03-26 15:01:54,131 INFO L130 PetriNetUnfolder]: For 227596/229469 co-relation queries the response was YES. [2021-03-26 15:01:54,255 INFO L84 FinitePrefix]: Finished finitePrefix Result has 96384 conditions, 15460 events. 5796/15460 cut-off events. For 227596/229469 co-relation queries the response was YES. Maximal size of possible extension queue 990. Compared 180486 event pairs, 2271 based on Foata normal form. 488/15171 useless extension candidates. Maximal degree in co-relation 95921. Up to 8855 conditions per place. [2021-03-26 15:01:54,311 INFO L132 encePairwiseOnDemand]: 111/132 looper letters, 635 selfloop transitions, 152 changer transitions 2/824 dead transitions. [2021-03-26 15:01:54,311 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 824 transitions, 15688 flow [2021-03-26 15:01:54,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 15:01:54,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 15:01:54,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 370 transitions. [2021-03-26 15:01:54,312 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.4004329004329004 [2021-03-26 15:01:54,312 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 370 transitions. [2021-03-26 15:01:54,312 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 370 transitions. [2021-03-26 15:01:54,312 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 15:01:54,312 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 370 transitions. [2021-03-26 15:01:54,313 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 52.857142857142854) internal successors, (370), 7 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 15:01:54,314 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 132.0) internal successors, (1056), 8 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 15:01:54,314 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 132.0) internal successors, (1056), 8 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 15:01:54,314 INFO L185 Difference]: Start difference. First operand has 204 places, 754 transitions, 13040 flow. Second operand 7 states and 370 transitions. [2021-03-26 15:01:54,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 824 transitions, 15688 flow [2021-03-26 15:01:56,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 824 transitions, 15077 flow, removed 299 selfloop flow, removed 2 redundant places. [2021-03-26 15:01:56,076 INFO L241 Difference]: Finished difference. Result has 211 places, 755 transitions, 13173 flow [2021-03-26 15:01:56,077 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=11258, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=685, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=88, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=540, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=13173, PETRI_PLACES=211, PETRI_TRANSITIONS=755} [2021-03-26 15:01:56,077 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 163 predicate places. [2021-03-26 15:01:56,077 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 15:01:56,077 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 211 places, 755 transitions, 13173 flow [2021-03-26 15:01:56,077 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 211 places, 755 transitions, 13173 flow [2021-03-26 15:01:56,082 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 211 places, 755 transitions, 13173 flow [2021-03-26 15:01:57,203 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([108] L31-->L32: Formula: (or (not (< v_n3_2 v_n1_8)) (= v_n3_2 0)) InVars {n3=v_n3_2, n1=v_n1_8} OutVars{n3=v_n3_2, n1=v_n1_8} AuxVars[] AssignedVars[][752], [Black: 116#(and (<= n1 n3) (<= n3 n2) (<= 0 n2)), Black: 117#(and (<= n1 n2) (<= n3 n2) (<= 0 n2)), Black: 118#(and (<= n3 n2) (<= 0 n2)), Black: 119#(and (<= 1 n2) (<= (+ n3 1) n2)), Black: 120#(and (= n3 n2) (<= 1 n2)), Black: 121#(and (<= (+ n2 1) n3) (<= 1 n2)), Black: 123#(and (<= n1 n3) (<= 1 n2) (<= (+ n3 1) n2)), Black: 260#(and (<= (+ n3 1) n1) (or (<= 2 n2) (<= 2 n3)) (<= 0 n3)), Black: 125#(and (<= n1 n2) (<= 1 n2) (<= (+ n3 1) n2)), Black: 232#(and (<= n1 n2) (<= (+ n3 1) n1) (<= 0 n3)), Black: 236#(and (<= n1 n3) (<= 1 n1)), Black: 238#(and (<= n1 n2) (<= (+ n3 1) n1) (<= 0 n3) (<= 2 n2)), Black: 139#e3, Black: 242#(and (<= n1 n3) (or (<= 3 n2) (<= 2 n3)) (<= 1 n1)), Black: 244#(and (or (<= 1 n3) (<= 2 n2)) (<= 1 n1) (<= 0 n3) (<= n3 n1)), Black: 246#(and (= n3 n1) (or (<= 2 n2) (<= 2 n3)) (<= 1 n1)), Black: 248#(and (or (<= n1 n2) (<= 2 n3)) (or (<= 1 n3) (<= 2 n2)) (<= 1 n1) (<= 0 n3) (<= n3 n1) (or (<= n1 n3) (<= n1 n2))), Black: 250#(and (<= n1 n3) (or (<= 2 n2) (<= 2 n3)) (<= 1 n1)), Black: 144#e1, Black: 252#(and (<= (+ n3 1) n1) (or (<= 1 n3) (<= 2 n2)) (<= 0 n3)), 147#true, 280#(<= 0 n3), Black: 151#(and (<= n3 n2) (<= 0 n3)), Black: 152#(and (<= 0 n3) (<= (+ n3 1) n2)), Black: 153#(and (<= 1 n3) (< n3 (+ n2 1))), Black: 154#(and (<= 1 n3) (< n3 (+ n2 1)) (not (= n3 n2))), 32#L77true, 164#(and (<= n2 n3) (<= 0 n2)), 38#L64true, Black: 288#(and (<= n1 n3) (<= 1 n3) (<= n3 (+ n2 1))), Black: 290#(and (<= n1 n3) (<= 1 n3) (<= n3 n2)), Black: 292#(and (<= n1 n3) (<= 1 n3) (<= n3 n2) (not (= n3 n2))), 40#thread2EXITtrue, Black: 162#(and (<= n1 n2) (<= n3 n2) (<= n2 n3) (<= 0 n2)), Black: 163#(and (= n3 n2) (<= 0 n2)), Black: 279#(and (<= n1 n3) (<= 0 n3)), Black: 281#(and (<= n3 n2) (<= 0 n3)), Black: 165#(and (<= n2 (+ n3 1)) (<= 1 n2)), Black: 166#(and (<= n2 n3) (<= 1 n2)), Black: 282#(and (<= 1 n3) (<= n3 (+ n2 1))), Black: 283#(and (<= 1 n3) (<= n3 n2)), Black: 284#(and (<= 1 n3) (<= n3 n2) (not (= n3 n2))), Black: 286#(and (<= n1 n3) (<= n3 n2) (<= 0 n3)), 55#L32true, Black: 306#(and (<= n1 n2) (< n2 (+ n3 1)) (<= n3 n2) (<= 0 n2) (<= n2 0)), Black: 307#(and (<= n2 n3) (<= n3 0) (<= 0 n2)), Black: 308#(and (<= 0 n2) (<= (+ n2 1) n3) (<= n3 1)), 185#(and (<= 0 n3) (<= n3 n1)), Black: 309#(and (< n2 (+ n3 1)) (<= n3 n2) (<= 1 n2)), 67#true, 323#(and (<= 1 n1) (or (<= n1 n3) (<= 0 n2))), Black: 178#(and (= n3 n1) (<= 1 n1)), Black: 195#(and (<= 1 n1) (<= 0 n3) (<= 2 n2)), Black: 197#(and (<= 1 n1) (<= 0 n3) (<= 3 n2)), Black: 201#(and (< n2 n1) (<= 0 n3) (<= 3 n2)), Black: 187#(and (<= (+ n3 1) n1) (<= 0 n3)), Black: 320#(and (<= n1 n2) (<= 0 n1)), Black: 336#(and (<= 1 n1) (or (<= n1 n3) (<= 1 n2)) (or (<= n1 n3) (< n2 n1))), Black: 321#(and (<= 1 n1) (<= n1 (+ n2 1))), Black: 189#(and (<= 1 n1) (<= 0 n3) (or (<= n1 n3) (<= 2 n2))), Black: 191#(and (<= 1 n1) (<= 0 n3) (or (<= (+ n1 1) n3) (<= 2 n2))), Black: 175#(<= 0 n3), Black: 328#(and (<= n1 n2) (<= 1 n1)), Black: 332#(and (<= n1 n3) (<= n1 n2) (<= 1 n1)), Black: 317#(and (<= n1 n3) (<= n1 n2) (<= n2 n1) (<= n3 n1) (<= 0 n2)), Black: 318#(and (<= n1 n2) (<= n2 n1) (<= n3 n1) (<= 0 n2)), Black: 83#(and (<= i3 0) (<= 2 i) (<= i1 1) (<= i 2) (<= 0 i3) (<= 1 i1)), Black: 69#(and (<= i 0) (<= 0 i)), Black: 334#(and (<= n1 n2) (<= 1 n1) (<= n3 n1)), Black: 319#(and (<= n1 n2) (<= 0 n1) (<= n3 n1)), Black: 79#(and (<= i3 0) (<= 1 i) (<= i 1) (<= 0 i3)), 350#true, 95#true, 230#(and (<= (+ n3 1) n1) (<= 0 n3)), Black: 352#(and (<= n1 n3) (<= 0 n3) (<= n2 n1) (<= n3 n1)), Black: 354#(and (<= n1 (+ n3 1)) (<= (+ n3 1) n1) (<= 1 n1)), Black: 355#(and (<= n1 n3) (<= 1 n1) (< n3 (+ n1 1))), Black: 97#(and (<= n1 n3) (<= 0 n3) (<= n2 n1) (<= n3 n1)), Black: 357#(and (<= n1 n3) (<= 1 n1) (<= n2 n1) (< n3 (+ n1 1))), Black: 98#(and (<= (+ n3 1) n1) (<= 1 n1) (<= (+ n2 1) n1)), Black: 99#(and (<= (+ n3 1) n1) (<= 1 n1) (= n2 n1)), Black: 101#(and (<= 1 n1) (<= (+ n1 1) n2)), Black: 111#e2, 114#true]) [2021-03-26 15:01:57,203 INFO L384 tUnfolder$Statistics]: this new event has 25 ancestors and is not cut-off event [2021-03-26 15:01:57,203 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is not cut-off event [2021-03-26 15:01:57,203 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is not cut-off event [2021-03-26 15:01:57,203 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is not cut-off event [2021-03-26 15:01:57,357 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L65-->L66: Formula: (or (= v_n2_14 0) (and (not (< v_n2_14 v_n3_13)) (not (= v_n2_14 v_n3_13)))) InVars {n2=v_n2_14, n3=v_n3_13} OutVars{n2=v_n2_14, n3=v_n3_13} AuxVars[] AssignedVars[][576], [Black: 116#(and (<= n1 n3) (<= n3 n2) (<= 0 n2)), Black: 117#(and (<= n1 n2) (<= n3 n2) (<= 0 n2)), Black: 118#(and (<= n3 n2) (<= 0 n2)), Black: 119#(and (<= 1 n2) (<= (+ n3 1) n2)), Black: 120#(and (= n3 n2) (<= 1 n2)), Black: 121#(and (<= (+ n2 1) n3) (<= 1 n2)), Black: 123#(and (<= n1 n3) (<= 1 n2) (<= (+ n3 1) n2)), Black: 260#(and (<= (+ n3 1) n1) (or (<= 2 n2) (<= 2 n3)) (<= 0 n3)), Black: 125#(and (<= n1 n2) (<= 1 n2) (<= (+ n3 1) n2)), Black: 230#(and (<= (+ n3 1) n1) (<= 0 n3)), Black: 232#(and (<= n1 n2) (<= (+ n3 1) n1) (<= 0 n3)), Black: 236#(and (<= n1 n3) (<= 1 n1)), Black: 238#(and (<= n1 n2) (<= (+ n3 1) n1) (<= 0 n3) (<= 2 n2)), Black: 139#e3, Black: 242#(and (<= n1 n3) (or (<= 3 n2) (<= 2 n3)) (<= 1 n1)), Black: 244#(and (or (<= 1 n3) (<= 2 n2)) (<= 1 n1) (<= 0 n3) (<= n3 n1)), Black: 246#(and (= n3 n1) (or (<= 2 n2) (<= 2 n3)) (<= 1 n1)), Black: 248#(and (or (<= n1 n2) (<= 2 n3)) (or (<= 1 n3) (<= 2 n2)) (<= 1 n1) (<= 0 n3) (<= n3 n1) (or (<= n1 n3) (<= n1 n2))), Black: 250#(and (<= n1 n3) (or (<= 2 n2) (<= 2 n3)) (<= 1 n1)), 17#L66true, Black: 144#e1, Black: 252#(and (<= (+ n3 1) n1) (or (<= 1 n3) (<= 2 n2)) (<= 0 n3)), 147#true, 280#(<= 0 n3), Black: 151#(and (<= n3 n2) (<= 0 n3)), Black: 152#(and (<= 0 n3) (<= (+ n3 1) n2)), Black: 153#(and (<= 1 n3) (< n3 (+ n2 1))), Black: 154#(and (<= 1 n3) (< n3 (+ n2 1)) (not (= n3 n2))), 32#L77true, 164#(and (<= n2 n3) (<= 0 n2)), Black: 288#(and (<= n1 n3) (<= 1 n3) (<= n3 (+ n2 1))), Black: 290#(and (<= n1 n3) (<= 1 n3) (<= n3 n2)), Black: 292#(and (<= n1 n3) (<= 1 n3) (<= n3 n2) (not (= n3 n2))), Black: 162#(and (<= n1 n2) (<= n3 n2) (<= n2 n3) (<= 0 n2)), 40#thread2EXITtrue, Black: 279#(and (<= n1 n3) (<= 0 n3)), Black: 163#(and (= n3 n2) (<= 0 n2)), Black: 281#(and (<= n3 n2) (<= 0 n3)), Black: 165#(and (<= n2 (+ n3 1)) (<= 1 n2)), Black: 166#(and (<= n2 n3) (<= 1 n2)), Black: 282#(and (<= 1 n3) (<= n3 (+ n2 1))), Black: 283#(and (<= 1 n3) (<= n3 n2)), Black: 284#(and (<= 1 n3) (<= n3 n2) (not (= n3 n2))), Black: 286#(and (<= n1 n3) (<= n3 n2) (<= 0 n3)), 175#(<= 0 n3), Black: 306#(and (<= n1 n2) (< n2 (+ n3 1)) (<= n3 n2) (<= 0 n2) (<= n2 0)), 55#L32true, Black: 307#(and (<= n2 n3) (<= n3 0) (<= 0 n2)), Black: 308#(and (<= 0 n2) (<= (+ n2 1) n3) (<= n3 1)), Black: 309#(and (< n2 (+ n3 1)) (<= n3 n2) (<= 1 n2)), 323#(and (<= 1 n1) (or (<= n1 n3) (<= 0 n2))), 67#true, Black: 178#(and (= n3 n1) (<= 1 n1)), Black: 195#(and (<= 1 n1) (<= 0 n3) (<= 2 n2)), Black: 197#(and (<= 1 n1) (<= 0 n3) (<= 3 n2)), Black: 185#(and (<= 0 n3) (<= n3 n1)), Black: 201#(and (< n2 n1) (<= 0 n3) (<= 3 n2)), Black: 320#(and (<= n1 n2) (<= 0 n1)), Black: 187#(and (<= (+ n3 1) n1) (<= 0 n3)), Black: 336#(and (<= 1 n1) (or (<= n1 n3) (<= 1 n2)) (or (<= n1 n3) (< n2 n1))), Black: 189#(and (<= 1 n1) (<= 0 n3) (or (<= n1 n3) (<= 2 n2))), Black: 321#(and (<= 1 n1) (<= n1 (+ n2 1))), Black: 191#(and (<= 1 n1) (<= 0 n3) (or (<= (+ n1 1) n3) (<= 2 n2))), Black: 328#(and (<= n1 n2) (<= 1 n1)), Black: 332#(and (<= n1 n3) (<= n1 n2) (<= 1 n1)), Black: 317#(and (<= n1 n3) (<= n1 n2) (<= n2 n1) (<= n3 n1) (<= 0 n2)), Black: 318#(and (<= n1 n2) (<= n2 n1) (<= n3 n1) (<= 0 n2)), Black: 83#(and (<= i3 0) (<= 2 i) (<= i1 1) (<= i 2) (<= 0 i3) (<= 1 i1)), 219#(<= 0 n3), Black: 334#(and (<= n1 n2) (<= 1 n1) (<= n3 n1)), Black: 69#(and (<= i 0) (<= 0 i)), Black: 319#(and (<= n1 n2) (<= 0 n1) (<= n3 n1)), Black: 79#(and (<= i3 0) (<= 1 i) (<= i 1) (<= 0 i3)), 350#true, 95#true, Black: 352#(and (<= n1 n3) (<= 0 n3) (<= n2 n1) (<= n3 n1)), Black: 354#(and (<= n1 (+ n3 1)) (<= (+ n3 1) n1) (<= 1 n1)), Black: 355#(and (<= n1 n3) (<= 1 n1) (< n3 (+ n1 1))), Black: 97#(and (<= n1 n3) (<= 0 n3) (<= n2 n1) (<= n3 n1)), Black: 357#(and (<= n1 n3) (<= 1 n1) (<= n2 n1) (< n3 (+ n1 1))), Black: 98#(and (<= (+ n3 1) n1) (<= 1 n1) (<= (+ n2 1) n1)), Black: 99#(and (<= (+ n3 1) n1) (<= 1 n1) (= n2 n1)), Black: 101#(and (<= 1 n1) (<= (+ n1 1) n2)), Black: 111#e2, 114#true]) [2021-03-26 15:01:57,357 INFO L384 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2021-03-26 15:01:57,357 INFO L387 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2021-03-26 15:01:57,357 INFO L387 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2021-03-26 15:01:57,357 INFO L387 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2021-03-26 15:01:57,434 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([108] L31-->L32: Formula: (or (not (< v_n3_2 v_n1_8)) (= v_n3_2 0)) InVars {n3=v_n3_2, n1=v_n1_8} OutVars{n3=v_n3_2, n1=v_n1_8} AuxVars[] AssignedVars[][752], [Black: 116#(and (<= n1 n3) (<= n3 n2) (<= 0 n2)), Black: 117#(and (<= n1 n2) (<= n3 n2) (<= 0 n2)), Black: 118#(and (<= n3 n2) (<= 0 n2)), Black: 119#(and (<= 1 n2) (<= (+ n3 1) n2)), Black: 120#(and (= n3 n2) (<= 1 n2)), Black: 121#(and (<= (+ n2 1) n3) (<= 1 n2)), Black: 123#(and (<= n1 n3) (<= 1 n2) (<= (+ n3 1) n2)), Black: 125#(and (<= n1 n2) (<= 1 n2) (<= (+ n3 1) n2)), Black: 260#(and (<= (+ n3 1) n1) (or (<= 2 n2) (<= 2 n3)) (<= 0 n3)), Black: 232#(and (<= n1 n2) (<= (+ n3 1) n1) (<= 0 n3)), Black: 236#(and (<= n1 n3) (<= 1 n1)), Black: 238#(and (<= n1 n2) (<= (+ n3 1) n1) (<= 0 n3) (<= 2 n2)), Black: 139#e3, Black: 242#(and (<= n1 n3) (or (<= 3 n2) (<= 2 n3)) (<= 1 n1)), Black: 244#(and (or (<= 1 n3) (<= 2 n2)) (<= 1 n1) (<= 0 n3) (<= n3 n1)), Black: 246#(and (= n3 n1) (or (<= 2 n2) (<= 2 n3)) (<= 1 n1)), Black: 248#(and (or (<= n1 n2) (<= 2 n3)) (or (<= 1 n3) (<= 2 n2)) (<= 1 n1) (<= 0 n3) (<= n3 n1) (or (<= n1 n3) (<= n1 n2))), Black: 250#(and (<= n1 n3) (or (<= 2 n2) (<= 2 n3)) (<= 1 n1)), Black: 144#e1, Black: 252#(and (<= (+ n3 1) n1) (or (<= 1 n3) (<= 2 n2)) (<= 0 n3)), 147#true, 280#(<= 0 n3), Black: 151#(and (<= n3 n2) (<= 0 n3)), Black: 152#(and (<= 0 n3) (<= (+ n3 1) n2)), Black: 153#(and (<= 1 n3) (< n3 (+ n2 1))), Black: 154#(and (<= 1 n3) (< n3 (+ n2 1)) (not (= n3 n2))), 32#L77true, 160#true, Black: 288#(and (<= n1 n3) (<= 1 n3) (<= n3 (+ n2 1))), Black: 290#(and (<= n1 n3) (<= 1 n3) (<= n3 n2)), Black: 292#(and (<= n1 n3) (<= 1 n3) (<= n3 n2) (not (= n3 n2))), 40#thread2EXITtrue, Black: 162#(and (<= n1 n2) (<= n3 n2) (<= n2 n3) (<= 0 n2)), Black: 163#(and (= n3 n2) (<= 0 n2)), Black: 279#(and (<= n1 n3) (<= 0 n3)), Black: 164#(and (<= n2 n3) (<= 0 n2)), Black: 281#(and (<= n3 n2) (<= 0 n3)), Black: 165#(and (<= n2 (+ n3 1)) (<= 1 n2)), Black: 166#(and (<= n2 n3) (<= 1 n2)), Black: 282#(and (<= 1 n3) (<= n3 (+ n2 1))), Black: 283#(and (<= 1 n3) (<= n3 n2)), Black: 284#(and (<= 1 n3) (<= n3 n2) (not (= n3 n2))), Black: 286#(and (<= n1 n3) (<= n3 n2) (<= 0 n3)), 50#thread3EXITtrue, 55#L32true, Black: 306#(and (<= n1 n2) (< n2 (+ n3 1)) (<= n3 n2) (<= 0 n2) (<= n2 0)), Black: 307#(and (<= n2 n3) (<= n3 0) (<= 0 n2)), Black: 308#(and (<= 0 n2) (<= (+ n2 1) n3) (<= n3 1)), 185#(and (<= 0 n3) (<= n3 n1)), Black: 309#(and (< n2 (+ n3 1)) (<= n3 n2) (<= 1 n2)), 315#true, 67#true, Black: 178#(and (= n3 n1) (<= 1 n1)), Black: 195#(and (<= 1 n1) (<= 0 n3) (<= 2 n2)), Black: 197#(and (<= 1 n1) (<= 0 n3) (<= 3 n2)), Black: 201#(and (< n2 n1) (<= 0 n3) (<= 3 n2)), Black: 187#(and (<= (+ n3 1) n1) (<= 0 n3)), Black: 320#(and (<= n1 n2) (<= 0 n1)), Black: 336#(and (<= 1 n1) (or (<= n1 n3) (<= 1 n2)) (or (<= n1 n3) (< n2 n1))), Black: 321#(and (<= 1 n1) (<= n1 (+ n2 1))), Black: 189#(and (<= 1 n1) (<= 0 n3) (or (<= n1 n3) (<= 2 n2))), Black: 191#(and (<= 1 n1) (<= 0 n3) (or (<= (+ n1 1) n3) (<= 2 n2))), Black: 323#(and (<= 1 n1) (or (<= n1 n3) (<= 0 n2))), Black: 175#(<= 0 n3), Black: 328#(and (<= n1 n2) (<= 1 n1)), Black: 332#(and (<= n1 n3) (<= n1 n2) (<= 1 n1)), Black: 317#(and (<= n1 n3) (<= n1 n2) (<= n2 n1) (<= n3 n1) (<= 0 n2)), Black: 318#(and (<= n1 n2) (<= n2 n1) (<= n3 n1) (<= 0 n2)), Black: 83#(and (<= i3 0) (<= 2 i) (<= i1 1) (<= i 2) (<= 0 i3) (<= 1 i1)), Black: 69#(and (<= i 0) (<= 0 i)), Black: 334#(and (<= n1 n2) (<= 1 n1) (<= n3 n1)), Black: 319#(and (<= n1 n2) (<= 0 n1) (<= n3 n1)), Black: 79#(and (<= i3 0) (<= 1 i) (<= i 1) (<= 0 i3)), 350#true, 95#true, 230#(and (<= (+ n3 1) n1) (<= 0 n3)), Black: 352#(and (<= n1 n3) (<= 0 n3) (<= n2 n1) (<= n3 n1)), Black: 354#(and (<= n1 (+ n3 1)) (<= (+ n3 1) n1) (<= 1 n1)), Black: 355#(and (<= n1 n3) (<= 1 n1) (< n3 (+ n1 1))), Black: 97#(and (<= n1 n3) (<= 0 n3) (<= n2 n1) (<= n3 n1)), Black: 357#(and (<= n1 n3) (<= 1 n1) (<= n2 n1) (< n3 (+ n1 1))), Black: 98#(and (<= (+ n3 1) n1) (<= 1 n1) (<= (+ n2 1) n1)), Black: 99#(and (<= (+ n3 1) n1) (<= 1 n1) (= n2 n1)), Black: 101#(and (<= 1 n1) (<= (+ n1 1) n2)), Black: 111#e2, 114#true]) [2021-03-26 15:01:57,434 INFO L384 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2021-03-26 15:01:57,434 INFO L387 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2021-03-26 15:01:57,434 INFO L387 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2021-03-26 15:01:57,434 INFO L387 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2021-03-26 15:01:57,718 INFO L129 PetriNetUnfolder]: 3207/10761 cut-off events. [2021-03-26 15:01:57,718 INFO L130 PetriNetUnfolder]: For 124168/125687 co-relation queries the response was YES. [2021-03-26 15:01:57,793 INFO L84 FinitePrefix]: Finished finitePrefix Result has 59140 conditions, 10761 events. 3207/10761 cut-off events. For 124168/125687 co-relation queries the response was YES. Maximal size of possible extension queue 739. Compared 133212 event pairs, 874 based on Foata normal form. 338/10310 useless extension candidates. Maximal degree in co-relation 58609. Up to 1622 conditions per place. [2021-03-26 15:01:57,896 INFO L142 LiptonReduction]: Number of co-enabled transitions 5822 [2021-03-26 15:02:25,593 INFO L154 LiptonReduction]: Checked pairs total: 2807 [2021-03-26 15:02:25,594 INFO L156 LiptonReduction]: Total number of compositions: 11 [2021-03-26 15:02:25,594 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 29517 [2021-03-26 15:02:25,594 INFO L480 AbstractCegarLoop]: Abstraction has has 211 places, 755 transitions, 13195 flow [2021-03-26 15:02:25,594 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 39.166666666666664) internal successors, (235), 6 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 15:02:25,594 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 15:02:25,594 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 15:02:25,594 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-03-26 15:02:25,594 INFO L428 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-26 15:02:25,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 15:02:25,595 INFO L82 PathProgramCache]: Analyzing trace with hash 1321934957, now seen corresponding path program 1 times [2021-03-26 15:02:25,595 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 15:02:25,595 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094958079] [2021-03-26 15:02:25,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 15:02:25,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 15:02:25,752 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 15:02:25,752 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 15:02:25,764 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 15:02:25,764 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 15:02:25,777 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 15:02:25,777 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 15:02:25,785 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 15:02:25,785 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 15:02:25,793 INFO L142 QuantifierPusher]: treesize reduction 7, result has 68.2 percent of original size [2021-03-26 15:02:25,794 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-26 15:02:25,800 INFO L142 QuantifierPusher]: treesize reduction 4, result has 63.6 percent of original size [2021-03-26 15:02:25,800 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 15:02:25,808 INFO L142 QuantifierPusher]: treesize reduction 4, result has 63.6 percent of original size [2021-03-26 15:02:25,808 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 15:02:25,817 INFO L142 QuantifierPusher]: treesize reduction 4, result has 69.2 percent of original size [2021-03-26 15:02:25,817 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 15:02:25,827 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 15:02:25,827 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 15:02:25,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 15:02:25,828 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094958079] [2021-03-26 15:02:25,828 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 15:02:25,828 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-03-26 15:02:25,828 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896783866] [2021-03-26 15:02:25,828 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-26 15:02:25,828 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 15:02:25,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-26 15:02:25,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-03-26 15:02:25,829 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 143 [2021-03-26 15:02:25,830 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 755 transitions, 13195 flow. Second operand has 9 states, 9 states have (on average 38.111111111111114) internal successors, (343), 9 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 15:02:25,830 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 15:02:25,830 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 143 [2021-03-26 15:02:25,830 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 15:02:30,662 INFO L129 PetriNetUnfolder]: 6611/17869 cut-off events. [2021-03-26 15:02:30,663 INFO L130 PetriNetUnfolder]: For 256461/258353 co-relation queries the response was YES. [2021-03-26 15:02:30,788 INFO L84 FinitePrefix]: Finished finitePrefix Result has 110734 conditions, 17869 events. 6611/17869 cut-off events. For 256461/258353 co-relation queries the response was YES. Maximal size of possible extension queue 1204. Compared 214652 event pairs, 1477 based on Foata normal form. 727/17816 useless extension candidates. Maximal degree in co-relation 110329. Up to 2995 conditions per place. [2021-03-26 15:02:30,851 INFO L132 encePairwiseOnDemand]: 94/143 looper letters, 506 selfloop transitions, 637 changer transitions 7/1185 dead transitions. [2021-03-26 15:02:30,852 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 1185 transitions, 22852 flow [2021-03-26 15:02:30,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-03-26 15:02:30,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2021-03-26 15:02:30,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 827 transitions. [2021-03-26 15:02:30,854 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.3401892225421637 [2021-03-26 15:02:30,854 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 827 transitions. [2021-03-26 15:02:30,854 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 827 transitions. [2021-03-26 15:02:30,854 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 15:02:30,854 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 827 transitions. [2021-03-26 15:02:30,856 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 48.64705882352941) internal successors, (827), 17 states have internal predecessors, (827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 15:02:30,858 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 143.0) internal successors, (2574), 18 states have internal predecessors, (2574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 15:02:30,859 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 143.0) internal successors, (2574), 18 states have internal predecessors, (2574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 15:02:30,859 INFO L185 Difference]: Start difference. First operand has 211 places, 755 transitions, 13195 flow. Second operand 17 states and 827 transitions. [2021-03-26 15:02:30,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 1185 transitions, 22852 flow [2021-03-26 15:02:32,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 1185 transitions, 22702 flow, removed 75 selfloop flow, removed 0 redundant places. [2021-03-26 15:02:32,778 INFO L241 Difference]: Finished difference. Result has 241 places, 1005 transitions, 20164 flow [2021-03-26 15:02:32,779 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=12905, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=746, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=401, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=301, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=20164, PETRI_PLACES=241, PETRI_TRANSITIONS=1005} [2021-03-26 15:02:32,779 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 193 predicate places. [2021-03-26 15:02:32,779 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 15:02:32,779 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 241 places, 1005 transitions, 20164 flow [2021-03-26 15:02:32,779 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 241 places, 1005 transitions, 20164 flow [2021-03-26 15:02:32,788 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 241 places, 1005 transitions, 20164 flow [2021-03-26 15:02:35,335 INFO L129 PetriNetUnfolder]: 4416/14195 cut-off events. [2021-03-26 15:02:35,335 INFO L130 PetriNetUnfolder]: For 240915/242918 co-relation queries the response was YES. [2021-03-26 15:02:35,460 INFO L84 FinitePrefix]: Finished finitePrefix Result has 88386 conditions, 14195 events. 4416/14195 cut-off events. For 240915/242918 co-relation queries the response was YES. Maximal size of possible extension queue 915. Compared 180045 event pairs, 1121 based on Foata normal form. 445/13658 useless extension candidates. Maximal degree in co-relation 87847. Up to 2091 conditions per place. [2021-03-26 15:02:35,725 INFO L142 LiptonReduction]: Number of co-enabled transitions 7064 [2021-03-26 15:04:05,782 INFO L154 LiptonReduction]: Checked pairs total: 6037 [2021-03-26 15:04:05,782 INFO L156 LiptonReduction]: Total number of compositions: 23 [2021-03-26 15:04:05,783 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 93004 [2021-03-26 15:04:05,783 INFO L480 AbstractCegarLoop]: Abstraction has has 241 places, 1005 transitions, 20210 flow [2021-03-26 15:04:05,783 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 38.111111111111114) internal successors, (343), 9 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 15:04:05,784 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 15:04:05,784 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 15:04:05,784 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-03-26 15:04:05,784 INFO L428 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-26 15:04:05,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 15:04:05,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1897109481, now seen corresponding path program 2 times [2021-03-26 15:04:05,784 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 15:04:05,784 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805257768] [2021-03-26 15:04:05,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 15:04:05,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 15:04:05,824 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 15:04:05,827 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-03-26 15:04:05,842 INFO L142 QuantifierPusher]: treesize reduction 5, result has 81.5 percent of original size [2021-03-26 15:04:05,843 INFO L147 QuantifierPusher]: treesize reduction 3, result has 86.4 percent of original size 19 [2021-03-26 15:04:05,845 INFO L142 QuantifierPusher]: treesize reduction 7, result has 65.0 percent of original size [2021-03-26 15:04:05,846 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 15:04:05,857 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 15:04:05,857 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 15:04:05,867 INFO L142 QuantifierPusher]: treesize reduction 8, result has 57.9 percent of original size [2021-03-26 15:04:05,868 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 15:04:05,877 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 15:04:05,878 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 15:04:05,887 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 15:04:05,887 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 15:04:05,904 INFO L142 QuantifierPusher]: treesize reduction 15, result has 53.1 percent of original size [2021-03-26 15:04:05,908 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-26 15:04:05,922 INFO L142 QuantifierPusher]: treesize reduction 14, result has 63.2 percent of original size [2021-03-26 15:04:05,923 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-26 15:04:05,941 INFO L142 QuantifierPusher]: treesize reduction 9, result has 52.6 percent of original size [2021-03-26 15:04:05,942 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 15:04:05,953 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 15:04:05,953 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 15:04:05,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 15:04:05,953 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805257768] [2021-03-26 15:04:05,956 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 15:04:05,956 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-03-26 15:04:05,956 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91755937] [2021-03-26 15:04:05,957 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-03-26 15:04:05,957 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 15:04:05,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-03-26 15:04:05,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-03-26 15:04:05,958 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 166 [2021-03-26 15:04:05,958 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 1005 transitions, 20210 flow. Second operand has 11 states, 11 states have (on average 37.72727272727273) internal successors, (415), 11 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 15:04:05,958 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 15:04:05,958 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 166 [2021-03-26 15:04:05,958 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 15:04:09,665 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 14 [2021-03-26 15:04:14,730 INFO L129 PetriNetUnfolder]: 7674/21844 cut-off events. [2021-03-26 15:04:14,730 INFO L130 PetriNetUnfolder]: For 459823/463232 co-relation queries the response was YES. [2021-03-26 15:04:14,960 INFO L84 FinitePrefix]: Finished finitePrefix Result has 152565 conditions, 21844 events. 7674/21844 cut-off events. For 459823/463232 co-relation queries the response was YES. Maximal size of possible extension queue 1543. Compared 278367 event pairs, 2036 based on Foata normal form. 1102/21954 useless extension candidates. Maximal degree in co-relation 151932. Up to 6490 conditions per place. [2021-03-26 15:04:15,049 INFO L132 encePairwiseOnDemand]: 122/166 looper letters, 1026 selfloop transitions, 468 changer transitions 13/1542 dead transitions. [2021-03-26 15:04:15,049 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 1542 transitions, 33489 flow [2021-03-26 15:04:15,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-03-26 15:04:15,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2021-03-26 15:04:15,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 854 transitions. [2021-03-26 15:04:15,051 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.3026222537207654 [2021-03-26 15:04:15,051 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 854 transitions. [2021-03-26 15:04:15,051 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 854 transitions. [2021-03-26 15:04:15,051 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 15:04:15,051 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 854 transitions. [2021-03-26 15:04:15,053 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 50.23529411764706) internal successors, (854), 17 states have internal predecessors, (854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 15:04:15,056 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 166.0) internal successors, (2988), 18 states have internal predecessors, (2988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 15:04:15,056 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 166.0) internal successors, (2988), 18 states have internal predecessors, (2988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 15:04:15,056 INFO L185 Difference]: Start difference. First operand has 241 places, 1005 transitions, 20210 flow. Second operand 17 states and 854 transitions. [2021-03-26 15:04:15,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 1542 transitions, 33489 flow [2021-03-26 15:04:18,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 1542 transitions, 32624 flow, removed 426 selfloop flow, removed 2 redundant places. [2021-03-26 15:04:18,766 INFO L241 Difference]: Finished difference. Result has 269 places, 1282 transitions, 26981 flow [2021-03-26 15:04:18,767 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=19570, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=996, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=233, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=671, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=26981, PETRI_PLACES=269, PETRI_TRANSITIONS=1282} [2021-03-26 15:04:18,768 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 221 predicate places. [2021-03-26 15:04:18,768 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 15:04:18,768 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 269 places, 1282 transitions, 26981 flow [2021-03-26 15:04:18,768 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 269 places, 1282 transitions, 26981 flow [2021-03-26 15:04:18,781 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 269 places, 1282 transitions, 26981 flow [2021-03-26 15:04:22,533 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([108] L31-->L32: Formula: (or (not (< v_n3_2 v_n1_8)) (= v_n3_2 0)) InVars {n3=v_n3_2, n1=v_n1_8} OutVars{n3=v_n3_2, n1=v_n1_8} AuxVars[] AssignedVars[][198], [Black: 260#(and (<= (+ n3 1) n1) (or (<= 2 n2) (<= 2 n3)) (<= 0 n3)), Black: 232#(and (<= n1 n2) (<= (+ n3 1) n1) (<= 0 n3)), Black: 236#(and (<= n1 n3) (<= 1 n1)), Black: 238#(and (<= n1 n2) (<= (+ n3 1) n1) (<= 0 n3) (<= 2 n2)), Black: 242#(and (<= n1 n3) (or (<= 3 n2) (<= 2 n3)) (<= 1 n1)), Black: 244#(and (or (<= 1 n3) (<= 2 n2)) (<= 1 n1) (<= 0 n3) (<= n3 n1)), Black: 248#(and (or (<= n1 n2) (<= 2 n3)) (or (<= 1 n3) (<= 2 n2)) (<= 1 n1) (<= 0 n3) (<= n3 n1) (or (<= n1 n3) (<= n1 n2))), Black: 250#(and (<= n1 n3) (or (<= 2 n2) (<= 2 n3)) (<= 1 n1)), Black: 252#(and (<= (+ n3 1) n1) (or (<= 1 n3) (<= 2 n2)) (<= 0 n3)), 280#(<= 0 n3), 32#L77true, Black: 288#(and (<= n1 n3) (<= 1 n3) (<= n3 (+ n2 1))), Black: 290#(and (<= n1 n3) (<= 1 n3) (<= n3 n2)), 40#thread2EXITtrue, Black: 292#(and (<= n1 n3) (<= 1 n3) (<= n3 n2) (not (= n3 n2))), Black: 279#(and (<= n1 n3) (<= 0 n3)), Black: 281#(and (<= n3 n2) (<= 0 n3)), Black: 282#(and (<= 1 n3) (<= n3 (+ n2 1))), Black: 283#(and (<= 1 n3) (<= n3 n2)), Black: 284#(and (<= 1 n3) (<= n3 n2) (not (= n3 n2))), Black: 286#(and (<= n1 n3) (<= n3 n2) (<= 0 n3)), 50#thread3EXITtrue, Black: 306#(and (<= n1 n2) (< n2 (+ n3 1)) (<= n3 n2) (<= 0 n2) (<= n2 0)), 55#L32true, Black: 307#(and (<= n2 n3) (<= n3 0) (<= 0 n2)), Black: 308#(and (<= 0 n2) (<= (+ n2 1) n3) (<= n3 1)), Black: 309#(and (< n2 (+ n3 1)) (<= n3 n2) (<= 1 n2)), 315#true, 67#true, Black: 320#(and (<= n1 n2) (<= 0 n1)), Black: 336#(and (<= 1 n1) (or (<= n1 n3) (<= 1 n2)) (or (<= n1 n3) (< n2 n1))), Black: 321#(and (<= 1 n1) (<= n1 (+ n2 1))), Black: 323#(and (<= 1 n1) (or (<= n1 n3) (<= 0 n2))), Black: 328#(and (<= n1 n2) (<= 1 n1)), Black: 332#(and (<= n1 n3) (<= n1 n2) (<= 1 n1)), Black: 317#(and (<= n1 n3) (<= n1 n2) (<= n2 n1) (<= n3 n1) (<= 0 n2)), Black: 318#(and (<= n1 n2) (<= n2 n1) (<= n3 n1) (<= 0 n2)), Black: 83#(and (<= i3 0) (<= 2 i) (<= i1 1) (<= i 2) (<= 0 i3) (<= 1 i1)), Black: 69#(and (<= i 0) (<= 0 i)), Black: 334#(and (<= n1 n2) (<= 1 n1) (<= n3 n1)), Black: 319#(and (<= n1 n2) (<= 0 n1) (<= n3 n1)), Black: 79#(and (<= i3 0) (<= 1 i) (<= i 1) (<= 0 i3)), 350#true, 95#true, Black: 352#(and (<= n1 n3) (<= 0 n3) (<= n2 n1) (<= n3 n1)), Black: 354#(and (<= n1 (+ n3 1)) (<= (+ n3 1) n1) (<= 1 n1)), Black: 97#(and (<= n1 n3) (<= 0 n3) (<= n2 n1) (<= n3 n1)), Black: 355#(and (<= n1 n3) (<= 1 n1) (< n3 (+ n1 1))), Black: 357#(and (<= n1 n3) (<= 1 n1) (<= n2 n1) (< n3 (+ n1 1))), Black: 98#(and (<= (+ n3 1) n1) (<= 1 n1) (<= (+ n2 1) n1)), Black: 99#(and (<= (+ n3 1) n1) (<= 1 n1) (= n2 n1)), Black: 101#(and (<= 1 n1) (<= (+ n1 1) n2)), 366#(and (<= n3 n2) (<= 0 n3) (<= n3 n1)), Black: 111#e2, 114#true, Black: 116#(and (<= n1 n3) (<= n3 n2) (<= 0 n2)), Black: 117#(and (<= n1 n2) (<= n3 n2) (<= 0 n2)), Black: 118#(and (<= n3 n2) (<= 0 n2)), Black: 119#(and (<= 1 n2) (<= (+ n3 1) n2)), Black: 120#(and (= n3 n2) (<= 1 n2)), Black: 385#(and (<= (+ n2 1) n1) (<= n3 n2) (<= 0 n3) (<= 1 n2)), Black: 121#(and (<= (+ n2 1) n3) (<= 1 n2)), Black: 387#(and (<= (+ n2 1) n1) (<= 0 n3) (<= n3 n1) (<= 1 n2)), Black: 365#(and (<= n1 n2) (<= 0 n3) (<= n3 n1)), Black: 123#(and (<= n1 n3) (<= 1 n2) (<= (+ n3 1) n2)), Black: 125#(and (<= n1 n2) (<= 1 n2) (<= (+ n3 1) n2)), Black: 367#(and (<= 0 n3) (<= n3 n1) (<= 0 n2)), Black: 369#(and (<= 0 n1) (<= 1 n2)), Black: 370#(and (<= 1 n1) (<= 1 n2)), Black: 371#(and (<= (+ n2 1) n1) (<= 1 n2)), Black: 373#(and (<= n1 n2) (<= 0 n3) (<= n3 n1) (<= 1 n2)), Black: 139#e3, Black: 375#(and (<= n1 n2) (<= 1 n1) (<= 0 n3) (<= n3 n1)), Black: 377#(and (<= n3 n2) (<= 0 n3) (<= n3 n1) (<= 1 n2)), Black: 379#(and (<= 1 n1) (<= n3 n2) (<= 0 n3) (<= n3 n1) (<= 1 n2)), Black: 381#(and (<= 0 n3) (<= n3 n1) (<= 1 n2)), Black: 144#e1, Black: 383#(and (<= 1 n1) (<= 0 n3) (<= n3 n1) (<= 1 n2)), 147#true, 403#true, Black: 151#(and (<= n3 n2) (<= 0 n3)), Black: 152#(and (<= 0 n3) (<= (+ n3 1) n2)), Black: 153#(and (<= 1 n3) (< n3 (+ n2 1))), Black: 154#(and (<= 1 n3) (< n3 (+ n2 1)) (not (= n3 n2))), 160#true, Black: 162#(and (<= n1 n2) (<= n3 n2) (<= n2 n3) (<= 0 n2)), Black: 163#(and (= n3 n2) (<= 0 n2)), Black: 164#(and (<= n2 n3) (<= 0 n2)), Black: 165#(and (<= n2 (+ n3 1)) (<= 1 n2)), Black: 166#(and (<= n2 n3) (<= 1 n2)), Black: 417#(and (<= 1 n3) (<= 1 n1)), Black: 419#(and (<= 1 n3) (<= 0 n1)), Black: 421#(and (<= 1 n3) (< n1 (+ n2 1)) (<= 1 n1)), Black: 423#(and (<= 1 n3) (or (<= (+ n3 1) n1) (< n1 (+ n2 1))) (<= 1 n1)), Black: 425#(and (<= 1 n3) (<= (+ n3 1) n1)), Black: 427#(and (<= 1 n3) (<= (+ n3 1) n1) (< n1 (+ n2 1))), Black: 429#(and (<= (+ n3 1) n1) (<= 1 n1) (or (<= n1 n2) (<= 1 n3))), 185#(and (<= 0 n3) (<= n3 n1)), Black: 431#(and (<= (+ n3 1) n1) (< n1 (+ n2 1)) (<= 1 n1)), Black: 433#(and (<= (+ n3 1) n1) (< n1 (+ n2 1)) (<= 1 n1) (or (<= 1 n3) (<= (+ n1 1) n2))), Black: 406#(and (<= 0 n3) (<= n3 n1) (= n2 n1)), Black: 408#(and (or (<= 1 n3) (= n2 n1)) (<= 0 n1)), Black: 409#(and (<= 0 n1) (or (<= 1 n3) (<= (+ n1 1) n2))), Black: 410#(and (<= 1 n1) (or (<= n1 n2) (<= 1 n3))), Black: 415#(and (<= 1 n3) (<= 0 n2) (= n2 n1)), Black: 178#(and (= n3 n1) (<= 1 n1)), Black: 195#(and (<= 1 n1) (<= 0 n3) (<= 2 n2)), Black: 197#(and (<= 1 n1) (<= 0 n3) (<= 3 n2)), Black: 201#(and (< n2 n1) (<= 0 n3) (<= 3 n2)), Black: 187#(and (<= (+ n3 1) n1) (<= 0 n3)), Black: 189#(and (<= 1 n1) (<= 0 n3) (or (<= n1 n3) (<= 2 n2))), Black: 191#(and (<= 1 n1) (<= 0 n3) (or (<= (+ n1 1) n3) (<= 2 n2))), Black: 175#(<= 0 n3), 230#(and (<= (+ n3 1) n1) (<= 0 n3))]) [2021-03-26 15:04:22,534 INFO L384 tUnfolder$Statistics]: this new event has 30 ancestors and is not cut-off event [2021-03-26 15:04:22,534 INFO L387 tUnfolder$Statistics]: existing Event has 30 ancestors and is not cut-off event [2021-03-26 15:04:22,534 INFO L387 tUnfolder$Statistics]: existing Event has 30 ancestors and is not cut-off event [2021-03-26 15:04:22,534 INFO L387 tUnfolder$Statistics]: existing Event has 30 ancestors and is not cut-off event [2021-03-26 15:04:22,616 INFO L129 PetriNetUnfolder]: 5291/17851 cut-off events. [2021-03-26 15:04:22,616 INFO L130 PetriNetUnfolder]: For 371371/374111 co-relation queries the response was YES. [2021-03-26 15:04:22,983 INFO L84 FinitePrefix]: Finished finitePrefix Result has 120135 conditions, 17851 events. 5291/17851 cut-off events. For 371371/374111 co-relation queries the response was YES. Maximal size of possible extension queue 1254. Compared 240656 event pairs, 1282 based on Foata normal form. 750/17513 useless extension candidates. Maximal degree in co-relation 119417. Up to 2559 conditions per place. [2021-03-26 15:04:23,197 INFO L142 LiptonReduction]: Number of co-enabled transitions 8610 [2021-03-26 15:07:12,794 INFO L154 LiptonReduction]: Checked pairs total: 4721 [2021-03-26 15:07:12,794 INFO L156 LiptonReduction]: Total number of compositions: 13 [2021-03-26 15:07:12,794 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 174026 [2021-03-26 15:07:12,795 INFO L480 AbstractCegarLoop]: Abstraction has has 269 places, 1282 transitions, 27007 flow [2021-03-26 15:07:12,795 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 37.72727272727273) internal successors, (415), 11 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 15:07:12,795 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 15:07:12,795 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 15:07:12,795 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-03-26 15:07:12,795 INFO L428 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-26 15:07:12,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 15:07:12,796 INFO L82 PathProgramCache]: Analyzing trace with hash -146919033, now seen corresponding path program 3 times [2021-03-26 15:07:12,796 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 15:07:12,796 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390560774] [2021-03-26 15:07:12,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 15:07:12,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 15:07:12,815 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 15:07:12,816 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 15:07:12,827 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 15:07:12,828 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 15:07:12,839 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 15:07:12,840 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 15:07:12,847 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 15:07:12,847 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 15:07:12,855 INFO L142 QuantifierPusher]: treesize reduction 7, result has 68.2 percent of original size [2021-03-26 15:07:12,856 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-26 15:07:12,862 INFO L142 QuantifierPusher]: treesize reduction 4, result has 63.6 percent of original size [2021-03-26 15:07:12,862 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 15:07:12,869 INFO L142 QuantifierPusher]: treesize reduction 4, result has 63.6 percent of original size [2021-03-26 15:07:12,870 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 15:07:12,877 INFO L142 QuantifierPusher]: treesize reduction 1, result has 90.0 percent of original size [2021-03-26 15:07:12,878 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 15:07:12,886 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 15:07:12,887 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 15:07:12,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 15:07:12,887 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390560774] [2021-03-26 15:07:12,887 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 15:07:12,887 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-03-26 15:07:12,888 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2215208] [2021-03-26 15:07:12,888 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-26 15:07:12,888 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 15:07:12,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-26 15:07:12,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-03-26 15:07:12,889 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 179 [2021-03-26 15:07:12,889 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 1282 transitions, 27007 flow. Second operand has 9 states, 9 states have (on average 38.111111111111114) internal successors, (343), 9 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 15:07:12,889 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 15:07:12,890 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 179 [2021-03-26 15:07:12,890 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 15:07:20,726 INFO L129 PetriNetUnfolder]: 6171/18494 cut-off events. [2021-03-26 15:07:20,726 INFO L130 PetriNetUnfolder]: For 463238/466535 co-relation queries the response was YES. [2021-03-26 15:07:20,908 INFO L84 FinitePrefix]: Finished finitePrefix Result has 139701 conditions, 18494 events. 6171/18494 cut-off events. For 463238/466535 co-relation queries the response was YES. Maximal size of possible extension queue 1344. Compared 235056 event pairs, 1513 based on Foata normal form. 903/18646 useless extension candidates. Maximal degree in co-relation 139173. Up to 3461 conditions per place. [2021-03-26 15:07:20,983 INFO L132 encePairwiseOnDemand]: 116/179 looper letters, 578 selfloop transitions, 752 changer transitions 1/1366 dead transitions. [2021-03-26 15:07:20,983 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 1366 transitions, 30455 flow [2021-03-26 15:07:20,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-03-26 15:07:20,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2021-03-26 15:07:20,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 758 transitions. [2021-03-26 15:07:20,984 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.2823091247672253 [2021-03-26 15:07:20,984 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 758 transitions. [2021-03-26 15:07:20,985 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 758 transitions. [2021-03-26 15:07:20,985 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 15:07:20,985 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 758 transitions. [2021-03-26 15:07:20,986 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 50.53333333333333) internal successors, (758), 15 states have internal predecessors, (758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 15:07:20,989 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 179.0) internal successors, (2864), 16 states have internal predecessors, (2864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 15:07:20,989 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 179.0) internal successors, (2864), 16 states have internal predecessors, (2864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 15:07:20,989 INFO L185 Difference]: Start difference. First operand has 269 places, 1282 transitions, 27007 flow. Second operand 15 states and 758 transitions. [2021-03-26 15:07:20,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 1366 transitions, 30455 flow [2021-03-26 15:07:24,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 1366 transitions, 29722 flow, removed 359 selfloop flow, removed 1 redundant places. [2021-03-26 15:07:24,777 INFO L241 Difference]: Finished difference. Result has 286 places, 1221 transitions, 26575 flow [2021-03-26 15:07:24,778 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=23970, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=720, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=464, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=26575, PETRI_PLACES=286, PETRI_TRANSITIONS=1221} [2021-03-26 15:07:24,778 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 238 predicate places. [2021-03-26 15:07:24,778 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 15:07:24,778 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 286 places, 1221 transitions, 26575 flow [2021-03-26 15:07:24,778 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 286 places, 1221 transitions, 26575 flow [2021-03-26 15:07:24,788 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 286 places, 1221 transitions, 26575 flow [2021-03-26 15:07:28,083 INFO L129 PetriNetUnfolder]: 4191/14981 cut-off events. [2021-03-26 15:07:28,083 INFO L130 PetriNetUnfolder]: For 317978/320293 co-relation queries the response was YES. [2021-03-26 15:07:28,385 INFO L84 FinitePrefix]: Finished finitePrefix Result has 103704 conditions, 14981 events. 4191/14981 cut-off events. For 317978/320293 co-relation queries the response was YES. Maximal size of possible extension queue 1068. Compared 200019 event pairs, 956 based on Foata normal form. 608/14699 useless extension candidates. Maximal degree in co-relation 103148. Up to 2000 conditions per place. [2021-03-26 15:07:28,549 INFO L142 LiptonReduction]: Number of co-enabled transitions 7462 [2021-03-26 15:08:41,368 INFO L154 LiptonReduction]: Checked pairs total: 1473 [2021-03-26 15:08:41,368 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-26 15:08:41,368 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 76590 [2021-03-26 15:08:41,369 INFO L480 AbstractCegarLoop]: Abstraction has has 286 places, 1221 transitions, 26581 flow [2021-03-26 15:08:41,369 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 38.111111111111114) internal successors, (343), 9 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 15:08:41,369 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 15:08:41,369 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 15:08:41,369 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-03-26 15:08:41,369 INFO L428 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-26 15:08:41,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 15:08:41,370 INFO L82 PathProgramCache]: Analyzing trace with hash -1733494138, now seen corresponding path program 1 times [2021-03-26 15:08:41,370 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 15:08:41,370 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422901960] [2021-03-26 15:08:41,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 15:08:41,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 15:08:41,390 INFO L142 QuantifierPusher]: treesize reduction 19, result has 52.5 percent of original size [2021-03-26 15:08:41,391 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 15:08:41,405 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 15:08:41,405 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 15:08:41,417 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 15:08:41,418 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 15:08:41,421 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 15:08:41,421 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 15:08:41,424 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 15:08:41,425 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-26 15:08:41,437 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 15:08:41,437 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 15:08:41,447 INFO L142 QuantifierPusher]: treesize reduction 5, result has 70.6 percent of original size [2021-03-26 15:08:41,448 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 15:08:41,459 INFO L142 QuantifierPusher]: treesize reduction 11, result has 52.2 percent of original size [2021-03-26 15:08:41,460 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 15:08:41,469 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 15:08:41,469 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 15:08:41,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 15:08:41,470 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422901960] [2021-03-26 15:08:41,470 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 15:08:41,470 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-26 15:08:41,470 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448474781] [2021-03-26 15:08:41,470 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-26 15:08:41,470 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 15:08:41,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-26 15:08:41,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-03-26 15:08:41,471 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 182 [2021-03-26 15:08:41,471 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 1221 transitions, 26581 flow. Second operand has 8 states, 8 states have (on average 38.375) internal successors, (307), 8 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 15:08:41,471 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 15:08:41,471 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 182 [2021-03-26 15:08:41,471 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 15:08:49,230 INFO L129 PetriNetUnfolder]: 5928/18088 cut-off events. [2021-03-26 15:08:49,230 INFO L130 PetriNetUnfolder]: For 467712/470879 co-relation queries the response was YES. [2021-03-26 15:08:49,420 INFO L84 FinitePrefix]: Finished finitePrefix Result has 139892 conditions, 18088 events. 5928/18088 cut-off events. For 467712/470879 co-relation queries the response was YES. Maximal size of possible extension queue 1306. Compared 230853 event pairs, 2136 based on Foata normal form. 381/17659 useless extension candidates. Maximal degree in co-relation 139395. Up to 10012 conditions per place. [2021-03-26 15:08:49,494 INFO L132 encePairwiseOnDemand]: 163/182 looper letters, 1057 selfloop transitions, 159 changer transitions 53/1304 dead transitions. [2021-03-26 15:08:49,494 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 1304 transitions, 30726 flow [2021-03-26 15:08:49,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-26 15:08:49,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-03-26 15:08:49,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 570 transitions. [2021-03-26 15:08:49,503 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.28471528471528473 [2021-03-26 15:08:49,503 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 570 transitions. [2021-03-26 15:08:49,503 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 570 transitions. [2021-03-26 15:08:49,504 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 15:08:49,504 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 570 transitions. [2021-03-26 15:08:49,505 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 51.81818181818182) internal successors, (570), 11 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 15:08:49,507 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 182.0) internal successors, (2184), 12 states have internal predecessors, (2184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 15:08:49,507 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 182.0) internal successors, (2184), 12 states have internal predecessors, (2184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 15:08:49,507 INFO L185 Difference]: Start difference. First operand has 286 places, 1221 transitions, 26581 flow. Second operand 11 states and 570 transitions. [2021-03-26 15:08:49,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 1304 transitions, 30726 flow [2021-03-26 15:08:53,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 1304 transitions, 30123 flow, removed 43 selfloop flow, removed 5 redundant places. [2021-03-26 15:08:53,195 INFO L241 Difference]: Finished difference. Result has 297 places, 1206 transitions, 26336 flow [2021-03-26 15:08:53,196 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=25641, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=131, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1052, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=26336, PETRI_PLACES=297, PETRI_TRANSITIONS=1206} [2021-03-26 15:08:53,196 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 249 predicate places. [2021-03-26 15:08:53,196 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 15:08:53,196 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 297 places, 1206 transitions, 26336 flow [2021-03-26 15:08:53,196 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 297 places, 1206 transitions, 26336 flow [2021-03-26 15:08:53,208 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 295 places, 1206 transitions, 26336 flow [2021-03-26 15:08:56,084 INFO L129 PetriNetUnfolder]: 3828/14057 cut-off events. [2021-03-26 15:08:56,084 INFO L130 PetriNetUnfolder]: For 301717/303505 co-relation queries the response was YES. [2021-03-26 15:08:56,222 INFO L84 FinitePrefix]: Finished finitePrefix Result has 97666 conditions, 14057 events. 3828/14057 cut-off events. For 301717/303505 co-relation queries the response was YES. Maximal size of possible extension queue 1030. Compared 187622 event pairs, 903 based on Foata normal form. 529/13824 useless extension candidates. Maximal degree in co-relation 97071. Up to 1854 conditions per place. [2021-03-26 15:08:56,510 INFO L142 LiptonReduction]: Number of co-enabled transitions 7102 [2021-03-26 15:10:10,639 INFO L154 LiptonReduction]: Checked pairs total: 2774 [2021-03-26 15:10:10,640 INFO L156 LiptonReduction]: Total number of compositions: 9 [2021-03-26 15:10:10,640 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 77444 [2021-03-26 15:10:10,640 INFO L480 AbstractCegarLoop]: Abstraction has has 295 places, 1206 transitions, 26354 flow [2021-03-26 15:10:10,641 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 38.375) internal successors, (307), 8 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 15:10:10,641 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 15:10:10,641 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 15:10:10,641 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-03-26 15:10:10,641 INFO L428 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-26 15:10:10,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 15:10:10,641 INFO L82 PathProgramCache]: Analyzing trace with hash 777553884, now seen corresponding path program 1 times [2021-03-26 15:10:10,641 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 15:10:10,641 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397085020] [2021-03-26 15:10:10,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 15:10:10,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 15:10:10,664 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 15:10:10,664 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 15:10:10,669 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 15:10:10,669 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 15:10:10,675 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 15:10:10,675 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 15:10:10,682 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 15:10:10,682 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 15:10:10,693 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 15:10:10,693 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 15:10:10,704 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 15:10:10,705 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 15:10:10,716 INFO L142 QuantifierPusher]: treesize reduction 9, result has 43.8 percent of original size [2021-03-26 15:10:10,716 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 15:10:10,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 15:10:10,728 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397085020] [2021-03-26 15:10:10,728 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 15:10:10,728 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-26 15:10:10,728 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599516051] [2021-03-26 15:10:10,728 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-26 15:10:10,728 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 15:10:10,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-26 15:10:10,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-03-26 15:10:10,730 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 191 [2021-03-26 15:10:10,731 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 1206 transitions, 26354 flow. Second operand has 9 states, 9 states have (on average 179.88888888888889) internal successors, (1619), 9 states have internal predecessors, (1619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 15:10:10,731 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 15:10:10,731 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 191 [2021-03-26 15:10:10,731 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 15:10:16,336 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([108] L31-->L32: Formula: (or (not (< v_n3_2 v_n1_8)) (= v_n3_2 0)) InVars {n3=v_n3_2, n1=v_n1_8} OutVars{n3=v_n3_2, n1=v_n1_8} AuxVars[] AssignedVars[][50], [Black: 260#(and (<= (+ n3 1) n1) (or (<= 2 n2) (<= 2 n3)) (<= 0 n3)), Black: 232#(and (<= n1 n2) (<= (+ n3 1) n1) (<= 0 n3)), Black: 236#(and (<= n1 n3) (<= 1 n1)), Black: 238#(and (<= n1 n2) (<= (+ n3 1) n1) (<= 0 n3) (<= 2 n2)), Black: 242#(and (<= n1 n3) (or (<= 3 n2) (<= 2 n3)) (<= 1 n1)), Black: 244#(and (or (<= 1 n3) (<= 2 n2)) (<= 1 n1) (<= 0 n3) (<= n3 n1)), Black: 248#(and (or (<= n1 n2) (<= 2 n3)) (or (<= 1 n3) (<= 2 n2)) (<= 1 n1) (<= 0 n3) (<= n3 n1) (or (<= n1 n3) (<= n1 n2))), Black: 250#(and (<= n1 n3) (or (<= 2 n2) (<= 2 n3)) (<= 1 n1)), Black: 252#(and (<= (+ n3 1) n1) (or (<= 1 n3) (<= 2 n2)) (<= 0 n3)), 280#(<= 0 n3), 32#L77true, Black: 288#(and (<= n1 n3) (<= 1 n3) (<= n3 (+ n2 1))), Black: 290#(and (<= n1 n3) (<= 1 n3) (<= n3 n2)), 40#thread2EXITtrue, Black: 292#(and (<= n1 n3) (<= 1 n3) (<= n3 n2) (not (= n3 n2))), Black: 279#(and (<= n1 n3) (<= 0 n3)), Black: 281#(and (<= n3 n2) (<= 0 n3)), Black: 282#(and (<= 1 n3) (<= n3 (+ n2 1))), Black: 283#(and (<= 1 n3) (<= n3 n2)), Black: 284#(and (<= 1 n3) (<= n3 n2) (not (= n3 n2))), Black: 286#(and (<= n1 n3) (<= n3 n2) (<= 0 n3)), 50#thread3EXITtrue, 55#L32true, Black: 306#(and (<= n1 n2) (< n2 (+ n3 1)) (<= n3 n2) (<= 0 n2) (<= n2 0)), Black: 307#(and (<= n2 n3) (<= n3 0) (<= 0 n2)), Black: 308#(and (<= 0 n2) (<= (+ n2 1) n3) (<= n3 1)), Black: 309#(and (< n2 (+ n3 1)) (<= n3 n2) (<= 1 n2)), 315#true, 67#true, Black: 320#(and (<= n1 n2) (<= 0 n1)), Black: 336#(and (<= 1 n1) (or (<= n1 n3) (<= 1 n2)) (or (<= n1 n3) (< n2 n1))), Black: 321#(and (<= 1 n1) (<= n1 (+ n2 1))), Black: 323#(and (<= 1 n1) (or (<= n1 n3) (<= 0 n2))), Black: 328#(and (<= n1 n2) (<= 1 n1)), Black: 332#(and (<= n1 n3) (<= n1 n2) (<= 1 n1)), Black: 317#(and (<= n1 n3) (<= n1 n2) (<= n2 n1) (<= n3 n1) (<= 0 n2)), Black: 318#(and (<= n1 n2) (<= n2 n1) (<= n3 n1) (<= 0 n2)), Black: 83#(and (<= i3 0) (<= 2 i) (<= i1 1) (<= i 2) (<= 0 i3) (<= 1 i1)), Black: 69#(and (<= i 0) (<= 0 i)), Black: 334#(and (<= n1 n2) (<= 1 n1) (<= n3 n1)), Black: 319#(and (<= n1 n2) (<= 0 n1) (<= n3 n1)), Black: 79#(and (<= i3 0) (<= 1 i) (<= i 1) (<= 0 i3)), 350#true, 95#true, Black: 352#(and (<= n1 n3) (<= 0 n3) (<= n2 n1) (<= n3 n1)), Black: 354#(and (<= n1 (+ n3 1)) (<= (+ n3 1) n1) (<= 1 n1)), Black: 355#(and (<= n1 n3) (<= 1 n1) (< n3 (+ n1 1))), Black: 97#(and (<= n1 n3) (<= 0 n3) (<= n2 n1) (<= n3 n1)), Black: 357#(and (<= n1 n3) (<= 1 n1) (<= n2 n1) (< n3 (+ n1 1))), Black: 98#(and (<= (+ n3 1) n1) (<= 1 n1) (<= (+ n2 1) n1)), Black: 99#(and (<= (+ n3 1) n1) (<= 1 n1) (= n2 n1)), Black: 101#(and (<= 1 n1) (<= (+ n1 1) n2)), 366#(and (<= n3 n2) (<= 0 n3) (<= n3 n1)), Black: 111#e2, 114#true, Black: 116#(and (<= n1 n3) (<= n3 n2) (<= 0 n2)), Black: 117#(and (<= n1 n2) (<= n3 n2) (<= 0 n2)), Black: 118#(and (<= n3 n2) (<= 0 n2)), Black: 119#(and (<= 1 n2) (<= (+ n3 1) n2)), Black: 120#(and (= n3 n2) (<= 1 n2)), Black: 385#(and (<= (+ n2 1) n1) (<= n3 n2) (<= 0 n3) (<= 1 n2)), Black: 387#(and (<= (+ n2 1) n1) (<= 0 n3) (<= n3 n1) (<= 1 n2)), Black: 121#(and (<= (+ n2 1) n3) (<= 1 n2)), Black: 123#(and (<= n1 n3) (<= 1 n2) (<= (+ n3 1) n2)), Black: 365#(and (<= n1 n2) (<= 0 n3) (<= n3 n1)), Black: 125#(and (<= n1 n2) (<= 1 n2) (<= (+ n3 1) n2)), Black: 367#(and (<= 0 n3) (<= n3 n1) (<= 0 n2)), Black: 369#(and (<= 0 n1) (<= 1 n2)), Black: 370#(and (<= 1 n1) (<= 1 n2)), Black: 371#(and (<= (+ n2 1) n1) (<= 1 n2)), Black: 139#e3, Black: 373#(and (<= n1 n2) (<= 0 n3) (<= n3 n1) (<= 1 n2)), Black: 375#(and (<= n1 n2) (<= 1 n1) (<= 0 n3) (<= n3 n1)), Black: 377#(and (<= n3 n2) (<= 0 n3) (<= n3 n1) (<= 1 n2)), Black: 379#(and (<= 1 n1) (<= n3 n2) (<= 0 n3) (<= n3 n1) (<= 1 n2)), Black: 381#(and (<= 0 n3) (<= n3 n1) (<= 1 n2)), Black: 144#e1, Black: 383#(and (<= 1 n1) (<= 0 n3) (<= n3 n1) (<= 1 n2)), 147#true, 403#true, Black: 151#(and (<= n3 n2) (<= 0 n3)), Black: 152#(and (<= 0 n3) (<= (+ n3 1) n2)), Black: 153#(and (<= 1 n3) (< n3 (+ n2 1))), Black: 154#(and (<= 1 n3) (< n3 (+ n2 1)) (not (= n3 n2))), 160#true, Black: 162#(and (<= n1 n2) (<= n3 n2) (<= n2 n3) (<= 0 n2)), Black: 163#(and (= n3 n2) (<= 0 n2)), Black: 164#(and (<= n2 n3) (<= 0 n2)), Black: 165#(and (<= n2 (+ n3 1)) (<= 1 n2)), Black: 166#(and (<= n2 n3) (<= 1 n2)), Black: 417#(and (<= 1 n3) (<= 1 n1)), Black: 419#(and (<= 1 n3) (<= 0 n1)), Black: 421#(and (<= 1 n3) (< n1 (+ n2 1)) (<= 1 n1)), Black: 423#(and (<= 1 n3) (or (<= (+ n3 1) n1) (< n1 (+ n2 1))) (<= 1 n1)), Black: 425#(and (<= 1 n3) (<= (+ n3 1) n1)), Black: 427#(and (<= 1 n3) (<= (+ n3 1) n1) (< n1 (+ n2 1))), Black: 429#(and (<= (+ n3 1) n1) (<= 1 n1) (or (<= n1 n2) (<= 1 n3))), Black: 431#(and (<= (+ n3 1) n1) (< n1 (+ n2 1)) (<= 1 n1)), Black: 433#(and (<= (+ n3 1) n1) (< n1 (+ n2 1)) (<= 1 n1) (or (<= 1 n3) (<= (+ n1 1) n2))), 187#(and (<= (+ n3 1) n1) (<= 0 n3)), Black: 406#(and (<= 0 n3) (<= n3 n1) (= n2 n1)), Black: 408#(and (or (<= 1 n3) (= n2 n1)) (<= 0 n1)), Black: 409#(and (<= 0 n1) (or (<= 1 n3) (<= (+ n1 1) n2))), Black: 410#(and (<= 1 n1) (or (<= n1 n2) (<= 1 n3))), Black: 415#(and (<= 1 n3) (<= 0 n2) (= n2 n1)), Black: 178#(and (= n3 n1) (<= 1 n1)), Black: 195#(and (<= 1 n1) (<= 0 n3) (<= 2 n2)), Black: 197#(and (<= 1 n1) (<= 0 n3) (<= 3 n2)), Black: 185#(and (<= 0 n3) (<= n3 n1)), Black: 201#(and (< n2 n1) (<= 0 n3) (<= 3 n2)), Black: 189#(and (<= 1 n1) (<= 0 n3) (or (<= n1 n3) (<= 2 n2))), Black: 191#(and (<= 1 n1) (<= 0 n3) (or (<= (+ n1 1) n3) (<= 2 n2))), Black: 453#(and (<= 0 n3) (<= n3 n1) (<= 0 n2)), Black: 175#(<= 0 n3), Black: 456#(and (<= 1 n1) (<= 1 n2)), Black: 457#(and (< n1 (+ n2 1)) (<= 1 n1)), Black: 461#(and (< n1 (+ n2 1)) (<= 1 n1) (<= 0 n3) (<= n3 n1)), 475#true, 230#(and (<= (+ n3 1) n1) (<= 0 n3)), Black: 480#(and (<= (+ n3 1) n1) (<= 0 n3)), Black: 481#(and (<= 1 n3) (< n3 (+ n1 1))), Black: 484#(and (<= n1 n3) (<= 1 n1) (<= n2 n1) (< n3 (+ n1 1))), Black: 486#(and (<= 1 n3) (<= n2 n3) (< n3 (+ n1 1))), Black: 488#(and (<= 1 n3) (<= (+ n3 1) n1) (<= n2 n3)), Black: 490#(and (<= 1 n3) (<= (+ n3 1) n1)), 498#true]) [2021-03-26 15:10:16,336 INFO L384 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2021-03-26 15:10:16,336 INFO L387 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2021-03-26 15:10:16,336 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-26 15:10:16,337 INFO L387 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2021-03-26 15:10:16,856 INFO L129 PetriNetUnfolder]: 4510/15820 cut-off events. [2021-03-26 15:10:16,856 INFO L130 PetriNetUnfolder]: For 333175/335936 co-relation queries the response was YES. [2021-03-26 15:10:17,012 INFO L84 FinitePrefix]: Finished finitePrefix Result has 111677 conditions, 15820 events. 4510/15820 cut-off events. For 333175/335936 co-relation queries the response was YES. Maximal size of possible extension queue 1000. Compared 207495 event pairs, 1002 based on Foata normal form. 809/15809 useless extension candidates. Maximal degree in co-relation 111104. Up to 2186 conditions per place. [2021-03-26 15:10:17,071 INFO L132 encePairwiseOnDemand]: 181/191 looper letters, 29 selfloop transitions, 29 changer transitions 3/1240 dead transitions. [2021-03-26 15:10:17,071 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 1240 transitions, 26611 flow [2021-03-26 15:10:17,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-03-26 15:10:17,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-03-26 15:10:17,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2371 transitions. [2021-03-26 15:10:17,073 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.954893274265002 [2021-03-26 15:10:17,074 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2371 transitions. [2021-03-26 15:10:17,074 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2371 transitions. [2021-03-26 15:10:17,074 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 15:10:17,074 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2371 transitions. [2021-03-26 15:10:17,077 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 182.3846153846154) internal successors, (2371), 13 states have internal predecessors, (2371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 15:10:17,080 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 191.0) internal successors, (2674), 14 states have internal predecessors, (2674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 15:10:17,080 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 191.0) internal successors, (2674), 14 states have internal predecessors, (2674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 15:10:17,080 INFO L185 Difference]: Start difference. First operand has 295 places, 1206 transitions, 26354 flow. Second operand 13 states and 2371 transitions. [2021-03-26 15:10:17,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 1240 transitions, 26611 flow [2021-03-26 15:10:20,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 1240 transitions, 26295 flow, removed 95 selfloop flow, removed 5 redundant places. [2021-03-26 15:10:20,135 INFO L241 Difference]: Finished difference. Result has 308 places, 1223 transitions, 26182 flow [2021-03-26 15:10:20,136 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=26038, PETRI_DIFFERENCE_MINUEND_PLACES=290, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=26182, PETRI_PLACES=308, PETRI_TRANSITIONS=1223} [2021-03-26 15:10:20,136 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 260 predicate places. [2021-03-26 15:10:20,136 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 15:10:20,136 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 308 places, 1223 transitions, 26182 flow [2021-03-26 15:10:20,136 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 308 places, 1223 transitions, 26182 flow [2021-03-26 15:10:20,148 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 308 places, 1223 transitions, 26182 flow [2021-03-26 15:10:23,620 INFO L129 PetriNetUnfolder]: 4207/15373 cut-off events. [2021-03-26 15:10:23,621 INFO L130 PetriNetUnfolder]: For 319796/321909 co-relation queries the response was YES. [2021-03-26 15:10:23,942 INFO L84 FinitePrefix]: Finished finitePrefix Result has 110337 conditions, 15373 events. 4207/15373 cut-off events. For 319796/321909 co-relation queries the response was YES. Maximal size of possible extension queue 1015. Compared 205030 event pairs, 897 based on Foata normal form. 663/15325 useless extension candidates. Maximal degree in co-relation 109624. Up to 2175 conditions per place. [2021-03-26 15:10:24,130 INFO L142 LiptonReduction]: Number of co-enabled transitions 7618 [2021-03-26 15:11:44,331 INFO L154 LiptonReduction]: Checked pairs total: 1899 [2021-03-26 15:11:44,331 INFO L156 LiptonReduction]: Total number of compositions: 5 [2021-03-26 15:11:44,331 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 84195 [2021-03-26 15:11:44,332 INFO L480 AbstractCegarLoop]: Abstraction has has 307 places, 1222 transitions, 26189 flow [2021-03-26 15:11:44,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 179.88888888888889) internal successors, (1619), 9 states have internal predecessors, (1619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 15:11:44,333 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 15:11:44,333 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 15:11:44,333 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-03-26 15:11:44,333 INFO L428 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-26 15:11:44,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 15:11:44,333 INFO L82 PathProgramCache]: Analyzing trace with hash 1242840150, now seen corresponding path program 1 times [2021-03-26 15:11:44,333 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 15:11:44,333 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946661624] [2021-03-26 15:11:44,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 15:11:44,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 15:11:44,356 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 15:11:44,357 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 15:11:44,362 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 15:11:44,362 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 15:11:44,366 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 15:11:44,367 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 15:11:44,372 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 15:11:44,372 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 15:11:44,378 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 15:11:44,378 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 15:11:44,386 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 15:11:44,386 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 15:11:44,394 INFO L142 QuantifierPusher]: treesize reduction 9, result has 43.8 percent of original size [2021-03-26 15:11:44,394 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 15:11:44,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 15:11:44,409 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946661624] [2021-03-26 15:11:44,410 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 15:11:44,410 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-26 15:11:44,410 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085326527] [2021-03-26 15:11:44,410 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-26 15:11:44,410 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 15:11:44,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-26 15:11:44,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-03-26 15:11:44,412 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 196 [2021-03-26 15:11:44,413 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 307 places, 1222 transitions, 26189 flow. Second operand has 9 states, 9 states have (on average 180.88888888888889) internal successors, (1628), 9 states have internal predecessors, (1628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 15:11:44,413 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 15:11:44,413 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 196 [2021-03-26 15:11:44,413 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 15:11:50,555 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([108] L31-->L32: Formula: (or (not (< v_n3_2 v_n1_8)) (= v_n3_2 0)) InVars {n3=v_n3_2, n1=v_n1_8} OutVars{n3=v_n3_2, n1=v_n1_8} AuxVars[] AssignedVars[][50], [Black: 260#(and (<= (+ n3 1) n1) (or (<= 2 n2) (<= 2 n3)) (<= 0 n3)), Black: 232#(and (<= n1 n2) (<= (+ n3 1) n1) (<= 0 n3)), Black: 514#(and (<= 2 i) (<= i 2) (<= 1 i3) (<= i3 1) (<= i1 0) (<= 0 i1)), Black: 236#(and (<= n1 n3) (<= 1 n1)), Black: 500#(and (<= i 0) (<= 0 i)), Black: 501#(and (<= i1 0) (<= 0 i1)), Black: 238#(and (<= n1 n2) (<= (+ n3 1) n1) (<= 0 n3) (<= 2 n2)), Black: 502#(and (<= 1 i) (<= i 1)), Black: 242#(and (<= n1 n3) (or (<= 3 n2) (<= 2 n3)) (<= 1 n1)), Black: 520#(and (<= 2 i2) (<= i2 2) (< 2 i) (<= i 3) (<= 1 i3) (<= i3 1) (<= i1 0) (<= 0 i1)), Black: 244#(and (or (<= 1 n3) (<= 2 n2)) (<= 1 n1) (<= 0 n3) (<= n3 n1)), Black: 510#(and (<= 1 i) (<= i1 0) (<= 0 i1) (<= i 1)), Black: 248#(and (or (<= n1 n2) (<= 2 n3)) (or (<= 1 n3) (<= 2 n2)) (<= 1 n1) (<= 0 n3) (<= n3 n1) (or (<= n1 n3) (<= n1 n2))), 528#true, Black: 250#(and (<= n1 n3) (or (<= 2 n2) (<= 2 n3)) (<= 1 n1)), Black: 252#(and (<= (+ n3 1) n1) (or (<= 1 n3) (<= 2 n2)) (<= 0 n3)), 280#(<= 0 n3), 32#L77true, Black: 288#(and (<= n1 n3) (<= 1 n3) (<= n3 (+ n2 1))), Black: 290#(and (<= n1 n3) (<= 1 n3) (<= n3 n2)), Black: 292#(and (<= n1 n3) (<= 1 n3) (<= n3 n2) (not (= n3 n2))), 40#thread2EXITtrue, Black: 279#(and (<= n1 n3) (<= 0 n3)), Black: 281#(and (<= n3 n2) (<= 0 n3)), Black: 282#(and (<= 1 n3) (<= n3 (+ n2 1))), Black: 283#(and (<= 1 n3) (<= n3 n2)), Black: 284#(and (<= 1 n3) (<= n3 n2) (not (= n3 n2))), Black: 286#(and (<= n1 n3) (<= n3 n2) (<= 0 n3)), 50#thread3EXITtrue, Black: 306#(and (<= n1 n2) (< n2 (+ n3 1)) (<= n3 n2) (<= 0 n2) (<= n2 0)), 55#L32true, Black: 307#(and (<= n2 n3) (<= n3 0) (<= 0 n2)), Black: 308#(and (<= 0 n2) (<= (+ n2 1) n3) (<= n3 1)), Black: 309#(and (< n2 (+ n3 1)) (<= n3 n2) (<= 1 n2)), 315#true, 67#true, Black: 320#(and (<= n1 n2) (<= 0 n1)), Black: 336#(and (<= 1 n1) (or (<= n1 n3) (<= 1 n2)) (or (<= n1 n3) (< n2 n1))), Black: 321#(and (<= 1 n1) (<= n1 (+ n2 1))), Black: 323#(and (<= 1 n1) (or (<= n1 n3) (<= 0 n2))), Black: 328#(and (<= n1 n2) (<= 1 n1)), Black: 332#(and (<= n1 n3) (<= n1 n2) (<= 1 n1)), Black: 317#(and (<= n1 n3) (<= n1 n2) (<= n2 n1) (<= n3 n1) (<= 0 n2)), Black: 318#(and (<= n1 n2) (<= n2 n1) (<= n3 n1) (<= 0 n2)), Black: 83#(and (<= i3 0) (<= 2 i) (<= i1 1) (<= i 2) (<= 0 i3) (<= 1 i1)), Black: 69#(and (<= i 0) (<= 0 i)), Black: 334#(and (<= n1 n2) (<= 1 n1) (<= n3 n1)), Black: 79#(and (<= i3 0) (<= 1 i) (<= i 1) (<= 0 i3)), 350#true, 95#true, Black: 352#(and (<= n1 n3) (<= 0 n3) (<= n2 n1) (<= n3 n1)), Black: 354#(and (<= n1 (+ n3 1)) (<= (+ n3 1) n1) (<= 1 n1)), Black: 355#(and (<= n1 n3) (<= 1 n1) (< n3 (+ n1 1))), Black: 97#(and (<= n1 n3) (<= 0 n3) (<= n2 n1) (<= n3 n1)), Black: 357#(and (<= n1 n3) (<= 1 n1) (<= n2 n1) (< n3 (+ n1 1))), Black: 98#(and (<= (+ n3 1) n1) (<= 1 n1) (<= (+ n2 1) n1)), Black: 99#(and (<= (+ n3 1) n1) (<= 1 n1) (= n2 n1)), Black: 101#(and (<= 1 n1) (<= (+ n1 1) n2)), 366#(and (<= n3 n2) (<= 0 n3) (<= n3 n1)), Black: 111#e2, 114#true, Black: 116#(and (<= n1 n3) (<= n3 n2) (<= 0 n2)), Black: 117#(and (<= n1 n2) (<= n3 n2) (<= 0 n2)), Black: 118#(and (<= n3 n2) (<= 0 n2)), Black: 119#(and (<= 1 n2) (<= (+ n3 1) n2)), Black: 120#(and (= n3 n2) (<= 1 n2)), Black: 385#(and (<= (+ n2 1) n1) (<= n3 n2) (<= 0 n3) (<= 1 n2)), Black: 121#(and (<= (+ n2 1) n3) (<= 1 n2)), Black: 387#(and (<= (+ n2 1) n1) (<= 0 n3) (<= n3 n1) (<= 1 n2)), Black: 123#(and (<= n1 n3) (<= 1 n2) (<= (+ n3 1) n2)), Black: 365#(and (<= n1 n2) (<= 0 n3) (<= n3 n1)), Black: 125#(and (<= n1 n2) (<= 1 n2) (<= (+ n3 1) n2)), Black: 367#(and (<= 0 n3) (<= n3 n1) (<= 0 n2)), Black: 369#(and (<= 0 n1) (<= 1 n2)), Black: 370#(and (<= 1 n1) (<= 1 n2)), Black: 371#(and (<= (+ n2 1) n1) (<= 1 n2)), Black: 373#(and (<= n1 n2) (<= 0 n3) (<= n3 n1) (<= 1 n2)), Black: 139#e3, Black: 375#(and (<= n1 n2) (<= 1 n1) (<= 0 n3) (<= n3 n1)), Black: 377#(and (<= n3 n2) (<= 0 n3) (<= n3 n1) (<= 1 n2)), Black: 379#(and (<= 1 n1) (<= n3 n2) (<= 0 n3) (<= n3 n1) (<= 1 n2)), Black: 381#(and (<= 0 n3) (<= n3 n1) (<= 1 n2)), Black: 383#(and (<= 1 n1) (<= 0 n3) (<= n3 n1) (<= 1 n2)), Black: 144#e1, 147#true, 403#true, Black: 151#(and (<= n3 n2) (<= 0 n3)), Black: 152#(and (<= 0 n3) (<= (+ n3 1) n2)), Black: 153#(and (<= 1 n3) (< n3 (+ n2 1))), Black: 154#(and (<= 1 n3) (< n3 (+ n2 1)) (not (= n3 n2))), 160#true, Black: 162#(and (<= n1 n2) (<= n3 n2) (<= n2 n3) (<= 0 n2)), Black: 163#(and (= n3 n2) (<= 0 n2)), Black: 164#(and (<= n2 n3) (<= 0 n2)), Black: 165#(and (<= n2 (+ n3 1)) (<= 1 n2)), Black: 166#(and (<= n2 n3) (<= 1 n2)), Black: 417#(and (<= 1 n3) (<= 1 n1)), Black: 419#(and (<= 1 n3) (<= 0 n1)), Black: 421#(and (<= 1 n3) (< n1 (+ n2 1)) (<= 1 n1)), Black: 423#(and (<= 1 n3) (or (<= (+ n3 1) n1) (< n1 (+ n2 1))) (<= 1 n1)), Black: 425#(and (<= 1 n3) (<= (+ n3 1) n1)), Black: 427#(and (<= 1 n3) (<= (+ n3 1) n1) (< n1 (+ n2 1))), Black: 429#(and (<= (+ n3 1) n1) (<= 1 n1) (or (<= n1 n2) (<= 1 n3))), Black: 431#(and (<= (+ n3 1) n1) (< n1 (+ n2 1)) (<= 1 n1)), Black: 433#(and (<= (+ n3 1) n1) (< n1 (+ n2 1)) (<= 1 n1) (or (<= 1 n3) (<= (+ n1 1) n2))), 187#(and (<= (+ n3 1) n1) (<= 0 n3)), Black: 406#(and (<= 0 n3) (<= n3 n1) (= n2 n1)), Black: 408#(and (or (<= 1 n3) (= n2 n1)) (<= 0 n1)), Black: 409#(and (<= 0 n1) (or (<= 1 n3) (<= (+ n1 1) n2))), Black: 410#(and (<= 1 n1) (or (<= n1 n2) (<= 1 n3))), Black: 415#(and (<= 1 n3) (<= 0 n2) (= n2 n1)), Black: 178#(and (= n3 n1) (<= 1 n1)), Black: 195#(and (<= 1 n1) (<= 0 n3) (<= 2 n2)), Black: 197#(and (<= 1 n1) (<= 0 n3) (<= 3 n2)), Black: 185#(and (<= 0 n3) (<= n3 n1)), Black: 201#(and (< n2 n1) (<= 0 n3) (<= 3 n2)), Black: 189#(and (<= 1 n1) (<= 0 n3) (or (<= n1 n3) (<= 2 n2))), Black: 453#(and (<= 0 n3) (<= n3 n1) (<= 0 n2)), Black: 191#(and (<= 1 n1) (<= 0 n3) (or (<= (+ n1 1) n3) (<= 2 n2))), Black: 456#(and (<= 1 n1) (<= 1 n2)), Black: 175#(<= 0 n3), Black: 457#(and (< n1 (+ n2 1)) (<= 1 n1)), Black: 461#(and (< n1 (+ n2 1)) (<= 1 n1) (<= 0 n3) (<= n3 n1)), 475#true, 230#(and (<= (+ n3 1) n1) (<= 0 n3)), Black: 480#(and (<= (+ n3 1) n1) (<= 0 n3)), Black: 481#(and (<= 1 n3) (< n3 (+ n1 1))), Black: 484#(and (<= n1 n3) (<= 1 n1) (<= n2 n1) (< n3 (+ n1 1))), Black: 486#(and (<= 1 n3) (<= n2 n3) (< n3 (+ n1 1))), 498#true]) [2021-03-26 15:11:50,556 INFO L384 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2021-03-26 15:11:50,556 INFO L387 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2021-03-26 15:11:50,556 INFO L387 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2021-03-26 15:11:50,556 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-26 15:11:51,161 INFO L129 PetriNetUnfolder]: 4616/16529 cut-off events. [2021-03-26 15:11:51,162 INFO L130 PetriNetUnfolder]: For 340432/344214 co-relation queries the response was YES. [2021-03-26 15:11:51,448 INFO L84 FinitePrefix]: Finished finitePrefix Result has 121797 conditions, 16529 events. 4616/16529 cut-off events. For 340432/344214 co-relation queries the response was YES. Maximal size of possible extension queue 1097. Compared 219325 event pairs, 1011 based on Foata normal form. 1470/17183 useless extension candidates. Maximal degree in co-relation 121220. Up to 2343 conditions per place. [2021-03-26 15:11:51,527 INFO L132 encePairwiseOnDemand]: 182/196 looper letters, 38 selfloop transitions, 45 changer transitions 51/1262 dead transitions. [2021-03-26 15:11:51,527 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 324 places, 1262 transitions, 26606 flow [2021-03-26 15:11:51,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-03-26 15:11:51,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2021-03-26 15:11:51,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 3302 transitions. [2021-03-26 15:11:51,548 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9359410430839002 [2021-03-26 15:11:51,548 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 3302 transitions. [2021-03-26 15:11:51,548 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 3302 transitions. [2021-03-26 15:11:51,548 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 15:11:51,548 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 3302 transitions. [2021-03-26 15:11:51,553 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 183.44444444444446) internal successors, (3302), 18 states have internal predecessors, (3302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 15:11:51,556 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 196.0) internal successors, (3724), 19 states have internal predecessors, (3724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 15:11:51,557 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 196.0) internal successors, (3724), 19 states have internal predecessors, (3724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 15:11:51,557 INFO L185 Difference]: Start difference. First operand has 307 places, 1222 transitions, 26189 flow. Second operand 18 states and 3302 transitions. [2021-03-26 15:11:51,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 324 places, 1262 transitions, 26606 flow [2021-03-26 15:11:54,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 323 places, 1262 transitions, 26531 flow, removed 34 selfloop flow, removed 1 redundant places. [2021-03-26 15:11:54,533 INFO L241 Difference]: Finished difference. Result has 332 places, 1192 transitions, 25131 flow [2021-03-26 15:11:54,534 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=26127, PETRI_DIFFERENCE_MINUEND_PLACES=306, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=25131, PETRI_PLACES=332, PETRI_TRANSITIONS=1192} [2021-03-26 15:11:54,534 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 284 predicate places. [2021-03-26 15:11:54,534 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 15:11:54,534 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 332 places, 1192 transitions, 25131 flow [2021-03-26 15:11:54,534 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 332 places, 1192 transitions, 25131 flow [2021-03-26 15:11:54,543 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 332 places, 1192 transitions, 25131 flow [2021-03-26 15:11:58,114 INFO L129 PetriNetUnfolder]: 4335/15842 cut-off events. [2021-03-26 15:11:58,114 INFO L130 PetriNetUnfolder]: For 339577/341972 co-relation queries the response was YES. [2021-03-26 15:11:58,284 INFO L84 FinitePrefix]: Finished finitePrefix Result has 117431 conditions, 15842 events. 4335/15842 cut-off events. For 339577/341972 co-relation queries the response was YES. Maximal size of possible extension queue 1057. Compared 211154 event pairs, 872 based on Foata normal form. 718/15796 useless extension candidates. Maximal degree in co-relation 116682. Up to 2327 conditions per place. [2021-03-26 15:11:58,475 INFO L142 LiptonReduction]: Number of co-enabled transitions 7780 [2021-03-26 15:12:38,104 INFO L154 LiptonReduction]: Checked pairs total: 396 [2021-03-26 15:12:38,105 INFO L156 LiptonReduction]: Total number of compositions: 5 [2021-03-26 15:12:38,105 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 43571 [2021-03-26 15:12:38,105 INFO L480 AbstractCegarLoop]: Abstraction has has 331 places, 1191 transitions, 25162 flow [2021-03-26 15:12:38,106 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 180.88888888888889) internal successors, (1628), 9 states have internal predecessors, (1628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 15:12:38,106 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 15:12:38,106 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 15:12:38,106 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-03-26 15:12:38,106 INFO L428 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-26 15:12:38,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 15:12:38,107 INFO L82 PathProgramCache]: Analyzing trace with hash -1796354838, now seen corresponding path program 1 times [2021-03-26 15:12:38,107 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 15:12:38,107 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349072200] [2021-03-26 15:12:38,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 15:12:38,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 15:12:38,123 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 15:12:38,124 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 15:12:38,134 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 15:12:38,135 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 15:12:38,141 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 15:12:38,142 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 15:12:38,153 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 15:12:38,153 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 15:12:38,158 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 15:12:38,159 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 15:12:38,164 INFO L142 QuantifierPusher]: treesize reduction 21, result has 34.4 percent of original size [2021-03-26 15:12:38,164 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 15:12:38,179 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 15:12:38,179 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 15:12:38,188 INFO L142 QuantifierPusher]: treesize reduction 1, result has 90.0 percent of original size [2021-03-26 15:12:38,189 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 15:12:38,198 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 15:12:38,199 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 15:12:38,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 15:12:38,199 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349072200] [2021-03-26 15:12:38,199 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 15:12:38,199 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-03-26 15:12:38,200 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032674094] [2021-03-26 15:12:38,200 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-03-26 15:12:38,200 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 15:12:38,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-03-26 15:12:38,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-03-26 15:12:38,201 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 201 [2021-03-26 15:12:38,201 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 331 places, 1191 transitions, 25162 flow. Second operand has 10 states, 10 states have (on average 44.9) internal successors, (449), 10 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 15:12:38,202 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 15:12:38,202 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 201 [2021-03-26 15:12:38,202 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 15:12:46,963 INFO L129 PetriNetUnfolder]: 6704/21014 cut-off events. [2021-03-26 15:12:46,963 INFO L130 PetriNetUnfolder]: For 525373/528297 co-relation queries the response was YES. [2021-03-26 15:12:47,393 INFO L84 FinitePrefix]: Finished finitePrefix Result has 170171 conditions, 21014 events. 6704/21014 cut-off events. For 525373/528297 co-relation queries the response was YES. Maximal size of possible extension queue 1299. Compared 270257 event pairs, 1281 based on Foata normal form. 1029/21353 useless extension candidates. Maximal degree in co-relation 169601. Up to 3051 conditions per place. [2021-03-26 15:12:47,475 INFO L132 encePairwiseOnDemand]: 144/201 looper letters, 850 selfloop transitions, 648 changer transitions 98/1668 dead transitions. [2021-03-26 15:12:47,475 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 347 places, 1668 transitions, 37851 flow [2021-03-26 15:12:47,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-03-26 15:12:47,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2021-03-26 15:12:47,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1004 transitions. [2021-03-26 15:12:47,477 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.2938249926836406 [2021-03-26 15:12:47,477 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1004 transitions. [2021-03-26 15:12:47,477 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1004 transitions. [2021-03-26 15:12:47,477 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 15:12:47,478 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1004 transitions. [2021-03-26 15:12:47,479 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 59.05882352941177) internal successors, (1004), 17 states have internal predecessors, (1004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 15:12:47,482 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 201.0) internal successors, (3618), 18 states have internal predecessors, (3618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 15:12:47,483 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 201.0) internal successors, (3618), 18 states have internal predecessors, (3618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 15:12:47,483 INFO L185 Difference]: Start difference. First operand has 331 places, 1191 transitions, 25162 flow. Second operand 17 states and 1004 transitions. [2021-03-26 15:12:47,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 347 places, 1668 transitions, 37851 flow [2021-03-26 15:12:52,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 342 places, 1668 transitions, 37735 flow, removed 46 selfloop flow, removed 5 redundant places. [2021-03-26 15:12:52,241 INFO L241 Difference]: Finished difference. Result has 357 places, 1349 transitions, 31041 flow [2021-03-26 15:12:52,242 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=24909, PETRI_DIFFERENCE_MINUEND_PLACES=326, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=450, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=669, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=31041, PETRI_PLACES=357, PETRI_TRANSITIONS=1349} [2021-03-26 15:12:52,242 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 309 predicate places. [2021-03-26 15:12:52,242 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 15:12:52,242 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 357 places, 1349 transitions, 31041 flow [2021-03-26 15:12:52,243 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 357 places, 1349 transitions, 31041 flow [2021-03-26 15:12:52,253 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 353 places, 1349 transitions, 31041 flow [2021-03-26 15:12:56,685 INFO L129 PetriNetUnfolder]: 4774/17395 cut-off events. [2021-03-26 15:12:56,685 INFO L130 PetriNetUnfolder]: For 475109/477683 co-relation queries the response was YES. [2021-03-26 15:12:56,906 INFO L84 FinitePrefix]: Finished finitePrefix Result has 140253 conditions, 17395 events. 4774/17395 cut-off events. For 475109/477683 co-relation queries the response was YES. Maximal size of possible extension queue 1184. Compared 233308 event pairs, 970 based on Foata normal form. 836/17389 useless extension candidates. Maximal degree in co-relation 139782. Up to 2614 conditions per place. [2021-03-26 15:12:57,281 INFO L142 LiptonReduction]: Number of co-enabled transitions 8334 [2021-03-26 15:13:54,530 INFO L154 LiptonReduction]: Checked pairs total: 5570 [2021-03-26 15:13:54,531 INFO L156 LiptonReduction]: Total number of compositions: 21 [2021-03-26 15:13:54,531 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 62289 [2021-03-26 15:13:54,537 INFO L480 AbstractCegarLoop]: Abstraction has has 353 places, 1349 transitions, 31083 flow [2021-03-26 15:13:54,538 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 44.9) internal successors, (449), 10 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 15:13:54,538 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 15:13:54,538 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 15:13:54,538 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-03-26 15:13:54,538 INFO L428 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-26 15:13:54,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 15:13:54,539 INFO L82 PathProgramCache]: Analyzing trace with hash 658502392, now seen corresponding path program 2 times [2021-03-26 15:13:54,539 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 15:13:54,539 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855703298] [2021-03-26 15:13:54,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 15:13:54,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 15:13:54,574 INFO L142 QuantifierPusher]: treesize reduction 25, result has 47.9 percent of original size [2021-03-26 15:13:54,575 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-26 15:13:54,591 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 15:13:54,591 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 15:13:54,597 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 15:13:54,597 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 15:13:54,603 INFO L142 QuantifierPusher]: treesize reduction 13, result has 53.6 percent of original size [2021-03-26 15:13:54,604 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-26 15:13:54,608 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 15:13:54,608 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 15:13:54,612 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 15:13:54,613 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 15:13:54,617 INFO L142 QuantifierPusher]: treesize reduction 13, result has 35.0 percent of original size [2021-03-26 15:13:54,617 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 15:13:54,624 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 15:13:54,624 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 15:13:54,631 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 15:13:54,632 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 15:13:54,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 15:13:54,632 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855703298] [2021-03-26 15:13:54,632 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 15:13:54,632 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-03-26 15:13:54,632 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951594897] [2021-03-26 15:13:54,632 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-26 15:13:54,632 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 15:13:54,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-26 15:13:54,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2021-03-26 15:13:54,633 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 222 [2021-03-26 15:13:54,633 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 353 places, 1349 transitions, 31083 flow. Second operand has 9 states, 9 states have (on average 45.111111111111114) internal successors, (406), 9 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 15:13:54,634 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 15:13:54,634 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 222 [2021-03-26 15:13:54,634 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2021-03-26 15:14:02,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-26 15:14:02,913 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-03-26 15:14:02,913 WARN L545 AbstractCegarLoop]: Verification canceled [2021-03-26 15:14:02,916 WARN L224 ceAbstractionStarter]: Timeout [2021-03-26 15:14:02,916 INFO L202 PluginConnector]: Adding new model bakery-3.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.03 03:14:02 BasicIcfg [2021-03-26 15:14:02,916 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-26 15:14:02,917 INFO L168 Benchmark]: Toolchain (without parser) took 853645.96 ms. Allocated memory was 255.9 MB in the beginning and 8.7 GB in the end (delta: 8.5 GB). Free memory was 236.5 MB in the beginning and 5.8 GB in the end (delta: -5.6 GB). Peak memory consumption was 2.9 GB. Max. memory is 16.0 GB. [2021-03-26 15:14:02,917 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.45 ms. Allocated memory is still 255.9 MB. Free memory is still 237.7 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 15:14:02,917 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.62 ms. Allocated memory is still 255.9 MB. Free memory was 236.4 MB in the beginning and 235.0 MB in the end (delta: 1.5 MB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 15:14:02,917 INFO L168 Benchmark]: Boogie Preprocessor took 12.64 ms. Allocated memory is still 255.9 MB. Free memory was 235.0 MB in the beginning and 234.0 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 15:14:02,917 INFO L168 Benchmark]: RCFGBuilder took 229.02 ms. Allocated memory is still 255.9 MB. Free memory was 233.9 MB in the beginning and 235.9 MB in the end (delta: -2.0 MB). Peak memory consumption was 18.5 MB. Max. memory is 16.0 GB. [2021-03-26 15:14:02,917 INFO L168 Benchmark]: TraceAbstraction took 853370.77 ms. Allocated memory was 255.9 MB in the beginning and 8.7 GB in the end (delta: 8.5 GB). Free memory was 235.5 MB in the beginning and 5.8 GB in the end (delta: -5.6 GB). Peak memory consumption was 2.9 GB. Max. memory is 16.0 GB. [2021-03-26 15:14:02,918 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.45 ms. Allocated memory is still 255.9 MB. Free memory is still 237.7 MB. There was no memory consumed. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 27.62 ms. Allocated memory is still 255.9 MB. Free memory was 236.4 MB in the beginning and 235.0 MB in the end (delta: 1.5 MB). There was no memory consumed. Max. memory is 16.0 GB. * Boogie Preprocessor took 12.64 ms. Allocated memory is still 255.9 MB. Free memory was 235.0 MB in the beginning and 234.0 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.0 GB. * RCFGBuilder took 229.02 ms. Allocated memory is still 255.9 MB. Free memory was 233.9 MB in the beginning and 235.9 MB in the end (delta: -2.0 MB). Peak memory consumption was 18.5 MB. Max. memory is 16.0 GB. * TraceAbstraction took 853370.77 ms. Allocated memory was 255.9 MB in the beginning and 8.7 GB in the end (delta: 8.5 GB). Free memory was 235.5 MB in the beginning and 5.8 GB in the end (delta: -5.6 GB). Peak memory consumption was 2.9 GB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 628.7ms, 58 PlacesBefore, 48 PlacesAfterwards, 48 TransitionsBefore, 38 TransitionsAfterwards, 1170 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 9 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 10 TotalNumberOfCompositions, 2728 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 973, positive: 873, positive conditional: 873, positive unconditional: 0, negative: 100, negative conditional: 100, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 973, positive: 873, positive conditional: 0, positive unconditional: 873, negative: 100, negative conditional: 0, negative unconditional: 100, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 973, positive: 873, positive conditional: 0, positive unconditional: 873, negative: 100, negative conditional: 0, negative unconditional: 100, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 711, positive: 638, positive conditional: 0, positive unconditional: 638, negative: 73, negative conditional: 0, negative unconditional: 73, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 711, positive: 608, positive conditional: 0, positive unconditional: 608, negative: 103, negative conditional: 0, negative unconditional: 103, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 103, positive: 30, positive conditional: 0, positive unconditional: 30, negative: 73, negative conditional: 0, negative unconditional: 73, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 352, positive: 86, positive conditional: 0, positive unconditional: 86, negative: 265, negative conditional: 0, negative unconditional: 265, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 973, positive: 235, positive conditional: 0, positive unconditional: 235, negative: 27, negative conditional: 0, negative unconditional: 27, unknown: 711, unknown conditional: 0, unknown unconditional: 711] , Statistics on independence cache: Total cache size (in pairs): 711, Positive cache size: 638, Positive conditional cache size: 0, Positive unconditional cache size: 638, Negative cache size: 73, Negative conditional cache size: 0, Negative unconditional cache size: 73, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 116.6ms, 56 PlacesBefore, 54 PlacesAfterwards, 54 TransitionsBefore, 54 TransitionsAfterwards, 978 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 3129 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1044, positive: 927, positive conditional: 927, positive unconditional: 0, negative: 117, negative conditional: 117, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1044, positive: 927, positive conditional: 134, positive unconditional: 793, negative: 117, negative conditional: 5, negative unconditional: 112, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1044, positive: 927, positive conditional: 134, positive unconditional: 793, negative: 117, negative conditional: 5, negative unconditional: 112, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 76, positive: 74, positive conditional: 18, positive unconditional: 56, negative: 2, negative conditional: 1, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 76, positive: 73, positive conditional: 0, positive unconditional: 73, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 2, negative conditional: 1, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 35, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 33, negative conditional: 27, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1044, positive: 853, positive conditional: 116, positive unconditional: 737, negative: 115, negative conditional: 4, negative unconditional: 111, unknown: 76, unknown conditional: 19, unknown unconditional: 57] , Statistics on independence cache: Total cache size (in pairs): 787, Positive cache size: 712, Positive conditional cache size: 18, Positive unconditional cache size: 694, Negative cache size: 75, Negative conditional cache size: 1, Negative unconditional cache size: 74, Eliminated conditions: 105 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 102.2ms, 64 PlacesBefore, 64 PlacesAfterwards, 75 TransitionsBefore, 75 TransitionsAfterwards, 1276 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 1563 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 576, positive: 527, positive conditional: 527, positive unconditional: 0, negative: 49, negative conditional: 49, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 576, positive: 527, positive conditional: 75, positive unconditional: 452, negative: 49, negative conditional: 15, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 576, positive: 527, positive conditional: 75, positive unconditional: 452, negative: 49, negative conditional: 15, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 34, positive: 25, positive conditional: 7, positive unconditional: 18, negative: 9, negative conditional: 8, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 34, positive: 25, positive conditional: 0, positive unconditional: 25, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 9, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 9, negative conditional: 8, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 35, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 35, negative conditional: 32, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 576, positive: 502, positive conditional: 68, positive unconditional: 434, negative: 40, negative conditional: 7, negative unconditional: 33, unknown: 34, unknown conditional: 15, unknown unconditional: 19] , Statistics on independence cache: Total cache size (in pairs): 821, Positive cache size: 737, Positive conditional cache size: 25, Positive unconditional cache size: 712, Negative cache size: 84, Negative conditional cache size: 9, Negative unconditional cache size: 75, Eliminated conditions: 70 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 74.6ms, 67 PlacesBefore, 67 PlacesAfterwards, 75 TransitionsBefore, 75 TransitionsAfterwards, 1194 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 1237 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 441, positive: 401, positive conditional: 401, positive unconditional: 0, negative: 40, negative conditional: 40, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 441, positive: 401, positive conditional: 59, positive unconditional: 342, negative: 40, negative conditional: 11, negative unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 441, positive: 401, positive conditional: 59, positive unconditional: 342, negative: 40, negative conditional: 11, negative unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 2, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 1, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 441, positive: 399, positive conditional: 57, positive unconditional: 342, negative: 40, negative conditional: 11, negative unconditional: 29, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 823, Positive cache size: 739, Positive conditional cache size: 27, Positive unconditional cache size: 712, Negative cache size: 84, Negative conditional cache size: 9, Negative unconditional cache size: 75, Eliminated conditions: 56 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 633.0ms, 83 PlacesBefore, 83 PlacesAfterwards, 126 TransitionsBefore, 126 TransitionsAfterwards, 2104 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 4334 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 880, positive: 791, positive conditional: 791, positive unconditional: 0, negative: 89, negative conditional: 89, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 900, positive: 791, positive conditional: 205, positive unconditional: 586, negative: 109, negative conditional: 75, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 900, positive: 791, positive conditional: 205, positive unconditional: 586, negative: 109, negative conditional: 75, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 38, positive: 22, positive conditional: 10, positive unconditional: 12, negative: 16, negative conditional: 15, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 38, positive: 20, positive conditional: 0, positive unconditional: 20, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 18, positive: 2, positive conditional: 2, positive unconditional: 0, negative: 16, negative conditional: 15, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 72, positive: 6, positive conditional: 6, positive unconditional: 0, negative: 66, negative conditional: 62, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 900, positive: 769, positive conditional: 195, positive unconditional: 574, negative: 93, negative conditional: 60, negative unconditional: 33, unknown: 38, unknown conditional: 25, unknown unconditional: 13] , Statistics on independence cache: Total cache size (in pairs): 861, Positive cache size: 761, Positive conditional cache size: 37, Positive unconditional cache size: 724, Negative cache size: 100, Negative conditional cache size: 24, Negative unconditional cache size: 76, Eliminated conditions: 199 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 449.1ms, 86 PlacesBefore, 86 PlacesAfterwards, 126 TransitionsBefore, 126 TransitionsAfterwards, 1868 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 3396 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 622, positive: 551, positive conditional: 551, positive unconditional: 0, negative: 71, negative conditional: 71, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 648, positive: 551, positive conditional: 113, positive unconditional: 438, negative: 97, negative conditional: 56, negative unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 648, positive: 551, positive conditional: 113, positive unconditional: 438, negative: 97, negative conditional: 56, negative unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 24, positive: 17, positive conditional: 6, positive unconditional: 11, negative: 7, negative conditional: 4, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 24, positive: 12, positive conditional: 0, positive unconditional: 12, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 12, positive: 5, positive conditional: 3, positive unconditional: 2, negative: 7, negative conditional: 4, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 37, positive: 15, positive conditional: 10, positive unconditional: 5, negative: 22, negative conditional: 15, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 648, positive: 534, positive conditional: 107, positive unconditional: 427, negative: 90, negative conditional: 52, negative unconditional: 38, unknown: 24, unknown conditional: 10, unknown unconditional: 14] , Statistics on independence cache: Total cache size (in pairs): 885, Positive cache size: 778, Positive conditional cache size: 43, Positive unconditional cache size: 735, Negative cache size: 107, Negative conditional cache size: 28, Negative unconditional cache size: 79, Eliminated conditions: 151 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 645.1ms, 87 PlacesBefore, 87 PlacesAfterwards, 125 TransitionsBefore, 125 TransitionsAfterwards, 1794 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 1941 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 303, positive: 263, positive conditional: 263, positive unconditional: 0, negative: 40, negative conditional: 40, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 319, positive: 263, positive conditional: 63, positive unconditional: 200, negative: 56, negative conditional: 37, negative unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 319, positive: 263, positive conditional: 63, positive unconditional: 200, negative: 56, negative conditional: 37, negative unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 17, positive: 7, positive conditional: 7, positive unconditional: 0, negative: 10, negative conditional: 8, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 17, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 13, positive: 3, positive conditional: 3, positive unconditional: 0, negative: 10, negative conditional: 8, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 51, positive: 11, positive conditional: 11, positive unconditional: 0, negative: 40, negative conditional: 35, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 319, positive: 256, positive conditional: 56, positive unconditional: 200, negative: 46, negative conditional: 29, negative unconditional: 17, unknown: 17, unknown conditional: 15, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 902, Positive cache size: 785, Positive conditional cache size: 50, Positive unconditional cache size: 735, Negative cache size: 117, Negative conditional cache size: 36, Negative unconditional cache size: 81, Eliminated conditions: 69 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 728.5ms, 95 PlacesBefore, 95 PlacesAfterwards, 153 TransitionsBefore, 153 TransitionsAfterwards, 2052 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 1905 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 182, positive: 147, positive conditional: 147, positive unconditional: 0, negative: 35, negative conditional: 35, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 218, positive: 147, positive conditional: 63, positive unconditional: 84, negative: 71, negative conditional: 56, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 218, positive: 147, positive conditional: 63, positive unconditional: 84, negative: 71, negative conditional: 56, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 16, positive: 11, positive conditional: 7, positive unconditional: 4, negative: 5, negative conditional: 4, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 16, positive: 11, positive conditional: 0, positive unconditional: 11, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 5, negative conditional: 4, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 18, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 18, negative conditional: 15, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 218, positive: 136, positive conditional: 56, positive unconditional: 80, negative: 66, negative conditional: 52, negative unconditional: 14, unknown: 16, unknown conditional: 11, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 918, Positive cache size: 796, Positive conditional cache size: 57, Positive unconditional cache size: 739, Negative cache size: 122, Negative conditional cache size: 40, Negative unconditional cache size: 82, Eliminated conditions: 19 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 835.0ms, 106 PlacesBefore, 106 PlacesAfterwards, 181 TransitionsBefore, 181 TransitionsAfterwards, 2156 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 1535 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 300, positive: 276, positive conditional: 276, positive unconditional: 0, negative: 24, negative conditional: 24, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 312, positive: 276, positive conditional: 138, positive unconditional: 138, negative: 36, negative conditional: 16, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 312, positive: 276, positive conditional: 138, positive unconditional: 138, negative: 36, negative conditional: 16, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 13, positive: 10, positive conditional: 8, positive unconditional: 2, negative: 3, negative conditional: 3, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 13, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 8, positive: 5, positive conditional: 4, positive unconditional: 1, negative: 3, negative conditional: 3, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 27, positive: 16, positive conditional: 13, positive unconditional: 3, negative: 11, negative conditional: 11, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 312, positive: 266, positive conditional: 130, positive unconditional: 136, negative: 33, negative conditional: 13, negative unconditional: 20, unknown: 13, unknown conditional: 11, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 931, Positive cache size: 806, Positive conditional cache size: 65, Positive unconditional cache size: 741, Negative cache size: 125, Negative conditional cache size: 43, Negative unconditional cache size: 82, Eliminated conditions: 47 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6226.5ms, 131 PlacesBefore, 131 PlacesAfterwards, 285 TransitionsBefore, 285 TransitionsAfterwards, 3220 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 6 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 10 TotalNumberOfCompositions, 1322 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 769, positive: 761, positive conditional: 761, positive unconditional: 0, negative: 8, negative conditional: 8, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 769, positive: 761, positive conditional: 245, positive unconditional: 516, negative: 8, negative conditional: 2, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 769, positive: 761, positive conditional: 245, positive unconditional: 516, negative: 8, negative conditional: 2, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, positive: 10, positive conditional: 10, positive unconditional: 0, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 14, positive: 10, positive conditional: 10, positive unconditional: 0, negative: 4, negative conditional: 4, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 769, positive: 751, positive conditional: 235, positive unconditional: 516, negative: 7, negative conditional: 1, negative unconditional: 6, unknown: 11, unknown conditional: 11, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 942, Positive cache size: 816, Positive conditional cache size: 75, Positive unconditional cache size: 741, Negative cache size: 126, Negative conditional cache size: 44, Negative unconditional cache size: 82, Eliminated conditions: 350 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3962.2ms, 159 PlacesBefore, 159 PlacesAfterwards, 347 TransitionsBefore, 347 TransitionsAfterwards, 3688 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 807 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 291, positive: 285, positive conditional: 285, positive unconditional: 0, negative: 6, negative conditional: 6, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 291, positive: 285, positive conditional: 94, positive unconditional: 191, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 291, positive: 285, positive conditional: 94, positive unconditional: 191, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 291, positive: 285, positive conditional: 94, positive unconditional: 191, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 942, Positive cache size: 816, Positive conditional cache size: 75, Positive unconditional cache size: 741, Negative cache size: 126, Negative conditional cache size: 44, Negative unconditional cache size: 82, Eliminated conditions: 149 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 27126.9ms, 179 PlacesBefore, 179 PlacesAfterwards, 586 TransitionsBefore, 586 TransitionsAfterwards, 6014 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 16 TrivialYvCompositions, 9 ConcurrentYvCompositions, 0 ChoiceCompositions, 25 TotalNumberOfCompositions, 4916 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4124, positive: 4118, positive conditional: 4118, positive unconditional: 0, negative: 6, negative conditional: 6, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4124, positive: 4118, positive conditional: 1767, positive unconditional: 2351, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4124, positive: 4118, positive conditional: 1767, positive unconditional: 2351, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 3, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4124, positive: 4115, positive conditional: 1764, positive unconditional: 2351, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 945, Positive cache size: 819, Positive conditional cache size: 78, Positive unconditional cache size: 741, Negative cache size: 126, Negative conditional cache size: 44, Negative unconditional cache size: 82, Eliminated conditions: 2073 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 21918.6ms, 187 PlacesBefore, 187 PlacesAfterwards, 592 TransitionsBefore, 592 TransitionsAfterwards, 5590 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 6 ConcurrentYvCompositions, 0 ChoiceCompositions, 9 TotalNumberOfCompositions, 2351 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1619, positive: 1613, positive conditional: 1613, positive unconditional: 0, negative: 6, negative conditional: 6, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1619, positive: 1613, positive conditional: 738, positive unconditional: 875, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1619, positive: 1613, positive conditional: 738, positive unconditional: 875, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 1, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1619, positive: 1612, positive conditional: 737, positive unconditional: 875, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 946, Positive cache size: 820, Positive conditional cache size: 79, Positive unconditional cache size: 741, Negative cache size: 126, Negative conditional cache size: 44, Negative unconditional cache size: 82, Eliminated conditions: 776 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 33608.0ms, 204 PlacesBefore, 204 PlacesAfterwards, 754 TransitionsBefore, 754 TransitionsAfterwards, 6188 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 5 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 12 TotalNumberOfCompositions, 3626 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1916, positive: 1904, positive conditional: 1904, positive unconditional: 0, negative: 12, negative conditional: 12, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1922, positive: 1904, positive conditional: 671, positive unconditional: 1233, negative: 18, negative conditional: 12, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1922, positive: 1904, positive conditional: 671, positive unconditional: 1233, negative: 18, negative conditional: 12, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, positive: 7, positive conditional: 7, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 6, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 6, negative conditional: 6, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1922, positive: 1897, positive conditional: 664, positive unconditional: 1233, negative: 16, negative conditional: 10, negative unconditional: 6, unknown: 9, unknown conditional: 9, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 955, Positive cache size: 827, Positive conditional cache size: 86, Positive unconditional cache size: 741, Negative cache size: 128, Negative conditional cache size: 46, Negative unconditional cache size: 82, Eliminated conditions: 1083 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 29516.3ms, 211 PlacesBefore, 211 PlacesAfterwards, 755 TransitionsBefore, 755 TransitionsAfterwards, 5822 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 5 TrivialYvCompositions, 6 ConcurrentYvCompositions, 0 ChoiceCompositions, 11 TotalNumberOfCompositions, 2807 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1964, positive: 1958, positive conditional: 1958, positive unconditional: 0, negative: 6, negative conditional: 6, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1964, positive: 1958, positive conditional: 604, positive unconditional: 1354, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1964, positive: 1958, positive conditional: 604, positive unconditional: 1354, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 2, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1964, positive: 1956, positive conditional: 602, positive unconditional: 1354, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 957, Positive cache size: 829, Positive conditional cache size: 88, Positive unconditional cache size: 741, Negative cache size: 128, Negative conditional cache size: 46, Negative unconditional cache size: 82, Eliminated conditions: 1215 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 93003.3ms, 241 PlacesBefore, 241 PlacesAfterwards, 1005 TransitionsBefore, 1005 TransitionsAfterwards, 7064 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 14 TrivialYvCompositions, 9 ConcurrentYvCompositions, 0 ChoiceCompositions, 23 TotalNumberOfCompositions, 6037 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4987, positive: 4981, positive conditional: 4981, positive unconditional: 0, negative: 6, negative conditional: 6, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4987, positive: 4981, positive conditional: 1424, positive unconditional: 3557, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4987, positive: 4981, positive conditional: 1424, positive unconditional: 3557, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, positive: 10, positive conditional: 9, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4987, positive: 4971, positive conditional: 1415, positive unconditional: 3556, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 10, unknown conditional: 9, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 967, Positive cache size: 839, Positive conditional cache size: 97, Positive unconditional cache size: 742, Negative cache size: 128, Negative conditional cache size: 46, Negative unconditional cache size: 82, Eliminated conditions: 3285 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 174026.0ms, 269 PlacesBefore, 269 PlacesAfterwards, 1282 TransitionsBefore, 1282 TransitionsAfterwards, 8610 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 4 TrivialYvCompositions, 6 ConcurrentYvCompositions, 0 ChoiceCompositions, 13 TotalNumberOfCompositions, 4721 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3205, positive: 3197, positive conditional: 3197, positive unconditional: 0, negative: 8, negative conditional: 8, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3205, positive: 3197, positive conditional: 1184, positive unconditional: 2013, negative: 8, negative conditional: 8, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3205, positive: 3197, positive conditional: 1184, positive unconditional: 2013, negative: 8, negative conditional: 8, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 16, positive: 15, positive conditional: 14, positive unconditional: 1, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 16, positive: 15, positive conditional: 0, positive unconditional: 15, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 3, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3205, positive: 3182, positive conditional: 1170, positive unconditional: 2012, negative: 7, negative conditional: 7, negative unconditional: 0, unknown: 16, unknown conditional: 15, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 983, Positive cache size: 854, Positive conditional cache size: 111, Positive unconditional cache size: 743, Negative cache size: 129, Negative conditional cache size: 47, Negative unconditional cache size: 82, Eliminated conditions: 1870 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 76589.9ms, 286 PlacesBefore, 286 PlacesAfterwards, 1221 TransitionsBefore, 1221 TransitionsAfterwards, 7462 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 1473 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 513, positive: 507, positive conditional: 507, positive unconditional: 0, negative: 6, negative conditional: 6, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 513, positive: 507, positive conditional: 184, positive unconditional: 323, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 513, positive: 507, positive conditional: 184, positive unconditional: 323, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 5, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 513, positive: 502, positive conditional: 179, positive unconditional: 323, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 988, Positive cache size: 859, Positive conditional cache size: 116, Positive unconditional cache size: 743, Negative cache size: 129, Negative conditional cache size: 47, Negative unconditional cache size: 82, Eliminated conditions: 288 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 77443.2ms, 297 PlacesBefore, 295 PlacesAfterwards, 1206 TransitionsBefore, 1206 TransitionsAfterwards, 7102 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 7 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 9 TotalNumberOfCompositions, 2774 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1817, positive: 1811, positive conditional: 1811, positive unconditional: 0, negative: 6, negative conditional: 6, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1817, positive: 1811, positive conditional: 655, positive unconditional: 1156, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1817, positive: 1811, positive conditional: 655, positive unconditional: 1156, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, positive: 12, positive conditional: 12, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, positive: 12, positive conditional: 0, positive unconditional: 12, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1817, positive: 1799, positive conditional: 643, positive unconditional: 1156, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 12, unknown conditional: 12, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1000, Positive cache size: 871, Positive conditional cache size: 128, Positive unconditional cache size: 743, Negative cache size: 129, Negative conditional cache size: 47, Negative unconditional cache size: 82, Eliminated conditions: 1055 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 84195.1ms, 308 PlacesBefore, 307 PlacesAfterwards, 1223 TransitionsBefore, 1222 TransitionsAfterwards, 7618 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 5 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, 1899 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 829, positive: 819, positive conditional: 819, positive unconditional: 0, negative: 10, negative conditional: 10, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 829, positive: 819, positive conditional: 531, positive unconditional: 288, negative: 10, negative conditional: 10, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 829, positive: 819, positive conditional: 531, positive unconditional: 288, negative: 10, negative conditional: 10, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 61, positive: 60, positive conditional: 57, positive unconditional: 3, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 61, positive: 60, positive conditional: 0, positive unconditional: 60, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 3, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 829, positive: 759, positive conditional: 474, positive unconditional: 285, negative: 9, negative conditional: 9, negative unconditional: 0, unknown: 61, unknown conditional: 58, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 1061, Positive cache size: 931, Positive conditional cache size: 185, Positive unconditional cache size: 746, Negative cache size: 130, Negative conditional cache size: 48, Negative unconditional cache size: 82, Eliminated conditions: 227 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 43570.1ms, 332 PlacesBefore, 331 PlacesAfterwards, 1192 TransitionsBefore, 1191 TransitionsAfterwards, 7780 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, 396 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 396, positive: 396, positive conditional: 396, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 396, positive: 396, positive conditional: 175, positive unconditional: 221, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 396, positive: 396, positive conditional: 175, positive unconditional: 221, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 17, positive: 17, positive conditional: 17, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 17, positive: 17, positive conditional: 0, positive unconditional: 17, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 396, positive: 379, positive conditional: 158, positive unconditional: 221, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 17, unknown conditional: 17, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1078, Positive cache size: 948, Positive conditional cache size: 202, Positive unconditional cache size: 746, Negative cache size: 130, Negative conditional cache size: 48, Negative unconditional cache size: 82, Eliminated conditions: 213 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 62288.2ms, 357 PlacesBefore, 353 PlacesAfterwards, 1349 TransitionsBefore, 1349 TransitionsAfterwards, 8334 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 11 TrivialYvCompositions, 9 ConcurrentYvCompositions, 0 ChoiceCompositions, 21 TotalNumberOfCompositions, 5570 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5570, positive: 5570, positive conditional: 5570, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5570, positive: 5570, positive conditional: 2064, positive unconditional: 3506, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5570, positive: 5570, positive conditional: 2064, positive unconditional: 3506, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 18, positive: 18, positive conditional: 18, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 18, positive: 18, positive conditional: 0, positive unconditional: 18, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5570, positive: 5552, positive conditional: 2046, positive unconditional: 3506, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 18, unknown conditional: 18, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1096, Positive cache size: 966, Positive conditional cache size: 220, Positive unconditional cache size: 746, Negative cache size: 130, Negative conditional cache size: 48, Negative unconditional cache size: 82, Eliminated conditions: 3302 - TimeoutResultAtElement [Line: 82]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 82). Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (9states, 43/222 universal loopers) in iteration 22,while PetriNetUnfolder was constructing finite prefix that currently has 145019 conditions, 16286 events (5306/16285 cut-off events. For 526338/528727 co-relation queries the response was YES. Maximal size of possible extension queue 1264. Compared 211973 event pairs, 1531 based on Foata normal form. 568/16580 useless extension candidates. Maximal degree in co-relation 144868. Up to 4738 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 54 locations, 1 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 19.3ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: TIMEOUT, OverallTime: 853278.9ms, OverallIterations: 22, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 112491.9ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 764.0ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 621 SDtfs, 1301 SDslu, 484 SDs, 0 SdLazy, 7656 SolverSat, 1474 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4019.7ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 283 GetRequests, 33 SyntacticMatches, 15 SemanticMatches, 235 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 535 ImplicationChecksByTransitivity, 2855.6ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=31083occurred in iteration=21, InterpolantAutomatonStates: 235, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 29.0ms SsaConstructionTime, 197.0ms SatisfiabilityAnalysisTime, 2348.6ms InterpolantComputationTime, 773 NumberOfCodeBlocks, 773 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 751 ConstructedInterpolants, 0 QuantifiedInterpolants, 4154 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown